Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds

DOI10.1016/S0010-4655(02)00455-1zbMath1008.81508arXivhep-lat/0202025OpenAlexW2091835635MaRDI QIDQ1613768

Henk A. van der Vorst, Andreas Frommer, Klaus Schilling, Jasper van den Eshof, Thomas Lippert

Publication date: 2 September 2002

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/hep-lat/0202025

zbMATH Keywords

Lanczos methoderror boundsmatrix sign functionlattice quantum chromodynamicspartial fraction expansionoverlap fermions

Mathematics Subject Classification ID

Strong interaction, including quantum chromodynamics (81V05) Quantum field theory on lattices (81T25) Computational methods for problems pertaining to quantum theory (81-08)

Related Items

Numerical experiments with algorithms for the ADI and Zolotarev coefficients, Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions, Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions, New matrix function approximations and quadrature rules based on the Arnoldi process, A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions, Low-lying Wilson Dirac operator eigenvector mixing in dynamical overlap hybrid Monte Carlo, Numerical methods for the QCD overlap operator IV: Hybrid Monte Carlo, Extremal rational functions on symmetric discrete sets and superlinear convergence of the ADI method, A numerical method to compute derivatives of functions of large complex matrices and its application to the overlap Dirac operator at finite chemical potential, 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, Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions, Krylov Subspace Restarting for Matrix Laplace Transforms, Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM, A lattice Dirac operator for QCD with light dynamical quarks, A nested Krylov subspace method to compute the sign function of large complex matrices, The Padé iterations for the matrix sign function and their reciprocals are optimal, The Möbius domain wall fermion algorithm, A Comparison of Limited-memory Krylov Methods for Stieltjes Functions of Hermitian Matrices, On an Economic Arnoldi Method for $BML$-Matrices, Eigenvalue inclusion regions from inverses of shifted matrices, The geometric mean of two matrices from a computational viewpoint, Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential, Numerical techniques for lattice QCD in the \(\epsilon \)-regime, 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, Relaxation strategies for nested Krylov methods, Multigrid preconditioning for the overlap operator in lattice QCD, LATTICE QCD AT THE END OF 2003, A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation, Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions, A new investigation of the extended Krylov subspace method for matrix function evaluations, Low-Rank Updates of Matrix Functions II: Rational Krylov Methods, Integral representations for higher-order Fréchet derivatives of matrix functions: quadrature algorithms and new results on the level-2 condition number, Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection, Error Bounds for Lanczos-Based Matrix Function Approximation, A posteriori error estimates of Krylov subspace approximations to matrix functions

Uses Software

• BiCGstab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
• Abelian chiral gauge theories on the lattice with exact gauge invariance
• A Lanczos approach to the inverse square root of a large and sparse matrix
• Reliable updated residuals in hybrid Bi-CG methods
• Optimal finite difference grids and rational approximations of the square root I. Elliptic problems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Fast CG-Based Methods for Tikhonov--Phillips Regularization
• Estimating the Attainable Accuracy of Recursively Computed Residual Methods
• Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
• Approximate solutions and eigenvalue bounds from Krylov subspaces