Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices

DOI10.1007/s00607-001-1435-8zbMath1006.65032OpenAlexW2079086114MaRDI QIDQ1614973

R. Smith

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

zbMATH Keywords

convergencenumerical examplespolynomial eigenvalue problemdescent iterationgeneralized damped Gauss-Newton methodgeneralized damped Newton method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items (2)

Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems ⋮ Model-order reduction of large-scalekth-order linear dynamical systems via akth-order Arnoldi method

This page was built for publication: Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices