Related papers: Schur decomposition of several matrices
This work introduces a methodology to solve ordinary differential equations using the Schur decomposition of the linear representation of the differential equation. This is done by first transforming the system into an upper triangular…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
We consider solvable matrix models. We generalize Harish-Chandra-Itzykson-Zuber and certain other integrals (Gross-Witten integral and integrals over complex matrices) using the notion of tau function of matrix argument. In this case one…
We extend to infinite dimensional separable Hilbert spaces the Schur convexity property of eigenvalues of a symmetric matrix with real entries. Our framework includes both the case of linear, selfadjoint, compact operators, and that of…
The main goal of this paper is to reconsider a phenomenon which was treated in earlier work of the authors' on several truncated matricial moment problems. Using a special kind of Schur complement we obtain a more transparent insight into…
In this paper we propose an approach to approximate a truncated singular value decomposition of a large structured matrix. By first decomposing the matrix into a sum of Kronecker products, our approach can be used to approximate a large…
We study the eigenvectors of Laplacian matrices of trees. The Laplacian matrix is reduced to a tridiagonal matrix using the Schur complement. This preserves the eigenvectors and allows us to provide fomulas for the ratio of eigenvector…
Schur modules give the irreducible polynomial representations of the general linear group $\mathrm{GL}_t$. Viewing the symmetric group $\mathfrak{S}_t$ as a subgroup of $\mathrm{GL}_t$, we may restrict Schur modules to $\mathfrak{S}_t$ and…
Singular value decompositions of matrices are widely used in numerical linear algebra with many applications. In this paper, we extend the notion of singular value decompositions to finite complexes of real vector spaces. We provide two…
If a nonnegative selfadjoint linear relation $A$ in a Hilbert space and a closed subspace $\mathcal{S}$ are assumed to satisfy that the domain of $A$ is invariant under the orthogonal projector onto $\mathcal{S},$ then $A$ admits a…
We find an exact solution to strongly-coupled matrix models with a single-trace monomial potential. Our solution yields closed form expressions for the partition function as well as averages of Schur functions. The results are fully…
The recently discovered general formulas for perturbative correlators in basic matrix models can be interpreted as the Schur-preservation property of Gaussian measures. Then substitution of Schur by, say, Macdonald polynomials, defines a…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We give necessary and sufficient conditions for a Schur map to be a homomorphism, with some generalizations to the infinite-dimensional case. In the finite-dimensional case, we find that a Schur multiplier distributes over matrix…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
We derive fusion rules for the composition of $q$-deformed classical representations (arising in tensor products of the fundamental representation) with semi-periodic representations of $SL(N)_q$ at roots of unity. We obtain full…