An improved computationally efficient method for finding the Drazin inverse (Q1727190): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A class of Kung-Traub-type iterative algorithms for matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of hyperpower family of iterative methods via least squares approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient computation of generalized inverse of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rapid numerical algorithm to compute matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index splitting for the Drazin inverse and the singular linear system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Inverses in Associative Rings and Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit formulas for determinantal representations of the Drazin inverse solutions of some matrix and differential matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hyperpower family of iterations for computing outer inverses possessing high efficiencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Iterative Method for Computing Generalized Inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expression of the Drazin inverse with rank constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for the Drazin inverse of a matrix with a complex spectrum. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev-type methods and preconditioning techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal iterative schemes for computing the Moore-Penrose matrix inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematica GuideBook for Numerics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the Drazin Inverse to Linear Systems of Differential Equations with Singular Constant Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity and general perturbation of the Drazin inverse for closed linear operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifiability for a class of discretized linear partial differential algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Radial Basis Function Method for High-Dimensional American Option Pricing Problems / rank
 
Normal rank

Revision as of 07:46, 18 July 2024

scientific article
Language Label Description Also known as
English
An improved computationally efficient method for finding the Drazin inverse
scientific article

    Statements

    An improved computationally efficient method for finding the Drazin inverse (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    Summary: Drazin inverse is one of the most significant inverses in the matrix theory, where its computation is an intensive and useful task. The objective of this work is to propose a computationally effective iterative scheme for finding the Drazin inverse. The convergence is investigated analytically by applying a suitable initial matrix. The theoretical discussions are upheld by several experiments showing the stability and convergence of the proposed method.
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers