Piecewise linear Chebyshev approximation of planar curves

Download
  1. Get@NRC: Piecewise linear Chebyshev approximation of planar curves (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1080/00207728308926468
AuthorSearch for:
TypeArticle
Journal titleInternational Journal of Systems Science
ISSN0020-7721
Volume14
Issue4
Pages425435; # of pages: 11
AbstractTwo algorithms for solving the piecewise linear Chebyshev approximation problem of planar curves are presented. The first one is for the case when the Chebyshev error norm in any segment does not exceed a preassigned value. The second is for the case when the number of segments is given and a balanced Chebyshev error norm solution is required. The given curve is first digitized and either algorithm is then applied to the discrete points. Both algorithms use parametric linear programming techniques, which result in speed of computation. They also take advantage of the equioscillation property of the Chebyshev approximation and thus avoid unnecessary computation. Hence the algorithms are faster than other known methods. Also no constraints on the approximating functions are required. Numerical results and comments are given.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number22642
NPARC number21273697
Export citationExport as RIS
Report a correctionReport a correction
Record identifiercd03ad14-cad4-424d-8338-ac0e06918920
Record created2015-01-20
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)