On polynomial function approximation with minimum mean squared relative error and a problem of Tchebychef

DOI10.1016/j.amc.2015.01.121zbMath1338.41006OpenAlexW2047745149MaRDI QIDQ300164

Carlos F. Borges

Publication date: 23 June 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.01.121

zbMATH Keywords

approximationleast-squaresrelative error

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Cites Work

• Families satisfying the Haar condition
• On Generating Orthogonal Polynomials
• A Survey of Practical Rational and Polynomial Approximation of Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On polynomial function approximation with minimum mean squared relative error and a problem of Tchebychef