1 Excerpt

- Published 2012 in Numerical Algorithms

Approximating integral operators by a standard Galerkin discretisation typically leads to dense matrices. To avoid the quadratic complexity it takes to compute and store a dense matrix, several approaches have been introduced including $\mathcal {H}$ -matrices. The kernel function is approximated by a separable function, this leads to a low rank matrix. Interpolation is a robust and popular scheme, but requires us to interpolate in each spatial dimension, which leads to a complexity of $m^d$ for $m$ -th order. Instead of interpolation we propose using quadrature on the kernel function represented with Green’s formula. Due to the fact that we are integrating only over the boundary, we save one spatial dimension compared to the interpolation method and get a complexity of $m^{d-1}$ .

@article{Brm2012LowrankAO,
title={Low-rank approximation of integral operators by using the Green formula and quadrature},
author={Steffen B{\"{o}rm and Jessica G{\"{o}rdes},
journal={Numerical Algorithms},
year={2012},
volume={64},
pages={567-592}
}