A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates (Q1841975): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-0427(00)00486-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971285640 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 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
0 references
0 references
0 references
