相关论文: An investigation into a wavelet accelerated gauge …

The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed…

Anderson acceleration (AA) as an efficient technique for speeding up the convergence of fixed-point iterations may be designed for accelerating an optimization method. We propose a novel optimization algorithm by adapting Anderson…

The stabilized biconjugate gradient algorithm BiCGStab recently presented by van der Vorst is applied to the inversion of the lattice fermion operator in the Wilson formulation of lattice Quantum Chromodynamics. Its computational efficiency…

Fast Fourier transform was included in the Top 10 Algorithms of 20th Century by Computing in Science & Engineering. In this paper, we provide a new simple derivation of both the discrete Fourier transform and fast Fourier transform by means…

We use Lorentz polynomials to present the solutions explicitly of equations (6.1.7) of [I. Daubechies, Ten lectures on wavelets, CBMS-NSF Regional Conference Series in Applied Mathematics, 61. Society for Industrial and Applied Mathematics…

In this paper, we present a work in progress about a deep learning based approach for automatic code optimization in polyhedral compilers. The proposed technique explores combinations of affine and non-affine loop transformations to find…

An improved approach to updating the electric field in simulations of Coulomb gases using the local lattice technique introduced by Maggs and Rossetto, is described and tested. Using the Fast Fourier Transform (FFT) an independent…

We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…

We calculate the mean link in Landau gauge for Wilson and improved SU(3) anisotropic gauge actions, using two loop perturbation theory and Monte Carlo simulation employing an accelerated Langevin algorithm. Twisted boundary conditions are…

Two contrasting algorithmic paradigms for constraint satisfaction problems are successive local explorations of neighboring configurations versus producing new configurations using global information about the problem (e.g. approximating…

Fixed-point quantum search algorithms succeed at finding one of $M$ target items among $N$ total items even when the run time of the algorithm is longer than necessary. While the famous Grover's algorithm can search quadratically faster…

In a series of recent papers (Adcock, Hansen and Poon, 2013, Appl. Comput. Harm. Anal. 45(5):3132-3167), (Adcock, Gataric and Hansen, 2014, SIAM J. Imaging Sci. 7(3):1690-1723) and (Adcock, Hansen, Kutyniok and Ma, 2015, SIAM J. Math. Anal.…

We propose an adaptive iteratively linearized finite element method (AILFEM) in the context of strongly monotone nonlinear operators in Hilbert spaces. The approach combines adaptive mesh-refinement with an energy-contractive linearization…

The unitary gauge fixing technique is applied to the QCD hamiltonian formulated in terms of angular variables. It is demonstrated that in this formulation projections on the physical Hilbert space are unnecessary to separate physical and…

We present a rigorous renormalization group scheme for lattice quantum field theories in terms of operator algebras. The renormalization group is considered as an inductive system of scaling maps between lattice field algebras. We construct…

The 2-D discrete wavelet transform (DWT) can be found in the heart of many image-processing algorithms. Until recently, several studies have compared the performance of such transform on various shared-memory parallel architectures,…

In this paper, we focus on solving a sequence of linear systems with an identical (or similar) coefficient matrix. For this type of problems, we investigate the subspace correction and deflation methods, which use an auxiliary matrix…

The phase retrieval problem is found in various areas of applications of engineering and applied physics. It is also a very active field of research in mathematics, signal processing and machine learning. In this paper, we present an…

In this paper, we introduce the G\"uler-type acceleration technique and utilize it to propose three acceleration algorithms: the G\"uler-type accelerated proximal gradient method (GPGM), the G\"uler-type accelerated linearized augmented…

Gauge fixing is a frequent task encountered in practical lattice gauge theory calculations. We review the performance characteristics of some standard gauging procedures for non-abelian gauge theories, implemented on the parallel machines…