Rate of Convergence of Lawson's Algorithm

DOI10.2307/2004726MaRDI QIDQ4771683zbMATH OpenOpenAlexFDO

Authors 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) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25)

Cited in

(14)

• Compressive Sensing
• Saddle points and overdetermined complex equations
• A convex dual problem for the rational minimax approximation and Lawson's iteration
• Rational minimax approximation via adaptive barycentric representations
• H₂- and H∞-approximations for eigenvalues/vector functions of transfer matrices
• Estimating the matrix p-norm
• An algorithm for real and complex rational minimax approximation
• Nonlinear residual minimization by iteratively reweighted least squares
• The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
• Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise
• Conjugate gradient acceleration of iteratively re-weighted least squares methods
• A AAA-type algorithm for the microwave duplexer filtering
• A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations
• Iteratively reweighted least squares minimization for sparse recovery

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4771683)