Related papers: The truncated matrix trigonometric moment problem …
This paper is concerned with the mathematical analysis of the time-domain electromagnetic scattering problem in an infinite rectangular waveguide. A transparent boundary condition is developed to reformulate the problem into an equivalent…
We present an implementation of a truncated unity parquet solver (TUPS) which solves the parquet equations using a truncated form-factor basis for the fermionic momenta. This way fluctuations from different scattering channels are treated…
Products of truncated unitary matrices, independently and uniformly drawn from the unitary group, can be used to study universal aspects of monitored quantum circuits. The von Neumann entropy of the corresponding density matrix decreases…
This is a comprehensive exposition of the classical moment problem using methods from the theory of finite difference operators. Among the advantages of this approach is that the Nevanlinna functions appear as elements of a transfer matrix…
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…
We consider the Hamburger, Stieltjes and Hausdorff moment problems, that are problems of the construction of a Borel measure supported on a real line, on a half-line or on an interval $(0,1)$, from a prescribed set of moments. We propose a…
In this paper we study the strong matrix Stieltjes moment problem. We obtain necessary and sufficient conditions for its solvability. An analytic description of all solutions of the moment problem is derived. Necessary and sufficient…
In a recent paper, Aistleitner, Gantert, Kabluchko, Prochno and Ramanan studied large deviation principles (LDPs) for lacunary trigonometric sums $\sum_{n=1}^N \cos(2 \pi n_k x)$, where the sequence $(n_k)_{k \geq 1}$ satisfies the Hadamard…
The technique of truncated moments of parton distributions allows us to study scaling violations without making any assumption on the shape of parton distributions. The numerical implementation of the method is however difficult, since the…
In this paper we obtain an algorithm towards solving the two-dimensional moment problem. This algorithm gives the necessary and sufficient conditions for the solvability of the moment problem. It is shown that all solutions of the moment…
We consider the problem of constructing reduced models for large scale systems with poles in general domains in the complex plane (as opposed to, e.g., the open left-half plane or the open unit disk). Our goal is to design a model reduction…
The singular values of a product of $M$ independent Ginibre matrices of size $N\times N$ form a determinantal point process. Near the soft edge, as both $M$ and $N$ go to infinity in such a way that $M/N\to \alpha$, $\alpha>0$, a scaling…
In this paper, parameterization of a two-wave with diffuse power (TWDP) fading model is revised. Anomalies caused by using conventional TWDP parameters $K$ and $\Delta$ are first identified, indicating that the existing moment-based…
In this paper we obtain an algorithm towards solving the two-dimensional moment problem. This algorithm gives the necessary and sufficient conditions for the solvability of the moment problem. It is shown that all solutions of the moment…
We characterize the existence of the Lebesgue integrable solutions of the truncated problem of moments in several variables on unbounded supports by the existence of some maximum entropy -- type representing densities and discuss a few…
The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…
Numerical analytic continuation arises frequently in lattice field theory, particularly in spectroscopy problems. This work shows the equivalence of common spectroscopic problems to certain classes of moment problems that have been studied…
Given a dissimilarity matrix, the metric nearness problem is to find the nearest matrix of distances that satisfy the triangle inequalities. This problem has wide applications, such as sensor networks, image processing, and so on. But it is…
The Truncated Nonsmooth Newton Multigrid (TNNMG) method is a robust and efficient solution method for a wide range of block-separable convex minimization problems, typically stemming from discretizations of nonlinear and nonsmooth partial…
Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…