Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis. (Q5502428)
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 6476005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis. |
scientific article; zbMATH DE number 6476005 |
Statements
Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis (English)
0 references
26 August 2015
0 references
polynomial eigenvalue problem
0 references
linearization
0 references
Arnoldi method
0 references
Chebyshev basis
0 references
Krylov methods
0 references
companion linearization
0 references
algorithm
0 references
0 references
0 references
0 references
0.7941992878913879
0 references
0.7770547866821289
0 references
0.7770547866821289
0 references
0.7624694108963013
0 references
0.7585715651512146
0 references
