Related papers: The Double-Constant Matrix, Centering Matrix and E…
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…
The results on the inversion of convolution operators and Toeplitz matrices in the 1-D (one dimensional) case are classical and have numerous applications. We consider a 2-D case of Toeplitz-block Toeplitz matrices, describe a minimal…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
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…
As is known, every finite-dimensional algebra over a field is isomorphic to the centralizer algebra of \textbf{two} matrices. So it is fundamental to study first the centralizer algebra of a single matrix, called a centralizer matrix…
We consider the (symmetric) Pascal matrix, in its finite and infinite versions, and prove the existence of symmetric tridiagonal matrices commuting with it by giving explicit expressions for these commuting matrices. This is achieved by…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
This note presents several conditions to characterize real matrix similarity between a Hurwitz matrix (and then more generally, a real square matrix) and a diagonal dominant matrix.
We present the explicit inverse of a class of symmetric tridiagonal matrices which is almost Toeplitz, except that the first and last diagonal elements are different from the rest. This class of tridiagonal matrices are of special interest…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
In this note, we present a generalization of some results concerning the spectral properties of a certain class of block matrices. As applications, we study some of its implications on nonnegative matrices, doubly stochastic matrices and…
We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…
This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.
In the paper, we consider bivariate isotropic dilation matrices that are similar (up to constant factors) to rotation matrices; and we show that, in this case, the two-scale relation can be considered also as the relation between not only…
In this paper we describe some properties of companion matrices and demonstrate some special patterns that arise when a Toeplitz or a Hankel matrix is multiplied by a related companion matrix. We present a new condition, generalizing known…
A Toeplitz matrix is one in which the matrix elements are constant along diagonals. The Fisher-Hartwig matrices are much-studied singular matrices in the Toeplitz family. The matrices are defined for all orders, $N$. They are parametrized…
Two new matrix classes are introduced; inverse cyclic matrices and bi-diagonal south-west matrices. An interesting relation is established between these classes. Applications to two classes of inverse $Z$-matrices are provided.
When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…
Finding the inverse of a matrix is an open problem especially when it comes to engineering problems due to their complexity and running time (cost) of matrix inversion algorithms. An optimum strategy to invert a matrix is, first, to reduce…
The dynamical properties, especially the symmetric orbits, of the 2-parameter family of circle maps called off-center reflection is studied.