On parallel computations with banded matrices (Q1898464)

From MaRDI portal
Revision as of 23:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On parallel computations with banded matrices
scientific article

    Statements

    On parallel computations with banded matrices (English)
    0 references
    0 references
    0 references
    0 references
    22 February 1996
    0 references
    Theoretical paper on the algorithmic complexity of the direct solution of banded linear systems on parallel computers. The time complexity is improved compared to previous results. It should be mentioned that for engineering problems with large and sparse matrices iterative solvers are much more efficient.
    0 references
    algorithmic complexity
    0 references
    banded linear systems
    0 references
    parallel computers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references