On the best constants in L^2 approximation

09/30/2019
by   Andrea Bressan, et al.
0

In this paper we provide explicit upper and lower bounds on the L^2n-widths, i.e., the 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

A Collocation Method in Spline Spaces for the Solution of Linear Fractional Dynamical Systems

We used a collocation method in refinable spline space to solve a linear...
research
02/25/2020

New bounds for perfect k-hashing

Let C⊆{1,...,k}^n be such that for any k distinct elements of C there ex...
research
08/21/2022

Efficient numerical method for reliable upper and lower bounds on homogenized parameters

A numerical procedure providing guaranteed two-sided bounds on the effec...
research
02/24/2020

Lower bounds for prams over Z

This paper presents a new abstract method for proving lower bounds in co...
research
12/19/2022

Localizability of the approximation method

We use the approximation method of Razborov to analyze the locality barr...
research
08/11/2023

On the error of best polynomial approximation of composite functions

The purpose of the paper is to provide a characterization of the error o...
research
01/06/2020

Numerical evaluation of Airy-type integrals arising in uniform asymptotic analysis

We describe a method to evaluate integrals that arise in the asymptotic ...

Please sign up or login with your details

Forgot password? Click here to reset