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

Authors:
Richard H. Bartels;Gene H. Golub
Affiliations:
Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA
Venue:
Communications of the ACM
Year:
1968

Citing 5
Cited 2

Error Analysis of Direct Methods of Matrix Inversion

Journal of the ACM (JACM)
Chebyshev Solution of n+1 Linear Equations in n + 1nUnknowns

Journal of the ACM (JACM)
Iterative Refinement in Floating Point

Journal of the ACM (JACM)
Computational considerations regarding the calculation of Chebyshev solutions for overdetermined linear eqauation systems by the exchange method

Computational considerations regarding the calculation of Chebyshev solutions for overdetermined linear eqauation systems by the exchange method
Rounding Errors in Algebraic Processes

Rounding Errors in Algebraic Processes

Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system of functions

Communications of the ACM
The simplex method of linear programming using LU decomposition

Communications of the ACM

Quantified Score

Hi-index	48.25

Visualization

Abstract

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.