The ijk forms of factorization methods. II: Parallel systems

DOI10.1016/0167-8191(88)90036-1zbMath0665.65024OpenAlexW2026872352MaRDI QIDQ1116276

James M. Ortega, Charles H. Romine

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90036-1

zbMATH Keywords

LU factorizationparallel computersCholesky factorizationsijk formslocal memory systems

Mathematics Subject Classification ID

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

Related Items (10)

Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers ⋮ SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES ⋮ Solution of sparse positive definite systems on a hypercube ⋮ Block-Cholesky for parallel processing ⋮ Key concepts for parallel out-of-core LU factorization ⋮ On the cost of sequential and parallel algorithms for solving linear system of equations ⋮ On the \(ijk\) forms of the truncated LU decomposition ⋮ Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors ⋮ Modelling and analysis of communication overhead for parallel matrix algorithms ⋮ Numerical linear algebra algorithms and software

This page was built for publication: The ijk forms of factorization methods. II: Parallel systems