Related papers: A geometric decomposition of real diagonalizable m…
This article introduces the Hartwig-Spindelb\"{o}ck decomposition of dual complex matrices. We provide representations of some generalized inverses using this decomposition. Further, several characterizations are established for a complex…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…
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…
We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…
The paper presents a general theory of coupling of eigenvalues of complex matrices of arbitrary dimension depending on real parameters. The cases of weak and strong coupling are distinguished and their geometric interpretation in two and…
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…
This is the paper as published. The topology of a complex plane curve singularity with real branches is deduced from any real deformation having delta crossings. An example of the computation of the global geometric monodromy of a…
We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…
Hessenberg decomposition is the basic tool used in computational linear algebra to approximate the eigenvalues of a matrix. In this article, we generalize Hessenberg decomposition to continuous matrix fields over topological spaces. This…
We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposition of an arbitrary matrix into a product of a symplectic…
We prove that with high probability, every eigenvector of a random matrix is delocalized in the sense that any subset of its coordinates carries a non-negligible portion of its $\ell_2$ norm. Our results pertain to a wide class of random…
The paper presents a new theory of unfolding of eigenvalue surfaces of real symmetric and Hermitian matrices due to an arbitrary complex perturbation near a diabolic point. General asymptotic formulae describing deformations of a conical…
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen…
We present explicit descriptions of the decompositions of vertices of a hypercube graph with respect to its distinguished symmetric cycle.
A procedure to obtain differentiation matrices is extended straightforwardly to yield new differentiation matrices useful to obtain derivatives of complex rational functions. Such matrices can be used to obtain numerical solutions of some…
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…