Perturbation Simulations of Rounding Errors in the Evaluation of Chebyshev Series

dc.creatorBarrio,Roberto
dc.creatorBerges,Jean-Claude
dc.date1998
dc.date.accessioned2024-02-06T12:49:36Z
dc.date.available2024-02-06T12:49:36Z
dc.descriptionThis paper presents some numerical simulations of rounding errors produced during evaluation of Chebyshev series. The simulations are based on perturbation theory and use recent software called AQUARELS. They give more precise results than the theoretical bounds (the difference is of some orders of magnitude). The paper concludes by confirming theoretical results on the increment of the error at the end of the interval [-1; 1] and the increased performance achieved by some modifications to Clenshaw's algorithm near those points.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-004-06-0561
dc.identifierhttps://lib.jucs.org/article/27499/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7396
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 4(6): 561-573
dc.subjectRounding errors
dc.subjectperturbation methods
dc.subjectChebyshev polynomials
dc.subjectpolynomial evaluation
dc.titlePerturbation Simulations of Rounding Errors in the Evaluation of Chebyshev Series
dc.typeResearch Article
Файлы