Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semi-separable representations
<|reference_start|>Tree quasi-separable matrices: a simultaneous generalization of sequentially and hierarchically semi-separable representations: We present a unification and generalization of what is known in the literature as sequentially and hierarchically semi-separable (SSS and HSS) representations for matrices. Describing rank-structured representations of (inverses of) sparse matrices whose adjacency graph is a tree, it is shown that these so-called tree quasi-separable (TQS) matrices inherit all the favorable algebraic properties of SSS and HSS under addition, products, and inversion. To arrive at these properties, we prove a key result that characterizes the conversion of any dense matrix into a TQS representation. Here, we specifically show through an explicit construction procedure that the generator sizes are dictated by the ranks of certain Hankel blocks of the matrix. Analogous to SSS and HSS, TQS matrices admit fast matrix-vector products and direct solvers provided the generator sizes are small. A sketch of the associated algorithms is provided.<|reference_end|>
@article{govindarajan2024tree,
    title={Tree quasi-separable matrices: a simultaneous generalization of
  sequentially and hierarchically semi-separable representations},
    author={Nithin Govindarajan and Shivkumar Chandrasekaran and Patrick Dewilde},
    journal={arXiv preprint arXiv:2402.13381},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.13381},
    primaryClass={math.NA cs.NA}
}