Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis (Q5502428): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/nla.1913 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NLA.1913 / rank | |||
Normal rank | |||
Latest revision as of 17:06, 30 December 2024
scientific article; zbMATH DE number 6476005
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
