EXPERIENCES WITH SPARSE-MATRIX SOLVERS IN PARALLEL ODE SOFTWARE

Citation
Jjb. Deswart et Jg. Blom, EXPERIENCES WITH SPARSE-MATRIX SOLVERS IN PARALLEL ODE SOFTWARE, Computers & mathematics with applications, 31(9), 1996, pp. 43-55
Citations number
19
Categorie Soggetti
Computer Sciences",Mathematics,"Computer Science Interdisciplinary Applications
ISSN journal
08981221
Volume
31
Issue
9
Year of publication
1996
Pages
43 - 55
Database
ISI
SICI code
0898-1221(1996)31:9<43:EWSSIP>2.0.ZU;2-7
Abstract
The use of implicit methods for numerically solving stiff systems of d ifferential equations requires the solution of systems of nonlinear eq uations. Normally these are solved by a Newton-type process, in which we have to solve systems of linear equations. The Jacobian of the deri vative function determines the structure of the matrices of these line ar systems. Since it often occurs that the components of the derivativ e function only depend on a small number of variables, the system can be considerably sparse. Hence, it can be worth the effort to use a spa rse matrix solver instead of a dense LU-decomposition. This paper repo rts on experiences with the direct sparse matrix solvers MA28 by Duff [1], Y12M by Zlatev et al. [2] and one special-purpose matrix solver, all embedded in the parallel ODE solver PSODE by Sommeijer [3].