1994
DOI: 10.1137/0731065
|View full text |Cite
|
Sign up to set email alerts
|

Quadrature Formulae and Asymptotic Error Expansions for Wavelet Approximations of Smooth Functions

Abstract: This paper deals with typical problems that arise when using wavelets in numerical analysis applications. The first part involves the construction of quadrature formulae for the calculation of inner products of smooth functions and scaling functions. Several types of quadratures are discussed and compared for different classes of wavelets. Since their construction using monomials is ill-conditioned, also a modified, well-conditioned construction using Chebyshev polynomials is presented. The second part of the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
140
0

Year Published

1995
1995
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 151 publications
(143 citation statements)
references
References 13 publications
3
140
0
Order By: Relevance
“…Let X c l2 denote the range of p(-, 4>). Because {<t>n}nez is a frame, the operator p(-, 4>) satisfies (14). The left inequality of (14) implies that p(-, <P) is injective and bounded below by the positive constant A.…”
Section: Mappings On L2 For the Construction Of Frames Of %Fmentioning
confidence: 97%
“…Let X c l2 denote the range of p(-, 4>). Because {<t>n}nez is a frame, the operator p(-, 4>) satisfies (14). The left inequality of (14) implies that p(-, <P) is injective and bounded below by the positive constant A.…”
Section: Mappings On L2 For the Construction Of Frames Of %Fmentioning
confidence: 97%
“…For general wavelet families this integration can be difficult and computationally expensive. 6 The interpolating wavelets discussed above are the glorious exception. Since both the dual scaling function and the dual wavelets are delta functions, 4 one or just a few data points suffice to do the integration exactly.…”
Section: Expanding Functions In a Wavelet Basismentioning
confidence: 99%
“…(6) Note that in both cases we need exactly 16 coefficients to represent the function. By doing a backward wavelet transform, we can go back to the original expansion of Eq.…”
Section: The Haar Wavelet Familymentioning
confidence: 99%
See 1 more Smart Citation
“…Approximation power. Given any function u ∈ L 2 (R), it can be approximated by the projection, this approximation has the following sharp estimate [17,18,19]:where Table 9 Compression ratio C 2 for matrix which converts the finite Chebyshev expansion to finite Legendre expansion. The matrix size is 1024 × 1024.…”
mentioning
confidence: 99%