Related papers: Diagonalizing hermitian matrices of continuous fun…
Diagonalizability plays an important role in the analysis and design of multivariable systems. A structured matrix is called structurally diagonalizable if almost all of its numerical realizations, obtained by assigning real values to its…
Diffeomorphisms can be seen as automorphisms of the algebra of functions. In the matrix regularization, functions on a smooth compact manifold are mapped to finite size matrices. We consider how diffeomorphisms act on the configuration…
Knutson and Miller (2005) established a connection between the anti-diagonal Gr\"obner degenerations of matrix Schubert varieties and the pre-existing combinatorics of pipe dreams. They used this correspondence to give a…
A method for solving linear initial boundary value problems was recently reimplemented as a true spectral transform method. As part of this reformulation, the precise sense in which the spectral transforms diagonalize the underlying spatial…
A positive definite completion problem pertains to determining whether the unspecified positions of a partial (or incomplete) matrix can be completed in a desired subclass of positive definite matrices. In this paper we study an important…
We consider random non-hermitean matrices in the large $N$ limit. The power of analytic function theory cannot be brought to bear directly to analyze non-hermitean random matrices, in contrast to hermitean random matrices. To overcome this…
We consider orthogonal transformations of arbitrary square matrices to a form where all diagonal entries are equal. In our main results we treat the simultaneous transformation of two matrices and the symplectic orthogonal transformation of…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…
We propose a totally functional view of geometric matrix completion problem. Differently from existing work, we propose a novel regularization inspired from the functional map literature that is more interpretable and theoretically sound.…
The $1/x^{2}$ deformed $c=1$ matrix model is studied at finite radius and non-zero cosmological constant. Calculational techniques are presented and illustrated in some examples. Furthermore, a new kind of $R \rightarrow 1/R$ duality is…
Transfer matrices and matrix product operators play an ubiquitous role in the field of many body physics. This paper gives an ideosyncratic overview of applications, exact results and computational aspects of diagonalizing transfer matrices…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
We study the renormalization of normal mixing matrices, which includes hermitian and unitary matrices as particular cases. We give a minimal, multiplicative parametrization of counterterms, and compute the renormalized Lagrangian to…
This paper develops matrix-multiplication-based iterative refinement for diagonalizable non-Hermitian eigendecompositions. The main theory concerns simple eigenvalues and distinguishes two input regimes. In the right-only regime, where only…
We show that the averaged characteristic polynomial and the averaged inverse characteristic polynomial, associated with Hermitian matrices whose elements perform a random walk in the space of complex numbers, satisfy certain partial…
Given a matrix the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of…