Matrices with low-rank off-diagonal blocks are a versatile tool to perform matrix compression and to speed up various matrix operations, such as the solution of linear systems. Often, the underlying block partitioning is described by a hierarchical partitioning of the row and column indices, thus giving rise to hierarchical low-rank structures. The goal of this chapter is to provide a brief introduction to these techniques, with an emphasis on linear algebra aspects.
CITATION STYLE
Ballani, J., & Kressner, D. (2016). Matrices with hierarchical low-rank structures. Lecture Notes in Mathematics, 2173, 161–209. https://doi.org/10.1007/978-3-319-49887-4_3
Mendeley helps you to discover research relevant for your work.