Journal Articles Numerical Algorithms Year : 2020

A projection algorithm on the set of polynomials with two bounds

Abstract

The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Després, Numer. Algorithms, 76(3), (2017)] and [B. Després and M. Herda, Numer. Algorithms, 77(1), (2018)] where an interpretation of monovariate polynomials with two bounds is provided in terms of a quaternion algebra and the Euler four-squares formulas. Thanks to this structure, we generate a new nonlinear projection algorithm onto the set of polynomials with two bounds. The numerical analysis of the method provides theoretical error estimates showing stability and continuity of the projection. Some numerical tests illustrate this novel algorithm for constrained polynomial approximation.
Fichier principal
Vignette du fichier
projection.pdf (563.72 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02128851 , version 1 (14-05-2019)

Identifiers

Cite

Martin Campos Pinto, Frédérique Charles, Bruno Després, Maxime Herda. A projection algorithm on the set of polynomials with two bounds. Numerical Algorithms, 2020, 85, pp.1475-1498. ⟨10.1007/s11075-019-00872-x⟩. ⟨hal-02128851⟩
133 View
171 Download

Altmetric

Share

More