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

Authors:
David Moursund
Affiliations:
Computer Laboratory, Michigan State University, East Lansing, Michigan
Venue:
Journal of the ACM (JACM)
Year:
1965

Citing 0
Cited 2

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

Communications of the ACM
Privacy preserving data obfuscation for inherently clustered data

International Journal of Information and Computer Security

Quantified Score

Hi-index	0.02

Visualization

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.