Symbolic Cholesky factorization on a local-memory multiprocessor
One of the standard steps of the Cholesky factorization algorithm, namely the parallel symbolic factorization step for sparse symmetric matrices is presented. The algorithm is designed for a message-passing distributed- memory multiprocessor (no global memory is shared). Numerical experiments on Intel hypercube are given.
message-passing distributed- memory multiprocessor
scientific article; zbMATH DE number 4003358