A matrix iteration for finding Drazin inverse with ninth-order convergence
From MaRDI portal
Publication:1722157
Summary: The aim of this paper is twofold. First, a matrix iteration for finding approximate inverses of nonsingular square matrices is constructed. Second, how the new method could be applied for computing the Drazin inverse is discussed. It is theoretically proven that the contributed method possesses the convergence rate nine. Numerical studies are brought forward to support the analytical parts.
Recommendations
- Iterative methods for the Drazin inverse of a matrix with a complex spectrum.
- An improved computationally efficient method for finding the Drazin inverse
- On a fast iterative method for approximate inverse of matrices
- A high-order iterate method for computing \(A_{T, S}^{(2)}\)
- Finding the Moore-Penrose inverse by a new matrix iteration
Cites work
- A class of numerical algorithms for computing outer inverses
- A fast convergent iterative solver for approximate inverse of matrices
- A new method for solving ill-conditioned linear systems
- A note on the stability of a \(p\)th order iteration for finding generalized inverses
- A rapid numerical algorithm to compute matrix inversion
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- An efficient matrix iteration for computing weighted Moore-Penrose inverse
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients
- Approximate inverse computation using Frobenius inner product
- Efficient optimal eighth-order derivative-free methods for nonlinear equations
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
- Explicit formulas for determinantal representations of the Drazin inverse solutions of some matrix and differential matrix equations
- Generalized inverses. Theory and applications.
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Identifiability for a class of discretized linear partial differential algebraic equations
- Iterative methods for the Drazin inverse of a matrix with a complex spectrum.
- On a fast iterative method for approximate inverse of matrices
- Optimal iterative schemes for computing the Moore-Penrose matrix inverse
- Pseudo-Inverses in Associative Rings and Semigroups
- Some iterative methods free from derivatives and their basins of attraction for nonlinear equations
- The expression of the Drazin inverse with rank constraints
- The Mathematica GuideBook for Numerics
Cited in
(5)- Solving nondifferentiable nonlinear equations by new Steffensen-type iterative methods with memory
- An improved computationally efficient method for finding the Drazin inverse
- Invariant subspaces, derivative arrays, and the computation of the Drazin inverse
- A general class of arbitrary order iterative methods for computing generalized inverses
- Multipoint iterative methods for finding all the simple zeros in an interval
This page was built for publication: A matrix iteration for finding Drazin inverse with ninth-order convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722157)
