A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (Q702669)

From MaRDI portal
Revision as of 01:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system
scientific article

    Statements

    A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 2005
    0 references
    tridiagonal matrix
    0 references
    BSP computer
    0 references
    divide and conquer
    0 references
    Sherman-Morrison formula
    0 references
    diagonal dominant matrix
    0 references
    numerical examples
    0 references
    algorithms
    0 references
    performance
    0 references

    Identifiers