On parallel computations with banded matrices (Q1898464)
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: On parallel computations with banded matrices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On parallel computations with banded matrices |
scientific article |
Statements
On parallel computations with banded matrices (English)
0 references
22 February 1996
0 references
Theoretical paper on the algorithmic complexity of the direct solution of banded linear systems on parallel computers. The time complexity is improved compared to previous results. It should be mentioned that for engineering problems with large and sparse matrices iterative solvers are much more efficient.
0 references
algorithmic complexity
0 references
banded linear systems
0 references
parallel computers
0 references
