Related papers: Coalescing Eigenvalues and Crossing Eigencurves of…
This paper describes and develops a fast and accurate path following algorithm that computes the field of values boundary curve for every conceivable complex or real square matrix $A$. It relies on a matrix flow decomposition method that…
For general complex or real 1-parameter matrix flows $A(t)_{n,n}$ and for time-invariant static matrices $A \in \CC_{n,n}$ alike, this paper considers ways to decompose matrix flows and single matrices globally via one constant matrix…
We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…
We continue the study of the Hermitian random matrix ensemble with external source $\frac{1}{Z_n} e^{-n \Tr({1/2}M^2 -AM)} dM$ where $A$ has two distinct eigenvalues $\pm a$ of equal multiplicity. This model exhibits a phase transition for…
This paper establishes a theory of nonlinear spectral decompositions by considering the eigenvalue problem related to an absolutely one-homogeneous functional in an infinite-dimensional Hilbert space. This approach is both motivated by…
The flow equation approach investigated by Wegner et al. is applied to an unbounded Hamiltonian system with a generalization. We show that a well-known quantized complex energy eigenvalues which is related to decay widths can be given with…
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…
We prove that the point process of the eigenvalues of real or complex non-Hermitian matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of eigenvalues in a subdomain $\Omega$ of the…
It is a well-known result of T.\,Kato that given a continuous path of square matrices of a fixed dimension, the eigenvalues of the path can be chosen continuously. In this paper, we give an infinite-dimensional analogue of this result,…
We explore the concept of eigenvalue avoidance, which is well understood for real symmetric and Hermitian matrices, for other classes of structured matrices. We adopt a differential geometric perspective and study the generic behaviour of…
Convergence properties of binary stationary subdivision schemes for curves have been analyzed using the techniques of z-transforms and eigenanalysis. Eigenanalysis provides a way to determine derivative continuity at specific points based…
The statistical properties of trajectories of eigenvalues of Gaussian complex matrices whose Hermitian condition is progressively broken are investigated. It is shown how the ordering on the real axis of the real eigenvalues is reflected in…
The irreversibility of the renormalization group flow is conjectured to be closely related to the concept of entropy. In this paper, the variation of eigenvalues of the Laplacian in the Polyakov action under the renormalization group flow…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
We review the recent developments in the theory of normal, normal self-dual and general complex random matrices. The distribution and correlations of the eigenvalues at large scales are investigated in the large $N$ limit. The 1/N expansion…
It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence…
One useful standard method to compute eigenvalues of matrix polynomials ${\bf P}(z) \in \mathbb{C}^{n\times n}[z]$ of degree at most $\ell$ in $z$ (denoted of grade $\ell$, for short) is to first transform ${\bf P}(z)$ to an equivalent…
Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…
Let $A(t)$ be a continuous path of Fredhom operators, we first prove that the spectral flow $sf(A(t))$ is cogredient invariant. Based on this property, we give a decomposition formula of spectral flow if the path is invariant under a…