期刊
COMPUTING
卷 70, 期 1, 页码 1-24出版社
SPRINGER WIEN
DOI: 10.1007/s00607-002-1469-6
关键词
integral equations; hierarchical matrices; low-rank approximation; fast solvers
This article deals with the solution of integral equations using collocation methods with almost linear complexity. Methods such as fast multipole, panel clustering and H-matrix methods gain their efficiency from approximating the kernel function. The proposed algorithm which uses the H-matrix format, in contrast, is purely algebraic and relies on a small part of the collocation matrix for its blockwise approximation by low-rank matrices. Furthermore, a new algorithm for matrix partitioning that significantly reduces the number of blocks generated is presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据