Iterative representing set selection for nested cross approximation

A. Yu Mikhalev, I. V. Oseledets

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Summary: A new fast algebraic method for obtaining an -approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum volume principle to select submatrices in low-rank matrices. A special iterative approach for the computation of so-called representing sets is established. The main advantage of the method is that it uses only the hierarchical partitioning of the matrix and does not require special 'proxy surfaces' to be selected in advance. The numerical experiments for the electrostatic problem and for the boundary integral operator confirm the effectiveness and robustness of the approach. The complexity is linear in the matrix size and polynomial in the ranks. The algorithm is implemented as an open-source Python package that is available online. Copyright

Original languageEnglish
Pages (from-to)230-248
Number of pages19
JournalNumerical Linear Algebra with Applications
Issue number2
Publication statusPublished - 1 Mar 2016
Externally publishedYes


  • Cross approximation
  • Hiearchical matrices
  • Low-rank approximation
  • Skeleton decomposition


Dive into the research topics of 'Iterative representing set selection for nested cross approximation'. Together they form a unique fingerprint.

Cite this