Two algorithms for solving general backward pentadiagonal linear systems
A. A. Karawia
Abstract
A. A. Karawia
Abstract
In this paper, we present efficient computational and symbolic algorithms for solving backward penta-diagonal 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. The symbolic algorithm is competitive with other methods for solving a backward pentadiagonal linear systems.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we present efficient computational and symbolic algorithms for solving backward penta-diagonal 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. The symbolic algorithm is competitive with other methods for solving a backward pentadiagonal linear systems.
Key concepts: Maple, Symbolic computation, Algorithm, Diagonal, MATLAB, Linear system, Mathematics, Algebra over a field