SUNDIALS: Suite of nonlinear and differential/algebraic equation solvers
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Solving Ordinary Differential Equations II
Hairer, E., & Wanner, G. (1996) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-05221-7 · Cited by 4,342
Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations
Brenan, K. E., Campbell, S. L., & Petzold, L. R. (1995) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971224 · Cited by 3,405
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,793
VODE: a variable-coefficient ODE solver.
Brown, P. N., Byrne, G. D., & Hindmarsh, A. C. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910062 · Cited by 1,642
Self-citationSolving Ordinary Differential Equations II
Hairer, E., & Wanner, G. (1991) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-09947-6 · Cited by 1,456
Dennis, J. E., & Schnabel, R. B. (1996) · Cited by 949
Hybrid Krylov Methods for Nonlinear Systems of Equations
Brown, P. N., & Saad, Y. (1990) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0911026 · Cited by 751
Self-citationChoosing the Forcing Terms in an Inexact Newton Method
Eisenstat, S. C., & Walker, H. F. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917003 · Cited by 736
CVODE, A Stiff/Nonstiff ODE Solver in C
Cohen, S. D., Hindmarsh, A. C., & Dubois, P. F. (1996) · Computers in Physics · doi:10.1063/1.4822377 · Cited by 691
Self-citationDescription and use of LSODE, the Livemore Solver for Ordinary Differential Equations
Radhakrishnan, K., & Hindmarsh, A. C. (1993) · doi:10.2172/15013302 · Cited by 502
Self-citationCao, Y., Li, S., Petzold, L., & Serban, R. (2003) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501380630 · Cited by 407
Self-citationJones, J. E., & Woodward, C. S. (2001) · Advances in Water Resources · doi:10.1016/s0309-1708(00)00075-0 · Cited by 383
Self-citationA Polyalgorithm for the Numerical Solution of Ordinary Differential Equations
Byrne, G. D., & Hindmarsh, A. C. (1975) · ACM Transactions on Mathematical Software · doi:10.1145/355626.355636 · Cited by 334
Self-citationNumerical methods and software for sensitivity analysis of differential-algebraic systems
Maly, T., & Petzold, L. R. (1996) · Applied Numerical Mathematics · doi:10.1016/0168-9274(95)00117-4 · Cited by 230
CVODES: The Sensitivity-Enabled ODE Solver in SUNDIALS
Serban, R., & Hindmarsh, A. C. (2005) · ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE) · doi:10.1115/detc2005-85597 · Cited by 215
Self-citationReduced storage matrix methods in stiff ODE systems
Brown, P. N., & Hindmarsh, A. C. (1989) · Applied Mathematics and Computation · doi:10.1016/0096-3003(89)90110-0 · Cited by 198
Self-citationReduced storage matrix methods in stiff ODE systems
Brown, P. N., & Hindmarsh, A. C. (1989) · Conference on Numerical Ordinary Differential Equations · doi:10.1145/101007.101017 · Cited by 154
Self-citationAn Alternative Implementation of Variable Step-Size Multistep Formulas for Stiff ODEs
Jackson, K. R., & Sacks‐Davis, R. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355900.355903 · Cited by 125
Cited by
Stan : A Probabilistic Programming Language
Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., & Riddell, A. (2017) · Journal of Statistical Software · doi:10.18637/jss.v076.i01 · Cited by 7,754
CasADi: a software framework for nonlinear optimization and optimal control
Andersson, J. A. E., Gillis, J., Horn, G., Rawlings, J. B., & Diehl, M. (2019) · Mathematical Programming Computation · doi:10.1007/s12532-018-0139-4 · Cited by 3,868
Rackauckas, C., & Nie, Q. (2017) · Journal of Open Research Software · doi:10.5334/jors.151 · Cited by 1,636
Diversitree: comparative phylogenetic analyses of diversification in R
FitzJohn, R. G. (2012) · Methods in Ecology and Evolution · doi:10.1111/j.2041-210x.2012.00234.x · Cited by 941
Simulation of networks of spiking neurons: A review of tools and strategies
Brette, R., Rudolph, M., Carnevale, T., Hines, M., Beeman, D., Bower, J. M., Diesmann, M., Morrison, A., Goodman, P. H., Harris, F. C., et al. (2007) · Journal of Computational Neuroscience · doi:10.1007/s10827-007-0038-6 · Cited by 822
Metadata
- Authors
- Hindmarsh, A. C., Brown, P. N., Grant, K. E., Lee, S. L., Serban, R., Shumaker, D. E., & Woodward, C. S.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2005-09
- Volume
- 31
- Issue
- 3
- Pages
- 363-396
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2166751342
- Cited by
- 2,556
- References
- 20
- FWCI
- 30.44
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.