Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
type: Item
instance of: scholarly article
title: Descent iterations for improving approximate eigenpairs of polynomial eigenvalue problems with general complex matrices
zbMATH Open document ID: 1006.65032
author: R. Smith
published in: Computing
publication date: 2002-09-10T00:00:00Z
review text: The paper is devoted to the study of two descent iterative methods, the generalized damped Newton method and the generalized damped Gauss-Newton method, both based on line search and designed to improve an approximate eigenvalue and the corresponding approximate eigenvector of polynomial eigenvalue problems with general complex matrices. To this end, it is supposed that an approximate eigenpair, obtained by a certain method, is available. Convergence theorems, without rate of convergence results, as well as numerical examples, are given. Finally, some empirical rate of convergence results are also mentioned.
reviewed by: Vasile Berinde
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65H17
zbMATH DE Number: 1798912
zbMATH Keywords: polynomial eigenvalue problem
zbMATH Keywords: descent iteration
zbMATH Keywords: generalized damped Newton method
zbMATH Keywords: generalized damped Gauss-Newton method
zbMATH Keywords: convergence
zbMATH Keywords: numerical examples
MaRDI profile type: Publication
full work available at URL: s00607-001-1435-8
OpenAlex ID: W2079086114
DOI: 10.1007/S00607-001-1435-8
description: scientific article; zbMATH DE number 1798912