article · INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
We develop a new algorithm to compute the inverse of an interesting class of bordered ktridiagonal matrices. This algorithm relieson a novel strategy of partitioning and decomposition. We also give examples illustrating the efficiency of the proposed method.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.47191/ijmcr/v13i2.09
Is something wrong with this record? Report it or request removal.
Discussion
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.
New to MARATTO™? Create a free account.
