Related papers: Short-recurrence Krylov subspace methods for the o…
We present a multigrid based eigensolver for computing low-modes of the Hermitian Wilson Dirac operator. For the non-Hermitian case multigrid methods have already replaced conventional Krylov subspace solvers in many lattice QCD…
The parallel strong-scaling of Krylov iterative methods is largely determined by the number of global reductions required at each iteration. The GMRES and Krylov-Schur algorithms employ the Arnoldi algorithm for nonsymmetric matrices. The…
In QCD chiral symmetry is explicitly broken by quark masses, the effect of which can be described reliably by chiral perturbation theory. Effects of explicit chiral symmetry breaking by the lattice regularisation of the Dirac operator,…
The low energy eigenmodes of the continuum QCD Dirac operator are extended, but on the lattice, due to discretization effects, the Dirac operator can have localized eigenmodes. These non-physical modes can introduce strong lattice artifacts…
The authors propose a recycling Krylov subspace method for the solution of a sequence of self-adjoint linear systems. Such problems appear, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically…
We compute the ratio between the scale $\Lambda_L$ associated with a lattice formulation of QCD using the overlap-Dirac operator, and $\Lambda_{MS-bar}$. To this end, the one-loop relation between the lattice coupling $g_0$ and the coupling…
In Lattice QCD computations a substantial amount of work is spent in solving the Dirac equation. In the recent past it has been observed that conventional Krylov solvers tend to critically slow down for large lattices and small quark…
The need for large-scale electronic structure calculations arises recently in the field of material physics and efficient and accurate algebraic methods for large simultaneous linear equations become greatly important. We investigate the…
In this talk we present the results published recently in Ref. [1], where we showed how to introduce a quark chemical potential in the overlap Dirac operator. The resulting operator satisfies a Ginsparg-Wilson relation and has exact zero…
We propose a novel general approach to locality of lattice composite fields, which in case of QCD involves locality in both quark and gauge degrees of freedom. The method is applied to gauge operators based on the overlap Dirac matrix…
Inhomogeneous dynamical mean-field theory has been employed to solve many interesting strongly interacting problems from transport in multilayered devices to the properties of ultracold atoms in a trap. The main computational step,…
We propose algorithms for efficient time integration of large systems of oscillatory second order ordinary differential equations (ODEs) whose solution can be expressed in terms of trigonometric matrix functions. Our algorithms are based on…
Close to the chiral limit, many calculations in numerical lattice QCD can potentially be accelerated using low-mode deflation techniques. In this paper it is shown that the recently introduced domain-decomposed deflation subspaces can be…
We present the first numerical implementation of a non-perturbative renormalization method for lattice operators, based on the study of correlation functions in coordinate space at short Euclidean distance. The method is applied to compute…
The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalisations in the subspace…
In this research, we solve polynomial, Sobolev polynomial, rational, and Sobolev rational least squares problems. Although the increase in the approximation degree allows us to fit the data better in attacking least squares problems, the…
We show how to introduce a quark chemical potential in the overlap Dirac operator. The resulting operator satisfies a Ginsparg-Wilson relation and has exact zero modes. It is no longer gamma_5-hermitian, but its nonreal eigenvalues still…
The rational Krylov subspace method (RKSM) and the low-rank alternating directions implicit (LR-ADI) iteration are established numerical tools for computing low-rank solution factors of large-scale Lyapunov equations. In order to generate…
Efficient algorithms for the solution of partial differential equations on parallel computers are often based on domain decomposition methods. Schwarz preconditioners combined with standard Krylov space solvers are widely used in this…
The Lanczos process constructs a sequence of orthonormal vectors v_m spanning a nested sequence of Krylov subspaces generated by a hermitian matrix A and some starting vector b. In this paper we show how to cheaply recover a secondary…