Approximation Theory for Matrices
arXiv:hep-lat/0402037 · doi:10.1016/S0920-5632(03)02466-6
Abstract
We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (ε\leq |z| \leq1). We explain how rational approximations can be applied to large sparse matrices efficiently by making use of partial fraction expansions and multi-shift Krylov space solvers.
10 pages, 7 figures
Cited by in corpus (8)
- Complexity of quantum impurity problems
- Testing Proposals for the Yang-Mills Vacuum Wavefunctional by Measurement of the Vacuum
- The locality of the square-root method for improved staggered quarks
- Accelerating Fermionic Molecular Dynamics
- A lattice Dirac operator for QCD with light dynamical quarks
- A numerical method to compute derivatives of functions of large complex matrices and its application to the overlap Dirac operator at finite chemical potential
- A determinant-free method to simulate the parameters of large Gaussian fields
- Evaluation of the Bilinear Condensate of the Planar Thirring Model in the Strongly Coupled Region