Affiliation:
1. Stanford Univ., Stanford, CA
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.
Publisher
Association for Computing Machinery (ACM)
Reference11 articles.
1. �ber diskrete und lineare Tschebyscheff-Approximationen
2. Note on Jordan elimination, linear programming and Tchebycheff approximation
3. WILKINSON J. H. Rounding errors in Mgebraic processes. (Series in Automatic Computation.) Prentice-Hall Englewood Cliffs N. J. 1963. WILKINSON J. H. Rounding errors in Mgebraic processes. (Series in Automatic Computation.) Prentice-Hall Englewood Cliffs N. J. 1963.
4. Chebyshev Solution of n+1 Linear Equations in
n
+ 1
n
Unknowns
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Minimax Method;Wiley StatsRef: Statistics Reference Online;2014-09-29
2. Application of the PM6 method to modeling proteins;Journal of Molecular Modeling;2008-12-10
3. Theoretical Upperbound of the Spurious-Free Dynamic Range in Direct Digital Frequency Synthesizers Realized by Polynomial Interpolation Methods;IEEE Transactions on Circuits and Systems I: Regular Papers;2007-10
4. Minimax Method;Encyclopedia of Statistical Sciences;2006-08-15
5. Approximation in normed linear spaces;Numerical Analysis: Historical Developments in the 20th Century;2001