several representations of the generalized drazin inverse of an anti-triangular block matrix in banach algebra are given in terms of the generalized banachiewicz--schur form.

some necessary and sufficient conditions are given for the existence of a g-positive (g-repositive) solution to adjointable operator equations $ax=c,axa^{left( astright) }=c$ and $axb=c$ over hilbert $c^{ast}$-modules, respectively. moreover, the expressions of these general g-positive (g-repositive) solutions are also derived. some of the findings of this paper extend some known results in the...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

Several representations of the generalized Drazin inverse of an anti-triangular block matrix in Banach algebra are given in terms of the generalized Banachiewicz--Schur form.  

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...