Deflated Restarting for Matrix Functions

DOI10.1137/090774665zbMath1264.65070OpenAlexW2037201748MaRDI QIDQ3094405

Oliver G. Ernst, Stefan Güttel, Michael Eiermann

Publication date: 25 October 2011

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090774665

zbMATH Keywords

polynomial interpolationmatrix functionKrylov subspace approximationrestarted Krylov subspace methoddeflated restartingthick restartingimplicitly restarted Arnoldi/Lanczos method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (30)

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 ⋮ A combination of the fast multipole boundary element method and Krylov subspace recycling solvers ⋮ Efficient time integration for discontinuous Galerkin approximations of linear wave equations ⋮ A block Krylov subspace time-exact solution method for linear ordinary differential equation systems ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations ⋮ The Radau--Lanczos Method for Matrix Functions ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ A nested Schur complement solver with mesh-independent convergence for the time domain photonics modeling ⋮ 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 ⋮ A shifted block FOM algorithm with deflated restarting for matrix exponential computations ⋮ Speeding Up Krylov Subspace Methods for Computing \(\boldsymbol{{f}(A){b}}\) via Randomization ⋮ Residual and Restarting in Krylov Subspace Evaluation of the $\varphi$ Function ⋮ 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 ⋮ A restarted Lanczos approximation to functions of a symmetric matrix ⋮ 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 ⋮ Polynomial preconditioning for the action of the matrix square root and inverse square root ⋮ Krylov subspace recycling with randomized sketching for matrix functions ⋮ 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 ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ A posteriori error estimates of Krylov subspace approximations to matrix functions

This page was built for publication: Deflated Restarting for Matrix Functions