Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding (Q475676)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding |
scientific article |
Statements
Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding (English)
0 references
27 November 2014
0 references
CMV matrices
0 references
unitary matrices
0 references
rank-structured matrices
0 references
block tridiagonal reduction
0 references
QR iteration
0 references
block Lanczos algorithm
0 references
algorithm
0 references
eigenvalue problem
0 references
0 references
0 references
0.7763728499412537
0 references
0.773764431476593
0 references
0.7633068561553955
0 references
0.7621780037879944
0 references
0.7428655028343201
0 references
