相关论文: Generation of Matrices with Specified Eigenvalues …
We introduce $\hat{H}$-eigenvalue for $2m$-th order $n$-dimensional complex tensors. Then we determine several checkable inclusion sets for $\hat{H}$-eigenvalues and derive some criterions for the Hermitian positive definiteness…
Conditions for existence and formulas for the first- and second order total derivatives of the eigenvalues, and the first order total derivatives of the eigenprojections of smooth matrix-valued functions $H\colon\Omega\to S(m)$ are given.…
We discuss the solution of eigenvalue problems associated with partial differential equations that can be written in the generalized form $\m{A}x=\lambda\m{B}x$, where the matrices $\m{A}$ and/or $\m{B}$ may depend on a scalar parameter.…
A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…
We provide a necessary and sufficient condition for matrices in the max-plus algebra to be pseudo-diagonalizable, calculate the powers of pseudo-diagonal matrices and prove the invariance of optimal-node matrices and separable matrices…
The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean…
Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications and it is a prerequisite of eigensolvers based on a divide-and-conquer paradigm. Often an…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
The partly symmetric real Ginibre ensemble consists of matrices formed as linear combinations of real symmetric and real anti-symmetric Gaussian random matrices. Such matrices typically have both real and complex eigenvalues. For a fixed…
In this paper, we consider linear differential equations satisfied by the generating function for Hermite polynomials and derive some new identities involving those polynomials.
A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…
The first step when solving an infinite-dimensional eigenvalue problem is often to discretize it. We show that one must be extremely careful when discretizing nonlinear eigenvalue problems. Using examples, we show that discretization can:…
We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…
Models of disorder with a direction (constant imaginary vector-potential) are considered. These non-Hermitian models can appear as a result of computation for models of statistical physics using transfer matrix technique or describe…
Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…
This is a brief survey of classical and recent results about the typical behavior of eigenvalues of large random matrices, written for mathematicians and others who study and use matrices but may not be accustomed to thinking about…
We show that similarity (or equivalent) transformations enable one to construct non-Hermitian operators with real spectrum. In this way we can also prove and generalize the results obtained by other authors by means of a gauge-like…