A novel algorithm and its parallelization for solving nearly penta-diagonal linear systems

DOI10.1080/00207160.2012.725845zbMath1284.65046OpenAlexW2042771048MaRDI QIDQ2868179

Ji-Teng Jia, Tomohiro Sogabe

Publication date: 23 December 2013

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

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

zbMATH Keywords

computer algebra systemsparallel algorithmlarge scale linear systemCrout LU decompositionnearly pentadiagonal matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

Two symbolic algorithms for solving general periodic pentadiagonal linear systems ⋮ On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices

Cites Work

• Unnamed Item
• Unnamed Item
• New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems
• Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - derivation and implementation
• A computational algorithm for solving nearly penta-diagonal linear systems
• A computational algorithm for solving periodic penta-diagonal linear systems
• A note on solving nearly penta-diagonal linear systems
• On the Solution of Circulant Linear Systems
• Parallel Factorizations for Tridiagonal Matrices
• A Parallel Fast Direct Solver for Block Tridiagonal Systems with Separable Matrices of Arbitrary Dimension
• A Parallel Elimination Method for "Periodic" Tridiagonal Systems
• A fast numerical algorithm for solving nearly penta-diagonal linear systems
• On Direct Methods for Solving Poisson’s Equations

This page was built for publication: A novel algorithm and its parallelization for solving nearly penta-diagonal linear systems