Algorithms for LU decomposition on a shared memory multiprocessor

DOI10.1016/0167-8191(93)90075-VzbMATH Open0780.65016OpenAlexW2054611365MaRDI QIDQ688202

John J. Buoni, P. A. Farrell, Arden Ruttan

Publication date: 26 January 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90075-v

zbMATH Keywords

parallel algorithmtridiagonal matricesHessenberg matrixparallel LU decompositionshared memory multiprocessor

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

An efficient implementation of LU decomposition in C ⋮ Implementation of two projection methods on a shared memory multiprocessor: DEC VAX 6240

Recommendations

• Parallel algorithms for QR decomposition on a shared memory multiprocessor 👍 👎
• LU factorization on parallel computers 👍 👎
• LU decomposition optimized for a parallel computer with a hierarchical distributed memory 👍 👎
• $LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algorithms for LU decomposition on a shared memory multiprocessor

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