Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers

DOI10.1016/0024-3795(91)90279-6MaRDI QIDQ803714zbMATH OpenOpenAlexWikidataFDO

Authors David M. Gay

Publication date 1991

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90279-6

zbMATH Keywords

computational experimentsdirect factorizationsincore sparse Cholesky factorizationssparse, symmetric, positive-definite matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Review text

The author shows that the benefits of using large amounts of memory in direct factorizations of sparse, symmetric, positive-definite matrices more modest than pointed out by \textit{W. Murray} [Methods for linear programming, talk presented at the NATO Advanced Workshop on Algorithms and Model Formulations in Mathematical Programming, Bergen, Norway, 15-19 June 1987]. He gives the results of computational experiments performed on a variety of problems using IBM 3081 K, VAX 8550 and Sun-3/160. Relevant details about sparse Cholesky and data structures are described.

Recommendations

• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• scientific article; zbMATH DE number 1760069
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 833702
• scientific article; zbMATH DE number 833696
• Highly Parallel Sparse Cholesky Factorization
• Parallel Processing and Applied Mathematics
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Efficient Methods for Out-of-Core Sparse Cholesky Factorization

Cites work

• A new polynomial-time algorithm for linear programming
• A Note on Sparse Factorization in a Paging Environment
• An implementation of Karmarkar's algorithm for linear programming
• Computing Karmarkar projections quickly
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• General Sparse Elimination Requires No Permanent Integer Storage
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3181418 (Why is no real title available?)
• scientific article; zbMATH DE number 3651654 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
• Vector processing in simplex and interior methods for linear programming

Cited in

(4)

• Recurrent neural networks for LU decomposition and Cholesky factorization
• A Note on Sparse Factorization in a Paging Environment
• Parallel Processing and Applied Mathematics
• A survey of direct methods for sparse linear systems

Describes a project that uses

Uses Software

• symrcm

This page was built for publication: Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803714)