Related papers: An investigation into a wavelet accelerated gauge …
In order to meet the theoretically achievable imaging performance, calibration of modern radio interferometers is a mandatory challenge, especially at low frequencies. In this perspective, we propose a novel parallel iterative…
This paper establishes convergence rates for learning elliptic pseudo-differential operators, a fundamental operator class in partial differential equations and mathematical physics. In a wavelet-Galerkin framework, we formulate learning…
After an introduction in which we review the fundamental difficulty in constructing lattice chiral gauge theories, we summarize the analytic and numerical evidence that abelian lattice chiral gauge theories can be nonperturbatively…
The Gribov ambiguity problem is studied for compact lattice QED within the Lorentz gauge. In the Coulomb phase, Gribov copies are mainly caused by double Dirac sheets and zero-momentum modes of the gauge fields. Removing them by (non-)…
We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation…
In this paper we derive and analyze an algorithm for inverting quaternion matrices. The algorithm is an analogue of the Frobenius algorithm for the complex matrix inversion. On the theory side, we prove that our algorithm is more efficient…
Ab initio atomic relaxations often take large numbers of steps and long times to converge. An atomic relaxation method based on on-the-flight force learning and a corresponding new curved line minimization algorithm is presented to…
Focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid is discussed. For the uniform grid the model sensitivity matrices exhibit block Toeplitz Toeplitz…
Photon correlators in $~U(1)~$ pure gauge theory for different lattice actions are considered under the Lorentz gauge condition. They are shown to depend strongly on the gauge fixing ambiguity and on the corresponding existence of Dirac…
Wavelets and their associated transforms are highly efficient when approximating and analyzing one-dimensional signals. However, multivariate signals such as images or videos typically exhibit curvilinear singularities, which wavelets are…
In a Hilbert setting, for convex differentiable optimization, we develop a general framework for adaptive accelerated gradient methods. They are based on damped inertial dynamics where the coefficients are designed in a closed-loop way.…
We propose a numerical algorithm for backward stochastic differential equations based on time discretization and trigonometric wavelets. This method combines the effectiveness of Fourier-based methods and the simplicity of a wavelet-based…
We study possibility of improving staggered fermions using various fat links in order to reduce perturbative corrections to the gauge-invariant staggered fermion operators. We prove five theorems on SU(3) projection, triviality in…
In this paper we present applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. According to variational approach in the general case we have the solution as a…
A generalized prefactorization of compact schemes aimed at reducing the stencil and improving the computational efficiency is proposed here in the framework of transport equations. By the prefactorization introduced here, the computational…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
We propose a new fast algorithm to estimate any sparse generalized linear model with convex or non-convex separable penalties. Our algorithm is able to solve problems with millions of samples and features in seconds, by relying on…
At fine lattice spacings, lattice simulations are plagued by slow (topological) modes that give rise to large autocorrelation times. These, in turn, lead to statistical and systematic errors that are difficult to estimate. We study the…
We present an efficient and simple modification of the standard transport algorithm used in explicit eulerian fixed polar grid codes, aimed at getting rid of the average azimuthal velocity when applying the Courant condition. This results…
We investigate the application of efficient recursive numerical integration strategies to models in lattice gauge theory from quantum field theory. Given the coupling structure of the physics problems and the group structure within lattice…