A Lanczos approach to the inverse square root of a large and sparse matrix

DOI10.1006/jcph.2000.6529zbMath0960.65048arXivhep-lat/9910045OpenAlexW2088635427MaRDI QIDQ1577026

Artan Boriçi

Publication date: 22 November 2000

Published in: Journal of Computational Physics (Search for Journal in Brave)

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

zbMATH Keywords

matrix equationsLanczos algorithminverse square root of a matrix

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Related Items

Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds ⋮ Numerical methods for the QCD overlap operator IV: Hybrid Monte Carlo ⋮ Computational methods for UV-suppressed fermions ⋮ An exact Polynomial Hybrid Monte Carlo algorithm for dynamical Kogut-Susskind fermions ⋮ Fast enclosure for a matrix inverse square root ⋮ A LINUX PC CLUSTER FOR LATTICE QCD WITH EXACT CHIRAL SYMMETRY ⋮ Computing enclosures for the inverse square root and the sign function of a matrix ⋮ 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

Cites Work

• Unnamed Item
• Locality properties of Neuberger's lattice Dirac operator
• MINIMIZING STORAGE IN IMPLEMENTATIONS OF THE OVERLAP LATTICE-DIRAC OPERATOR