New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem. (Q2955975)
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 6674914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem. |
scientific article; zbMATH DE number 6674914 |
Statements
New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (English)
0 references
13 January 2017
0 references
HSS matrices
0 references
Cauchy-like matrices
0 references
eigenvalue problems
0 references
Schur complement
0 references
divide-and-conquer algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8343067765235901
0 references
0.8319931030273438
0 references
0.8295605778694153
0 references
