Parallel Cholesky factorization on a shared-memory multiprocessor

DOI10.1016/0024-3795(86)90167-9zbMath0587.65017OpenAlexW2036509408MaRDI QIDQ1072332

B. George

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90167-9

zbMATH Keywords

numerical examplesCholesky factorizationparallel algorithmelimination algorithmshared- memory multiprocessor

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (12)

Solution of sparse positive definite systems on a shared-memory multiprocessor ⋮ A parallel algorithm for the general LU factorization ⋮ Exact sampling of determinantal point processes without eigendecomposition ⋮ Experiments with an ordinary differential equation solver in the parallel solution of method of lines problems on a shared-memory parallel computer ⋮ Block-Cholesky for parallel processing ⋮ Sparse Cholesky factorization on FPGA using parameterized model ⋮ FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture ⋮ Sparse QR factorization on a massively parallel computer ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Near optimal Cholesky factorization on orthogonal multiprocessors. ⋮ Assignment and scheduling in parallel matrix factorization ⋮ Torus data flow for parallel computation of missized matrix problems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• A collection of parallel linear equations routines for the Denelcor HEP
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Data-flow algorithms for parallel matrix computation
• Basic Linear Algebra Subprograms for Fortran Usage

This page was built for publication: Parallel Cholesky factorization on a shared-memory multiprocessor