Parallel Algorithms for Sparse Linear Systems

DOI10.1137/1033099zbMath0738.65014OpenAlexW1993274656MaRDI QIDQ3981404

Barry W. Peyton, Michael T. Heath, Esmond G. Ng

Publication date: 26 June 1992

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1033099

zbMATH Keywords

orderingCholesky factorizationparallel algorithmsnumerical factorizationsymbolic factorizationtriangular solutionlarge sparse symmetric positive definite systemsserial computer

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 (26)

A quality and distance guided hybrid algorithm for the vertex separator problem ⋮ Alya: computational solid mechanics for supercomputers ⋮ Parallel implementation of finite-element/Newton method for solution of steady-state and transient nonlinear partial differential equations ⋮ A parallel multifrontal algorithm and its implementation ⋮ A fast algorithm for sparse matrix computations related to inversion ⋮ Parallelized integrated nested Laplace approximations for fast Bayesian inference ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions ⋮ A parallel computational method in steady power-law creep ⋮ Minimizing elimination tree height can increase fill more than linearly ⋮ Sparse Cholesky factorization on FPGA using parameterized model ⋮ An implementation of a parallel primal-dual interior point method for block- structured linear programs ⋮ Data-Parallel Sparse Factorization ⋮ Reordering for parallelism ⋮ A survey of direct methods for sparse linear systems ⋮ FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture ⋮ The vertex separator problem: a polyhedral investigation ⋮ Sparse QR factorization on a massively parallel computer ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver ⋮ Multifrontal Computations on GPUs and Their Multi-core Hosts ⋮ Improving parallel ordering of sparse matrices using genetic algorithms ⋮ A parallel interior point algorithm for linear programming on a network of transputers ⋮ A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION ⋮ An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations

This page was built for publication: Parallel Algorithms for Sparse Linear Systems