On polynomial approximation in the uniform norm by the discrete least squares method

DOI10.1007/BF01933715zbMath0606.65008OpenAlexW1967001685MaRDI QIDQ1084833

Lothar Reichel

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933715

zbMATH Keywords

uniform normpolynomial approximationsNumerical examplesFejér pointsdiscrete least squares method

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation by polynomials (41A10)

Related Items

Constrained mock-Chebyshev least squares quadrature, Newton interpolation at Leja points, Uniform approximation by discrete least squares polynomials, On the constrained mock-Chebyshev least-squares, Gram polynomials and the Kummer function, An arbitrary-order discontinuous Galerkin method with one unknown per element

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Development of the mapping function at an analytic corner
• On the determination of boundary collocation points for solving some problems for the Laplace operator
• Convergence of complex Lagrange interpolation polynomials on the locus of the interpolation points
• Riemann sums and the fundamental polynomials of Lagrange interpolation