Minimum L∞ solution of underdetermined systems of linear equations

Download
  1. Get@NRC: Minimum L∞ solution of underdetermined systems of linear equations (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1016/0021-9045(77)90019-3
AuthorSearch for:
TypeArticle
Journal titleJournal of Approximation Theory
ISSN0021-9045
Volume20
Issue1
Pages5769; # of pages: 13
AbstractThe problem of obtaining a minimum L∞ solution of an underdetermined system of consistent linear equations is reduced to a linear programming problem. A modified simplex algorithm is then described. In this algorithm no conditions are imposed on the coefficient matrix, minimum computer storage is required and no artificial variables are needed. The algorithm is a simple and fast one. Numerical results are given.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number16557
NPARC number21273627
Export citationExport as RIS
Report a correctionReport a correction
Record identifier87a94b52-dca2-409f-9ac8-1dc40ae14e71
Record created2015-01-16
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)