Tree semi-separable matrices: a simultaneous generalization of sequentially and hierarchically semi-separable representations
N Govindarajan, S Chandrasekaran - arXiv preprint arXiv:2402.13381, 2024 - arxiv.org
We present a unification and generalization of sequentially and hierarchically semi-
separable (SSS and HSS) matrices called tree semi-separable (TSS) matrices. Our main …
separable (SSS and HSS) matrices called tree semi-separable (TSS) matrices. Our main …
Minimal rank completions for overlapping blocks
EN Epperly, N Govindarajan… - Linear Algebra and its …, 2021 - Elsevier
We consider the multi-objective optimization problem of choosing the bottom left block-entry
of a block lower triangular matrix to minimize the ranks of all block sub-matrices. We provide …
of a block lower triangular matrix to minimize the ranks of all block sub-matrices. We provide …
[图书][B] Advancements in Algorithms for Approximations of Rank Structured Matrices
KA Lessel - 2020 - search.proquest.com
Many problems in mathematical physics and engineering involve solving linear systems Ax=
b which are highly structured. These structured matrices, which typically arise from …
b which are highly structured. These structured matrices, which typically arise from …