Convergence analysis of corner cutting algorithms refining nets of functions

Costanza Conti, Nira Dyn, Lucia Romani*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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.

Original languageEnglish
Pages (from-to)134-146
Number of pages13
JournalMathematics and Computers in Simulation
Volume176
DOIs
StatePublished - Oct 2020

Funding

FundersFunder number
Istituto Nazionale di Alta Matematica "Francesco Severi"

    Keywords

    • Convergence
    • Coons transfinite interpolation
    • Corner cutting for nets of functions
    • Corner cutting for polygonal lines
    • Lipschitz continuity

    Fingerprint

    Dive into the research topics of 'Convergence analysis of corner cutting algorithms refining nets of functions'. Together they form a unique fingerprint.

    Cite this