Papers › Blockwise inversion and algorithms for inverting large partitioned matrices
Blockwise inversion and algorithms for inverting large partitioned matrices
R. Thiru Senthil
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Block matrix structure is commonly arising is various physics and engineering applications. There are various advantages in preserving the blocks structure while computing the inversion of such partitioned matrices. In this context, using the blockwise matrix inversion technique, inversions of large matrices with different ways of memory handling are presented, in this article. An algorithm for performing inversion of a matrix which is partitioned into a large number of blocks is presented, in which inversions and multiplications involving the blocks are carried out with parallel processing. Optimized memory handling and efficient methods for intermediate multiplications among the partitioned blocks are implemented in this algorithm. The developed programs for the procedures discussed in this article are provided in C language and the parallel processing methodology is implemented using OpenMP application programming interface. The performance and the advantages of the developed algorithms are highlighted.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections