Error bounds for a class of subdivision schemes based on the two-scale refinement equation (Q645712): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cam.2011.06.031 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2015791156 / rank | |||
Normal rank |
Revision as of 22:52, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Error bounds for a class of subdivision schemes based on the two-scale refinement equation |
scientific article |
Statements
Error bounds for a class of subdivision schemes based on the two-scale refinement equation (English)
0 references
10 November 2011
0 references
Error bounds between the limit curve and the control polygon defined after \(k\) subdivision stages are estimated by the authors. A very interesting example is that of the class of subdivision schemes based on the well known two-scale equation [e.g., \textit{I. Daubechies}, Ten lectures on wavelets. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics (1992; Zbl 0776.42018), p. 195]. The authors estimate here error bounds for this general class of subdivision schemes [cf. \textit{C. Mustafa, F. Chen}, and \textit{J. Deng}, J. Comput. Appl. Math. 193, No.~2, 596--613 (2006; Zbl 1120.65018)].
0 references
binary subdivision schemes
0 references
error analysis
0 references
control polygon
0 references
two-scale refinement equation
0 references