Adaptive and anisotropic piecewise polynomial approximation

DOI10.1007/978-3-642-03413-8_4MaRDI QIDQ3559393zbMATH OpenOpenAlexFDO

Authors Albert Cohen, Jean-Marie Mirebeau

Publication date 14 May 2010

Published in Multiscale, Nonlinear and Adaptive Approximation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.1587

zbMATH Keywords

adaptive anisotropic partitionsadaptive isotropic partitionsapproximation by piecewise polynomial functionsmultiresolution greedy refinement algorithmprinciple of error equidistribution

Mathematics Subject Classification ID

Spline approximation (41A15) Rate of convergence, degree of approximation (41A25) Best approximation, Chebyshev systems (41A50)

Abstract: We survey the main results of approximation theory for adaptive piecewise polynomial functions. In such methods, the partition on which the piecewise polynomial approximation is defined is not fixed in advance, but adapted to the given function f which is approximated. We focus our discussion on (i) the properties that describe an optimal partition for f, (ii) the smoothness properties of f that govern the rate of convergence of the approximation in the Lp-norms, and (iii) fast refinement algorithms that generate near optimal partitions. While these results constitute a fairly established theory in the univariate case and in the multivariate case when dealing with elements of isotropic shape, the approximation theory for adaptive and anisotropic elements is still building up. We put a particular emphasis on some recent results obtained in this direction.

Recommendations

• scientific article; zbMATH DE number 4097961
• Algorithms and error bounds for multivariate piecewise constant approximation
• Optimal \(N\)-term approximation by linear splines over anisotropic Delaunay triangulations
• Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects
• Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection

Cited in

(15)

• Flexible piecewise approximations based on partition of unity
• A continuous analogue of the tensor-train decomposition
• Automatic approximation using asymptotically optimal adaptive interpolation
• Adaptation to anisotropy and inhomogeneity via dyadic piecewise polynomial selection
• Adaptive tree approximation with finite element functions: a first look
• Algorithms and error bounds for multivariate piecewise constant approximation
• Approximating gradients with continuous piecewise polynomial functions
• Adaptive Approximation
• scientific article; zbMATH DE number 4097961 (Why is no real title available?)
• Adaptive Interpolation Based on PÓlya Frequency Functions
• scientific article; zbMATH DE number 937354 (Why is no real title available?)
• Adaptive multiresolution analysis based on anisotropic triangulations
• Sharp asymptotics of the \(L_p\) approximation error for interpolation on block partitions
• Optimally adapted meshes for finite elements of arbitrary order and \(W^{1,p}\) norms
• Anisotropic smoothness classes: from finite element approximation to image models

This page was built for publication: Adaptive and anisotropic piecewise polynomial approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559393)