Abstract

In the current article, the authors present a new recursive symbolic computational algorithm, that will never break down, for inverting general periodic pentadiagonal and anti-pentadiagonal matrices. It is a natural generalization of the work presented in [M.E.A. El-Mikkawy, E.D. Rahmo, A new recursive algorithm for inverting general tridiagonal and anti-tridiagonal matrices, Appl. Math. Comput. 204 (2008) 368–372]. The algorithm is suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. An illustrative example is given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.