Year: 2016
Type: article
Abstract: Finding approximations to the eigenvalues of non-linear eigenvalue problems is a common problem which arises from many complex applications. In this paper, iterative algo-rithms for finding approximations to the eigenvalues of nonlinear eigenvalue problems are verified. These algorithms use an efficient numerical approach for calculating the first and second deriva-tives of the determinant of the problem. Here we present and examine a technique for solving nonlinear eigenvalue problems using Newton method. Computational aspects of this approach for a nonlinear eigenvalue problem are analyzed. The efficiency of the algorithm is demonstrated using an example.
Authors: S.A Shahzadeh, F. Rabiei
Institution: Yazd University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2527779682