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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Contributor : Maxime Herda <>
Submitted on : Tuesday, May 14, 2019 - 2:49:02 PM
Last modification on : Thursday, May 16, 2019 - 1:20:50 AM


Files produced by the author(s)


  • HAL Id : hal-02128851, version 1


Martin Campos Pinto, Frédérique Charles, Bruno Després, Maxime Herda. A projection algorithm on the set of polynomials with two bounds. 2019. ⟨hal-02128851⟩



Record views


Files downloads