A Rank Revealing Factorization Using Arbitrary Norms

Abstract

The classic rank-revealing QR factorization factorizes a matrix $A$ as $AP=QR$ where $P$ permutes the columns of $A$, $Q$ is an orthogonal matrix, and $R$ is upper triangular with non-increasing diagonal entries. This is called rank-revealing because careful choice of $P$ allows the user to truncate the factorization for a low-rank approximation of $A$ with an error term computed in the $l^2$ norm. In this paper I generalize the QR factorization to use any arbitrary norm and prove analogous properties for $Q$ and $R$ in this setting. I then show an application of this algorithm to compute low-rank approximations to $A$ with error term in the $l^1$ norm instead of the $l^2$ norm. I provide Python code for the $l^1$ case as demonstration of the idea.

References in corpus (3)

• The NumPy array: a structure for efficient numerical computation
• Efficient L1-Norm Principal-Component Analysis via Bit Flipping
• L1-norm Principal-Component Analysis of Complex Data