On best constants in L² approximation

DOI10.1093/IMANUM/DRAA041arXiv1909.13736MaRDI QIDQ6326255FDOQ6326255

Authors: Andrea Bressan, Michael S. Floater, Espen Sande 

Publication date: 30 September 2019

Abstract: In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method is superconvergent. Based on our numerical results we formulate a conjecture on the asymptotic behaviour of the $n$-widths. Finally we describe how the numerical method can be used to compute the breakpoints of the optimal spline spaces of Melkman and Micchelli, which have recently received renewed attention in the field of Isogeometric Analysis.

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Algorithms for approximation of functions (65D15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

This page was built for publication: On best constants in $L^2$ approximation

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