Saved in:
Bibliographic Details
Main Author: Zhou, Yunkai
Format: Preprint
Published: 2004
Subjects:
Online Access:https://arxiv.org/abs/math/0402164
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917022861885440
author Zhou, Yunkai
author_facet Zhou, Yunkai
contents We discuss the close connection between eigenvalue computation and optimization using the Newton method and subspace methods. From the connection we derive a new class of Newton updates. The new update formulation is similar to the well-known Jacobi-Davidson method. This similarity leads to simplified versions of the Jacobi-Davidson method and the inverse iteration generalized Davidson (IIGD) method. We prove that the projection subspace augmented by the updating direction from each of these methods is able to include the Rayleigh quotient iteration (RQI) direction. Hence, the locally quadratic (cubic for normal matrices) convergence rate of the RQI method is retained and strengthened by the subspace methods. The theory is supported by extensive numerical results. Preconditioned formulations are also briefly discussed for large scale eigenvalue problems.
format Preprint
id arxiv_https___arxiv_org_abs_math_0402164
institution arXiv
publishDate 2004
record_format arxiv
spellingShingle Eigenvalue Computation from the Optimization Perspective: On Jacobi-Davidson, IIGD, RQI, and Newton Updates
Zhou, Yunkai
Numerical Analysis
65F15; 65F25
We discuss the close connection between eigenvalue computation and optimization using the Newton method and subspace methods. From the connection we derive a new class of Newton updates. The new update formulation is similar to the well-known Jacobi-Davidson method. This similarity leads to simplified versions of the Jacobi-Davidson method and the inverse iteration generalized Davidson (IIGD) method. We prove that the projection subspace augmented by the updating direction from each of these methods is able to include the Rayleigh quotient iteration (RQI) direction. Hence, the locally quadratic (cubic for normal matrices) convergence rate of the RQI method is retained and strengthened by the subspace methods. The theory is supported by extensive numerical results. Preconditioned formulations are also briefly discussed for large scale eigenvalue problems.
title Eigenvalue Computation from the Optimization Perspective: On Jacobi-Davidson, IIGD, RQI, and Newton Updates
topic Numerical Analysis
65F15; 65F25
url https://arxiv.org/abs/math/0402164