Related papers: Hierarchically deflated conjugate residual
We study 2D QCD with a fundamental fermion at small-$N$ using the recently proposed conformal basis approach. We find that effective conformal dominance still holds, namely that the spectrum converges efficiently, with high…
Algebraic Multigrid (AMG) methods have been proven to be effective solvers for large-scale linear algebraic systems $Ax = b$ with Hermitian positive definite (HPD) matrix $A$. For such problems the convergence in the $A$-norm is well…
In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposition is an essential building block for solving dense…
Our research focuses on few-shot fine-grained image classification, which faces two major challenges: appearance similarity of fine-grained objects and limited number of samples. To preserve the appearance details of images, traditional…
In the domain of geometry and topology optimization, discovering geometries that optimally satisfy specific problem criteria is a complex challenge in both engineering and scientific research. In this work, we propose a new approach for the…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains on surfaces. In this paper the conjugate function method, earlier used for simply connected domains, is…
We present simulation results for the 2-flavour Schwinger model with dynamical Ginsparg-Wilson fermions. Our Dirac operator is constructed by inserting an approximately chiral hypercube operator into the overlap formula, which yields the…
The fermion determinant is a highly non-local object and its logarithm is an extensive quantity. For these reasons it is widely believed that the determinant cannot be treated in acceptance steps of gauge link configurations that differ in…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
We briefly review the overlap formalism for chiral gauge theories, the overlap Dirac operator for massless fermions and its connection to domain wall fermions. We describe properties of the overlap Dirac operator, and methods to implement…
Multigrid solvers are the standard in modern scientific computing simulations. Domain Decomposition Aggregation-Based Algebraic Multigrid, also known as the DD-$\alpha$AMG solver, is a successful realization of an algebraic multigrid solver…
The conjugate gradient (CG) method is an efficient iterative method for solving large-scale strongly convex quadratic programming (QP). In this paper we propose some generalized CG (GCG) methods for solving the $\ell_1$-regularized…
We present a new algorithm which allows for direct numerically exact solutions within dynamical mean-field theory (DMFT). It is based on the established Hirsch-Fye quantum Monte Carlo (HF-QMC) method. However, the DMFT impurity model is…
We show that using the multisplitting algorithm as a preconditioner for conjugate gradient inversion of the domain wall Dirac operator could effectively reduce the inter- node communication cost, at the expense of performing more on-node…
A recently developed numerical method for the calculation of derivatives of functions of general complex matrices, which can also be combined with implicit matrix function approximations such as Krylov-Ritz type algorithms, is presented. An…
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…
In this paper, we consider a class of nonconvex and nonsmooth fractional programming problems, that involve the sum of a convex, possibly nonsmooth function composed with a linear operator and a differentiable, possibly nonconvex function…
We present two improvements to our previous dynamical overlap HMC algorithm. We introduce a new method of differentiating the eigenvectors of the Kernel operator, which removes an instability in the fermionic force. Secondly, by simulating…
We propose an algorithm to reconstruct explicit polygonal meshes from discretely sampled Signed Distance Function (SDF) data, which is especially effective at recovering sharp features. Building on the traditional Dual Contouring of Hermite…
Chordal decomposition techniques are used to reduce large structured positive semidefinite matrix constraints in semidefinite programs (SDPs). The resulting equivalent problem contains multiple smaller constraints on the nonzero blocks (or…