Deflated restarting for matrix functions
From MaRDI portal
Recommendations
- Computation of matrix functions with deflated restarting
- The restarted shift-and-invert Krylov method for matrix functions.
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
Cited in
(33)- Exponential Krylov time integration for modeling multi-frequency optical response with monochromatic sources
- A combination of the fast multipole boundary element method and Krylov subspace recycling solvers
- A shifted block FOM algorithm with deflated restarting for matrix exponential computations
- KIOPS: a fast adaptive Krylov subspace solver for exponential integrators
- Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices
- Iterative across-time solution of linear differential equations: Krylov subspace versus waveform relaxation
- An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices
- Block Gram-Schmidt algorithms and their stability properties
- A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions
- A nested Schur complement solver with mesh-independent convergence for the time domain photonics modeling
- ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
- Computable upper error bounds for Krylov approximations to matrix exponentials and associated \(\varphi\)-functions
- A posteriori error estimates of Krylov subspace approximations to matrix functions
- A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- A block Krylov subspace time-exact solution method for linear ordinary differential equation systems.
- A framework of the harmonic Arnoldi method for evaluating \(\varphi\)-functions with applications to exponential integrators
- A restarted Lanczos approximation to functions of a symmetric matrix
- Efficient time integration for discontinuous Galerkin approximations of linear wave equations
- A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions
- Computation of matrix functions with deflated restarting
- Residual and restarting in Krylov subspace evaluation of the function
- The Radau-Lanczos method for matrix functions
- Limited‐memory polynomial methods for large‐scale matrix functions
- Coarse Grid Corrections in Krylov Subspace Evaluations of the Matrix Exponential
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- Krylov subspace recycling with randomized sketching for matrix functions
- A low-memory Lanczos method with rational Krylov compression for matrix functions
- Sketch-and-Restart: Randomized Sketching in Quadrature-Based Restarting for Matrix Functions
- Krylov subspace exponential time domain solution of Maxwell's equations in photonic crystal modeling
This page was built for publication: Deflated restarting for matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094405)
