On the computation of stable local bases for bivariate polynomial splines

O. Davydov, On the computation of stable local bases for bivariate polynomial splines, in "Trends in Approximation Theory" (K.Kopotun, T.Lyche, and M.Neamtu, Eds.), pp. 85-94, Vanderbilt University Press, 2001.

Abstract: We show that stable local bases for the spaces of polynomial splines on a triangulation of a bivariate polygonal domain can be efficiently computed by using either singular value decomposition or pivoted QR-decompositon of certain small matrices of nodal smoothness conditions.

Preprint version available: pdf

Homepage