Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
From MaRDI portal
Publication:952022
DOI10.1016/j.laa.2008.06.029zbMath1153.65042OpenAlexW2150150879MaRDI QIDQ952022
Stefan Güttel, Michael Eiermann, Martin Afanasjew, Oliver G. Ernst
Publication date: 6 November 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.06.029
convergencenumerical examplefinite difference methodrational approximationMaxwell equationpolynomial interpolationmatrix functionKrylov subspace approximationrestarted Arnoldi/Lanczos methodparabolic initial value problemsstopping criterion based on error indicator
PDEs in connection with optics and electromagnetic theory (35Q60) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Finite difference methods applied to problems in optics and electromagnetic theory (78M20) Iterative numerical methods for linear systems (65F10) Electromagnetic theory (general) (78A25)
Related Items
Efficient approximation of functions of some large matrices by partial fraction expansions ⋮ A study of defect-based error estimates for the Krylov approximation of \(\varphi\)-functions ⋮ Absorption kinetics of vacancies by cavities in aluminum: numerical characterization of sink strengths and first-passage statistics through Krylov subspace projection and eigenvalue deflation ⋮ 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 ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions ⋮ On the exponential generating function for non-backtracking walks ⋮ 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 ⋮ Exponential time differencing for the tracer equations appearing in primitive equation ocean models ⋮ The Radau--Lanczos Method for Matrix Functions ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation ⋮ 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 ⋮ Krylov Subspace Restarting for Matrix Laplace Transforms ⋮ A space-time adaptive finite element method with exponential time integrator for the phase field model of pitting corrosion ⋮ A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices ⋮ A scalable exponential-DG approach for nonlinear conservation laws: with application to Burger and Euler equations ⋮ Convergence rates for inverse-free rational approximation of matrix functions ⋮ Residual and Restarting in Krylov Subspace Evaluation of the $\varphi$ Function ⋮ KIOPS: a fast adaptive Krylov subspace solver for exponential integrators ⋮ Resolvent Krylov subspace approximation to operator functions ⋮ 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 ⋮ ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations ⋮ A Monte Carlo method for computing the action of a matrix exponential on a vector ⋮ An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices ⋮ Computing performability measures in Markov chains by means of 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 ⋮ Sublinear Column-wise Actions of the Matrix Exponential on Social Networks ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ A posteriori error estimates of Krylov subspace approximations to matrix functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of the steepest descent method for matrix functions
- Eigenvalues and pseudo-eigenvalues of Toeplitz matrices
- A recurrence among the elements of functions of triangular matrices
- Accurate conjugate gradient methods for families of shifted systems
- Talbot quadratures and rational approximations
- Chebyshev rational approximations to \(e^{-x}\) in \([0,+\infty)\) and applications to heat-conduction problems
- On Higher Order Stable Implicit Methods for Solving Parabolic Partial Differential Equations
- Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
- Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
- A Hessenberg-Schur method for the problem AX + XB= C
- 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
- Exponential Integrators for Large Systems of Differential Equations
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Two polynomial methods of calculating functions of symmetric matrices
This page was built for publication: Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
