2006.396: The Generalized Singular Value Decomposition and the Method of Particular Solutions
2006.396: Timo Betcke (2007) The Generalized Singular Value Decomposition and the Method of Particular Solutions.
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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:||MIMS Preprint|
SIAM J. Sci. Comp., to appear
|Uncontrolled Keywords:||eigenvalues; method of particular solutions; point matching; subspace angles; generalized singular value decomposition|
|Subjects:||MSC 2000 > 65 Numerical analysis|
|Deposited By:||Dr. Timo Betcke|
|Deposited On:||29 November 2007|
Available Versions of this Item
- The Generalized Singular Value Decomposition and the Method of Particular Solutions (deposited 07 April 2008)
- The Generalized Singular Value Decomposition and the Method of Particular Solutions (deposited 29 November 2007) [Currently Displayed]