A Maple implementation of partitioned matrices is described. A recursive block data structure is used, with all operations preserving the block abstraction. These include constructor functions, ring operations such as addition and product, and inversion. The package is demonstrated by calculating the PLU factorization of a block matrix.
Cite
@article{arxiv.2408.02112,
title = {An Abstraction-Preserving Block Matrix Implementation in Maple},
author = {David J. Jeffrey and Stephen M. Watt},
journal= {arXiv preprint arXiv:2408.02112},
year = {2024}
}