Chebyshev Solution of n+1 Linear Equations in n + 1nUnknowns

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Chebyshev Solution of n+1 Linear Equations in n + 1nUnknowns

Full text

Pdf (282 KB)

Source

Journal of the ACM (JACM) archive
Volume 12 , Issue 3 (July 1965) table of contents

Pages: 383 - 387

Year of Publication: 1965

ISSN:0004-5411

Author

David Moursund

Computer Laboratory, Michigan State University, East Lansing, Michigan

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 24, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321281.321289 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	M0URSUND, D. G. Applications of hill climbing techmques to computing Ahebyshev approximations. In preparation.
	2	VALLE POUSSIN, C. J., DE LA. Sur la mthode de lapproximation minimum. Ann. Soc. Sci. Bruxelles, Seconde Partie, Memoires 35, pp. 1-16 Bruxelles, 1911.
	3	RBMEZ, E. YA. General computational methods of Chebyshev approximation. In Prob Iems with linear real parameters. Izd. Akad., Nauk Ukrair. SSP. Kiev, 1957 (Russian). (A mimeographed translation is available in two volumes from the Office of Technical Services, Dept. of Commerce, Washington 25, D. C.)
	4	STIEFEL, E. Note on Jordon elimination, linear programming and Tchebyshev approxi mation. Numer. Math. 2 (1960), 1-17.

CITED BY 2

	Richard H. Bartels , Gene H. Golub, Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations, Communications of the ACM, v.11 n.6, p.401-406, June 1968
	Rupa Parameswaran , Douglas M. Blough, Privacy preserving data obfuscation for inherently clustered data, International Journal of Information and Computer Security, v.2 n.1, p.4-26, January 2008