Related papers: Schur decomposition of several matrices
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
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…
The QZ algorithm computes the Schur form of a matrix pencil. It is an iterative algorithm and at some point, it must decide that an eigenvalue has converged and move on with another one. Choosing a criterion that makes this decision is…
In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…
We introduce and study model-theoretic connected components of rings as an analogue of model-theoretic connected components of definable groups. We develop their basic theory and use them to describe both the definable and classical Bohr…
We consider wreath product decompositions for semigroups of triangular matrices. We exhibit an explicit wreath product decomposition for the semigroup of all n-by-n upper triangular matrices over a given field k, in terms of aperiodic…
This paper presents the forward and backward derivatives of partial eigendecomposition, i.e. where it only obtains some of the eigenpairs, of a real symmetric matrix for degenerate cases. The numerical calculation of forward and backward…
In this paper we investigate Schur ultrafilters on groups. Using the algebraic structure of Stone-\v{C}ech compactifications of discrete groups and Schur ultrafilters, we give a new description of Bohr compactifications of topological…
The Schur-Horn theorem is a classical result in matrix analysis which characterizes the existence of positive semidefinite matrices with a given diagonal and spectrum. In recent years, this theorem has been used to characterize the…
We consider the solution of the Sylvester equation $AX+XB=C$ in mixed precision. We derive a new iterative refinement scheme to solve perturbed quasi-triangular Sylvester equations; our rounding error analysis provides sufficient conditions…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…
In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…
We define the corresponding Hardy space, Schur multipliers and their realizations, and interpolation. Possible applications of the present work include matrices of quaternions, matrices of split quaternions, and other algebras of…
Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…
The circulant real and complex matrices are used to find new real and complex conference matrices. With them we construct Sylvester inverse orthogonal matrices by doubling the size of inverse complex conference matrices. When the free…
The reductions of a square complex matrix A to its canonical forms under transformations of similarity, congruence, or *congruence are unstable operations: these canonical forms and reduction transformations depend discontinuously on the…
We extend the family of classical Schur algebras in type A, which determine the polynomial representation theory of general linear groups over an infinite field, to a larger family, the rational Schur algebras, which determine the rational…
Our goal here is to see the space of matrices of a given size from a geometric and topological perspective, with emphasis on the families of various ranks and how they fit together. We pay special attention to the nearest orthogonal…