Convergence analysis of corner cutting algorithms refining nets of functions

Costanza Conti, Nira Dyn and Lucia Romani

Mathematics and Computers in Simulation (MATCOM), 2020, vol. 176, issue C, 134-146

Abstract: In this paper we propose a corner cutting algorithm for nets of functions and prove its convergence using some approximation ideas first applied to the case of corner cutting algorithms refining points with weights proposed by Gregory and Qu. In the net case convergence is proved for the above mentioned weights satisfying an additional condition. The condition requires a bound on the supremum of the relative sizes of the cuts.

Keywords: Corner cutting for polygonal lines; Coons transfinite interpolation; Corner cutting for nets of functions; Convergence; Lipschitz continuity (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475420300197
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:176:y:2020:i:c:p:134-146

DOI: 10.1016/j.matcom.2020.01.012

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().