Related papers: Schur analysis of matricial Hausdorff moment seque…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
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…
We study a truncated two-dimensional moment problem in terms of the Stieltjes transform. The set of the solutions is described by the Schur step-by-step algorithm, which is based on the continued fraction expansion of the solution. In…
This paper addresses the development of analytical tools for the computation of the moments of random Gram matrices with one side correlation. Such a question is mainly driven by applications in signal processing and wireless communications…
In this paper we study the truncated operator trigonometric moment problem. All solutions of the moment problem are described by a Nevanlinna-type parameterization. In the case of moments acting in a separable Hilbert space, the matrices of…
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…
A Nevanlinna function is a function which is analytic in the open upper half plane and has a non-negative imaginary part there. In this paper we study a fractional linear transformation for a Nevanlinna function $n$ with a suitable…
The multidimensional moment problem is studied in terms of the Steiltjes transform. The diagonal step-by-step algorithm is constructed for the multidimensional moment problem. The set of solutions of the full multidimensional moment problem…
This paper is concerned with an alternative analytical solution of time-fractional nonlinear Schrodinger equation and nonlinear coupled Schrodinger equation obtained by employing fractional reduced differential transform method. The…
Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
In the present paper, we propose a block variant of the extended Hessenberg process for computing approximations of matrix functions and other problems producing large-scale matrices. Applications to the computation of a matrix function…
The variance, higher order moments, covariance, and joint moments or cumulants are shown to be special cases of a certain tensor in $V^{\otimes n}$ defined in terms of a collection $X_1,...,X_n$ of $V$-valued random variables, for an…
We obtain a new multiplicative decomposition of the resolvent matrix of the truncated Hausdorff matrix moment (THMM) problem in the case of an odd and even number of moments via new Dyukarev-Stieltjes matrix (DSM) parameters. Explicit…
Truncated moment problems in the class of generalized Nevanlinna functions are investigated. General solvability criteria will be established, covering both the even and odd problems, including complete parametrizations of solutions. The…
We introduce a new domain decomposition strategy for time harmonic Maxwell's equations that is valid in the case of automatically generated subdomain partitions with possible presence of cross-points. The convergence of the algorithm is…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for…
We reconsider the problem of calculating arbitrary negative integer moments of the (regularized) characteristic polynomial for $N\times N$ random matrices taken from the Gaussian Unitary Ensemble (GUE). A very compact and convenient…