## rusty-compression

Low rank compression algorithms in Rust

### 2 unstable releases

 0.1.0 Apr 18, 2022 Jun 29, 2021

#1078 in Math

BSD-3-Clause

120KB
2K SLoC

# rusty-compression

A low-rank compression library in Rust.

This library provides various routines for the low-rank compression of linear operators. The algorithms are mostly adapted from the book Fast direct solvers for elliptic PDEs by Gunnar Martinsson.

For examples see the two example programs in the directory examples. In application use the library requires the ndarray-linalg dependency to be linked against Openblas or another Lapack library. For details see the corresponding documentation of ndarray-linalg.

### lib.rs:

This library provides routines to compute low-rank approximations of matrices.

# Overview

Let $A\in\mathbb{C}^{m\times n}$ be a given matrix. A low-rank approximation is a representation of the form $$A\approx UV^H$$ with $U\in\mathbb{C}^{m\times k}$ and $V\in\mathbb{C}^{n\times k}$, where $k$ is sufficiently small for the required application. A frequently used representation is also $$A\approx \tilde{U}X\tilde{V}^H$$ with a $k\times k$ matrix $X$.

The basis of the library is a pivoted QR decomposition of $A$ of the form $$AP = QR$$ with $P$ a permutation matrix, $Q\in\mathbb{C}^{m\times \ell}$ a matrix with orthogonal columns of unit norm, $R\in\mathbb{C}^{\ell\times n}$ upper triangular, and $\ell=\min\{m, n\}$.

In a pivoted QR decomposition the diagonal elements of $R$ are sorted in non-increasing order, that is $|r_{11}|\geq |r_{22}|\geq \dots$. We can therefore compress $A$ by choosing an index $k$ and only keeping the first $k$ columns of $Q$ and the first $k$ rows of $R$. The library allows to choose the parameter $k$ directly or by a given tolerance $\tau$ such that $\langle|\frac{r_{kk}}{r_{11}}\rangle|< \tau$.

Alternatively, one can also low-rank compress by first computing the Singular Value Decomposition. This is more accurate but also more costly.

From the compressed QR decomposition we can compute a column pivoted interpolative decomposition of the form $$A \approx CZ$$ The matrix $C$ is defined as $$C = A[:, [i_1, i_2, \dots]],$$ that is a selection of columns of $A$ with indices $i_1, i_2, \dots$.

The column pivoted interpolative decomposition has the advantage that we are using columns of $A$ as low-rank basis, which in applications often have physical meaning as opposed to the columns of $Q$.

From the column pivoted interpolative decomposition we can also compute a two-sided decomposition of the form $$A\approx C X R$$ Here, $X$ is a $k\times k$ matrix, which is the submatrix of $A$ formed of the column indices $i_1, i_2, \dots$ and row indices $j_1, j_2, \dots$.

Similarly to a column interpolative decomposition, a corresponding row interpolative decomposition is available that selects rows of $A$ for the low rank approximation.

~65MB
~867K SLoC