A note on communication analysis of parallel sparse Cholesky factorization on a hypercube

From MaRDI portal

Revision as of 10:26, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:751753

Jump to:navigation, search

DOI10.1016/0167-8191(90)90158-6zbMath0715.65017OpenAlexW2052302395MaRDI QIDQ751753

D. Kharzeev

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90158-6

zbMATH Keywords

hypercube Cholesky factorization parallel algorithms communication analysis nested-dissection method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

This page was built for publication: A note on communication analysis of parallel sparse Cholesky factorization on a hypercube

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:751753&oldid=12682037"