A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor

We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Zmijewski, Earl (VerfasserIn), Gilbert, John R. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Ithaca, New York 1986
Schriftenreihe:	Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 733
Schlagworte:	Matrices Multiprocessors Parallel processing (Electronic computers)
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!