Parallel solution of large‐scale differential‐algebraic systems
- 1 December 1995
- journal article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 7 (8) , 795-822
- https://doi.org/10.1002/cpe.4330070804
Abstract
DASPK solves large‐scale systems of differential‐algebraic equations. It is based on the integration method in DASSL, but instead of a direct method for the associated linear systems which arise at each time step, the preconditioned GMRES iteration is applied in combination with an inexact Newton method. Two parallel versions of DASPK have been developed: DASPKF90, a Fortran 90 data parallel implementation, and DASPKMP, a message‐passing implementation written in Fortran 77 with extended BLAS. The parallel versions have been implemented for the Thinking Machines Corporation (TMC) CM‐5, a massively parallel multiprocessor, keeping the user interface relatively simple while allowing for portability to other massively parallel architectures. The codes have been demonstrated on several large‐scale test problems, including three‐dimensional formulations of the heat equation, the Cahn‐Hilliard equation and a multi‐species reaction‐diffusion problem. The formulations are described, including detail on preconditioning the Krylov iteration, timing results and performance analysis.Keywords
This publication has 7 references indexed in Scilit:
- Using Krylov Methods in the Solution of Large-Scale Differential-Algebraic SystemsSIAM Journal on Scientific Computing, 1994
- Reduced storage matrix methods in stiff ODE systemsApplied Mathematics and Computation, 1989
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear SystemsSIAM Journal on Scientific and Statistical Computing, 1986
- Decay to Uniform States in Food WebsSIAM Journal on Applied Mathematics, 1986
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient MethodSIAM Journal on Scientific and Statistical Computing, 1985
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- The principle of minimized iterations in the solution of the matrix eigenvalue problemQuarterly of Applied Mathematics, 1951