On solving pentadiagonal linear systems via transformations

DOI10.1155/2015/232456zbMath1394.65021arXiv1409.4802OpenAlexW2963143141WikidataQ59117666 ScholiaQ59117666MaRDI QIDQ1665028

S. S. Askar, A. A. Karawia

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4802

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Sufficient Conditions for Existence of the LU Factorization of Toeplitz Symmetric Tridiagonal Matrices, Finite difference scheme for a higher order nonlinear Schrödinger equation

Uses Software

• Matlab
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• CSparse
• An algorithm for solving nonsymmetric penta-diagonal Toeplitz linear systems
• A fast and reliable algorithm for evaluating \(n\)th order pentadiagonal determinants
• On the inverse of a general pentadiagonal matrix
• New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems
• A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems
• On some parallel banded system solvers
• A parallel partition method for solving banded systems of linear equations
• A fast algorithm for solving Toeplitz penta-diagonal systems
• A fast numerical algorithm for the determinant of a pentadiagonal matrix
• A computational algorithm for solving periodic penta-diagonal linear systems
• Direct Methods for Sparse Linear Systems