Communication analysis of the PIE and QIF algorithms on distributed memory architecture

DOI10.1080/00207169808804666zbMath0901.65015OpenAlexW2082196937MaRDI QIDQ4392329

No author found.

Publication date: 26 November 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804666

zbMATH Keywords

algorithmscomparison of methodsparallel computationGaussian eliminationLU factorizationperformanceslarge linear systemsquadrant interlocking factorizationparallel implicit elimination

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

The choleski Q.I.F. algorithm for solving symmetric linear systems ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ Existence and Stability of Choleski Q.I.F. for Symmetric Linear Systems

Cites Work

• Parallel quadrant interlocking factorization on hypercube computers
• A parallel linear system solver
• Implicit matrix elimination (IME) schemes
• THE PARALLEL IMPLICIT ELIMINATION (PIE) METHOD FOR THE SOLUTION OF LINEAR SYSTEMS

This page was built for publication: Communication analysis of the PIE and QIF algorithms on distributed memory architecture