Related papers: A fast minimal residual solver for overlap fermion…
We propose an acceleration scheme for first-order methods (FOMs) for convex quadratic programs (QPs) that is analogous to Anderson acceleration and the Generalized Minimal Residual algorithm for linear systems. We motivate our proposed…
We summarize our recent investigations of lattice QCD with dynamical overlap fermions. We sketch algorithmic issues and our approach to solving them. We show our measurement of the topological susceptibility. We describe a computation of…
One of the limitations of recycled GCRO methods is the large amount of computation required to orthogonalize the basis vectors of the newly generated Krylov subspace for the approximate solution when combined with those of the recycle…
In order to construct improved overlap fermions, we start from a short ranged approximate Ginsparg-Wilson fermion and insert it into the overlap formula. We show that its polynomial evaluation is accelerated considerably compared to the…
The solution of sequences of shifted linear systems is a classic problem in numerical linear algebra, and a variety of efficient methods have been proposed over the years. Nevertheless, there still exist challenging scenarios witnessing a…
Recursive estimates of large systems of equations in the context of least squares fitting is a common practice in different fields of study. For example, recursive adaptive filtering is extensively used in signal processing and control…
This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…
In this work, a new algorithm for solving symmetric indefinite systems of linear equations is presented. It factorizes the matrix into the form LDLt using Jacobi rotations in order to increase the pivot's absolute value. Furthermore, Rook's…
An efficient Krylov subspace algorithm for computing actions of the $\varphi$ matrix function for large matrices is proposed. This matrix function is widely used in exponential time integration, Markov chains and network analysis and many…
We study the use of Krylov subspace recycling for the solution of a sequence of slowly-changing families of linear systems, where each family consists of shifted linear systems that differ in the coefficient matrix only by multiples of the…
We use a continued fraction expansion of the sign-function in order to obtain a five dimensional formulation of the overlap lattice Dirac operator. Within this formulation the inverse of the overlap operator can be calculated by a single…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
We present a new short-recurrence reaidual-optimal Krylov subspace recycling method for sequences of Hermitian systems of linear equations with a fixed system matrix and changing right-hand sides. Such sequences of linear systems occur…
We investigate the application of Krylov space methods to the solution of shifted linear systems of the form (A+\sigma) x - b = 0 for several values of \sigma simultaneously, using only as many matrix-vector operations as the solution of a…
In recent years, a great deal of attention has been focused on numerically solving exponential integrators. The important ingredient to the implementation of exponential integrators is the efficient and accurate evaluation of the so called…
Using overlap as well as Wilson fermions, we have computed the one-loop renormalization factors of ten non-singlet operators which measure the third moment of quark momentum and helicity distributions (the lowest two having been computed in…
The overlap hypercube fermion is a variant of a chirally symmetric lattice fermion, which is endowed with a higher level of locality than the standard overlap fermion. We apply this formulation in quenched QCD simulations with light quarks.…
We describe a shorter algorithm for HD0L uniform recurrence problem
We derive an augmented Krylov subspace method with subspace recycling for computing a sequence of matrix function applications on a set of vectors. The matrix is either fixed or changes as the sequence progresses. We assume consecutive…
The improvement in observational facilities requires refining the modelling of the geometrical structures of astrophysical objects. Nevertheless, for complex problems such as line overlap in molecules showing hyperfine structure, a detailed…