Solving large dense systems of linear equations on systems with virtual memory and with cache (Q1188314)
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: Solving large dense systems of linear equations on systems with virtual memory and with cache |
scientific article; zbMATH DE number 40465
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large dense systems of linear equations on systems with virtual memory and with cache |
scientific article; zbMATH DE number 40465 |
Statements
Solving large dense systems of linear equations on systems with virtual memory and with cache (English)
0 references
13 August 1992
0 references
The solution of large full sets of linear algebraic equations on a computer with hierarchical memory is considered. Blocked Gaussian elimination and \(QR\) factorization are studied in an attempt to apply exactly the same implementations on computers with virtual memory as on computers with cache. The authors point out that their approach differs slightly from the approach taken in the LAPACK project which, although aimed at the same architectures, focuses mainly on computers with vector registers and/or cache. Experiments on a Cyber 205 and an Alliant FX/4 are reported.
0 references
large dense systems
0 references
computer with hierarchical memory
0 references
Blocked Gaussian elimination
0 references
\(QR\) factorization
0 references
computers with virtual memory
0 references
computers with cache
0 references
computers with vector registers
0 references
Cyber 205
0 references
Alliant FX/4
0 references