ACM

Communications of the ACM

Home/Magazine Archive/June 1968 (Vol. 11, No. 6)/Numerical Analysis: Stable numerical methods for obtaining.../Abstract

Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations

By Richard H. Bartels, Gene H. Golub
Communications of the ACM, June 1968, Vol. 11 No. 6, Pages 401-406
10.1145/363347.363364
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

An implementation of Stiefel's exchange algorithm for determining a Chebyshev solution to an overdetermined system of linear equations is presented, that uses Gaussian LU decomposition with row interchanges. The implementation is computationally more stable than those usually given in the literature. A generalization of Stiefel's algorithm is developed which permits the occasional exchange of two equations simultaneously.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.