An Efficient Algorithm for the Inverse of P-Diagonal Toeplitz Matrices
In this recurring paper, we provide a compact and more general algorithm for obtaining the inverse of p-diagonal matrices. We implemented it on a more complex structure, a nona-diagonal matrix and tested it,to test its efficiency using the same method. Currently, this extension not only showcases the flexibility of our method,but also shows that we can further improve the computational performance when working with more general matrix structures.
Authors
- A.AIAT HADJ
- Boutaina Talibi
- Driss Sarsri
Institutions
- Abdelmalek Essaâdi University (MA)
Publication Details
- Journal
- INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
- Published
- 2025-02-28
- DOI
- https://doi.org/10.47191/ijmcr/v13i2.13
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00