A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
type: Item
instance of: scholarly article
title: A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
zbMATH Open document ID: 0977.65036
DOI: 10.1016/S0377-0427(00)00486-6
published in: Journal of Computational and Applied Mathematics
publication date: 2001-02-18T00:00:00Z
review text: Complexity analysis and optimal complexity results are given for a class of data-sparse matrices.
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1566030
zbMATH Keywords: sparse \({\mathcal H}\)-matrix arithmetic
zbMATH Keywords: complexity
author: Wolfgang Hackbusch
author: Boris N. Khoromskij
reviewed by: Aurél Galántai
MaRDI profile type: Publication
cites work: Wavelet approximation methods for pseudodifferential equations. II: Matrix compression and fast solution
cites work: Q4356574
cites work: Integral equations. Theory and numerical treatment
cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
cites work: A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
cites work: On the fast matrix multiplication in the boundary element method by panel clustering
cites work: On the efficient use of the Galerkin-method to solve Fredholm integral equations
cites work: Q4867816
cites work: Wavelet approximations for first kind boundary integral equations on polygons
full work available at URL: s0377-0427(00)00486-6
OpenAlex ID: W1971285640
description: scientific article; zbMATH DE number 1566030