Adaptive low-rank approximation of collocation matrices (Q1404541)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Adaptive low-rank approximation of collocation matrices |
scientific article; zbMATH DE number 1969119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive low-rank approximation of collocation matrices |
scientific article; zbMATH DE number 1969119 |
Statements
Adaptive low-rank approximation of collocation matrices (English)
0 references
21 August 2003
0 references
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.
0 references
integral equations
0 references
hierarchical matrices
0 references
low-rank approximation
0 references
fast solvers
0 references
0.8003382682800293
0 references
0.7979656457901001
0 references
0.7864551544189453
0 references
0.7820781469345093
0 references
0.7811440825462341
0 references
