相关论文: Inverse tridiagonal Z-matrices
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
We give a formula for the inverse matrix to an infinite matrix with possibly noncommutative entries, generalizing the Newton interpolation formula and the Taylor formula.
This study investigates tridiagonal near-Toeplitz matrices in which the Toeplitz part is strictly diagonally dominant. The focus is on determining the exact inverse of these matrices and establishing upper bounds for the infinite norms of…
We present the generalized Drazin inverse for certain anti-triangular operator matrices. Let $E,F,EF^{\pi}\in \mathcal{B}(X)^d$. If $EFEF^{\pi}=0$ and $F^2EF^{\pi}=0$, we prove that $M=\left( \begin{array}{cc} E&I F&0 \end{array} \right)$…
The motivation of this paper is to investigate the dual Drazin inverse of adjacency matrices arising from several classes of connected dual-number-weighted digraphs over the dual complex algebra. Explicit formulas for the dual Drazin…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work…
We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…
The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…
The notion of type of quadruples of rows is proven to be useful in the classification of Hadamard matrices. In this paper, we investigate Hadamard matrices with few distinct types. Among other results, the Sylvester Hadamard matrices are…
The M-matrix is an important concept in matrix theory, and has many applications. Recently, this concept has been extended to higher order tensors [18]. In this paper, we establish some important properties of M-tensors and nonsingular…
We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin…
Recently, Malik and Ferreyra introduced the $m$-weak core inverse for complex square matrices which generalizes the core-EP inverse, the WC inverse, and therefore the core inverse. The main aim of this paper is to extend the concept of…
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…
We show that all off-diagonal entries in the Moore-Penrose inverse of the distance Laplacian matrix of a tree are non-positive.
Since the day the core inverse has been known in a paper of Bakasarly and Trenkler, it has been widely researched. So far, there are four generalizations of this inverse for the case of matrices of an arbitrary index, namely, the BT…