Related papers: Gamma-matrices: a new class of simultaneously diag…
We establish the joint $*$-convergence of a random circulant matrix and a specific deterministic diagonal matrix. We also show that the empirical spectral distributions of skew-circulant and left skew-circulant random matrices converge…
In this work, we develop a novel multilevel Tau matrix-based preconditioned method for a class of non-symmetric multilevel Toeplitz systems. This method not only accounts for but also improves upon an ideal preconditioner pioneered by [J.…
In this paper we consider linear systems with dense-matrices which arise from numerical solution of boundary integral equations. Such matrices can be well-approximated with $\mathcal{H}^2$-matrices. We propose several new preconditioners…
We present a novel class of real symmetric matrices in arbitrary dimension $d$, linearly dependent on a parameter $x$. The matrix elements satisfy a set of nontrivial constraints that arise from asking for commutation of pairs of such…
There has been a growing interest in parallel strategies for solving trajectory optimization problems. One key step in many algorithmic approaches to trajectory optimization is the solution of moderately-large and sparse linear systems.…
A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…
Jacobi's method is a well-known algorithm in linear algebra to diagonalize symmetric matrices by successive elementary rotations. We report about the generalization of these elementary rotations towards canonical transformations acting in…
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…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
In this era of large-scale data, distributed systems built on top of clusters of commodity hardware provide cheap and reliable storage and scalable processing of massive data. Here, we review recent work on developing and implementing…
Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
The Gram matrix is defined for Bessel sequences by combining synthesis with subsequent analysis operators. If different sequences are used and an operator U is inserted we reach so called U-cross Gram matrices. This can be seen as…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…
It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…