Automatic partitioning in linearly-implicit Runge-Kutta methods
- 1 September 1993
- journal article
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 13 (1-3) , 41-55
- https://doi.org/10.1016/0168-9274(93)90130-j
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Efficient Solution of Parabolic Equations by Krylov Approximation MethodsSIAM Journal on Scientific and Statistical Computing, 1992
- Analysis of the Enright-Kamel Partitioning Method for Stiff Ordinary Differential EquationsIMA Journal of Numerical Analysis, 1989
- Matrix-Free Methods for Stiff Systems of ODE’sSIAM Journal on Numerical Analysis, 1986
- Partitioned Runge-Kutta methods with stiffness detection and stepsize controlNumerische Mathematik, 1985
- Iterative Solution of Linear Equations in ODE CodesSIAM Journal on Scientific and Statistical Computing, 1983
- A blockQR algorithm for partitioning stiff differential systemsBIT Numerical Mathematics, 1983
- On the stability of semi-implicit methods for ordinary differential equationsBIT Numerical Mathematics, 1982
- Krylov subspace methods for solving large unsymmetric linear systemsMathematics of Computation, 1981
- Automatic Partitioning of Stiff Systems and Exploiting the Resulting StructureACM Transactions on Mathematical Software, 1979
- Explicit functional calculusLinear Algebra and its Applications, 1973