Recent Results on Near-Best Spline Quasi-Interpolants

Abstract

Roughly speaking, a near-best (abbr. NB) quasi-interpolant (abbr. QI) is an approximation operator of the form Qaf=Σα∈ A Λα(f) Bα where the Bα's are B-splines and the Λα(f)'s are linear discrete or integral forms acting on the given function f. These forms depend on a finite number of coefficients which are the components of vectors aα for α∈ A. The index a refers to this sequence of vectors. In order that Qa p=p for all polynomials p belonging to some subspace included in the space of splines generated by the Bα's, each vector aα must lie in an affine subspace Vα, i.e. satisfy some linear constraints. However there remain some degrees of freedom which are used to minimize aα1 for each α∈ A. It is easy to prove that \ aα1 ; α∈ A\ is an upper bound of Qa ∞: thus, instead of minimizing the infinite norm of Qa, which is a difficult problem, we minimize an upper bound of this norm, which is much easier to do. Moreover, the latter problem has always at least one solution, which is associated with a NB QI. In the first part of the paper, we give a survey on NB univariate or bivariate spline QIs defined on uniform or non-uniform partitions and already studied by the author and coworkers. In the second part, we give some new results, mainly on univariate and bivariate integral QIs on non-uniform partitions: in that case, NB QIs are more difficult to characterize and the optimal properties strongly depend on the geometry of the partition. Therefore we have restricted our study to QIs having interesting shape properties and/or infinite norms uniformly bounded independently of the partition.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…