Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
From MaRDI portal
Abstract: We describe a Lanczos-based algorithm for approximating the product of a rational matrix function with a vector. This algorithm, which we call the Lanczos method for optimal rational matrix function approximation (Lanczos-OR), returns the optimal approximation from a given Krylov subspace in a norm depending on the rational function's denominator, and can be computed using the information from a slightly larger Krylov subspace. We also provide a low-memory implementation which only requires storing a number of vectors proportional to the denominator degree of the rational function. Finally, we show that Lanczos-OR can be used to derive algorithms for computing other matrix functions, including the matrix sign function and quadrature based rational function approximations. In many cases, it improves on the approximation quality of prior approaches, including the standard Lanczos method, with little additional computational overhead.
Recommendations
- Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
- Convergence rates for inverse-free rational approximation of matrix functions
- The Radau-Lanczos method for matrix functions
- Computation of generalized matrix functions with rational Krylov methods
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
Cites work
- scientific article; zbMATH DE number 5713161 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 911331 (Why is no real title available?)
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
- A restarted Lanczos approximation to functions of a symmetric matrix
- Accuracy and Stability of Numerical Algorithms
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Analysis of Projection Methods for Rational Function Approximation to the Matrix Exponential
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
- Efficient and stable Arnoldi restarts for matrix functions based on quadrature
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Bounds for Lanczos-Based Matrix Function Approximation
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- Estimates for the asymptotic convergence factor of two intervals
- Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
- Krylov subspace methods. Principles and analysis.
- Matrix functions
- Methods of conjugate gradients for solving linear systems
- Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
- On solving indefinite symmetric linear systems by means of the Lanczos method
- On the real convergence rate of the conjugate gradient method
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Stability of the Lanczos method for matrix function approximation
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Two polynomial methods of calculating functions of symmetric matrices
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
Cited in
(10)- A low-memory Lanczos method with rational Krylov compression for matrix functions
- Limited memory restarted ^p-^q minimization methods using generalized Krylov subspaces
- Numerical experiments using the barycentric Lagrange treecode to compute correlated random displacements for Brownian dynamics simulations
- Low-Rank Updates of Matrix Functions II: Rational Krylov Methods
- The Radau-Lanczos method for matrix functions
- The short-term rational Lanczos method and applications
- Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm
- Convergence rates for inverse-free rational approximation of matrix functions
- Near instance optimality of the Lanczos method for Stieltjes and related matrix functions
- Computing function of large matrices by a preconditioned rational Krylov method
This page was built for publication: Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101128)
