Related papers: (Approximate) Low-Mode Averaging with a new Multig…
We present high order accurate numerical methods for the wave equation that combines efficient Hermite methods with eometrically flexible discontinuous Galerkin methods by using overset grids. Near boundaries we use thin boundary fitted…
We provide an iterative solution approach for the indefinite Helmholtz equation discretised using finite elements, based upon a Hermitian Skew-Hermitian Splitting (HSS) iteration applied to the shifted operator, and prove that the iteration…
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…
Our goal is to predict the band structure of photonic crystals. This task requires us to compute a number of the smallest non-zero eigenvalues of the time-harmonic Maxwell operator depending on the chosen Bloch boundary conditions. We…
The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…
We investigate the connection between pseudo-Hermitian and Hermitian descriptions for a lattice, which consists of a set of isomorphic pseudo-Hermitian clusters. We show that such non-Hermitian systems can act as Hermitian systems. This is…
Bilevel optimization, with broad applications in machine learning, has an intricate hierarchical structure. Gradient-based methods have emerged as a common approach to large-scale bilevel problems. However, the computation of the…
A space-time adaptive scheme is presented for solving advection equations in two space dimensions. The gradient-augmented level set method using a semi-Lagrangian formulation with backward time integration is coupled with a point value…
This work puts forth low-complexity Riemannian subspace descent algorithms for the minimization of functions over the symmetric positive definite (SPD) manifold. Different from the existing Riemannian gradient descent variants, the proposed…
The subgradient method is a classical and foundational approach in non-smooth convex optimization; its simplicity, robustness, and role as a conceptual and algorithmic starting point have made it the backbone of many significant…
For dense Hermitian matrices with small off-diagonal (numerical) ranks and in a hierarchically semiseparable form, we give a stable divide-and-conquer eigendecomposition method with nearly linear complexity (called SuperDC) that…
Typically, the conjugate gradient (CG) algorithm employs mixed precision and even-odd preconditioning to compute propagators for highly improved staggered quarks (HISQ). This approach suffers from critical slowing down as the light quark…
In continuum QCD, nontrivial gauge topologies give rise to zero eigenvalues of the massless Dirac operator. In lattice QCD with Wilson fermions, these zero modes appear as exactly real eigenvalues of the Wilson-Dirac operator and hence as…
Multigrid methods have proven to be an invaluable tool to efficiently solve large sparse linear systems arising in the discretization of partial differential equations (PDEs). Algebraic multigrid methods and in particular adaptive algebraic…
We use low lying eigenvectors of the overlap-Dirac operator as a probe of the QCD vacuum. If instantons play a significant role one would expect the low lying eigenmodes of the overlap-Dirac operator to consist mainly of the mixed ``would…
This paper reviews the most popular methods which are used in lattice QCD to compute the determinant of the lattice Dirac operator: Gaussian integral representation and noisy methods. Both of them lead naturally to matrix function problems.…
A method is presented to include irregular domain boundaries in a geometric multigrid solver. Dirichlet boundary conditions can be imposed on an irregular boundary defined by a level set function. Our implementation employs quadtree/octree…
We have briefly analyzed the existence of the pseudofermionic structure of multilevel pseudo-Hermitian systems with odd time-reversal and higher order involutive symmetries. We have shown that 2N-level Hamiltonians with N-order eigenvalue…
Implicit solvers present strong limitations when used on supercomputing facilities and in particular for adaptive mesh-refinement codes. We present a new method for implicit adaptive time-stepping on adaptive mesh refinement-grids. We…
Multigrid preconditioners and solvers for the indefinite Helmholtz equation suffer from non-stability of the stationary smoothers due to the indefinite spectrum of the operator. In this paper we explore GMRES as a replacement for the…