On the low-rank approximation by the pivoted Cholesky decomposition

The present paper is dedicated to the application of the pivoted Cholesky decomposition to compute low-rank approximations of dense, positive semi-definite matrices.The resulting truncation error is rigorously controlled in terms of the trace norm. Exponential convergence rates are proved under the assumption that the eigenvalues of the matrix under consideration exhibit a sufficiently fast exponential decay. By numerical experiments it is demonstrated that the pivoted Cholesky decomposition leads to very efficient algorithms to separate the variables of bi-variate functions.