Computing properties of subdivision schemes using small real Fourier indexed matrices
Résumé
The quality of a subdivision scheme in the vicinity of a vertex or a face-centre is related to the eigenstructure of the subdivision matrix. When the scheme has the appropriate symmetries, a common technique, based on discrete Fourier transform, builds small complex matrices that ease the numerical analysis of the eigenelements using in particular their Fourier index. But the numerical analysis of the eigenelements remains difficult when matrix entries involve complex numbers and unknowns, for example, in cases where we are tuning a scheme. We present techniques to build similar small matrices, still associated with a Fourier index and whose eigenstructure is simply related to the full matrix, but which are real. They extend the known techniques to schemes which rotate the lattice and with vertices which do not lie topologically on symmetry axes of the studied vicinity of vertex or face centre. Our techniques make it easier to tune these subdivision schemes. We illustrate it with the analysis of the so-called Simplest Scheme at the centre of an n-sided face.