In:
ACM Transactions on Mathematical Software, Association for Computing Machinery (ACM), Vol. 43, No. 1 ( 2017-03-31), p. 1-19
Abstract:
A variation of Kublanovskaya's nonlinear QR method for solving banded nonlinear eigenvalue problems is presented in this article. The new method is iterative and specifically designed for problems too large to use dense linear algebra techniques. For the unstructurally banded nonlinear eigenvalue problem, a new data structure is used for storing the matrices to keep memory and computational costs low. In addition, an algorithm is presented for computing several nearby nonlinear eigenvalues to already-computed ones. Finally, numerical examples are given to show the efficacy of the new methods, and the source code has been made publicly available.
Type of Medium:
Online Resource
ISSN:
0098-3500
,
1557-7295
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2017
detail.hit.zdb_id:
2006421-4
detail.hit.zdb_id:
191812-6
