Nearly Pentadiagonal Linear Systems
A. A.Karawia, S.A. El-Shehawy
TL;DR
This paper introduces efficient computational and symbolic algorithms for solving nearly pentadiagonal linear systems, with implementations demonstrated in popular Computer Algebra Systems, supported by illustrative examples.
Contribution
It presents new algorithms specifically designed for nearly pentadiagonal systems and shows how to implement them in various CAS software.
Findings
Algorithms effectively solve nearly pentadiagonal systems
Implementation in MAPLE, MACSYMA, MATHEMATICA, MATLAB is straightforward
Two examples demonstrate the algorithms' practicality
Abstract
In this paper we present efficient computational and symbolic algorithms for solving a nearly pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS)such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB is straightforward. Two examples are given in order to illustrate the algorithms.
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
TopicsMatrix Theory and Algorithms · Polynomial and algebraic computation · Advanced Optimization Algorithms Research