Title of article :
Experiences with sparse matrix solvers in parallel ODE software
Author/Authors :
J. J. B. de Swart، نويسنده , , J. G. Blom، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Pages :
13
From page :
43
To page :
55
Abstract :
The use of implicit methods for numerically solving stiff systems of differential equations requires the solution of systems of nonlinear equations. Normally these are solved by a Newtontype process, in which we have to solve systems of linear equations. The Jacobian of the derivative function determines the structure of the matrices of these linear systems. Since it often occurs that the components of the derivative 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 sparse matrix solver instead of a dense LU-decomposition. This paper reports 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].
Keywords :
Numerical analysis , Sparse matrices , Newton iteration , Parallelism , Runge-Kutta methods
Journal title :
Computers and Mathematics with Applications
Serial Year :
1996
Journal title :
Computers and Mathematics with Applications
Record number :
917801
Link To Document :
بازگشت