Summary.
This article considers the problem of approximating a general asymptotically smooth function in two variables, typically arising in integral formulations of boundary value problems, by a sum of products of two functions in one variable. From these results an iterative algorithm for the low-rank approximation of blocks of large unstructured matrices generated by asymptotically smooth functions is developed. This algorithm uses only few entries from the original block and since it has a natural stopping criterion the approximative rank is not needed in advance.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received June 21, 1999 / Revised version received December 6, 1999 / Published online June 8, 2000
Rights and permissions
About this article
Cite this article
Bebendorf, M. Approximation of boundary element matrices. Numer. Math. 86, 565–589 (2000). https://doi.org/10.1007/PL00005410
Issue Date:
DOI: https://doi.org/10.1007/PL00005410