The computation and communication complexity of a parallel banded system solver (Q3318107): Difference between revisions
From MaRDI portal
Set profile property. |
Add wikidata reference. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/399.401 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035695022 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Access and Alignment of Data in an Array Processor / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Stable Parallel Linear System Solvers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129992110 / rank | |||
Normal rank | |||
Latest revision as of 13:21, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computation and communication complexity of a parallel banded system solver |
scientific article |
Statements
The computation and communication complexity of a parallel banded system solver (English)
0 references
1984
0 references
parallel computers
0 references
alignment networks
0 references
positive definite systems
0 references
multiple-data-stream processors
0 references
algorithm
0 references
banded positive definite linear systems
0 references
multiprocessor computer
0 references
banded matrix
0 references
