Solution of sparse positive definite systems on a hypercube

DOI10.1016/0377-0427(89)90364-6zbMath0678.65014OpenAlexW2752093666MaRDI QIDQ1124265

S. H. Smith

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90364-6

zbMATH Keywords

hypercubenumerical experimentsparallel computationCholesky factorizationmultiprocessorsnumerical factorizationdata structureelimination treeslarge sparse positive definite systemspseudo-code algorithmssymbolic factorizationtriangular solution

Mathematics Subject Classification ID

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

Related Items (4)

Task scheduling for parallel sparse Cholesky factorization ⋮ A survey of direct methods for sparse linear systems ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION

Uses Software

• SPARSPAK
• symrcm
• MA27
• YSMP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Parallel implementation of multifrontal schemes
• The analysis of a nested dissection algorithm
• The ijk forms of factorization methods. II: Parallel systems
• Reordering sparse matrices for parallel elimination
• Communication results for parallel sparse Cholesky factorization on a hypercube
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Modification of the minimum-degree algorithm by multiple elimination
• A compact row storage scheme for Cholesky factors using elimination trees
• On General Row Merging Schemes for Sparse Givens Transformations
• Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors
• Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
• A Minimal Storage Implementation of the Minimum Degree Algorithm
• Generalized Nested Dissection
• An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
• A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
• A Data Structure for Parallel L/U Decomposition
• A New Implementation of Sparse Gaussian Elimination
• Yale sparse matrix package I: The symmetric codes
• Computing the Minimum Fill-In is NP-Complete
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: Solution of sparse positive definite systems on a hypercube