相关论文: Schur analysis of matricial Hausdorff moment seque…
The main goal of this paper is to achieve a parametrization of the solution set of the truncated matricial Hausdorff moment problem in the non-degenerate and degenerate situation. We treat the even and the odd cases simultaneously. Our…
The main goal of this paper is to achieve a simultaneous treatment of the even and odd truncated matricial Hamburger moment problems in the most general case. In the odd case, these results are completely new for the matrix case, whereas…
The paper treats several aspects of the truncated matricial $[\alpha,\beta]$-Hausdorff type moment problems. It is shown that each $[\alpha,\beta]$-Hausdorff moment sequence has a particular intrinsic structure. More precisely, each element…
In this paper, we study the truncated matrix moment problem in one variable through recursive matrix extensions. \ We give necessary and sufficient conditions for a recursive matrix extension of finite data to be a matrix moment sequence in…
Various methods have been proposed to approximate a solution to the truncated Hausdorff moment problem. In this paper, we establish a method of comparison for the performance of the approximations. Three ways of producing random moment…
The main goal of this paper is to achieve a simultaneous treatment of the even and odd truncated matricial Stieltjes moment problems in the most general case. These results are generalizations of results of Chen and Hu [5,17] which…
We describe all solutions of the matrix Hamburger moment problem in a general case (no conditions besides solvability are assumed). We use the fundamental results of A.V. Shtraus on the generalized resolvents of symmetric operators. All…
In this paper we obtain a Nevanlinna-type formula for the matrix Hamburger moment problem in a general case. We only assume that the problem is solvable and has more that one solution. We express the matrix coefficients of the corresponding…
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…
In this paper we consider two related objects: singular positive semidefinite Hankel block--matrices and associated degenerate truncated matrix Hamburger moment problems. The description of all solutions of a degenerate matrix Hamburger…
The characterization of the solvability of matrix versions of truncated Stieltjes-type moment problems led to the class of $\alpha$-Stieltjes non-negative definite sequences of complex $q \times q$ matrices. In [21], a parametrization of…
This paper gives via Stieltjes transform a complete description of the solution set of a matricial truncated Stieltjes-type power moment problem in the non-degenerate and degenerate cases. The approach is based on the Schur type algorithm…
In this paper we study moment sequences of matrix-valued measures on compact intervals. A complete parametrization of such sequences is obtained via a symmetric version of matricial canonical moments. Furthermore, distinguished extensions…
The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following…
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…
We consider the sparse moment problem of learning a $k$-spike mixture in high-dimensional space from its noisy moment information in any dimension. We measure the accuracy of the learned mixtures using transportation distance. Previous…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
The main goal of this paper is to reconsider a phenomenon which was treated in earlier work of the authors' on several truncated matricial moment problems. Using a special kind of Schur complement we obtain a more transparent insight into…