Results 31 to 40 of about 2,351,945 (200)
Minimizing the condition number of a positive definite matrix by completion [PDF]
Elsner L, He C, Mehrmann V. Minimizing the condition number of a positive definite matrix by completion. Numerische Mathematik. 1994;69(1):17-23.We consider the problem of minimizing the spectral condition number of a positive definite matrix by ...
Mehrmann, Volker +2 more
core +1 more source
This paper develops a multidimensional differential-transform-based framework for computing matrix characteristics of complex-valued multiparameter matrix functions.
Sargis Simonyan +2 more
doaj +1 more source
Cayley-Hamilton theorem for Drazin inverse matrix and standard inverse matrices [PDF]
The classical Cayley-Hamilton theorem is extended to Drazin inverse matrices and to standard inverse matrices. It is shown that knowing the characteristic polynomial of the singular matrix or nonsingular matrix, it is possible to write the analog Cayley ...
Kaczorek, T.
core +1 more source
We present both a combinatorial characterization and a recurrent formula for the entries of the inverse Kostka matrix. An application to the topology of the classifying space BU(n) is obtained.
openaire +3 more sources
Representations for the Drazin inverses of block matrices
In this paper, we investigate representations of the Drazin inverse of a 2 × 2 block matrix. The Drazin inverse of a matrix is very important in various applied mathematical fields like machinery and automation, singular differential equations. We give a
Guo Li, Wang Jie, Du Wenming
doaj +1 more source
George Andrews has demonstrated that the Bailey transform is equivalent to the inversion of an infinite-dimensional matrix whose entires are rational functions in q q
openaire +1 more source
𝕮-inverse of graphs and mixed graphs
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar +2 more
doaj +1 more source
γ-Inverse graph of some mixed graphs
Let GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa +2 more
doaj +1 more source
ON CONDITIONS FOR MATRICES T SUCH THAT T-I AND I-T^(-1) ARE INVERSE H-MATRICES*
In this article, we study an analogue of a classical result for M-matrices: if T - I is an invertible M-matrix, then both T and I - T-1 are also invertible M-matrices. We extend this implication to a broader class—inverse H-matrices.
Jeriko Gormantara +3 more
doaj +1 more source
This paper gives a characterization of EPr-λ-matrices. Necessary and sufficient conditions are determined for (i) the Moore-Penrose inverse of an EPr-λ-matrix to be an EPr-λ-matrix and (ii) Moore-Penrose inverse of the product of EPr-λ-matrices to be an ...
Ar. Meenakshi, N. Anandam
doaj +1 more source

