Related papers: A fast minimal residual solver for overlap fermion…
Randomized algorithms for low-rank approximation of quaternion matrices have gained increasing attention in recent years. However, existing methods overlook pass efficiency, the ability to limit the number of passes over the input…
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations…
In this paper, we study regression problems over a separable Hilbert space with the square loss, covering non-parametric regression over a reproducing kernel Hilbert space. We investigate a class of spectral/regularized algorithms,…
This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…
The action of the overlap-Dirac operator on a vector is typically implemented in directly through a multi-shift conjugate gradient solver. The compute-time this takes to evaluate depends upon the condition number $\kappa$ of the matrix that…
Methods exploiting sparsity have been popular in imaging and signal processing applications including compression, denoising, and imaging inverse problems. Data-driven approaches such as dictionary learning and transform learning enable one…
In this text I present a couple of new principles and thereon based iterative methods for numerical solution of sequences of systems of linear equations with fixed system matrix and changing right-hand-sides. The use of the new methods is…
We consider algebraic iterative reconstruction methods with applications in image reconstruction. In particular, we are concerned with methods based on an unmatched projector/backprojector pair; i.e., the backprojector is not the exact…
We present economical iterative algorithms built on the Biconjugate $A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitian systems. The principal characteristics of the developed solvers is that they are fast…
We study minimum vertex cover problems on random \alpha-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase…
We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…
In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time. It uses very little of the machinery that previously appeared to be necessary for a such an…
We formulate the massive overlap fermions on anisotropic lattices. We find that the dispersion relation for the overlap fermion resembles the continuum form in the low-momentum region once the bare parameters are properly tuned. The quark…
People employ the function-on-function regression to model the relationship between two random curves. Fitting this model, widely used strategies include algorithms falling into the framework of functional partial least squares (typically…
We present a set of related Hybrid Monte Carlo methods to simulate an arbitrary number of dynamical overlap fermions. Each fermion is represented by a chiral pseudo-fermion field. The new algorithm reduces critical slowing down in the…
Randomized Kaczmarz (RK) is a simple and fast solver for consistent overdetermined systems, but it is known to be fragile under noise. We study overdetermined $m\times n$ linear systems with a sparse set of corrupted equations, $ {\bf…
This paper introduces a parallel and distributed extension to the alternating direction method of multipliers (ADMM) for solving convex problem: minimize $\sum_{i=1}^N f_i(x_i)$ subject to $\sum_{i=1}^N A_i x_i=c, x_i\in \mathcal{X}_i$. The…
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and…
In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization…
The overlap hypercube fermion is constructed by inserting a lattice fermion with hypercubic couplings into the overlap formula. One obtains an exact Ginsparg-Wilson fermion, which is more complicated than the standard overlap fermion, but…