|
ABSTRACT
SUNDIALS is a suite of advanced computational codes for solving large-scale problems that can be modeled as a system of nonlinear algebraic equations, or as initial-value problems in ordinary differential or differential-algebraic equations. The basic versions of these codes are called KINSOL, CVODE, and IDA, respectively. The codes are written in ANSI standard C and are suitable for either serial or parallel machine environments. Common and notable features of these codes include inexact Newton-Krylov methods for solving large-scale nonlinear systems; linear multistep methods for time-dependent problems; a highly modular structure to allow incorporation of different preconditioning and/or linear solver methods; and clear interfaces allowing for users to provide their own data structures underneath the solvers. We describe the current capabilities of the codes, along with some of the algorithms and heuristics used to achieve efficiency and robustness. We also describe how the codes stem from previous and widely used Fortran 77 solvers, and how the codes have been augmented with forward and adjoint methods for carrying out first-order sensitivity analysis with respect to model parameters or initial conditions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Brenan, K. E., Campbell, S. L., and Petzold, L. R. 1996. Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations. SIAM Press, Philadelphia, PA.
|
| |
2
|
|
| |
3
|
|
| |
4
|
Brown, P. N. and Hindmarsh, A. C. 1989. Reduced storage matrix methods in stiff ODE systems. J. Appl. Math. Comp. 31, 49--91.
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
Byrne, G. D. 1992. Pragmatic experiments with Krylov methods in the stiff ODE setting. In Computational Ordinary Differential Equations, J. Cash and I. Gladwell, Eds. Oxford University Press, Oxford, U.K., 323--356.
|
 |
10
|
|
| |
11
|
Byrne, G. D. and Hindmarsh, A. C. 1998. User documentation for PVODE, an ODE solver for parallel computers. Tech. rep. UCRL-ID-130884. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
12
|
|
| |
13
|
|
| |
14
|
Cohen, S. D. and Hindmarsh, A. C. 1994. CVODE user guide. Tech. rep. UCRL-MA-118618. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
15
|
|
| |
16
|
Collier, A. M., Hindmarsh, A. C., Serban, R., and Woodward, C. S. 2004. User documentation for KINSOL v2.2.1. LLNL Tech. rep. UCRL-SM-208116. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
17
|
Curtis, A. R., Powell, M. J. D., and Reid, J. K. 1974. On the estimation of sparse Jacobian matrices. J. Inst. Math. Applic. 13, 117--119.
|
| |
18
|
Dembo, R. S., Eisenstat, S. C., and Steihaug, T. 1982. Inexact Newton methods. SIAM J. Numer. Anal. 19, 400--408.
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
| |
22
|
Hairer, E. and Wanner, G. 1991. Solving Ordinary Differential Equations II, Stiff and Differential-Algebraic Problems. Springer-Verlag, Berlin, Germany.
|
| |
23
|
Hiebert, K. L. and Shampine, L. F. 1980. Implicitly defined output points for solutions of ODEs. Tech. rep. SAND80-0180. Sandia National Laboratories, Albuquerque, NM.
|
| |
24
|
Hindmarsh, A. C. 1992. Detecting stability barriers in BDF solvers. In Computational Ordinary Differential Equations, J. Cash and I. Gladwell, Eds. Oxford University Press, Oxford, U.K., 87--96.
|
| |
25
|
|
| |
26
|
Hindmarsh, A. C. 2000. The PVODE and IDA algorithms. Tech. rep. UCRL-ID-141558. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
27
|
Hindmarsh, A. C. and Serban, R. 2004a. User documentation for CVODE v2.2.1. LLNL Tech. rep. UCRL-SM-208108. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
28
|
Hindmarsh, A. C. and Serban, R. 2004b. User documentation for CVODES v2.2.1. LLNL Tech. rep. UCRL-SM-208111. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
29
|
Hindmarsh, A. C. and Serban, R. 2004c. User documentation for IDA v2.2.1. LLNL Tech. rep. UCRL-SM-208112. Lawrence Livermore National Laboratory, Livermore, CA.
|
 |
30
|
|
| |
31
|
Jones, J. E. and Woodward, C. S. 2001. Newton-Krylov-multigrid solvers for large-scale, highly heterogeneous, variably saturated flow problems. Adv. Water Resourc. 24, 763-- 774.
|
| |
32
|
Kelley, C. T. 1995. Iterative Methods for Solving Linear and Nonlinear Equations. SIAM Press, Philadelphia, PA.
|
| |
33
|
Lee, S. L., Hindmarsh, A. C., and Brown, P. N. 2000. User documentation for SensPVODE, a variant of PVODE for sensitivity analysis. Tech. Rep. UCRL-MA-140211. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
34
|
|
| |
35
|
|
| |
36
|
Radhakrishnan, K. and Hindmarsh, A. C. 1993. Description and use of LSODE, the Livermore solver for ordinary differential equations. Tech. rep. UCRL-ID-113855. Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
37
|
|
| |
38
|
|
| |
39
|
Serban, R. and Hindmarsh, A. C. 2005. CVODES, the Sensitivity-enabled ODE solver in SUNDIALS. In Proceedings of the 2005 ASME International Design Engineering Technical Conference (Long Beach, CA, Sep. 24--28). Also published as 2005 LLNL Tech. rep. UCRL-PROC-21030, Lawrence Livermore National Laboratory, Livermore, CA.
|
| |
40
|
Woodward, C. S. 1998. A Newton-Krylov-multigrid solver for variably saturated flow problems. In Proceedings of the Twelfth International Conference on Computational Methods in Water Resources, vol. 2. Computational Mechanics Publications, Southampton, U.K., 609--616.
|
| |
41
|
Woodward, C. S., Grant, K. E., and Maxwell, R. 2002. Applications of sensitivity analysis to uncertainty quantification for variably saturated flow. In Computational Methods in Water Resources, S. M. Hassanizadeh, R. J. Schotting, W. G. Gray, and G. F. Pinder, Eds. Elsevier, Amsterdam, The Netherlands, 73--80.
|
REVIEW
"Wolfgang Schreiner : Reviewer"
The simulation of many physical phenomena, from turbulences in fusion reactors to water flows in porous media, requires the solution of systems of nonlinear and differential algebraic equations with thousands of unknowns. For the efficient computa
more...
|