Automatic partitioning in linearly-implicit Runge-Kutta methods
Publication:1308559
DOI10.1016/0168-9274(93)90130-JzbMath0790.65058OpenAlexW1991832937WikidataQ127296775 ScholiaQ127296775MaRDI QIDQ1308559
Mario Büttner, Bernhard A. Schmitt, Rüdiger Weiner
Publication date: 23 June 1994
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(93)90130-j
numerical examplesGram-Schmidt orthogonalizationstiff systemsKrylov subspacestiff initial value problem\(W\)-methodautomatic partitioningKrylov techniquelinearly-implicit Runge-Kutta schemepartitioning of stiff and nonstiff subsystems
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Multiple scale methods for ordinary differential equations (34E13)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioned Runge-Kutta methods with stiffness detection and stepsize control
- A block QR algorithm for partitioning stiff differential systems
- Partitioned adaptive Runge-Kutta methods and their stability
- On the stability of semi-implicit methods for ordinary differential equations
- Explicit functional calculus
- Iterative Solution of Linear Equations in ODE Codes
- Implementation of the GMRES Method Using Householder Transformations
- The Numerical Solution of Separably Stiff Systems by Precise Partitioning
- Analysis of the Enright-Kamel Partitioning Method for Stiff Ordinary Differential Equations
- Automatic Partitioning of Stiff Systems and Exploiting the Resulting Structure
- An Attempt to Avoid Exact Jacobian and Nonlinear Equations in the Numerical Solution of Stiff Differential Equations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- Partitioning strategies in Runge-Kutta type methods
- W-Methods with Automatic Partitioning by Krylov Techniques for Large Stiff Systems
- Matrix-Free Methods for Stiff Systems of ODE’s
This page was built for publication: Automatic partitioning in linearly-implicit Runge-Kutta methods