Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions

DOI10.1007/s10543-015-0596-3zbMath1353.65038OpenAlexW2302061485MaRDI QIDQ329011

Marcel Schweitzer, Andreas Frommer

Publication date: 21 October 2016

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-015-0596-3

zbMATH Keywords

error estimatesLanczos methodGaussian quadratureLanczos algorithmmatrix functionKrylov subspace approximationStieltjes function

Mathematics Subject Classification ID

Related Items (8)

Rational Gauss quadrature rules for the approximation of matrix functionals involving Stieltjes functions ⋮ The Radau--Lanczos Method for Matrix Functions ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Krylov-Aware Stochastic Trace Estimation ⋮ Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation ⋮ Estimating the error in matrix function approximations ⋮ Enhanced matrix function approximation ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation

Uses Software

• OPQ
• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculation of functions of unsymmetric matrices using Arnoldi's method
• An iterative method to compute the sign function of a non-Hermitian matrix and its application to the overlap Dirac operator at nonzero chemical potential
• On the real convergence rate of the conjugate gradient method
• Implementation of a restarted Krylov subspace method for the evaluation of matrix functions
• Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices
• Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
• Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds
• Numerical approximation to the fractional derivative operator
• Matrix Algorithms
• 2-Norm Error Bounds and Estimates for Lanczos Approximations to Linear Systems and Rational Matrix Functions
• Exponential integrators
• Efficient and Stable Arnoldi Restarts for Matrix Functions Based on Quadrature
• Error Estimates and Evaluation of Matrix Functions via the Faber Transform
• A restarted Lanczos approximation to functions of a symmetric matrix
• Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
• An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• On Restart and Error Estimation for Krylov Approximation of $w=f(A)v$
• Stopping Criteria for Rational Matrix Functions of Hermitian and Symmetric Matrices
• Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
• Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
• Efficient Solution of Parabolic Equations by Krylov Approximation Methods
• Fast CG-Based Methods for Tikhonov--Phillips Regularization
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• Convergence of Restarted Krylov Subspace Methods for Stieltjes Functions of Matrices
• Quadrature Rules Based on the Arnoldi Process
• 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
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions