Range and Domain Partitioning in Piecewise Polynomial Approximation

J. S. C. Prentice


Abstract: Error control in piecewise polynomial interpolation of a smooth univariate function f requires that the interval of approximation be subdivided into many subintervals, on each of which an interpolating polynomial is determined. The number of such subintervals is often over- estimated through the use of a high-order derivative of f . We report on a partitioning algorithm, in which we attempt to reduce the number of subintervals required, by imposing conditions on f and its relevant higher derivative. One of these conditions facilitates a distinction between the need for absolute or relative error control. Two examples demonstrate the effectiveness of this partitioning algorithm.
Key Words: Piecewise Polynomial; Range Partitioning; Domain Partitioning; Error Control


Piecewise Polynomial; Range Partitioning; Domain Partitioning; Error Control

Full Text:


DOI: http://dx.doi.org/10.3968/j.sms.1923845220120202.006

DOI (PDF): http://dx.doi.org/10.3968/g1584


  • There are currently no refbacks.

Copyright (c)

Share us to:   


If you have already registered in Journal A and plan to submit article(s) to Journal B, please click the CATEGORIES, or JOURNALS A-Z on the right side of the "HOME".

We only use three mailboxes as follows to deal with issues about paper acceptance, payment and submission of electronic versions of our journals to databases:
caooc@hotmail.com; sms@cscanada.net; sms@cscanada.org

 Articles published in Studies in Mathematical Sciences are licensed under Creative Commons Attribution 4.0 (CC-BY).


Address: 9375 Rue de Roissy Brossard, Québec, J4X 3A1, Canada

Telephone: 1-514-558 6138

Copyright © 2010 Canadian Research & Development Centre of Sciences and Cultures