Skip to content

Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications

  • Benzi M
  • Bini D
  • Kressner D
  • et al.
N/ACitations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

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 chap- ter is to provide a brief introduction to these techniques, with an emphasis on linear algebra aspects.

Cite

CITATION STYLE

APA

Benzi, M., Bini, D., Kressner, D., Munthe-Kaas, H., & Van Loan, C. (2016). Exploiting Hidden Structure in Matrix Computations: Algorithms and Applications (Vol. 2173). Retrieved from http://link.springer.com/10.1007/978-3-319-49887-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free