The Generalized Singular Value Decomposition and the Method of Particular Solutions

Betcke, Timo (2008) The Generalized Singular Value Decomposition and the Method of Particular Solutions. SIAM J. Sci. Comp., 30 (3). pp. 1278-1295. ISSN 1095-7197

PDF SCE001278.pdf Download (268kB)

Abstract

A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name ``point matching method''. The implementation of this method usually depends on the solution of one of three types of linear algebra problems: singular value decomposition, generalized eigenvalue decomposition, or generalized singular value decomposition. We compare and give geometric interpretations of these different variants of the MPS. It turns out that the most stable and accurate of them is based on the Generalized Singular Value Decomposition. We present results to this effect and demonstrate the behavior of the generalized singular value decomposition in the presence of a highly ill-conditioned basis of particular solutions.

Item Type:	Article
Uncontrolled Keywords:	eigenvalues; method of particular solutions; point matching; subspace angles; generalized singular value decomposition
Subjects:	MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
Depositing User:	Dr. Timo Betcke
Date Deposited:	07 Apr 2008
Last Modified:	20 Oct 2017 14:12
URI:	https://eprints.maths.manchester.ac.uk/id/eprint/1073

Available Versions of this Item

• The Generalized Singular Value Decomposition and the Method of Particular Solutions. (deposited 29 Nov 2007)
  • The Generalized Singular Value Decomposition and the Method of Particular Solutions. (deposited 07 Apr 2008) [Currently Displayed]

Actions (login required)

View Item