The discrete linear restricted Chebyshev approximation

Download
  1. Get@NRC: The discrete linear restricted Chebyshev approximation (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1007/BF01932145
AuthorSearch for:
TypeArticle
Journal titleBIT Numerical Mathematics
ISSN0006-3835
Volume17
Issue3
Pages249261; # of pages: 13
Subjectnumeric computing; mathematics; computational mathematics; numerical analysis
AbstractA numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number16559
NPARC number21273629
Export citationExport as RIS
Report a correctionReport a correction
Record identifier6cd7b386-da24-444b-94d3-d447d2c2ac10
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)