An Efficient Algorithm for the Classical Least Squares Approximation
From MaRDI portal
Recommendations
- Efficient algorithm for a class of least squares estimation problems
- An Efficient Approach to the Linear Least Squares Problem
- An efficient algorithm for the separable nonlinear least squares problem
- Efficient Algorithms for Solution of Regularized Total Least Squares
- The extended classical total least squares algorithm
- An O(n) algorithm for least squares quasi-convex approximation
- A new algorithm for nonlinear least squares
- Faster least squares approximation
- scientific article; zbMATH DE number 1294401
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
Cites work
- Approximate calculation of sums. I: Bounds for the zeros of Gram polynomials
- Approximate calculation of sums. II: Gaussian type quadrature
- Approximation theory and approximation practice
- Best approximation in inner product spaces
- Calculation of Gauss Quadrature Rules
- Defeating the Runge phenomenon for equispaced polynomial interpolation via Tikhonov regularization
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
- Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
- Gram polynomials and the Kummer function
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 4044987 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 1966263 (Why is no real title available?)
- scientific article; zbMATH DE number 271420 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Impossibility of fast stable approximation of analytic functions from equispaced samples
- Inequalities for the Zeros of Ultraspherical Polynomials and Bessel Functions
- Numerical Differentiation by High Order Interpolation
- On algorithms for the summation of certain special functions
- On the construction of Gauss-Legendre quadrature rules
- On the optimality of linear methods for operator approximation in convex classes of functions
- Stable extrapolation of analytic functions
Cited in
(5)- An O(n) algorithm for least squares quasi-convex approximation
- A new complexity bound for the least-squares problem
- A Stable and Efficient Algorithm for the Indefinite Linear Least-Squares Problem
- scientific article; zbMATH DE number 1294401 (Why is no real title available?)
- scientific article; zbMATH DE number 1076856 (Why is no real title available?)
This page was built for publication: An Efficient Algorithm for the Classical Least Squares Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5132013)
