Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects

DOI10.1090/S0002-9947-03-03141-6zbMath1016.41007OpenAlexW1514292813MaRDI QIDQ4806450

Borislav Karaivanov, Pencho P. Petrushev, Robert C. Sharpley

Publication date: 14 May 2003

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-03-03141-6

zbMATH Keywords

approximation ratesnested irregular triangulationsnonlinear \(n\)-term approximation

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Function spaces arising in harmonic analysis (42B35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Rate of convergence, degree of approximation (41A25)

Related Items

Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects, Two-level-split decomposition of anisotropic Besov spaces

Cites Work

• Surface compression
• Nonlinear piecewise polynomial approximation beyond Besov spaces
• Multivariate \(n\)-term rational and piecewise polynomial approximation
• Interpolation of Besov Spaces
• Nonlinear Approximation from Differentiable Piecewise Polynomials
• Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects
• Tree approximation and optimal encoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item