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

DOI10.1007/S00607-001-1435-8MaRDI QIDQ1614973zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• scientific article; zbMATH DE number 1694905
• A new inexact inverse subspace iteration for generalized eigenvalue problems
• Inexact inverse subspace iteration for generalized eigenvalue problems
• A generalized inexact Newton method for inverse eigenvalue problems

Cited in

(2)

• Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
• Model-order reduction of large-scale \(k\)th-order linear dynamical systems via a \(k\)th-order Arnoldi method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614973)