Parallel algorithms for solving tridiagonal and near-circulant systems. (Q1855742)

From MaRDI portal
Revision as of 10:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel algorithms for solving tridiagonal and near-circulant systems.
scientific article

    Statements

    Parallel algorithms for solving tridiagonal and near-circulant systems. (English)
    0 references
    0 references
    0 references
    28 January 2003
    0 references
    This paper presents a new stable method for the exact solution of non-symmetric tridiagonal circulant linear systems of equations. The method is competitive with Gaussian elimination both in terms of arithmetic operations and storage requirements, and with the modified double sweep method. This method can be applied to solve the near-circulant tridiagonal system. In addition, the method is modified to allow parallel processing.
    0 references
    0 references
    circulant matrix
    0 references
    Toeplitz matrix
    0 references
    perturbed system
    0 references
    parallel processing
    0 references
    Gaussian elimination
    0 references
    double sweep method
    0 references
    near-circulant tridiagonal system
    0 references
    stability
    0 references
    comparison of methods
    0 references
    0 references