A Krylov projection method for systems of ODEs
From MaRDI portal
Publication:1360557
DOI10.1016/S0168-9274(97)00033-0zbMath0885.65073MaRDI QIDQ1360557
Publication date: 20 April 1998
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Linear ordinary differential equations and systems (34A30) Numerical methods for initial value problems involving ordinary differential equations (65L05) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Initial value problems for second-order parabolic equations (35K15) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
Related Items
A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions, A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators, Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources, On the time-fractional Schrödinger equation: theoretical analysis and numerical solution by matrix Mittag-Leffler functions, Preserving geometric properties of the exponential matrix by block Krylov subspace methods, A Krylov projection method for systems of ODEs, A block Krylov subspace time-exact solution method for linear ordinary differential equation systems, A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations, Semi-Lagrangian Runge-Kutta exponential integrators for convection dominated problems, Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential, A structure preserving approximation method for Hamiltonian exponential matrices, APPROXIMATION OF THE LINEAR COMBINATION OF <i>φ</i>-FUNCTIONS USING THE BLOCK SHIFT-AND-INVERT KRYLOV SUBSPACE METHOD, \textit{TimeEvolver}: a program for time evolution with improved error bound, Approximation of the matrix exponential operator by a structure-preserving block Arnoldi-type method, Exponential time differencing for mimetic multilayer Ocean models, Global symplectic Lanczos method with application to matrix exponential approximation, Block Krylov subspace methods for approximating the linear combination of \(\varphi\)-functions arising in exponential integrators, A residual based error estimate for Leja interpolation of matrix functions, Residual and Restarting in Krylov Subspace Evaluation of the $\varphi$ Function, Semi-Lagrangian multistep exponential integrators for index 2 differential-algebraic systems, THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES, An interpolatory approximation of the matrix exponential based on Faber polynomials, Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation, ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations, An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices, Optimal parameters for third order Runge-Kutta exponential integrators for convection-diffusion problems, Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions, Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling, A block \(J\)-Lanczos method for Hamiltonian matrices, Discrete QMR and BCG in the numerical solution of linear systems of ODEs, Exponential Time Integrators for Unsteady Advection–Diffusion Problems on Refined Meshes
Cites Work
- Unnamed Item
- Inertia characteristics of self-adjoint matrix polynomials
- A Krylov projection method for systems of ODEs
- 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
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Accelerating waveform relaxation methods with application to parallel semiconductor device simulation∗
- Global Convergence of the Basic QR Algorithm On Hessenberg Matrices
