Related papers: An adaptive aggregation based domain decomposition…

The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…

Recent developments have shown that a lot can be gained for QCD simulations from GPU hardware. This can be exploited especially in the case of Ginsparg-Wilson fermions when the com putational costs are particularly high. In this work, we…

I describe a method that places the fermion fields and the gauge fields on different lattice spacings during the Hybrid Monte Carlo generation of Ginsparg-Wilson dynamical ensembles. The idea is motivated by Wilson's formulation of the…

We develop an algebraic multigrid method for solving the non-Hermitian Wilson discretization of the 2-dimensional Dirac equation. The proposed approach uses a bootstrap setup algorithm based on a multigrid eigensolver. It computes test…

We are motivated to solve differential algebraic equations with new multi-stage and multisplitting methods. The multi-stage strategy of the waveform relaxation (WR) methods are given with outer and inner iterations. While the outer…

We study a variant of the Schwarz-preconditioned HMC algorithm. In contrast to the original proposal of L\"uscher, we apply the domain decomposition in one lattice direction only. This is sufficient to reduce the condition number of the…

This paper presents a multigrid algorithm for the computation of the rank-R canonical decomposition of a tensor for low rank R. Standard alternating least squares (ALS) is used as the relaxation method. Transfer operators and coarse-level…

We present a novel deep learning-based algorithm to accelerate - through the use of Artificial Neural Networks (ANNs) - the convergence of Algebraic Multigrid (AMG) methods for the iterative solution of the linear systems of equations…

It is shown that the 21264 Alpha processor can reach about 20% sustained efficiency for the inversion of the Wilson-Dirac operator. Since fast ethernet is not sufficient to get balancing between computation and communication on reasonable…

We present an iterative scheme, reminiscent of the Multigrid method, to solve large boundary value problems with Probabilistic Domain Decomposition (PDD). In it, increasingly accurate approximations to the solution are used as control…

In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same…

We compare different conjugate gradient -- like matrix inversion methods (CG, BiCGstab1 and BiCGstab2) employing for this purpose the compact lattice quantum electrodynamics (QED) with Wilson fermions. The main goals of this investigation…

Multilevel optimization has gained renewed interest in machine learning due to its promise in applications such as hyperparameter tuning and continual learning. However, existing methods struggle with the inherent difficulty of efficiently…

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

We demonstrate that substantial progress can be achieved in the study of the phase structure of 4-dimensional compact QED by a joint use of hybrid Monte Carlo and multicanonical algorithms, through an efficient parallel implementation. This…

In the stochastic gradient descent (SGD) for sequential simulations such as the neural stochastic differential equations, the Multilevel Monte Carlo (MLMC) method is known to offer better theoretical computational complexity compared to the…

The spectral deferred correction (SDC) method is an iterative scheme for computing a higher-order collocation solution to an ODE by performing a series of correction sweeps using a low-order timestepping method. This paper examines a…

Computing the trace of the inverse of large matrices is typically addressed through statistical methods. Deflating out the lowest eigenvectors or singular vectors of the matrix reduces the variance of the trace estimator. This work…

We show that it is possible to improve the chiral behaviour and the approach to the continuum limit of correlation functions in lattice QCD with Wilson fermions by taking arithmetic averages of correlators computed in theories regularized…

Critical slowing down in Krylov methods for the Dirac operator presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. Here we formulate a multi-grid algorithm for the Kogut-Susskind…