Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors (Q1569897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1471144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors |
scientific article; zbMATH DE number 1471144 |
Statements
Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors (English)
0 references
29 March 2001
0 references
Presentation of an efficient implementation of the LU factorization on shared memory parallel computers and SMP severs for structurally symmetric matrices and an extension to symmetric matrices, based on BLAS routines. Numerical experiments with 23 matrices on 6 different computers are reported. Forward elimination and backward substitution are not discussed.
0 references
sparse matrices
0 references
parallel computing
0 references
numerical experiments
0 references
LU factorization
0 references
symmetric matrices
0 references
0.8595697283744812
0 references
0.8543219566345215
0 references
0.8466664552688599
0 references
0.8463522791862488
0 references
0.8403772115707397
0 references
