The Lawson Algorithm and Extensions

DOI10.2307/2004769MaRDI QIDQ5538072zbMATH OpenOpenAlexFDO

Authors John R. Rice, Karl H. Usow

Publication date 1968

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

zbMATH Keywords

numerical analysis

Cites work

• scientific article; zbMATH DE number 3341067 (Why is no real title available?)
• Polynomials of Best Approximation on a Real Finite Point Set. I
• POLYNOMIALS OF BEST APPROXIMATION ON AN INTERVAL

Cited in

(11)

• Constrained near-minimax rational approximations to Dawson's integral
• A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Weiszfeld's method: old and new results
• Saddle points and overdetermined complex equations
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• On an algorithm for best approximate solutions to Av=b in normed linear spaces
• An algorithm for real and complex rational minimax approximation
• Solving maxmin optimization problems via population games
• The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
• A convergence analysis of Lawson's iteration for computing polynomial and rational minimax approximations

This page was built for publication: The Lawson Algorithm and Extensions

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