Computing entries of the inverse of a sparse matrix using the FIND algorithm (Q955257): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Iteration, Ill-Conditioned Equations and Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Dissection of a Regular Finite Element Mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing certain elements of the inverse of a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DIRECT SOLUTION TO THE BLOCK TRIDIAGONAL MATRIX INVERSION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduktionsverfahren für Differenzengleichungen bei Randwertaufgaben. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Direct Methods for Solving Poisson’s Equations / rank
 
Normal rank

Latest revision as of 20:39, 28 June 2024

scientific article
Language Label Description Also known as
English
Computing entries of the inverse of a sparse matrix using the FIND algorithm
scientific article

    Statements

    Computing entries of the inverse of a sparse matrix using the FIND algorithm (English)
    0 references
    0 references
    19 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    nested dissection
    0 references
    Green's function
    0 references
    NEGF
    0 references
    nanotransistor
    0 references
    Gaussian elimination
    0 references
    sparse matrix
    0 references
    semiconductor field-effect transistor
    0 references
    0 references
    0 references