Sharp asymptotics of the L_p approximation error for interpolation on block partitions

DOI10.1007/S00211-010-0355-YzbMATH Open1214.41001arXiv1101.1776OpenAlexW2024272109MaRDI QIDQ629905FDOQ629905

Authors: Yuliya Babenko, Tatyana Leskevich, Jean-Marie Mirebeau 

Publication date: 10 March 2011

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing optimal approximating spline for each function proved to be very hard. In fact, no polynomial time algorithm of adaptive spline approximation can be designed and no exact formula for the optimal error of approximation can be given. Therefore, the next natural question would be to study the asymptotic behavior of the error and construct asymptotically optimal sequences of partitions. In this paper we provide sharp asymptotic estimates for the error of interpolation by splines on block partitions in IRd. We consider various projection operators to define the interpolant and provide the analysis of the exact constant in the asymptotics as well as its explicit form in certain cases.

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

Recommendations

• On theL_p-error of adaptive approximation of bivariate functions by harmonic splines
• Exact asymptotics of the uniform error of interpolation by multilinear splines
• Automatic approximation using asymptotically optimal adaptive interpolation
• Sharp error estimates for spline approximation: explicit constants, \(n\)-widths, and eigenfunction convergence
• Exact asymptotics of the optimal $L_{p,\Omega}$-error of linear spline interpolation

zbMATH Keywords

projection operatorerror of approximationinterpolating splinesadaptive approximationblock partitionssharp asymptotic estimates

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Multidimensional problems (41A63) Spline approximation (41A15)

Cites Work

• Optimal meshes for finite elements of arbitrary order
• Error of asymptotic formulae for volume approximation of convex bodies in \({\mathbb E}^d\)
• Approximation of convex bodies and a momentum lemma for power diagrams
• Exact asymptotics of the optimal $L_{p,\Omega}$-error of linear spline interpolation
• Adaptive and anisotropic piecewise polynomial approximation
• On one problem of minimization of area
• Are Bilinear Quadrilaterals Better Than Linear Triangles?
• Exact asymptotics of the uniform error of interpolation by multilinear splines

Cited In (5)

• Exact asymptotics of the uniform error of interpolation by multilinear splines
• Automatic approximation using asymptotically optimal adaptive interpolation
• Efficient construction of multi-block volumetric spline parameterization by discrete mask method
• Optimally adapted meshes for finite elements of arbitrary order and \(W^{1,p}\) norms
• Optimization of transfinite interpolation of functions with bounded Laplacian by harmonic splines on box partitions

This page was built for publication: Sharp asymptotics of the \(L_p\) approximation error for interpolation on block partitions

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