Related papers: Schur decomposition of several matrices
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
We consider the uniqueness of solution (i.e., nonsingularity) of systems of $r$ generalized Sylvester and $\star$-Sylvester equations with $n\times n$ coefficients. After several reductions, we show that it is sufficient to analyze periodic…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
The Schur limit of the superconformal index of a four-dimensional N = 2 superconformal field theory encodes rich physical information about the protected spectrum of the theory. For a Lagrangian model, this limit of the index can be…
In recent years, the expander decomposition method was used to develop many graph algorithms, resulting in major improvements to longstanding complexity barriers. This powerful hammer has led the community to (1) believe that most problems…
It is known that singular values of idempotent matrices are either zero or larger or equal to one \cite{HouC63}. We state exactly how many singular values greater than one, equal to one, and equal to zero there are. Moreover, we derive a…
We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…
Some eigenvalue matrix models possess an interesting property: one can manifestly define the basis where all averages can be explicitly calculated. For example, in the Gaussian Hermitian and rectangular complex models, averages of the Schur…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II…
Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
We define the Schur multipliers of a separable von Neumann algebra M with Cartan masa A, generalising the classical Schur multipliers of $B(\ell^2)$. We characterise these as the normal A-bimodule maps on M. If M contains a direct summand…
The CUR decomposition is a factorization of a low-rank matrix obtained by selecting certain column and row submatrices of it. We perform a thorough investigation of what happens to such decompositions in the presence of noise. Since CUR…
We present new examples of superintegrable matrix/eigenvalue models. These examples arise as a result of the exploration of the relationship between the theory of superintegrability and multivariate orthogonal polynomials. The new…
Let $\mathbb{H}$ be the real quaternion algebra and $\mathbb{H}^{n\times m}$ denote the set of all $n\times m$ matrices over $\mathbb{H}$. In this paper, we construct a simultaneous decomposition of seven general real quaternion matrices…
Recently the authors investigated the Lipschitz triviality of simple germs of matrices. In this work, we improve some previous results and we present an extension of an integral closure result for the real setting. These tools are applied…
We propose a theory for matrix completion that goes beyond the low-rank structure commonly considered in the literature and applies to general matrices of low description complexity. Specifically, complexity of the sets of matrices…
In this document, some elements of the theory and algorithmics corresponding to the existence and computability of approximate joint eigenpairs for finite collections of matrices with applications to model order reduction, are presented.…
Pseudo-unitary circuits are recurring in both S-matrix theory and analysis of No-Go theorems. We propose a matrix and diagrammatic representation for the operation that maps S-matrices to T-matrices and, consequently, a unitary group to a…