MARATTO

article · INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH

An Efficient Algorithm for the Inverse of P-Diagonal Toeplitz Matrices

Abstract

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.

Research topics

  • Matrix Theory and Algorithms
  • graph theory and CDMA systems

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.47191/ijmcr/v13i2.13

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.