相关论文: An Accelerated Conjugate Gradient Algorithm to Com…
The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applied to the inversion of the lattice fermion operator in the Wilson formulation of lattice Quantum Chromodynamics. Its computational efficiency…
For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the…
The efficient solution of large-scale multiterm linear matrix equations is a challenging task in numerical linear algebra, and it is a largely open problem. We propose a new iterative scheme for symmetric and positive definite operators,…
We discuss the usage and applicability of deflation methods for the overlap lattice Dirac operator, focussing on calculating the eigenvalues using a method similar to the eigCG algorithm used for other Dirac operators. The overlap operator,…
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…
Two numerical algorithms for the computation of eigenvalues of Dirac operators in lattice gauge theories are described: one is an accelerated conjugate gradient method, the other one a standard Lanczos method. Results obtained by Cullum's…
Lattice QCD calculations require significant computational effort, with the dominant fraction of resources typically spent in the numerical inversion of the Dirac operator. One of the simplest methods to solve such large and sparse linear…
We present a multi-level algorithm for the solution of five dimensional chiral fermion formulations, including domain wall and Mobius Fermions. The algorithm operates on the red-black preconditioned Hermitian operator, and directly…
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be…
Eigenvalues of the Hermitian Wilson-Dirac operator are of special interest in several lattice QCD simulations, e.g., for noise reduction when evaluating all-to-all propagators. In this paper we present a Davidson-type eigensolver that…
A deflated and restarted Lanczos algorithm to solve hermitian linear systems, and at the same time compute eigenvalues and eigenvectors for application to multiple right-hand sides, is described. For the first right-hand side, eigenvectors…
We present an iterative method to diagonalise large matrices. The basic idea is the same as the conjugated gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroduce errors to the directions of…
Results of porting parts of the Lattice Quantum Chromodynamics code to modern FPGA devices are presented. A single-node, double precision implementation of the Conjugate Gradient algorithm is used to invert numerically the Dirac-Wilson…
We analyze the convergence of the Conjugate Gradient (CG) method in exact arithmetic, when the coefficient matrix $A$ is symmetric positive semidefinite and the system is consistent. To do so, we diagonalize $A$ and decompose the algorithm…
Results on the computational efficiency of 2-flavor staggered Wilson fermions compared to usual Wilson fermions in a quenched lattice QCD simulation on $16^3\times32$ lattice at $\beta=6$ are reported. We compare the cost of inverting the…
In this paper, we focus on solving a sequence of linear systems with an identical (or similar) coefficient matrix. For this type of problems, we investigate the subspace correction and deflation methods, which use an auxiliary matrix…
Generalized linear mixed models (GLMMs) are a widely used tool in statistical analysis. The main bottleneck of many computational approaches lies in the inversion of the high dimensional precision matrices associated with the random…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
Low-rank matrix estimation is a canonical problem that finds numerous applications in signal processing, machine learning and imaging science. A popular approach in practice is to factorize the matrix into two compact low-rank factors, and…
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…