LU decomposition optimized for a parallel computer with a hierarchical distributed memory
DOI10.1016/0167-8191(92)90010-5zbMATH Open0757.65029OpenAlexW1995111642MaRDI QIDQ1201009FDOQ1201009
Authors: Scott Stark, Antony N. Beris 
Publication date: 17 January 1993
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(92)90010-5
Recommendations
- scientific article; zbMATH DE number 741177
- scientific article; zbMATH DE number 641618
- $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- Algorithms for LU decomposition on a shared memory multiprocessor
optimal performancedense systemsBBN TC2000 parallel computerefficient hybrid parallel block LU decomposition procedureMIMD architecture with distributed memory
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)
Cited In (8)
- Dense linear system: A parallel self-verified solver
- Algorithms for LU decomposition on a shared memory multiprocessor
- Title not available (Why is that?)
- An efficient implementation of LU decomposition in C
- UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
- An LDU decomposition algorithm for a block Toeplitz matrix having a parallel and pipelined computing structure
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers
- A Parallel Multistage ILU Factorization Based on a Hierarchical Graph Decomposition
Uses Software
This page was built for publication: LU decomposition optimized for a parallel computer with a hierarchical distributed memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201009)
