MATRIX DECOMPOSITION ALGORITHMS IN ORTHOGONAL SPLINE COLLOCATION FOR SEPARABLE ELLIPTIC BOUNDARY-VALUE-PROBLEMS

Citation
B. Bialecki et G. Fairweather, MATRIX DECOMPOSITION ALGORITHMS IN ORTHOGONAL SPLINE COLLOCATION FOR SEPARABLE ELLIPTIC BOUNDARY-VALUE-PROBLEMS, SIAM journal on scientific computing, 16(2), 1995, pp. 330-347
Citations number
33
Categorie Soggetti
Computer Sciences",Mathematics
ISSN journal
10648275
Volume
16
Issue
2
Year of publication
1995
Pages
330 - 347
Database
ISI
SICI code
1064-8275(1995)16:2<330:MDAIOS>2.0.ZU;2-J
Abstract
Fast direct methods are presented for the solution of linear systems a rising in high-order, tensor-product orthogonal spline collocation app lied to separable, second order, linear, elliptic partial differential equations on rectangles. The methods, which are based on a matrix dec omposition approach, involve the solution of a generalized eigenvalue problem corresponding to the orthogonal spline collocation discretizat ion of a two-point boundary value problem. The solution of the origina l linear system is reduced to solving a collection of independent almo st block diagonal linear systems which arise in orthogonal spline coll ocation applied to one-dimensional boundary value problems. The result s of numerical experiments are presented which compare an implementati on of the orthogonal spline collocation approach with a recently devel oped matrix decomposition code for solving finite element Galerkin equ ations.