Institute for Numerical Simulation
Rheinische Friedrich-Wilhelms-Universität Bonn
maximize


@misc{bebendorf:2007,
  author = {M. Bebendorf and S. Kunis},
  title = {Recompression techniques for adaptive cross
		  approximation},
  howpublished = {Available as INS Preprint No 0708},
  year = {2007},
  inspreprintnum = {0708},
  abstract = {The adaptive cross approximation method generates low-rank
		  approximations to suitable m×n sub-blocks of discrete
		  integral formulations of elliptic boundary value problems.
		  A characteristic property is that the approximation, which
		  requires k(m+n), k | log | , units of storage, is generated
		  in an adaptive and purely algebraic manner using only few
		  of the matrix entries. In this article we present further
		  recompression techniques which bring the required amount of
		  storage down to sublinear order kk , where k depends
		  logarithmically on the accuracy of the approximation but is
		  independent of the matrix size.},
  pdf = {http://www.ins.uni-bonn.de/research/pub/bebendorf_kunis.pdf 1}
}