Adaptive low-rank approximation of collocation matrices (Q1404541): Difference between revisions

In this paper there is dealt with the solution of integral equations using collocation methods with almost linear complexity. There are used fast multipole, panel clustering and \(H\)-matrix methods which gain their efficiency from approximating the kernel function. The proposed \(H\)-matrix algorithm is purely algebraic. A new algorithm for matrix partitioning significantly reducing the number of blocks generated is presented.