Two Algorithms for Solving A General Backward Pentadiagonal Linear Systems
A. A. Karawia

TL;DR
This paper introduces efficient computational and symbolic algorithms for solving backward pentadiagonal linear systems, demonstrating their implementation in various Computer Algebra Systems and comparing their effectiveness.
Contribution
The paper presents new algorithms specifically designed for backward pentadiagonal systems, with implementations in multiple CAS platforms and a comparison of their performance.
Findings
Symbolic algorithm is competitive with existing methods.
Algorithms are straightforward to implement in CAS.
Examples illustrate the algorithms' effectiveness.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques
