The Lawson Algorithm and Extensions

DOI10.2307/2004769zbMath0155.21902OpenAlexW4245317895MaRDI QIDQ5538072

Karl H. Usow, John R. Rice

Publication date: 1968

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

zbMATH Keywords

numerical analysis

Related Items (8)

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 ⋮ An Algorithm for Real and Complex Rational Minimax Approximation ⋮ 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 ⋮ Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm

Cites Work

• Unnamed Item
• Polynomials of Best Approximation on a Real Finite Point Set. I
• POLYNOMIALS OF BEST APPROXIMATION ON AN INTERVAL

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