Page 1 Next

Displaying 1 – 20 of 21

Showing per page

Self-correcting iterative methods for computing 2 -inverses

Stanimirović, Predrag S. (2003)

Archivum Mathematicum

In this paper we construct a few iterative processes for computing { 2 } -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.

Singular M-matrices which may not have a nonnegative generalized inverse

Agrawal N. Sushama, K. Premakumari, K.C. Sivakumar (2014)

Special Matrices

A matrix A ∈ ℝn×n is a GM-matrix if A = sI − B, where 0 < ρ(B) ≤ s and B ∈WPFn i.e., both B and Bt have ρ(B) as their eigenvalues and their corresponding eigenvector is entry wise nonnegative. In this article, we consider a generalization of a subclass of GM-matrices having a nonnegative core nilpotent decomposition and prove a characterization result for such matrices. Also, we study various notions of splitting of matrices from this new class and obtain sufficient conditions for their convergence....

Solutions of minus partial ordering equations over von Neumann regular rings

Yu Guan, Zhaojia Tong (2015)

Open Mathematics

In this paper, we mainly derive the general solutions of two systems of minus partial ordering equations over von Neumann regular rings. Meanwhile, some special cases are correspondingly presented. As applications, we give some necessary and sufficient conditions for the existence of solutions. It can be seen that some known results can be regarded as the special cases of this paper.

Solvability classes for core problems in matrix total least squares minimization

Iveta Hnětynková, Martin Plešinger, Jana Žáková (2019)

Applications of Mathematics

Linear matrix approximation problems A X B are often solved by the total least squares minimization (TLS). Unfortunately, the TLS solution may not exist in general. The so-called core problem theory brought an insight into this effect. Moreover, it simplified the solvability analysis if B is of column rank one by extracting a core problem having always a unique TLS solution. However, if the rank of B is larger, the core problem may stay unsolvable in the TLS sense, as shown for the first time by Hnětynková,...

Some equalities for generalized inverses of matrix sums and block circulant matrices

Yong Ge Tian (2001)

Archivum Mathematicum

Let A 1 , A 2 , , A n be complex matrices of the same size. We show in this note that the Moore-Penrose inverse, the Drazin inverse and the weighted Moore-Penrose inverse of the sum t = 1 n A t can all be determined by the block circulant matrix generated by A 1 , A 2 , , A n . In addition, some equalities are also presented for the Moore-Penrose inverse and the Drazin inverse of a quaternionic matrix.

Strict spectral approximation of a matrix and some related problems

Krystyna Ziętak (1997)

Applicationes Mathematicae

We show how the strict spectral approximation can be used to obtain characterizations and properties of solutions of some problems in the linear space of matrices. Namely, we deal with (i) approximation problems with singular values preserving functions, (ii) the Moore-Penrose generalized inverse. Some properties of approximation by positive semi-definite matrices are commented.

Currently displaying 1 – 20 of 21

Page 1 Next