Computing the strict Chebyshev solution of overdetermined linear equations

Download
  1. Get@NRC: Computing the strict Chebyshev solution of overdetermined linear equations (Opens in a new window)
DOIResolve DOI: http://doi.org/10.2307/2006127
AuthorSearch for:
TypeArticle
Journal titleMathematics of Computation
ISSN0025-5718
Volume31
Issue140
Pages974983; # of pages: 10
Subjectdiscrete linear Chebyshev approximation; strict Chebyshev approximation; overdetermined linear equations; linear programming
AbstractA method for calculating the strict Chebyshev solution of overdetermined systems of linear equations using linear programming techniques is described. This method provides: (1) a way to determine, for the majority of cases, all the equations belonging to the characteristic set, (2) an efficient method to obtain the inverse of the matrix needed to calculate the strict Chebyshev solution, and (3) a way of recognizing when an element of the Chebyshev solution equals a corresponding element of the strict Chebyshev solution. As a result, in general, the computational effort is considerably reduced. Also the present method deals with full rank as well as rank deficient cases. Numerical results are given.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number16560
NPARC number21273630
Export citationExport as RIS
Report a correctionReport a correction
Record identifierb02bacd5-ce90-4112-960c-80075360fded
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)