Successive matrix squaring algorithm for computing the Drazin inverse
From MaRDI portal
Publication:1569158
DOI10.1016/S0096-3003(98)10118-2zbMath1022.65043MaRDI QIDQ1569158
Publication date: 25 June 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
complexityparallel computationerror boundDrazin inverseJordan canonical formsuccessive matrix squaring algorithmmatrix multiplication
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (22)
Generalized Schultz iterative methods for the computation of outer inverses ⋮ A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix ⋮ The computation of Drazin inverse and its application in Markov chains ⋮ Iterative method for computing the Moore-Penrose inverse based on Penrose equations ⋮ A family of iterative methods for computing Moore-Penrose inverse of a matrix ⋮ Modified SMS method for computing outer inverses of Toeplitz matrices ⋮ Generalized inverses and a block-rank equation. ⋮ Successive matrix squaring algorithm for computing the generalized inverse \(A^{(2)}_{T, S}\) ⋮ Hyper-power methods for the computation of outer inverses ⋮ Computing generalized inverses using LU factorization of matrix product ⋮ The representation and approximation for Drazin inverse ⋮ Structured perturbations of Drazin inverse ⋮ Full-rank representations of \(\{2, 4\}, \{2, 3\}\)-inverses and successive matrix squaring algorithm ⋮ Invariant subspaces, derivative arrays, and the computation of the Drazin inverse ⋮ An interval extension of SMS method for computing weighted Moore-Penrose inverse ⋮ Rapid generalized Schultz iterative methods for the computation of outer inverses ⋮ Symbolic computation of Drazin inverses by specializations ⋮ Successive matrix squaring algorithm for computing outer inverses ⋮ An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) ⋮ An oblique projection iterative method to compute Drazin inverse and group inverse ⋮ The Drazin inverse of updating of a square matrix with application to perturbation formula ⋮ A characterization for the \(W\)-weighted Drazin inverse and a Cramer rule for the \(W\)-weighted Drazin inverse solution
Cites Work
- Successive overrelaxation methods for solving the rank deficient linear least squares problem
- Preconditionings and splittings for rectangular systems
- Parallel solution of linear systems by repeated squaring
- Complexity of parallel matrix computations
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- A Cramer rule for finding the solution of a class of singular equations
- Index splitting for the Drazin inverse and the singular linear system
- On the perturbation of the group inverse and oblique projection
- Finite precision behavior of stationary iteration for solving singular systems
- Generalised matrix inversion and rank computation by successive matrix powering
- The Drazin inverse in multibody system dynamics
- The perturbation theory for the Drazin inverse and its applications
- Fast and efficient parallel solution of dense linear systems
- The hyperpower iteration revisited
- The Souriau-Frame algorithm and the Drazin pseudoinverse
- APPLICATIONS OF THE DRAZIN INVERSE TO THE HILL CRYPTOGRAPHIC SYSTEM. PART III.
- More on the Souriau–Frame Algorithm and the Drazin Inverse
- Fast Parallel Matrix Inversion Algorithms
- Convergent Powers of a Matrix with Applications to Iterative Methods for Singular Linear Systems
- A Characterization and Representation of the Drazin Inverse
- On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling
- An Application of the Cayley-Hamilton Theorem to Generalized Matrix Inversion
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Successive matrix squaring algorithm for computing the Drazin inverse