English
Related papers

Related papers: Recovering the lattice from its random perturbatio…

200 papers

Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…

Information Theory · Computer Science 2020-11-06 Shanxiang Lyu , Christian Porter , Cong Ling

A new recursion procedure for deriving renormalized perturbation expansions for the one-dimensional anharmonic oscillator is offered. Based upon the $\hbar$-expansions and suitable quantization conditions, the recursion formulae obtained…

Quantum Physics · Physics 2009-11-07 I. V. Dobrovolska , R. S. Tutik

Let $K:={x: g(x)\leq 1}$ be the compact sub-level set of some homogeneous polynomial $g$. Assume that the only knowledge about $K$ is the degree of $g$ as well as the moments of the Lebesgue measure on $K$ up to order 2d. Then the vector of…

Optimization and Control · Mathematics 2013-11-15 Jean Lasserre

We extend a recently proposed real-space renormalization group scheme for dynamical triangulations to situations where the lattice is coupled to continuous scalar fields. Using Monte Carlo simulations in combination with a linear,…

High Energy Physics - Lattice · Physics 2009-10-31 Eric B. Gregory , Simon M. Catterall , Gudmar Thorleifsson

The number of gravitational arcs systems detected is increasing quickly and should even increase at a faster rate in the near future. This wealth of new gravitational arcs requires the development of a purely automated method to reconstruct…

Instrumentation and Methods for Astrophysics · Physics 2025-02-03 Christophe Alard

We show how the homogeneous variational bicomplex provides a useful formalism for describing a number of properties of single-integral variational problems, and we introduce a subsequence of one of the rows of the bicomplex which is locally…

Differential Geometry · Mathematics 2007-05-23 D. J. Saunders

By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…

Functional Analysis · Mathematics 2013-01-28 A. B. Németh , S. Z. Németh

We present a general scheme to derive lattice differential operators from the discrete velocities and associated Maxwell-Boltzmann distributions used in lattice hydrodynamics. Such discretizations offer built-in isotropy and recursive…

Computational Physics · Physics 2012-08-07 Rashmi Ramadugu , Sumesh P. Thampi , Ronojoy Adhikari , Sauro Succi , Santosh Ansumali

A new synthesis scheme is proposed to effectively generate a random vector with prescribed joint density that induces a (latent) Gaussian tree structure. The quality of synthesis is measured by total variation distance between the…

Information Theory · Computer Science 2017-05-09 Ali Moharrer , Shuangqing Wei , George T. Amariucai , Jing Deng

In applying large-momentum effective theory, renormalization of the Euclidean correlators in lattice regularization is a challenge due to linear divergences in the self-energy of Wilson lines. Based on lattice QCD matrix elements of the…

The skeleton is an essential shape characteristic providing a compact representation of the studied shape. Its computation on the image grid raises many issues. Due to the effects of discretization, the required properties of the skeleton -…

Computer Vision and Pattern Recognition · Computer Science 2014-06-03 Aurélie Leborgne , Julien Mille , Laure Tougne

We consider the problem of recovering a signal observed in Gaussian noise. If the set of signals is convex and compact, and can be specified beforehand, one can use classical linear estimators that achieve a risk within a constant factor of…

Statistics Theory · Mathematics 2017-06-05 Dmitry Ostrovsky , Zaid Harchaoui , Anatoli Juditsky , Arkadi Nemirovski

We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.

Numerical Analysis · Mathematics 2025-07-29 Haoze He , Daniel Kressner

The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…

Metric Geometry · Mathematics 2009-08-05 S. Glied , M. Baake

We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…

Data Structures and Algorithms · Computer Science 2007-07-05 Ali Akhavi , Céline Moreira

We study the recovery of an unknown three-dimensional band-limited signal from multiple noisy observations that are randomly rotated by latent elements of SO(3), where the rotations are drawn from an unknown, non-uniform distribution.…

Signal Processing · Electrical Eng. & Systems 2026-02-25 Tamir Bendory , Dan Edidin , Josh Katz , Shay Kreymer , Nir Sharon

In quantum field theories, spectral densities are directly related to relevant physical observables. In Lattice QCD, their non-perturbative extraction from first principles requires the Inverse Laplace transform of Euclidean-time…

High Energy Physics - Lattice · Physics 2025-01-29 Matteo Saccardi , Mattia Bruno , Leonardo Giusti

We introduce a method to investigate the static and dynamic properties of both Abelian and non-Abelian lattice gauge models in 1+1 dimensions. Specifically, we identify a set of transformations that disentangle different degrees of freedom,…

High Energy Physics - Lattice · Physics 2018-09-27 P. Sala , T. Shi , S. Kühn , M. C. Bañuls , E. Demler , J. I. Cirac

In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in…

Computational Engineering, Finance, and Science · Computer Science 2023-04-26 Vladimir Salnikov , Antoine Falaize , Daria Loziienko

Recently, a class of algorithms combining classical fixed point iterations with repeated random sparsification of approximate solution vectors has been successfully applied to eigenproblems with matrices as large as $10^{108} \times…

Numerical Analysis · Mathematics 2025-04-28 Jonathan Weare , Robert J. Webber
‹ Prev 1 4 5 6 7 8 10 Next ›