Related papers: Tridiagonal test matrices for eigenvalue computati…
We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…
The Jacobi-Davidson method is one of the most popular approaches for iteratively computing a few eigenvalues and their associated eigenvectors of a large matrix. The key of this method is to expand the search subspace via solving the…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…
Matrix transformations in terms of triangular matrices is the easiest method of evaluating matrix-variate gamma and beta integrals in the real and complex cases. Here we give several procedures of explicit evaluation of gamma and beta…
The eigenvalue spectrum of the transition matrix of a network encodes important information about its structural and dynamical properties. We study the transition matrix of a family of fractal scale-free networks and analytically determine…
It is shown that Pythagorean triples can be used to generate matrices that have integer eigenvalues for all permutations of their coefficients, via simple formulas. For example, each and every permutation of the $2\times2$ matrix…
We introduce kernel nonparametric tests for Lancaster three-variable interaction and for total independence, using embeddings of signed measures into a reproducing kernel Hilbert space. The resulting test statistics are straightforward to…
The Nystr\"{o}m method is routinely used for out-of-sample extension of kernel matrices. We describe how this method can be applied to find the singular value decomposition (SVD) of general matrices and the eigenvalue decomposition (EVD) of…
It is well known that if a matrix $A\in\mathbb C^{n\times n}$ solves the matrix equation $f(A,A^H)=0$, where $f(x, y)$ is a linear bivariate polynomial, then $A$ is normal; $A$ and $A^H$ can be simultaneously reduced in a finite number of…
We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
In this article we introduce $K$-type block matrices which include two new classes of block matrices namely block triangular $K$-matrices and hidden block triangular $K$-matrices. We show that the solution of linear complementarity problem…
We propose a tridiagonalization approach for non-Hermitian random matrices and Hamiltonians using singular value decomposition (SVD). This technique leverages the real and non-negative nature of singular values, bypassing the complex…
A Helson matrix (also known as a multiplicative Hankel matrix) is an infinite matrix with entries $\{a(jk)\}$ for $j,k\geq1$. Here the $(j,k)$'th term depends on the product $jk$. We study a self-adjoint Helson matrix for a particular…
Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field…
We present a novel method for matrix completion, specifically designed for matrices where one dimension is significantly larger than the other. Our Columns Selected Matrix Completion (CSMC) method combines Column Subset Selection with…
In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…
Dual complex numbers can represent rigid body motion in 2D spaces. Dual complex matrices are linked with screw theory, and have potential applications in various areas. In this paper, we study low rank approximation of dual complex…
Classical continuum mechanical theories operate on three-dimensional Eu-clidian space using scalar, vector, and tensor-valued quantities usually up to the order of four. For their numerical treatment, it is common practice to transform the…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…