Efficient parallel algorithm for quasi pentadiagonal systems on a hypercube

DOI10.1016/J.AMC.2004.06.014zbMath1060.65578OpenAlexW2059945431MaRDI QIDQ1774834

C. P. Katti, Rama Kumari

Publication date: 4 May 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.014

zbMATH Keywords

algorithmparallel computationHypercubeOdd even reduction methodPentadiagonal linear system

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

A novel algorithm for solving quasi penta-diagonal linear systems

Cites Work

• A Numerov-Galerkin technique applied to a finite-element shallow-water equations model with enforced conservation of integral invariants and selective lumping
• Highly efficient parallel algorithm for finite difference solution to Navier-Stokes equation on a hypercube.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient parallel algorithm for quasi pentadiagonal systems on a hypercube