LU factorization on parallel computers (Q1067753)

From MaRDI portal
scientific article
Language Label Description Also known as
English
LU factorization on parallel computers
scientific article

    Statements

    LU factorization on parallel computers (English)
    0 references
    0 references
    0 references
    1985
    0 references
    A new parallel algorithm for the LU factorization of a given dense matrix A is described. The case of banded matrices is also considered. This algorithm can be combined with the algorithm of \textit{A. H. Sameh} and \textit{R. P. Brent} [SIAM J. Numer. Anal. 14, 1101-1113, (1977; Zbl 0375.65016)] to obtain the solution of a linear system of algebraic equations. The arithmetic complexity for the dense case is \((1/3)n^ 2\) ((1/2)bn in the banded case), using 3(n-1) processors and no square roots.
    0 references
    parallel algorithm
    0 references
    LU factorization
    0 references
    dense matrix
    0 references
    banded matrices
    0 references
    linear system of algebraic equations
    0 references
    arithmetic complexity
    0 references

    Identifiers