Related papers: The truncated matrix trigonometric moment problem …
We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…
We consider elliptic variational inequalities generated by obstacle type problems with thin obstacles. For this class of problems, we deduce estimates of the distance (measured in terms of the natural energy norm) between the exact solution…
Many real life problems can be reduced to the solution of a complex exponentials approximation problem which is usually ill posed. Recently a new transform for solving this problem, formulated as a specific moments problem in the plane, has…
Currently, low-rank tensor completion has gained cumulative attention in recovering incomplete visual data whose partial elements are missing. By taking a color image or video as a three-dimensional (3D) tensor, previous studies have…
The paper considers linear problems on weighted spaces of multivariate functions of many variables. The main questions addressed are: When is it possible to approximate the solution for the original function of very many variables by the…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
We consider the "moment vanishing problem" for a general class of piecewise-analytic functions which satisfy on each continuity interval a linear ODE with polynomial coefficients. This problem, which essentially asks how many zero first…
The present paper is devoted to the {\it local moment problem}, which consists in finding of non-decreasing functions on the real axis having given first $2n+1, \; n\geq 0,$ power moments on the whole axis and also $2m+1$ first power…
We derive evolution equations for the truncated Mellin moments of the parton distributions. We find that the equations have the same form as those for the partons themselves. The modified splitting function for n-th moment $P'(n,x)$ is…
The minimum realization problem of hidden Markov models (HMM's) is a fundamental question of stationary discrete-time processes with a finite alphabet. It was shown in the literature that tensor decomposition methods give the hidden Markov…
This paper focuses on the resolution of infinite-dimensional Toeplitz Block LMIs, which are frequently encountered in the context of stability analysis and control design problems formulated in the harmonic framework. We propose a…
Nonnegative matrix factorization (NMF), which is the approximation of a data matrix as the product of two nonnegative matrices, is a key issue in machine learning and data analysis. One approach to NMF is to formulate the problem as a…
The new method for solving the descent equations for gauge theories proposed in \cite{s} is shown to be equivalent with that based on the {\em "Russian formula"}. Moreover it allows to obtain in a closed form the expressions of the…
We solve the LO DGLAP QCD evolution equation for truncated Mellin moments of the nucleon nonsinglet structure function. The results are compared with those, obtained in the Chebyshev-polynomial approach for $x$-space solutions. Computations…
Characterizing whether a Markov process of discrete random variables has an homogeneous continuous-time realization is a hard problem. In practice, this problem reduces to deciding when a given Markov matrix can be written as the…
Full indefinite Stieltjes moment problem is studied via the step-by-step Schur algorithm. Naturally associated with indefinite Stieltjes moment problem are generalized Stieltjes continued fraction and a system of difference equations,…
We review evolution equations for the truncated Mellin moments of the parton distributions and some their applications in QCD analysis. The main finding of the presented approach is that the $n$th truncated moment of the parton distribution…
Time bounded reachability is a fundamental problem in model checking continuous-time Markov chains (CTMCs) and Markov decision processes (CTMDPs) for specifications in continuous stochastic logics. It can be computed by numerically solving…
We present a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…
The generalized moment problem (GMP) is an infinite dimensional linear problem over the cone of finite nonnegative Borel measures. When a GMP instance involves finitely many polynomial moment constraints, moment/sum-of-squares hierarchies…