Complexity of dense-linear-system solution on a multiprocessor ring

DOI10.1016/0024-3795(86)90169-2zbMath0587.65022OpenAlexW1996954068MaRDI QIDQ1072340

Martin H. Schultz, Ilse C. F. Ipsen, Yousef Saad

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

zbMATH Keywords

complexityGaussian eliminationdense linear systemsmultiprocessor ring

Mathematics Subject Classification ID

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

Related Items

Communication complexity of the Gaussian elimination algorithm on multiprocessors, Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods, Parallel solution of Fredholm integral equations of the second kind by orthogonal polynomial expansions, Adaptive blocking in the QR factorization, Neville elimination: a study of the efficiency using checkerboard partitioning, A study of the performance of Neville elimination using two kinds of partitioning techniques, Parallel direct methods for solving banded linear systems, Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors, Assignment and scheduling in parallel matrix factorization

Cites Work

• Unnamed Item
• Multiple array processors for ocean acoustic problems
• The computation and communication complexity of a parallel banded system solver
• On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms
• Data-flow algorithms for parallel matrix computation
• On Stable Parallel Linear System Solvers
• Some Complexity Results for Matrix Computations on Parallel Processors
• A Survey of Parallel Algorithms in Numerical Linear Algebra