Journal
NUMERISCHE MATHEMATIK
Volume 133, Issue 3, Pages 409-442Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s00211-015-0757-y
Keywords
-
Categories
Funding
- DFG [BO 3289/2-1]
Ask authors/readers for more resources
We present a fast algorithm that constructs a data-sparse approximation of matrices arising in the context of integral equation methods for elliptic partial differential equations. The new algorithm uses Green's representation formula in combination with quadrature to obtain a first approximation of the kernel function, and then applies nested cross approximation to obtain a more efficient representation. The resulting -matrix representation requires units of storage for an matrix, where k depends on the prescribed accuracy.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available