Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
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

hypercubeCholesky factorizationparallel algorithmscommunication analysisnested-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"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki