An Efficient Algorithm for the Classical Least Squares Approximation
From MaRDI portal
Publication:5132013
DOI10.1137/19M1259936zbMath1452.65032OpenAlexW3093338128MaRDI QIDQ5132013
Lourenço L. Peixoto, Dimitar K. Dimitrov
Publication date: 9 November 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1259936
Newton-Raphson methodGaussian quadratureleast squares approximationGolub-Welsch algorithmorthogonal Gram polynomials
Numerical smoothing, curve fitting (65D10) Numerical integration (65D30) Numerical computation of roots of polynomial equations (65H04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
- Defeating the Runge phenomenon for equispaced polynomial interpolation via Tikhonov regularization
- On algorithms for the summation of certain special functions
- On the construction of Gauss-Legendre quadrature rules
- Gram polynomials and the Kummer function
- Stable extrapolation of analytic functions
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Approximate Calculation of Sums I: Bounds for the Zeros of Gram Polynomials
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Numerical Differentiation by High Order Interpolation
- Inequalities for the Zeros of Ultraspherical Polynomials and Bessel Functions
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- Calculation of Gauss Quadrature Rules
- On the optimality of linear methods for operator approximation in convex classes of functions
- Approximate Calculation of Sums II: Gaussian Type Quadrature
- Best approximation in inner product spaces
