Solution of sparse positive definite systems on a hypercube

DOI10.1016/0377-0427(89)90364-6zbMATH Open0678.65014OpenAlexW2752093666MaRDI QIDQ1124265FDOQ1124265

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

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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• 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

Uses Software

• SPARSPAK
• symrcm
• MA27
• YSMP

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)