Affiliation:
1. Computer Laboratory, Michigan State University, East Lansing, Michigan
Abstract
An algorithm is presented for finding a solution, and the value of a solution, to
n
+ 1 linear equations in
n
unknowns. The arrangement of the computation makes it convenient for use in computing Chebyshev-type approximations by polynomials. The algorithm is particularly efficient if only the value of a solution is desired.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference4 articles.
1. M0URSUND D. G. Applications of hill climbing techmques to computing Ahebyshev approximations. In preparation. M0URSUND D. G. Applications of hill climbing techmques to computing Ahebyshev approximations. In preparation.
2. Sur la mthode de lapproximation minimum. Ann. Soc. Sci. Bruxelles, Seconde Partie;VALLE POUSSIN C. J.;Memoires,1911
3. Note on Jordon elimination, linear programming and Tchebyshev approxi mation;STIEFEL E;Numer. Math.,1960
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献