Related papers: On the two-dimensional moment problem
In this paper, we present experimental algorithms for solving the dualization problem. We present the results of extensive experimentation comparing the execution time of various algorithms.
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…
Using standard tools of harmonic analysis, we state and solve the problem of moments for non-negative measures supported on the unit ball of a Sobolev space of multivariate periodic trigonometric functions. We describe outer and inner…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
We use moment techniques to construct a converging hierarchy of optimization problems to lower bound the ground state energy of interacting particle systems. We approximate (from below) the infinite dimensional optimization problems in this…
Several ways to accelerate the solution of 2D/3D linear min-max problems in $n$ constraints are discussed. We also present an algorithm for solving such problems in the 2D case, which is superior to CGAL's linear programming solver, both in…
In this paper, the problem of finding an axisymmetric stationary spacetime from a specified set of multipole moments, is studied. The condition on the multipole moments, for existence of a solution, is formulated as a convergence condition…
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…
Let $K_f$ be a closed semi-algebraic set in $\dR^d$ such that there exist bounded real polynomials $h_1,{...},h_n$ on $K_f$. It is proved that the moment problem for $K_f$ is solvable provided it is for all sets $K_f\cap C_\lambda$, where…
We show that the moment problem admits solutions that are continuous but differentiable nowhere.
We give a detailed technical report on the implementation of the algorithm presented in Gravin et al. (Discrete & Computational Geometry'12) for reconstructing an $N$-vertex convex polytope $P$ in $\mathbb{R}^d$ from the knowledge of…
This work presents an elegant formalism to model the evolution of the full two rigid body problem. The equations of motion, given in a Cartesian coordinate system, are expressed in terms of spherical harmonics and Wigner D-matrices. The…
The large moment method can be used to compute a large number of moments of physical quantities that are described by coupled systems of linear differential equations. Besides these systems the algorithm requires a certain number of initial…
This paper studies the second moment boundedness of solutions of linear stochastic delay differential equations. First, we give a framework, for general $\mathrm{N}$-dimensional linear stochastic differential equations with a single…
A solution is proposed to a longstanding open problem in kinetic theory, namely, given any set of realizable velocity moments up to order 2n, a closure for the moment of order 2n+1 is constructed for which the moment system found from the…
This paper is a continuation of our previous investigation on the truncated matrix trigonometric moment problem in Ukrainian Math. J., 2011, 63, no.6, 786-797. In the present paper we obtain a Nevanlinna-type formula for this moment problem…
A general quantum algorithm for solving a problem is discussed. The number of steps required to solve a problem using this method is independent of the number of cases that has to be considered classically. Hence, it is more efficient than…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
The paper proposes a novel hybrid method for solving equilibrium problems and fixed point problems. By constructing specially cutting-halfspaces, in this algorithm, only an optimization program is solved at each iteration without the…
We consider the complex moment problem, that is the problem of constructing a positive Borel measure on $\mathbb{C}$ from a given set of moments. We relate this problem to the dynamic inverse problem for the discrete system associated with…