相关论文: An iterative method to compute the overlap Dirac o…

Approaches to finite baryon density lattice QCD usually suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We test a method - sign reweighting - that works directly at finite chemical potential and…

Motivated by the contemporary advances in quantum implementation of non-unitary operations, we propose a new dilation method based on the biorthogonal representation of the non-unitary operator, mapping it to an isomorphic unitary matrix in…

An accurate residual--time (AccuRT) restarting for computing matrix exponential actions of nonsymmetric matrices by the shift-and-invert (SAI) Krylov subspace method is proposed. The proposed restarting method is an extension of the…

Semi-Lagrangian schemes with various splitting methods, and with different reconstruction/interpolation strategies have been applied to kinetic simulations. For example, the order of spatial accuracy of the algorithms proposed in {[Qiu and…

In application of the complex Langevin method to QCD at high density and low temperature, the singular-drift problem occurs due to the appearance of near-zero eigenvalues of the Dirac operator. In order to avoid this problem, we proposed to…

We introduce a new method for calculating the mixing matrix for non-singlet quark operators including total derivatives, based solely on their renormalization structure in the chiral limit. As input, the method requires the well-known…

A new method to solve the Dirac equation on a 3D lattice is proposed, in which the variational collapse problem is avoided by the inverse Hamiltonian method and the fermion doubling problem is avoided by performing spatial derivatives in…

We compute the one-loop lattice renormalization of the two-quark operators $\bar{\psi} \Gamma \psi$, where $\Gamma$ denotes the generic Dirac matrix, for the lattice formulation of QCD using the overlap-Dirac operator. We also study the…

In this work we introduce a memory-efficient method for computing the action of a Hermitian matrix function on a vector. Our method consists of a rational Lanczos algorithm combined with a basis compression procedure based on rational…

Critical slowing down for the Krylov Dirac solver presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. We propose a new multi-grid approach for chiral fermions, applicable to both…

Consider a Dirac operator on an oriented compact surface endowed with a Riemannian metric and spin structure. Provided the area and the conformal class are fixed, how small can the $k$-th positive Dirac eigenvalue be? This problem mirrors…

Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…

We compute Neuberger's overlap operator by the Lanczos algorithm applied to the Wilson-Dirac operator. Locality of the operator for quenched QCD data and its eigenvalue spectrum in an instanton background are studied.

In this article, we prove a Sobolev-like inequality for the Dirac operator on closed compact Riemannian spin manifolds with a nearly optimal Sobolev constant. As an application, we give a criterion for the existence of solutions to a…

We propose inexact subspace iteration for solving high-dimensional eigenvalue problems with low-rank structure. Inexactness stems from low-rank compression, enabling efficient representation of high-dimensional vectors in a low-rank tensor…

We describe preconditioned iterative methods for estimating the number of eigenvalues of a Hermitian matrix within a given interval. Such estimation is useful in a number of applications.In particular, it can be used to develop an efficient…

The Dirac operator provides a unified framework for processing signals defined over different order topological domains, such as node and edge signals. Its eigenmodes define a spectral representation that inherently captures cross-domain…

The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to…

According to the necessary requirements for a chirally symmetric Dirac operator, we present a systematic construction of such operators. We formulate a criterion for the hermitian operator which enters the construction such that the doubled…

Preconditioning of a linear system obtained from spectral discretization of time-dependent PDEs often results in a full matrix which is expensive to compute and store specially when the problem size increases. A matrix-free implementation…