Solution of sparse positive definite systems on a hypercube

DOI10.1016/0377-0427(89)90364-6MaRDI QIDQ1124265zbMATH OpenOpenAlexFDO

Authors 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

Cholesky factorizationdata structurehypercubenumerical experimentsparallel computationmultiprocessorsnumerical factorizationelimination treeslarge sparse positive definite systemspseudo-code algorithmssymbolic factorizationtriangular solution

Mathematics Subject Classification ID

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

Recommendations

• Solution of sparse positive definite systems on a shared-memory multiprocessor
• Publication:5750331
• scientific article; zbMATH DE number 991427
• scientific article; zbMATH DE number 4076453
• Parallel Algorithms for Sparse Linear Systems

Cites work

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

Cited in

(8)

• scientific article; zbMATH DE number 3885206 (Why is no real title available?)
• 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
• ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
• A latency tolerant hybrid sparse solver using incomplete Cholesky factorization
• Task scheduling for parallel sparse Cholesky factorization
• A Polyhedral Method for Sparse Systems with Many Positive Solutions

Describes a project that uses

Uses Software

• YSMP
• MA27
• symrcm
• SPARSPAK

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

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