Adaptive low-rank approximation of collocation matrices
type: Item
instance of: scholarly article
title: Adaptive low-rank approximation of collocation matrices
zbMATH Open document ID: 1068.41052
author: Mario Bebendorf
author: S. Rjasanow
published in: Computing
publication date: 2003-08-21T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 41A63
Mathematics Subject Classification ID: 41A80
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 1969119
zbMATH Keywords: integral equations
zbMATH Keywords: hierarchical matrices
zbMATH Keywords: low-rank approximation
zbMATH Keywords: fast solvers
reviewed by: Josef Kofroň
MaRDI profile type: Publication
full work available at URL: s00607-002-1469-6
OpenAlex ID: W1976986637
Wikidata QID: Q60060385
DBLP publication ID: journals/computing/BebendorfR03
DOI: 10.1007/S00607-002-1469-6
description: scientific article; zbMATH DE number 1969119