Rate of Convergence of Lawson's Algorithm

DOI10.2307/2004726zbMath0284.41004OpenAlexW4245754903MaRDI QIDQ4771683

A. K. Cline

Publication date: 1972

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2004726

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)

Related Items (10)

Nonlinear residual minimization by iteratively reweighted least squares ⋮ Conjugate gradient acceleration of iteratively re-weighted least squares methods ⋮ H₂- and H∞-approximations for eigenvalues/vector functions of transfer matrices ⋮ Rational Minimax Approximation via Adaptive Barycentric Representations ⋮ Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise ⋮ Compressive Sensing ⋮ An Algorithm for Real and Complex Rational Minimax Approximation ⋮ Saddle points and overdetermined complex equations ⋮ Iteratively reweighted least squares minimization for sparse recovery ⋮ Estimating the matrix \(p\)-norm

This page was built for publication: Rate of Convergence of Lawson's Algorithm