Lanczos Approach to the Inverse Square Root of a Large and Sparse Matrix

Abstract

I construct a Lanczos process on a large and sparse matrix and use the results of this iteration to compute the inverse square root of the same matrix. The algorithm is a stable version of an earlier proposal by the author. It can be used for problems related to the matrix sign and polar decomposition. The application here comes from the theory of chiral fermions on the lattice.

Expanded abstract, introduction and conclusions. References added

Cited by in corpus (15)

• Numerical Methods for the QCD Overlap Operator: I. Sign-Function and Error Bounds
• Aspects of Chiral Symmetry and the Lattice
• Numerical Methods for the QCD Overlap Operator:III. Nested Iterations
• Numerical Methods for the QCD Overlap Operator IV: Hybrid Monte Carlo
• Confinement, chiral symmetry, and the lattice
• Quenched QCD at finite temperature with chiral Fermions
• Upper and lower Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa model
• Computational Methods for UV-Suppressed Fermions
• A note on Neuberger's double pass algorithm
• Lattice QCD with Suppressed High Momentum Modes of the Dirac Operator
• An Exact Algorithm for Any-flavor Lattice QCD with Kogut-Susskind Fermion
• Speed and Adaptability of Overlap Fermion Algorithms
• A fast minimal residual solver for overlap fermions
• Fast algorithms for simulating chiral fermions in U(1)lattice gauge theory
• A Linux PC cluster for lattice QCD with exact chiral symmetry