No label defined (Q4035530)
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 176382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 176382 |
Statements
18 May 1993
0 references
parallel algorithms
0 references
triangular systems
0 references
sparse matrix
0 references
best ordering
0 references
0.8972861170768738
0 references
0.8868389129638672
0 references
0.8847266435623169
0 references
0.8781086802482605
0 references
[For the entire collection see Zbl 0753.00017.] A method for solving triangular systems of algebraic equations with a sparse matrix structure is presented. The partitioning principle is adopted with introducing a best ordering. The optimality of the algorithm for the case when the inverse is represented as a product of a few sparse factors is proved. The solver is applied to several problems where sparse solvers occur. The algorithm is implemented on a Connection Machine.
0 references
