Linear Programming Algorithms for the Chebyshev Solution to a System of Consistent Linear Equations.

Abstract

Efficient linear programming algorithms for the solution of a set of overdetermined linear equations in (l sub 1) norm are employed in order to obtain a minimum (l sub infinity) solution to a set of consistent linear equations. In addition, the solution is proved to be of a particular form in case that the set of equations is a Chebyshev system.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1976
Accession Number
ADA027888

Entities

People

  • Uri Ascher

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Equations
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis