相关论文: Some Comments on Multigrid Methods for Computing P…
We present a new multigrid solver that is suitable for the Dirac operator in the presence of disordered gauge fields. The key behind the success of the algorithm is an adaptive projection onto the coarse grids that preserves the near null…
With the rapid development in wide area networks and low cost, powerful computational resources, grid computing has gained its popularity. With the advent of grid computing, space limitations of conventional distributed systems can be…
We present evidence that multigrid works for wave equations in disordered systems, e.g. in the presence of gauge fields, no matter how strong the disorder, but one needs to introduce a "neural computations" point of view into large scale…
The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…
Gauge fields are special in the sense that they are invariant under gauge transformations and they lead to problems when we try quantizing them straightforwardly. To circumvent this problem we need to specify a gauge condition to fix gauge.
Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum…
A new set of projection operators for three-dimensional models are constructed. Using these operators, an uncomplicated and easily handling algorithm for analysing the unitarity of the aforementioned systems is built up. Interestingly…
This paper proposes the method to optimize restriction and prolongation operators in the two-grid method. The proposed method is straightforwardly extended to the geometric multigrid method (GMM). GMM is used in solving discretized partial…
Tensor network methods are a class of numerical tools and algorithms to study many-body quantum systems in and out of equilibrium, based on tailored variational wave functions. They have found significant applications in simulating lattice…
We examine the interaction of multigrid methods and shape optimization in appropriate shape spaces. Our aim is a scalable algorithm for application on supercomputers, which can only be achieved by mesh-independent convergence. The impact of…
We focus on the study of multigrid methods with aggressive coarsening and polynomial smoothers for the solution of the linear systems corresponding to finite difference/element discretizations of the Laplace equation. Using local Fourier…
This paper introduces a novel approach to algebraic multigrid methods for large systems of linear equations coming from finite element discretizations of certain elliptic second order partial differential equations. Based on a discrete…
The tools, ideas, and insights from linear algebra, abstract algebra, and functional analysis can be extremely useful to signal processing and system theory in various areas of engineering, science, and social science including…
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices…
We construct multigrid methods for an elliptic distributed optimal control problem that are robust with respect to a regularization parameter. We prove the uniform convergence of the $W$-cycle algorithm and demonstrate the performance of…
We study propagators of the lattice 3d adjoint Higgs model, considered as an effective theory of 4d SU(2) gauge theory at high temperature. The propagators are calculated in so-called lambda-gauges. From the long distance behaviour of the…
A new method for computing all elements of the lattice quark propagator is proposed. The method combines the spectral decomposition of the propagator, computing the lowest eigenmodes exactly, with noisy estimators which are 'diluted', i.e.…
The multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to…
In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…
Given a multigrid procedure for linear systems with coefficient matrices $A_n$, we discuss the optimality of a related multigrid procedure with the same smoother and the same projector, when applied to properly related algebraic problems…