A sparse matrix algorithm on the Boolean vector machine (Q1099582)
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: A sparse matrix algorithm on the Boolean vector machine |
scientific article; zbMATH DE number 4041155
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sparse matrix algorithm on the Boolean vector machine |
scientific article; zbMATH DE number 4041155 |
Statements
A sparse matrix algorithm on the Boolean vector machine (English)
0 references
1988
0 references
The implementation of general iterative methods for the solution of large sparse linear systems on a Boolean vector machine is discussed. Estimates are given for the speed of computation of these methods on two models of such a machine, one existing and one envisioned.
0 references
sparse matrix algorithm
0 references
Boolean vector language
0 references
performance estimates
0 references
Boolean vector machine
0 references
0.8229415416717529
0 references
0.7775709629058838
0 references
