iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1023/A:1025838129042
On Measuring the Efficiency of Kernel Operators in L p (R d ) | Advances in Computational Mathematics Skip to main content
Log in

On Measuring the Efficiency of Kernel Operators in L p (R d)

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

It is well known that it is possible to enhance the approximation properties of a kernel operator by increasing its support size. There is an obvious tradeoff between higher approximation order of a kernel and the complexity of algorithms that employ it. A question is then asked: how do we compare the efficiency of kernels with comparable support size? We follow Blu and Unser and choose as a measure of the efficiency of the kernels the first leading constant in a certain error expansion. We use time domain methods to treat the case of globally supported kernels in L p (R d), 1≤p≤∞.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Abraham, J.E. Marsden and R.R. Burton, Manifolds, Tensor Analysis and Applications (Springer, Berlin, 1988).

    Google Scholar 

  2. T. Blu, P. Thévenaz and M. Unser, MOMS: Maximal-order interpolation of minimal support, IEEE Trans. Image Process. 10 (2001) 1069–1080.

    Google Scholar 

  3. T. Blu and M. Unser, Approximation error for quasi-interpolators and (multi-) wavelet expansions, Appl. Comput. Harmon. Anal. 6 (1999) 219–251.

    Google Scholar 

  4. I. Daubechies, Ten Lectures on Wavelets, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 61 (SIAM, Philadelphia, PA, 1992).

    Google Scholar 

  5. R.A. DeVore and G.G. Lorentz, Constructive Approximation (Springer, Berlin, 1991).

    Google Scholar 

  6. K. Jetter and G. Plonka, A survey on L 2-approximation order from shift invariant spaces, in: Multivariate Approximation and Applications, eds. N. Dyn, D. Leviatan, D. Levin and A. Pinkus (Cambridge Univ. Press, Cambridge, 2001) pp. 73–111.

    Google Scholar 

  7. J. Lei, R.Q. Jia and W. Cheney, Approximation from shift-invariant spaces by integral operators, SIAM J. Math. Anal. 28 (1997) 481–498.

    Google Scholar 

  8. A. Ron, Factorization theorems for univariate splines on regular grids, Israel J. Math. 70 (1990) 48–68.

    Google Scholar 

  9. M. Unser, Approximation power of biorthogonal wavelet expansions, Trans. Signal Process. 44 (1996) 519–527.

    Google Scholar 

  10. W. Ziemer, Weakly Differentiable Functions (Springer, Berlin, 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dekel, S., Leviatan, D. On Measuring the Efficiency of Kernel Operators in L p (R d). Advances in Computational Mathematics 20, 53–65 (2004). https://doi.org/10.1023/A:1025838129042

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025838129042

Navigation