On the best constants in L^2 approximation

by   Andrea Bressan, et al.

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.



page 1

page 2

page 3

page 4


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...

New bounds for perfect k-hashing

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

Lower bounds for prams over Z

This paper presents a new abstract method for proving lower bounds in co...

Rational approximation of the absolute value function from measurements: a numerical study of recent methods

In this work, we propose an extensive numerical study on approximating t...

The firefighter problem on polynomial and intermediate growth groups

We prove that any Cayley graph G with degree d polynomial growth does no...

Computing Plan-Length Bounds Using Lengths of Longest Paths

We devise a method to exactly compute the length of the longest simple p...

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

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

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.