Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A new algorithm for the Chebyshev solution of overdetermined linear systems


Author: Paul T. Boggs
Journal: Math. Comp. 28 (1974), 203-217
MSC: Primary 65F20
MathSciNet review: 0334482
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let $ x(p)$ be the point which minimizes the residual of a linear system in the $ {l_p}$ norm. It is known that under certain conditions $ x(p) \to {x^\ast}$, the Chebyshev or $ {l_\infty }$ solution, as $ p \to \infty $. A differential equation describing $ x(p)$ is derived from which an iterative scheme is devised. A convergence analysis is given and numerical results are presented.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F20

Retrieve articles in all journals with MSC: 65F20


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1974-0334482-3
PII: S 0025-5718(1974)0334482-3
Keywords: Pólya algorithm, $ {l_p}$ solutions, differential equation for $ {l_p}$ solutions, stable integration techniques
Article copyright: © Copyright 1974 American Mathematical Society