On the growth factor upper bound for Aasen's algorithm (Q1726533)
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 7026056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the growth factor upper bound for Aasen's algorithm |
scientific article; zbMATH DE number 7026056 |
Statements
On the growth factor upper bound for Aasen's algorithm (English)
0 references
20 February 2019
0 references
Aasen's algorithm
0 references
growth factor
0 references
\(L T L^T\) factorization
0 references
0.769614040851593
0 references
0.7623882293701172
0 references
0.721425473690033
0 references
0.7114678621292114
0 references
0.698478639125824
0 references
