An inversion algorithm for general tridiagonal matrix (Q1016194): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the inverse of a general tridiagonal matrix. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse of a tridiagonal matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review on the Inverse of Symmetric Tridiagonal and Block Tridiagonal Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decay Rates of the Inverse of Nonsymmetric Tridiagonal and Band Matrices / rank
 
Normal rank

Latest revision as of 13:33, 1 July 2024

scientific article
Language Label Description Also known as
English
An inversion algorithm for general tridiagonal matrix
scientific article

    Statements

    An inversion algorithm for general tridiagonal matrix (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    The authors propose an algorithm for the inverse of a general tridiagonal matrix. The algorithm first computes an \textit{LU} factorization of the matrix and then uses the special structure of the inverses of \textit{L} and \textit{U} for computing the elements of the inverse. The computational cost is \(n^2+5n-5\).
    0 references
    Tridiagonal matrix
    0 references
    inverse
    0 references
    Doolittle factorization
    0 references
    algorithm
    0 references
    \textit{LU} factorization
    0 references

    Identifiers