Related papers: Matrices coupled in a chain. II. Spacing functions
The Jacobian elliptic functions are generalized and applied to a nonlinear eigenvalue problem with $p$-Laplacian. The eigenvalue and the corresponding eigenfunction are represented in terms of common parameters, and a complete description…
We present a friendly introduction to the very detailed results in [9,10,11] and as an illustration we discuss here the issue of {\em linearization of products}. We find some interesting new phenomena.
We calculate the eigenvalues of some two-dimensional non-Hermitian Hamiltonians by means of a pseudospectral method and straightforward diagonalization of the Hamiltonian matrix in a suitable basis set. Both sets of results agree remarkably…
In the first part of these notes, we review some of the recent developments in the study of the spectral properties of Wigner matrices. In the second part, we present a new proof of a Wegner estimate for the eigenvalues of a large class of…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
We present a family of matrix models such that their partition functions are tau functions of the universal character (UC) hierarchy. This develops one of the topics of our previous paper arXiv:2410.14823. We found new matrix models…
We propose a supplement matrix method for computing eigenvalues of a dual Hermitian matrix, and discuss its application in multi-agent formation control. Suppose we have a ring, which can be the real field, the complex field, or the…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their…
An arbitrary Mueller matrix can be decomposed into a sum of up to four deterministic Mueller-Jones matrices, with strengths given by the eigenvalues of an associated Hermitian matrix. A geometrical representation of the eigenvalues in terms…
This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…
We continue the analysis in [3] of matrix convex functions of a fixed order defined in a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus [5]. We amend and improve some…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
We consider the stability of synchronized chaos in coupled map lattices and in coupled ordinary differential equations. Applying the theory of Hermitian and positive semidefinite matrices we prove two results that give simple bounds on…
The numerical computation of the exponentiation of a real matrix has been intensively studied. The main objective of a good numerical method is to deal with round-off errors and computational cost. The situation is more complicated when…
The singular chain complex of the iterated loop space is expressed in terms of the cobar construction. After that we consider the spectral sequence of the cobar construction and calculate its first term over Z/p-coefficients and over a…
What is the connection of random matrices with integrable systems? Is this connection really useful? Introducing apprpriate times in the distribution of the ensemble of matrices, one shows that the corresponding distribution of the…
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.…
Subspace iterations are used to minimise a generalised Ritz functional of a large, sparse Hermitean matrix. In this way, the lowest $m$ eigenvalues are determined. Tests with $1 \leq m \leq 32$ demonstrate that the computational cost (no.…