Related papers: Spectral Factorization and Lattice Geometry
We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…
By applying Schmidt's lattice method, we prove results on simultaneous Diophantine approximation modulo 1 for systems of polynomials in a single prime variable provided that certain local conditions are met.
We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…
A new method of matrix spectral factorization is proposed which reliably computes an approximate spectral factor of any matrix spectral density that admits spectral factorization
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
Factorization of matrices of Laurent polynomials plays an important role in mathematics and engineering such as wavelet frame construction and filter bank design. Wavelet frames (a.k.a. framelets) are useful in applications such as signal…
We study the spectral stability of a 2D discrete Schr\"{o}dinger equation on a square lattice, in the simultaneous presence of a fractional Laplacian and $\cal{PT}$ symmetry. For that purpose, we compute the plane-wave spectrum in closed…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
Matrix spectral factorization is traditionally described as finding spectral factors having a fixed analytic pole configuration. The classification of spectral factors then involves studying the solutions of a certain algebraic Riccati…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
Bohr proved that a uniformly almost periodic function $f$ has a bounded spectrum if and only if it extends to an entire function $F$ of exponential type $\tau(F) < \infty$. If $f \geq 0$ then a result of Krein implies that $f$ admits a…
The Fej\'{e}r-Riesz spectral factorization lemma, which represents a nonnegative trigonometric polynomial as the squared modulus of a trigonometric polynomial, was extended by Ahiezer to factorize certain entire functions and by Helson and…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…
We study the direct and inverse spectral theory for a class of finite Hermitian banded matrices. Using the theory of matrix orthogonal polynomials, we provide an explicit procedure for reconstructing a banded matrix from a matrix-valued…
An important problem in applications is the approximation of a function $f$ from a finite set of randomly scattered data $f(x_j)$. A common and powerful approach is to construct a trigonometric least squares approximation based on the set…
Spectral and factorization properties of oscillatory matrices leads to a spectral Favard theorem for bounded banded matrices, that admit a positive bidiagonal factorization, in terms of sequences of mixed multiple orthogonal polynomials…