Related papers: An investigation into a wavelet accelerated gauge …
An efficient numerical quadrature is proposed for the approximate calculation of the potential energy in the context of pseudo potential electronic structure calculations with Daubechies wavelet and scaling function basis sets. Our…
This article looks at a simple modification to speedup the conventional Gauss Elimination. The proposed modification speeds up the conventional Gauss Elimination by a factor of nearly 9/7 (in the asymptotic limit).
Gauge fixing is a useful tool to simplify calculations. It is also valuable to combine different methods, in particular lattice and continuum methods. However, beyond perturbation theory the Gribov-Singer ambiguity requires further gauge…
We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is provably convergent. By marrying convergent…
We prove the quasi-optimal convergence of a standard adaptive finite element method (AFEM) for nonlinear elliptic second-order equations of monotone type. The adaptive algorithm is based on residual-type a posteriori error estimators and…
We develop a complete Hamiltonian approach to the theory of perturbations around any spatially homogeneous spacetime. We employ the Dirac method for constrained systems which is well-suited to cosmological perturbations. We refine the…
We analyze how gauge fixing, which is required by any practical continuum approach to gauge systems, can interfere with the physical symmetries of such systems. In principle, the gauge fixing procedure, which deals with the (unphysical)…
Early stopping of iterative algorithms is a widely-used form of regularization in statistics, commonly used in conjunction with boosting and related gradient-type algorithms. Although consistency results have been established in some…
This paper addresses the problem of finding the closest generalized essential matrix from a given $6\times 6$ matrix, with respect to the Frobenius norm. To the best of our knowledge, this nonlinear constrained optimization problem has not…
We consider feasibility and constrained optimization problems defined over smooth and/or strongly convex sets. These notions mirror their popular function counterparts but are much less explored in the first-order optimization literature.…
Finding a computationally efficient algorithm for the inverse continuous wavelet transform is a fundamental topic in applications. In this paper, we show the convergence of the inverse wavelet transform.
This work studies the linear convergence of an accelerated scheme of the Alternating Direction Method of Multipliers (ADMM) for strongly convex and Lipschitz-smooth problems. We use the methodology of expressing the accelerated ADMM as a…
We introduce a technique that uses gauge fixing to significantly improve the quantum error correcting performance of subsystem codes. By changing the order in which check operators are measured, valuable additional information can be…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
Automatic cubatures approximate integrals to user-specified error tolerances. For high dimensional problems, it is difficult to adaptively change the sampling pattern to focus on peaks because peaks can hide more easily in high dimensional…
In this paper, we propose a fast and convergent algorithm to solve unassigned distance geometry problems (uDGP). Technically, we construct a novel quadratic measurement model by leveraging $\ell_0$-norm instead of $\ell_1$-norm in the…
The low energy part of the FAST linear accelerator based on 1.3 GHz superconducting RF cavities was successfully commissioned. During commissioning, beam based model dependent methods were used to correct linear lattice and trajectory.…
This paper provides a rigorous convergence rate and complexity analysis for a recently introduced framework, called PDE acceleration, for solving problems in the calculus of variations, and explores applications to obstacle problems. PDE…
Some results of test runs on a $6^3\times 12$ lattice with Wilson quarks and gauge group SU(2) for a previously proposed fermion algorithm by A. Slavnov are presented.
In current work, non-familiar shifted Lucas polynomials are introduced. We have constructed a computational wavelet technique for solution of initial/boundary value second order differential equations. For this numerical scheme, we have…