Related papers: Comparing iterative methods to compute the overlap…
Global and block Krylov subspace methods are efficient iterative solvers for large sparse linear systems with multiple right-hand sides. However, global or block Lanczos-type solvers often exhibit large oscillations in the residual norms…
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…
We propose two numerical algorithms in the fully nonconvex setting for the minimization of the sum of a smooth function and the composition of a nonsmooth function with a linear operator. The iterative schemes are formulated in the spirit…
We use a chiral random matrix model to investigate the effects of massive quarks on the distribution of eigenvalues of QCD inspired Dirac operators. Kalkreuter's lattice analysis of the spectrum of the massive (hermitean) Dirac operator for…
Randomized iterative methods, such as the randomized Kaczmarz method, have gained significant attention for solving large-scale linear systems due to their simplicity and efficiency. Meanwhile, Krylov subspace methods have emerged as a…
This thesis is dedicated to explore the feasibility of numerical calculations in the $\epsilon$--regime of QCD for the extraction of physical information. We apply two formulations of the Ginsparg-Wilson fermions the Neuberger operator and…
We simulate two dynamical, mass degenerate light quarks on 16^3x32 lattices with a spatial extent of 2.4 fm using the Chirally Improved Dirac operator. The simulation method, the implementation of the action and signals of equilibration are…
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…
I show how to avoid a two level nested conjugate gradient procedure in the context of Hybrid Monte Carlo with the overlap fermionic action. The resulting procedure is quite similar to Hybrid Monte Carlo with domain wall fermions, but is…
A new class of lattice Dirac operators which satisfy the index theorem have been recently proposed on the basis of the algebraic relation $\gamma_{5}(\gamma_{5}D) + (\gamma_{5}D)\gamma_{5} = 2a^{2k+1}(\gamma_{5}D)^{2k+2}$. Here $k$ stands…
We show the result of the lattice gauge field tensor which is derived from the classical continuum limit of the overlap Dirac operator. By analogous construction, it was recently proposed that the gauge action can be obtained from the…
Lattice QCD should allow a derivation of the $\Delta I=1/2$ rule from first principles, but numerical calculations to date have been plagued by a variety of problems. After a brief review of these problems, we present several new methods…
The overlap fermion offers the tremendous advantage of exact chiral symmetry on the lattice, but is numerically intensive. This can be made affordable while still providing large lattice volumes, by using coarse lattice spacing, given that…
We study SU(2) gluodynamics at finite temperature near the deconfining phase transition. We create the lattice ensembles using the tadpole improved Luscher-Weisz action. The overlap Dirac operator is used to determine the following three…
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…
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…
We use the graded eigenvalue method, a variant of the supersymmetry technique, to compute the universal spectral correlations of the QCD Dirac operator in the presence of massive dynamical quarks. The calculation is done for the chiral…
Polynomial Krylov subspace methods are among the most widely used methods for approximating $f(A)b$, the action of a matrix function on a vector, in particular when $A$ is large and sparse. When $A$ is Hermitian positive definite, the…
We investigate the eigenvalue spectrum of the staggered Dirac matrix in two color QCD at finite chemical potential. The profiles of complex eigenvalues close to the origin are compared to a complex generalization of the chiral Gaussian…
In theory, the Lanczos algorithm generates an orthogonal basis of the corresponding Krylov subspace. However, in finite precision arithmetic, the orthogonality and linear independence of the computed Lanczos vectors is usually lost quickly.…