On polynomial approximation in the uniform norm by the discrete least squares method
From MaRDI portal
Publication:1084833
DOI10.1007/BF01933715zbMath0606.65008MaRDI QIDQ1084833
Publication date: 1986
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01933715
uniform norm; polynomial approximations; Numerical examples; Fejér points; discrete least squares method
Related Items
On the constrained mock-Chebyshev least-squares, Newton interpolation at Leja points, Uniform approximation by discrete least squares polynomials, Gram polynomials and the Kummer function, Constrained mock-Chebyshev least squares quadrature, 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