This paper proposes 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.
Convergence analysis of corner cutting algorithms refining nets of functions / Costanza Conti, Nira Dyn, Lucia Romani. - In: MATHEMATICS AND COMPUTERS IN SIMULATION. - ISSN 0378-4754. - STAMPA. - 176:(2020), pp. 134-146. [10.1016/j.matcom.2020.01.012]
Convergence analysis of corner cutting algorithms refining nets of functions
Costanza Conti;
2020
Abstract
This paper proposes 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.File | Dimensione | Formato | |
---|---|---|---|
CDR_MATCOM_2019.pdf
Accesso chiuso
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
187.93 kB
Formato
Adobe PDF
|
187.93 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.