Related papers: The polynomial eigenvalue problem is well conditio…
In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…
We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomials. First we calculate directly the moments of the density.…
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. Among the challenges that it poses is to expand the currently limited range of random polynomials…
This paper calculates the fluctuations of eigenvalues of polynomials on large Haar unitaries cut by finite rank deterministic matrices. When the eigenvalues are all simple, we can give a complete algorithm for computing the fluctuations.…
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
An admissible estimator of the eigenvalues of the variance-covariance matrix is given for multivariate normal distributions with respect to the scale-invariant squared error loss.
Eigenvalue assignment problem of a linear scalar system with a single discrete delay is analytically and exactly solved. The existence condition of the desired eigenvalue is established when the current and delay states are present in the…
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…
We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system…
For real symmetric and complex Hermitian Gaussian processes whose values are $d\times d$ matrices, we characterize the conditions under which the probability that at least $k$ eigenvalues collide is positive for $2\le k\le d$, and we obtain…
The aim of this paper is to describe a Matlab package for computing the simultaneous Gaussian quadrature rules associated with a variety of multiple orthogonal polynomials. Multiple orthogonal polynomials can be considered as a…
The general expression with the physical significance and positive definite condition of the eigenvalues of $4\times 4$ Hermitian and trace-one matrix are obtained. This implies that the eigenvalue problem of the $4\times 4$ density matrix…
This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to address several challenging problems in statistical…
Eigenvalue problem for two coupled Ginzburg-Landau equations is numerically investigated. The fixed points of corresponding equations system are found. The classification of these points is made. The phase portraits of corresponding…
Standard perturbation theory of eigenvalue problems consists of obtaining approximations of eigenmodes in the neighborhood of an operator where the corresponding eigenmode is known. Nevertheless, if the corresponding eigenmodes of several…
A truncation of a Haar distributed orthogonal random matrix gives rise to a matrix whose eigenvalues are either real or complex conjugate pairs, and are supported within the closed unit disk. This is also true for a product $P_m$ of $m$…
A necessary condition is given for a sequence of identically distributed and pairwise positively quadrant dependent random variables obeying the strong laws of large numbers with respect to the normalising constants $n^{1/p}$ $(1 \leqslant…
Given a random quantum state of multiple distinguishable or indistinguishable particles, we provide an effective method, rooted in symplectic geometry, to compute the joint probability distribution of the eigenvalues of its one-body reduced…