A block QR algorithm for partitioning stiff differential systems
From MaRDI portal
Publication:1056528
DOI10.1007/BF01934462zbMath0523.65053MaRDI QIDQ1056528
Publication date: 1983
Published in: BIT (Search for Journal in Brave)
partitioningnumerical examplesstiff problemsmultistep methodssparse Jacobians23, 329-345 (1983)approximation to the Jacobian matrixblock QR algorithmnon-stiff componentsorthogonal iteration
Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Related Items
Relaxed Newton-like methods for stiff differential systems ⋮ An explicit two-step method for solving stiff systems of ordinary differential equations ⋮ Using nonconvergence of iteration to partition ODEs ⋮ Krylov Approximations for Matrix Square Roots in Stiff Boundary Value Problems ⋮ Distributed-multirate methods for large weakly-coupled differential systems ⋮ Exploiting the separability in the solution of systems of linear ordinary differential equations ⋮ A projection method for the numerical solution of linear systems in separable stiff differential equations ⋮ Automatic partitioning in linearly-implicit Runge-Kutta methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
- Understanding the $QR$ Algorithm
- Iterative Solution of Linear Equations in ODE Codes
- The Numerical Solution of Separably Stiff Systems by Precise Partitioning
- Automatic Partitioning of Stiff Systems and Exploiting the Resulting Structure
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Comparing numerical methods for stiff systems of O.D.E:s
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- Correction in the Dominant Space: A Numerical Technique for a Certain Class of Stiff Initial Value Problems
- Numerical Methods for Computing Angles Between Linear Subspaces
- A Geometric Theory for the $QR$, $LU$ and Power Iterations
