A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates (Q1841975): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Wolfgang Hackbusch / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Boris N. Khoromskij / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Aurel Galantai / rank | |||
Normal rank | |||
Revision as of 16:50, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates |
scientific article |
Statements
A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates (English)
0 references
18 February 2001
0 references
Complexity analysis and optimal complexity results are given for a class of data-sparse matrices.
0 references
sparse \({\mathcal H}\)-matrix arithmetic
0 references
complexity
0 references
