On polynomial approximation in the uniform norm by the discrete least squares method
From MaRDI portal
Recommendations
- Uniform approximation by discrete least squares polynomials
- On numerical methods for discrete least-squares approximation by trigonometric polynomials
- Discretization for uniform polynomial approximation
- On the convergence of discrete least-squares methods on equidistant supporting points
- Uniform partition and the best least-squares piecewise polynomial approximation
Cites work
- Convergence of complex Lagrange interpolation polynomials on the locus of the interpolation points
- Development of the mapping function at an analytic corner
- scientific article; zbMATH DE number 3755179 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3019906 (Why is no real title available?)
- On the determination of boundary collocation points for solving some problems for the Laplace operator
- Riemann sums and the fundamental polynomials of Lagrange interpolation
Cited in
(19)- Gram polynomials and the Kummer function
- A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials
- Constrained mock-Chebyshev least squares quadrature
- An arbitrary-order discontinuous Galerkin method with one unknown per element
- Discrete Least Squares Approximation by Trigonometric Polynomials
- scientific article; zbMATH DE number 5669475 (Why is no real title available?)
- Mean-Square Approximation by Polynomials on the Unit Disk
- scientific article; zbMATH DE number 3985823 (Why is no real title available?)
- scientific article; zbMATH DE number 741186 (Why is no real title available?)
- On the convergence of discrete least-squares methods on equidistant supporting points
- On the constrained mock-Chebyshev least-squares
- Good point sets and corresponding weights for bivariate discrete least squares approximation
- Least-squares polynomial approximation on weakly admissible meshes: Disk and triangle
- The Lebesgue constant for uniform approximation of differential forms
- Sparse grids vs. random points for high-dimensional polynomial approximation
- A mixed interpolation-regression method for numerical integration on the unit circle using zeros of para-orthogonal polynomials
- Discretization for uniform polynomial approximation
- Newton interpolation at Leja points
- Uniform approximation by discrete least squares polynomials
This page was built for publication: On polynomial approximation in the uniform norm by the discrete least squares method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084833)
