Related papers: How well-conditioned can the eigenvalue problem be…
We show that a perturbed Coulomb problem discussed recently is conditionally solvable. We obtain the exact eigenvalues and eigenfunctions and compare the former with eigenvalues calculated by means of a numerical method. We discuss the…
This article study the average conditioning for a random underdetermined polynomial system. The expected value of the moments of the condition number are compared to the moments of the condition number of random matrices. An expression for…
A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented.…
This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…
The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
We discuss the (right) eigenvalue equation for $\mathbb{H}$, $\mathbb{C}$ and $\mathbb{R}$ linear quaternionic operators. The possibility to introduce an isomorphism between these operators and real/complex matrices allows to translate the…
The probability that there are $k$ real eigenvalues for an $n$ dimensional real random matrix is known. Here we study this for the case of products of independent random matrices. Relating the problem of the probability that the product of…
A two dimensional eigenvalue problem (2DEVP) of a Hermitian matrix pair $(A, C)$ is introduced in this paper. The 2DEVP can be viewed as a linear algebraic formulation of the well-known eigenvalue optimization problem of the parameter…
Analytic solutions for the energy eigenvalues are obtained from a confined potentials of the form $br$ in 3 dimensions. The confinement is effected by linear term which is a very important part in Cornell potential. The analytic eigenvalues…
This paper provides an overview of the necessary and sufficient conditions for guaranteeing the unique solvability of absolute value equations. In addition to discussing the basic form of these equations, we also address several…
We prove explicit lower bounds for the smallest singular value and upper bounds for the condition number of rectangular, multivariate Vandermonde matrices with scattered nodes on the complex unit circle. Analogously to the Shannon-Nyquist…
We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…
Eigenvalues of a density matrix characterize well the quantum state's properties, such as coherence and entanglement. We propose a simple method to determine all the eigenvalues of an unknown density matrix of a finite-dimensional system in…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…
This note deals with a simultaneous approximation of several matrices by a finite family of diagonalizable matrices satisfying an additional condition for the spectrum of a matrix product. That is the simplicity of all eigenvalues.
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…