Parallel symbolic factorization of sparse linear systems (Q923593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:923593 |
scientific article; zbMATH DE number 4169953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel symbolic factorization of sparse linear systems |
scientific article; zbMATH DE number 4169953 |
Statements
Parallel symbolic factorization of sparse linear systems (English)
0 references
1990
0 references
Problem: Determine the fill-in for a Cholesky factorization before executing the factorization. Development of a fast parallel algorithm and discussion of its complexity for finding the elimination tree and the fill-in is given. Unfortunately nothing is said about communication.
0 references
sparse linear systems
0 references
parallel computation
0 references
fill-in
0 references
Cholesky factorization
0 references
fast parallel algorithm
0 references
complexity
0 references
elimination tree
0 references
0.8394736051559448
0 references
0.8366369009017944
0 references
0.8329572677612305
0 references
0.8329572677612305
0 references
