scientific article; zbMATH DE number 176387

MaRDI QIDQ4035536zbMATH OpenFDO

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

Publication date 18 May 1993

zbMATH Keywords

\(LU\) decomposition\(LU\) solverADI iterationcomplexityelimination algorithmHessenberg matricesparallel algorithmsshared memory multiprocessortridiagonal systems

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Direct numerical methods for linear systems and matrix inversion (65F05) Finite difference methods for boundary value problems involving PDEs (65N06) Parallel numerical computation (65Y05)

Review text

[For the entire collection see Zbl 0753.00017.] An elimination algorithm is proposed for the \(LU\) decomposition of upper Hessenberg matrices on a shared memory multiprocessor where the number of processors is not related to the problem dimension. As an illustration for application of the \(LU\) solver serves a five-point difference approximation of an elliptic partial differential equation in a rectangle where two tridiagonal systems arise in one ADI iteration. A generalization to solving systems with a banded Hessenberg matrix is presented. What concerns the complexity, the direct solver yields best estimations for solving tridiagonal systems known hitherto.

Recommendations

• Algorithms for LU decomposition on a shared memory multiprocessor
• scientific article; zbMATH DE number 624932
• Parallel algorithms for \(LU\) decomposition on a shared memory multiprocessor
• LU factorization on parallel computers
• scientific article; zbMATH DE number 741177

Cited in

(3)

• scientific article; zbMATH DE number 4030824 (Why is no real title available?)
• Algorithms for LU decomposition on a shared memory multiprocessor
• On the \(ijk\) forms of the truncated LU decomposition

This page was built for publication:

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