A nested Krylov subspace method to compute the sign function of large complex matrices

From MaRDI portal
Publication:634061

DOI10.1016/J.CPC.2010.09.022zbMATH Open1221.65104arXiv0912.4457OpenAlexW2074393408MaRDI QIDQ634061FDOQ634061


Authors: J. C. R. Bloch, Simon Heybrock Edit this on Wikidata


Publication date: 2 August 2011

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

Abstract: We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the overlap Dirac operator at both zero and nonzero baryon density. Krylov-Ritz methods approximate the sign function using a projection on a Krylov subspace. To achieve a high accuracy this subspace must be taken quite large, which makes the method too costly. The new idea is to make a further projection on an even smaller, nested Krylov subspace. If additionally an intermediate preconditioning step is applied, this projection can be performed without affecting the accuracy of the approximation, and a substantial gain in efficiency is achieved for both Hermitian and non-Hermitian matrices. The numerical efficiency of the method is demonstrated on lattice configurations of sizes ranging from 4^4 to 10^4, and the new results are compared with those obtained with rational approximation methods.


Full work available at URL: https://arxiv.org/abs/0912.4457




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: A nested Krylov subspace method to compute the sign function of large complex matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634061)