Symbolic Cholesky factorization on a local-memory multiprocessor

DOI10.1016/0167-8191(87)90009-3zbMath0618.65023OpenAlexW2070259793MaRDI QIDQ1822452

Yanyan Li

Publication date: 1987

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(87)90009-3

zbMATH Keywords

Cholesky factorizationNumerical experimentssparse symmetric matricesIntel iPSC hypercubemessage-passing distributed- memory multiprocessorparallel symbolic factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

A survey of direct methods for sparse linear systems ⋮ Mixed and componentwise condition numbers for matrix decompositions ⋮ On constructing the elimination tree

This page was built for publication: Symbolic Cholesky factorization on a local-memory multiprocessor