Related papers: Adaptive Multigrid Algorithm for Lattice QCD
Two new relaxation schemes are proposed for the smoothing step in the geometric multigrid solution of PDEs on 2D and 3D stretched structured grids. The new schemes are characterized by efficient line relaxation on branched sets of lines of…
The design of fast solvers for isogeometric analysis is receiving a lot of attention due to the challenge that offers to find an algorithm with a robust convergence with respect to the spline degree. Here, we analyze the application of…
The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault…
In this paper, we present an efficient adaptive multigrid strategy for the geometry optimization of large-scale three dimensional molecular mechanics. The resulting method can achieve significantly reduced complexity by exploiting the…
A new multifermion formulation of lattice QCD is proposed. The model is free of spectrum doubling and preserves all nonanomalous chiral symmetries up to exponentially small corrections. It is argued that a small number of fermion fields may…
We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable…
In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust…
Multigrid solvers are among the most efficient methods for solving the Poisson equation, which is ubiquitous in computational physics. For example, in the context of incompressible flows, it is typically the costliest operation. The present…
In this article we consider two-grid finite element methods for solving semilinear interface problems in d space dimensions, for d=2 or d=3. We first describe in some detail the target problem class with discontinuous diffusion…
In this work, a local Fourier analysis is presented to study the convergence of multigrid methods based on additive Schwarz smoothers. This analysis is presented as a general framework which allows us to study these smoothers for any type…
The following paper discusses the application of a multigrid-in-time scheme to Least Squares Shadowing (LSS), a novel sensitivity analysis method for chaotic dynamical systems. While traditional sensitivity analysis methods break down for…
An algorithm for generating optimal nonuniform grids for solving the two-body Schr\"odinger equation is developed and implemented. The shape of the grid is optimized to accurately reproduce the low-energy part of the spectrum of the…
An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing.…
We review a number of topics related to block variable renormalisation group transformations of quantum fields on the lattice, and to the emerging perfect lattice actions. We first illustrate this procedure by considering scalar fields.…
A numerical scheme utilizing a grid which is staggered in both space and time is proposed for the numerical solution of the (2+1)D Dirac equation in presence of an external electromagnetic potential. It preserves the linear dispersion…
This paper presents a learnable solver tailored to iteratively solve sparse linear systems from discretized partial differential equations (PDEs). Unlike traditional approaches relying on specialized expertise, our solver streamlines the…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
In this paper we show how to construct a Dirac operator on a lattice in complete analogy with the continuum. In fact we consider a more general problem, that is, the Dirac operator over an abelian finite group (for which a lattice is a…
In this article we propose a scalable shape optimization algorithm which is tailored for large scale problems and geometries represented by hierarchically refined meshes. Weak scalability and grid independent convergence is achieved via a…
This work develops a nonlinear multigrid method for diffusion problems discretized by cell-centered finite volume methods on general unstructured grids. The multigrid hierarchy is constructed algebraically using aggregation of degrees of…