Fast computation in adaptive tree approximation

@article{Binev2004FastCI,
  title={Fast computation in adaptive tree approximation},
  author={P. Binev and R. DeVore},
  journal={Numerische Mathematik},
  year={2004},
  volume={97},
  pages={193-217}
}
  • P. Binev, R. DeVore
  • Published 2004
  • Mathematics, Computer Science
  • Numerische Mathematik
  • Summary.Adaptive methods of approximation arise in many settings including numerical methods for PDEs and image processing. They can usually be described by a tree which records the adaptive decisions. This paper is concerned with the fast computation of near optimal trees based on n adaptive decisions. The best tree based on n adaptive decisions could be found by examining all such possibilities. However, this is exponential in n and could be numerically prohibitive. The main result of this… CONTINUE READING

    Figures and Topics from this paper.

    Optimal computation
    • 17
    • PDF
    Adaptive methods for boundary integral equations: Complexity and convergence estimates
    • 41
    • Highly Influenced
    • PDF
    Uniform tree approximation by global optimization techniques
    • 1
    • PDF
    Adaptive Finite Element Methods with convergence rates
    • 472
    Adaptive Wavelet Schemes for Nonlinear Variational Problems
    • 101
    • PDF
    Adaptive Approximation of Curves
    • 17
    • PDF
    Adaptive and anisotropic piecewise polynomial approximation
    • 5
    • PDF
    Adaptive Wavelet Techniques in Numerical Simulation
    • 32
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Tree Approximation and Optimal Encoding
    • 176
    • PDF
    Adaptive Finite Element Methods with convergence rates
    • 472