Solving large dense systems of linear equations on systems with virtual memory and with cache

DOI10.1016/0168-9274(92)90056-JzbMath0760.65025OpenAlexW2130052962MaRDI QIDQ1188314

Walter M. Lioen, Dik T. Winter

Publication date: 13 August 1992

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(92)90056-j

zbMATH Keywords

\(QR\) factorizationAlliant FX/4Blocked Gaussian eliminationcomputer with hierarchical memorycomputers with cachecomputers with vector registerscomputers with virtual memoryCyber 205large dense systems

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations

Uses Software

• LAPACK
• BLAS
• LINPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Solving systems of large dense linear equations
• Rang revealing QR factorizations
• Solving linear systems on a vector computer
• Iterative algorithms for Gram-Schmidt orthogonalization
• Influence of memory systems on vector processor performance
• Monitoring the numerical stability of Gaussian elimination
• Solution of Simultaneous Linear Equations using a Magnetic-Tape Store
• An extended set of FORTRAN basic linear algebra subprograms
• Solving Large Full Sets of Linear Equations in a Paged Virtual Store
• A set of level 3 basic linear algebra subprograms
• Organizing matrices and matrix operations for paged memory systems

This page was built for publication: Solving large dense systems of linear equations on systems with virtual memory and with cache