On solving pentadiagonal linear systems via transformations

DOI10.1155/2015/232456MaRDI QIDQ1665028zbMATH OpenOpenAlexWikidataFDO

Authors S. S. Askar, A. A. Karawia

Publication date 27 August 2018

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

Copyright license Creative Commons Attribution 3.0 Unported

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

Mathematics Subject Classification ID

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

Abstract: Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article are described new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad El- Mikkawy and Faiz Atlan, Algorithms for Solving Linear Systems of Equations of Tridiagonal Type via Transformations, Applied Mathematics, 2014, 5, 413-422]. The symbolic algorithms remove the cases where the numeric algorithms fail. The computational cost of our algorithms is given. Some examples are given in order to illustrate the effectiveness of the proposed algorithms. All of the experiments are performed on a computer with the aid of programs written in MATLAB.

Recommendations

• Two symbolic algorithms for solving general periodic pentadiagonal linear systems
• Two algorithms for solving general backward pentadiagonal linear systems
• scientific article; zbMATH DE number 510177
• Symbolic algorithm for solving cyclic penta-diagonal linear systems
• A fast numerical algorithm for solving nearly penta-diagonal linear systems

Cites work

• scientific article; zbMATH DE number 1049347 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A computational algorithm for solving periodic penta-diagonal linear systems
• A fast algorithm for solving Toeplitz penta-diagonal systems
• A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems
• A fast and reliable algorithm for evaluating nth order pentadiagonal determinants
• A fast numerical algorithm for the determinant of a pentadiagonal matrix
• A parallel partition method for solving banded systems of linear equations
• An algorithm for solving nonsymmetric penta-diagonal Toeplitz linear systems
• CSparse
• Direct Methods for Sparse Linear Systems
• New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems
• On some parallel banded system solvers
• On the inverse of a general pentadiagonal matrix

Cited in

(8)

• Finite difference scheme for a higher order nonlinear Schrödinger equation
• Two symbolic algorithms for solving general periodic pentadiagonal linear systems
• An algorithm for solving nonsymmetric penta-diagonal Toeplitz linear systems
• scientific article; zbMATH DE number 5563624 (Why is no real title available?)
• Two algorithms for solving general backward pentadiagonal linear systems
• Sufficient Conditions for Existence of the LU Factorization of Toeplitz Symmetric Tridiagonal Matrices
• Z-folding and its applications
• scientific article; zbMATH DE number 6533375 (Why is no real title available?)

Describes a project that uses

Uses Software

• CSparse
• Matlab

This page was built for publication: On solving pentadiagonal linear systems via transformations

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