The discrete linear one-sided Chebyshev approximation

Download
  1. Get@NRC: The discrete linear one-sided Chebyshev approximation (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1093/imamat/18.3.361
AuthorSearch for:
TypeArticle
Journal titleIMA Journal of Applied Mathematics
ISSN0272-4960
Volume18
Issue3
Pages361370; # of pages: 10
AbstractA simplex algorithm for the one-sided Chebyshev solution form above of overdetermined systems of linear equations is described. In this algorithm minimum storage is required, no artificial variables are needed and no conditions are imposed on the coefficient matrix. The described algorithm applies as well for the one-sided Chebyshev solution from below. The algorithm is a simple and a fast one. Numerical results are given.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number16556
NPARC number21273626
Export citationExport as RIS
Report a correctionReport a correction
Record identifier715ca98b-4aaf-408f-a2a6-bb482c3d8be2
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)