Limited‐memory polynomial methods for large‐scale matrix functions
type: Item
instance of: scholarly article
title: Limited‐memory polynomial methods for large‐scale matrix functions
arXiv ID: 2002.01682
author: Stefan Güttel
author: Daniel Kressner
author: Kathryn Lund
published in: GAMM-Mitteilungen
publication date: 2023-12-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/2002.01682
Mathematics Subject Classification ID: 65Fxx
Mathematics Subject Classification ID: 15Axx
Mathematics Subject Classification ID: 65Dxx
zbMATH DE Number: 7778852
zbMATH Keywords: Krylov method
zbMATH Keywords: limited memory
zbMATH Keywords: matrix function
zbMATH Keywords: polynomial approximation
zbMATH Keywords: restarting
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3005345825
cites work: Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
cites work: A Truncated Taylor Series Algorithm for Computing the Action of Trigonometric and Hyperbolic Matrix Functions
cites work: Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
cites work: Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
cites work: Fast Leja points
cites work: A Technique for Accelerating the Convergence of Restarted GMRES
cites work: Communication lower bounds and optimal algorithms for numerical linear algebra
cites work: Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
cites work: Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
cites work: Superlinear convergence of conjugate gradients
cites work: Error Estimates and Evaluation of Matrix Functions via the Faber Transform
cites work: Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
cites work: Solution of the time-dependent Liouville-von Neumann equation: dissipative evolution
cites work: Weak convergence of Galerkin approximations for fractional elliptic stochastic PDEs with spatial white noise
cites work: ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
cites work: An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations
cites work: Comparison of software for computing the action of the matrix exponential
cites work: The Leja method revisited: backward error analysis for the matrix exponential
cites work: Interpolating discrete advection--diffusion propagators at Leja sequences
cites work: Computing $f(A)b$ via Least Squares Polynomial Approximations
cites work: Q5849046
cites work: The Numerical Range is a $(1+\sqrt{2})$-Spectral Set
cites work: Near-optimal perfectly matched layers for indefinite Helmholtz problems
cites work: Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
cites work: Two polynomial methods of calculating functions of symmetric matrices
cites work: Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
cites work: Direct methods for sparse matrices
cites work: Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
cites work: On investigating GMRES convergence using unitary matrices
cites work: A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
cites work: Deflated Restarting for Matrix Functions
cites work: Analysis of acceleration strategies for restarted minimal residual methods
cites work: The Tortoise and the Hare Restart GMRES
cites work: Weighted Inner Products for GMRES and GMRES-DR
cites work: Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
cites work: Restarted GMRES for Shifted Linear Systems
cites work: Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
cites work: Efficient and stable Arnoldi restarts for matrix functions based on quadrature
cites work: The Radau--Lanczos Method for Matrix Functions
cites work: Block Krylov subspace methods for functions of matrices
cites work: Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
cites work: Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
cites work: Q3530191
cites work: PARAEXP: A Parallel Integrator for Linear Initial-Value Problems
cites work: Q5851422
cites work: Enlarged Krylov subspace conjugate gradient methods for reducing communication
cites work: Rational approximation to trigonometric operators
cites work: Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
cites work: Hierarchical Matrices: Algorithms and Analysis
cites work: Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
cites work: Optimal solvers for linear systems with fractional powers of sparse SPD matrices
cites work: Q4156973
cites work: Functions of Matrices
cites work: Computing matrix functions
cites work: On Krylov Subspace Approximations to the Matrix Exponential Operator
cites work: Exponential integrators
cites work: Fractional Tikhonov regularization for linear discrete ill-posed problems
cites work: Q5360018
cites work: A restarted Lanczos approximation to functions of a symmetric matrix

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: A residual based error estimate for Leja interpolation of matrix functions

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: A Krylov Subspace Method for the Approximation of Bivariate Matrix Functions

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Approximating spectral densities of large matrices

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: From quantum to classical molecular dynamics: Reduced models and numerical analysis.

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Exponential integrators for stiff elastodynamic problems

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: An interpolatory approximation of the matrix exponential based on Faber polynomials

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Numerical approximation to the fractional derivative operator

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Newton interpolation at Leja points

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Parallel iterative methods for sparse linear systems

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Boundary Element Methods

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Any finite convergence curve is possible in the initial iterations of restarted FOM

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Evaluating non-analytic functions of matrices

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Expokit

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Restarted full orthogonalization method for shifted linear systems

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Backward stability of Clenshaw's algorithm

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: A Krylov--Schur algorithm for large eigenproblems

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Q4904857

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Preconditioning Lanczos Approximations to the Matrix Exponential

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles.

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: A shifted block FOM algorithm with deflated restarting for matrix exponential computations

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Thick-restart Lanczos method for large symmetric eigenvalue problems

Limited‐memory polynomial methods for large‐scale matrix functions (cites work)
cites work: Restarted Full Orthogonalization Method with Deflation for Shifted Linear Systems

Limited‐memory polynomial methods for large‐scale matrix functions (DOI)
DOI: 10.1002/GAMM.202000019