Fast algorithms for hierarchically semiseparable matrices (Q3090808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5945009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for hierarchically semiseparable matrices |
scientific article; zbMATH DE number 5945009 |
Statements
Fast algorithms for hierarchically semiseparable matrices (English)
0 references
2 September 2011
0 references
HSS matrix
0 references
postordering HSS tree
0 references
low-rank property
0 references
fast HSS algorithms
0 references
generalized HSS Cholesky factorization
0 references
hierarchically semiseparable (HSS) matrix
0 references
linear complexity
0 references
ULV factorization
0 references
symmetric positive definite
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0.8809033036231995
0 references
0.8607233166694641
0 references
0.858708918094635
0 references
0.8575943112373352
0 references
0.843133270740509
0 references
