CHEBYSHEV SOLUTION OF LARGE LINEAR SYSTEMS.

Abstract

The general problem considered is that of solving a linear system of equations which is singular or almost singular. A method is described which obtains a 'solution' to the system which is stable with respect to small changes in the matrix elements. This method will solve an overdetermined system in m variables and n equations(m < n) even when the system rank is less than m, and should therefore be very useful in many statistical apllications. In this case the error of the system is minimized in the Chebyshev norm using a linear programming formulation and solution. A numerical example using the Hilbert matrix is described in detail. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1966
Accession Number
AD0630537

Entities

People

  • J. B. Rosen

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Equations
  • Linear Programming
  • Linear Systems
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Linear Algebra