Limited‐memory polynomial methods for large‐scale matrix functions

DOI10.1002/gamm.202000019arXiv2002.01682OpenAlexW3005345825MaRDI QIDQ6068267

Stefan Güttel, Kathryn Lund, Daniel Kressner

Publication date: 15 December 2023

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.01682

zbMATH Keywords

polynomial approximationmatrix functionlimited memoryKrylov methodrestarting

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Numerical linear algebra (65Fxx) Basic linear algebra (15Axx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Any finite convergence curve is possible in the initial iterations of restarted FOM
• Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
• Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
• Fractional Tikhonov regularization for linear discrete ill-posed problems
• Newton interpolation at Leja points
• Rational approximation to trigonometric operators
• From quantum to classical molecular dynamics: Reduced models and numerical analysis.
• Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
• Fast Leja points
• Restarted full orthogonalization method for shifted linear systems
• Analysis of acceleration strategies for restarted minimal residual methods
• Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
• Weak convergence of Galerkin approximations for fractional elliptic stochastic PDEs with spatial white noise
• High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
• A shifted block FOM algorithm with deflated restarting for matrix exponential computations
• Evaluating non-analytic functions of matrices
• A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
• Backward stability of Clenshaw's algorithm
• Interpolating discrete advection--diffusion propagators at Leja sequences
• A residual based error estimate for Leja interpolation of matrix functions
• ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations
• Block Krylov subspace methods for functions of matrices
• On investigating GMRES convergence using unitary matrices
• Comparison of software for computing the action of the matrix exponential
• Numerical approximation to the fractional derivative operator
• Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
• Superlinear Convergence of Conjugate Gradients
• THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES
• A Krylov--Schur Algorithm for Large Eigenproblems
• Approximating Spectral Densities of Large Matrices
• Near-Optimal Perfectly Matched Layers for Indefinite Helmholtz Problems
• The Leja Method Revisited: Backward Error Analysis for the Matrix Exponential
• Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
• Direct Methods for Sparse Matrices
• Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
• Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles
• Computing matrix functions
• Exponential integrators
• Efficient and Stable Arnoldi Restarts for Matrix Functions Based on Quadrature
• Hierarchical Matrices: Algorithms and Analysis
• Error Estimates and Evaluation of Matrix Functions via the Faber Transform
• A restarted Lanczos approximation to functions of a symmetric matrix
• Deflated Restarting for Matrix Functions
• Computing $f(A)b$ via Least Squares Polynomial Approximations
• Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
• Stable Computation of Generalized Matrix Functions via Polynomial Interpolation
• An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• A Krylov Subspace Method for the Approximation of Bivariate Matrix Functions
• Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
• Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
• Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
• Solution of the time-dependent Liouville-von Neumann equation: dissipative evolution
• Expokit
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Restarted GMRES for Shifted Linear Systems
• Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• The Tortoise and the Hare Restart GMRES
• Optimal solvers for linear systems with fractional powers of sparse SPD matrices
• A Truncated Taylor Series Algorithm for Computing the Action of Trigonometric and Hyperbolic Matrix Functions
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
• Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
• Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
• The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software
• Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
• Restarted Full Orthogonalization Method with Deflation for Shifted Linear Systems
• PARAEXP: A Parallel Integrator for Linear Initial-Value Problems
• A Technique for Accelerating the Convergence of Restarted GMRES
• The Numerical Range is a $(1+\sqrt{2})$-Spectral Set
• The Radau--Lanczos Method for Matrix Functions
• Weighted Inner Products for GMRES and GMRES-DR
• Exponential integrators for stiff elastodynamic problems
• A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
• Functions of Matrices
• Preconditioning Lanczos Approximations to the Matrix Exponential
• Two polynomial methods of calculating functions of symmetric matrices
• Boundary Element Methods
• An interpolatory approximation of the matrix exponential based on Faber polynomials
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series

This page was built for publication: Limited‐memory polynomial methods for large‐scale matrix functions