Lamberti, Paola A parallel approach to bivariate splines. (English) Zbl 0912.65005 J. Math. Res. Expo. 17, No. 3, 361-370 (1997). Summary: We propose an algorithm for the reduction of a real sparse matrix that arises from the construction of certain spline surfaces to ‘block diagonal’ form. The approach is to aggregate matrix elements in similar position and to apply them in a blocked fashion, thus splitting the initial linear system into independent and parallelizable linear subsystems. The results suggest that it is possible to use a large number of processors to solve the above matrix problem at a relatively fine granularity. MSC: 65D07 Numerical computation using splines 65F30 Other matrix algorithms (MSC2010) 65Y05 Parallel numerical computation Keywords:sparse matrix reduction; parallel computation; multivariate spline functions; global conformality condition; multidimensional problems; algorithm; spline surfaces PDF BibTeX XML Cite \textit{P. Lamberti}, J. Math. Res. Expo. 17, No. 3, 361--370 (1997; Zbl 0912.65005)