Using the Discrete Fourier Transform to Analyze the Convergence of Subdivision Schemes
✍ Scribed by Leif Kobbelt
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 344 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1063-5203
No coin nor oath required. For personal study only.
✦ Synopsis
While the continuous Fourier transform is a well-established standard tool for the analysis of subdivision schemes, we present a new technique based on the discrete Fourier transform instead. We first prove a very general convergence criterion for arbitrary interpolatory schemes, i.e., for nonstationary, globally supported, or even nonlinear schemes. Then we use the discrete Fourier transform as an algebraic tool to transform subdivision schemes into a form suitable for the analysis. This allows us to formulate simple and numerically stable sufficient criteria for the convergence of subdivision schemes of very general type. We analyze some example schemes to illustrate the resulting easy-toapply criteria which merely require to numerically estimate the maximum of a smooth function on a compact interval.
📜 SIMILAR VOLUMES
## Abstract Recently a discrete Fourier transform–method of moments (DFT‐MoM) scheme was developed for fast analysis of electrically large rectangular planar dipole arrays, which has been shown to be very efficient in terms of number reduction of unknown variables and computational complexity. The
## Abstract The crystallinities of compression‐molded polypropene sheets were investigated by applying Fourier‐transform (FT)‐IR and attenuated total reflection (ATR) FT‐IR analyses. Two internal reflection elements, Ge and KRS‐5, with an angle of incidence of 45°, were used to obtain the depth pro