Two algorithms for solving general backward pentadiagonal linear systems
From MaRDI portal
Abstract: In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB are straightforward. An examples are given in order to illustrate the algorithms. The symbolic algorithm is competitive the other methods for solving a backward pentadiagonal linear systems.
Recommendations
- Two algorithms for solving a general backward tridiagonal linear systems
- Two symbolic algorithms for solving general periodic pentadiagonal linear systems
- On solving pentadiagonal linear systems via transformations
- Symbolic algorithm for solving cyclic penta-diagonal linear systems
- A computational algorithm for solving periodic penta-diagonal linear systems
Cites work
- scientific article; zbMATH DE number 4064339 (Why is no real title available?)
- A fast algorithm for evaluating \(n\)th order tri-diagonal determinants.
- Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
- Two algorithms for solving a general backward tridiagonal linear systems
Cited in
(6)- Two symbolic algorithms for solving general periodic pentadiagonal linear systems
- Symbolic algorithm for solving cyclic penta-diagonal linear systems
- Chase-after methods of anti-pentadiagonal and quasi anti-pentadiagonal linear equations
- On solving pentadiagonal linear systems via transformations
- Two algorithms for solving a general backward tridiagonal linear systems
- A fast numerical algorithm for solving nearly penta-diagonal linear systems
This page was built for publication: Two algorithms for solving general backward pentadiagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056417)