Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T02:34:13.026Z Has data issue: false hasContentIssue false

Homotopy continuation method for the numerical solutions of generalised symmetric eigenvalue problems

Published online by Cambridge University Press:  17 February 2009

W. W. Lin
Affiliation:
Institute of Applied Maths., Tsing Hua University, Hsinchu, Taiwan, Republic of China.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a generalised symmetric eigenvalue problem Ax = λMx, where A and M are real n by n symmetric matrices such that M is positive semidefinite. The purpose of this paper is to develop an algorithm based on the homotopy methods in [9, 11] to compute all eigenpairs, or a specified number of eigenvalues, in any part of the spectrum of the eigenvalue problem Ax = λMx. We obtain a special Kronecker structure of the pencil A − λM, and give an algorithm to compute the number of eigenvalues in a prescribed interval. With this information, we can locate the lost eigenpair by using the homotopy algorithm when multiple arrivals occur. The homotopy maintains the structures of the matrices A and M (if any), and the homotopy curves are n disjoint smooth curves. This method can be used to find all/some isolated eigenpairs for large sparse A and M on SIMD machines.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1991