Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
From MaRDI portal
Publication:1614973
DOI10.1007/s00607-001-1435-8zbMath1006.65032MaRDI QIDQ1614973
Publication date: 10 September 2002
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-001-1435-8
convergence; numerical examples; polynomial eigenvalue problem; descent iteration; generalized damped Gauss-Newton method; generalized damped Newton method
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65H17: Numerical solution of nonlinear eigenvalue and eigenvector problems
Related Items
Model-order reduction of large-scalekth-order linear dynamical systems via akth-order Arnoldi method, Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems