Related papers: Some Comments on Multigrid Methods for Computing P…
Magnetic fluids are colloidal suspensions of ferromagnetic particles covered with a surfactant layer, dispersed in a host liquid. The existence of cooperative phenomena in such magnetic colloidal systems, makes the determining of their…
We discuss how multi-grid computing schemes can be used to design hierarchical coordination architectures for energy systems. These hierarchical architectures can be used to manage multiple temporal and spatial scales and mitigate…
Linear covariant gauges, such as Feynman gauge, are very useful in perturbative calculations. Their nonperturbative formulation is, however, highly non-trivial. In particular, it is a challenge to define linear covariant gauges on a…
I review the lattice formulations of vector-like gauge theories (e.g. QCD) with domain-wall/overlap fermions, and discuss how to optimize the chiral symmetry for any finite $ N_s $ (sites in the fifth dimension). In this formulation, quark…
Although the field of distributed optimization is well-developed, relevant literature focused on the application of distributed optimization to multi-robot problems is limited. This survey constitutes the second part of a two-part series on…
We apply a new coordinate space method for the evaluation of lattice Feynman diagrams suggested by L\"uscher and Weisz to field theories in two dimensions. Our work is to be presented for the theories with massless propagators. The main…
Variational symplectic algorithms have recently been developed for carrying out long-time simulation of charged particles in magnetic fields. As a direct consequence of their derivation from a discrete variational principle, these…
High dimensional integrals are abundant in many fields of research including quantum physics. The aim of this paper is to develop efficient recursive strategies to tackle a class of high dimensional integrals having a special product…
Automatic segmentation of an image to identify all meaningful parts is one of the most challenging as well as useful tasks in a number of application areas. This is widely studied. Selective segmentation, less studied, aims to use limited…
Multigrid has become a popular method for solving some of the most challenging real-world computational problems, such as computational fluid dynamics (CFD). The reason for this is the very good scaling properties of multigrid, which is…
A graph based matching is used to construct aggregation for algebraic multigrid. Effects of inexact coarse grid solve is analyzed numerically for a highly discontinuous convection diffusion coefficient matrix and problems from Florida…
In this work, we propose a robust and easily implemented algebraic multigrid method as a stand-alone solver or a preconditioner in Krylov subspace methods for solving either symmetric and positive definite or saddle point linear systems of…
We compute hybrid static potentials in SU(3) lattice gauge theory. We present a method to generate a large set of suitable creation operators with defined quantum numbers from elementary building blocks. We show preliminary results for…
We consider the transmission problem for the Laplace equation on an infinite three-dimensional wedge, determining the complex parameters for which the problem is well-posed, and characterizing the infinite multiplicity nature of the…
Efficient numerical solvers for sparse linear systems are crucial in science and engineering. One of the fastest methods for solving large-scale sparse linear systems is algebraic multigrid (AMG). The main challenge in the construction of…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
In this paper, we investigate the combination of multigrid methods and neural networks, starting from a Finite Element discretization of an elliptic PDE. Multigrid methods use interpolation operators to transfer information between…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
Given a graph $G = (V,E)$ with vertex weights $w(v)$ and a desired number of parts $k$, the goal in graph partitioning problems is to partition the vertex set V into parts $V_1,\ldots,V_k$. Metrics for compactness, contiguity, and balance…
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…