Related papers: On the two-dimensional moment problem
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
In this paper we study truncated moment problems for $J$-self-adjoint, $J$-skew-self-adjoint and $J$-unitary operators. Conditions of the solvability are given. Some canonical solutions of the moment problems are constructed. As a…
In this paper, we establish the almost sure convergence of two-timescale stochastic gradient descent algorithms in continuous time under general noise and stability conditions, extending well known results in discrete time. We analyse…
A new approach in solution of simple quantum mechanical problems in deformed space with minimal length is presented. We propose the generalization of Schro\"edinger equation in momentum representation on the case of deformed Heisenberg…
In the present paper we are concerned with a numerical algorithm for the approximation of the two-dimensional neural field equation with delay. We consider three numerical examples that have been analysed before by other authors and are…
A high-resolution Eulerian method for simulating high-speed polydisperse granular multiphase flows has been developed. The governing equations include a compressible gas that is coupled to mass-based moment equations for a polydisperse…
This article presents a generic method to solve 2D multi-objective placement problem for free-form components. The proposed method is a relaxed placement technique combined with an hybrid algorithm based on a genetic algorithm and a…
In this paper, we propose an improved numerical algorithm for solving minimax problems based on nonsmooth optimization, quadratic programming and iterative process. We also provide a rigorous proof of convergence for our algorithm under…
In the present paper we solve the following different but interrelated problems: (a) the moment problem on Riemann surfaces, (b) the vanishing problem of polynomial Abelian integrals of dimension zero on the projective plane, (c) the…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
We propose the existence theorem for bounded solutions to the system of 2-nd order ODE. Dynamical applications have been considered.
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…
The two-particle models in de Sitter space-time with time-asymmetric retarded-advanced interactions are constructed. Particular cases of the field-type electromagnetic and scalar interactions are considered. The manifestly covariant…
The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…
We propose an approach based on machine learning to solve two-stage linear adaptive robust optimization (ARO) problems with binary here-and-now variables and polyhedral uncertainty sets. We encode the optimal here-and-now decisions, the…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of…
Initially introduced in the framework of quantum control, the so-called "monotonic algorithms" have demonstrated excellent numerical performance when dealing with bilinear optimal control problems. This paper presents a unified formulation…
Testing a graph on 2-vertex- and 2-edge-connectivity are two fundamental algorithmic graph problems. For both problems, different linear-time algorithms with simple implementations are known. Here, an even simpler linear-time algorithm is…
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…