Adaptive low-rank approximation of collocation matrices (Q1404541): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/computing/BebendorfR03, #quickstatements; #temporary_batch_1731468600454 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00607-002-1469-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1976986637 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60060385 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/computing/BebendorfR03 / rank | |||
Normal rank | |||
Latest revision as of 04:46, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adaptive low-rank approximation of collocation matrices |
scientific article |
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
