Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/85501
DC FieldValueLanguage
dc.contributor.advisor王太林zh_TW
dc.contributor.advisorWang, Tai-Linen_US
dc.contributor.author鄭月雯zh_TW
dc.contributor.authorCheng, Yueh-Wenen_US
dc.creator鄭月雯zh_TW
dc.creatorCheng, Yueh-Wenen_US
dc.date2000en_US
dc.date.accessioned2016-04-18T08:31:54Z-
dc.date.available2016-04-18T08:31:54Z-
dc.date.issued2016-04-18T08:31:54Z-
dc.identifierA2002001743en_US
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/85501-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學系zh_TW
dc.description87751005zh_TW
dc.description.abstract設H是一個實數正交的矩陣,我們要求它的特徵值以及特徵向量。H可以表示成Schur參數的形式。根據Ammar,Gragg及Reichel的論文,我們把H的特徵問題轉換成兩個元素由Schur參數決定的二對角矩陣的奇異值(奇異向量)的問題。我們用這個方法寫成程式並且與CLAPACK的程式比較準確度及速度。最後列出一些數值的結果作為結論。zh_TW
dc.description.abstractLet H be an orthogonal Hessenberg matrix whose eigenvalues, and possibly eigenvectors, are to be determined. Then H can be represented in Schur parametric form [2]. Following Ammar, Gragg, and Reichel`s paper [1], we compute the eigenproblem of H by finding the singular values (and vectors) of two bidiagonal matrices whose elements are explicitly known functions of the Schur parameters. We compare the accuracy and speed of our programs using the method described aboved with those in CLAPACK. Numerical results conclude this thesis.en_US
dc.description.tableofcontents封面頁\r\n證明書\r\n致謝詞\r\n論文摘要\r\n目錄\r\n1 Introduction\r\n1.1 Schur parameterization\r\n2 Fundamental principles\r\n2.1 Computation of eigenvalues\r\n2.1.1 Introducing two symmetric tridiagonal matrices C and S\r\n2.1.2 Transforming C and S into bidiagonal form\r\n2.1.3 Singular value computing and numerical stability\r\n2.2 Computation of eigenvectors\r\n2.2.1 Finding the left singular vectors of C\r\n2.2.2 Determining the eigenvectors of C and S\r\n2.2.3 Transforming back to the eigenvectors of H\r\n3 Examples and numerical results\r\n3.1 Tested examples\r\n3.2 Numerical results of eigenvalues\r\n3.3 Numerical results of eigenvectors\r\n3.4 Conclusion\r\nAppendix\r\nReferenceszh_TW
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#A2002001743en_US
dc.subject正交矩陣的特徵問題zh_TW
dc.subjectSchur參數zh_TW
dc.subject奇異值問題zh_TW
dc.subjectorthogonal eigenproblemen_US
dc.subjectSchur parametersen_US
dc.subjectsingular value problemen_US
dc.subjectCLAPACKen_US
dc.titleComputing the Eigenproblem of a Real Orthogonal Matrixen_US
dc.typethesisen_US
dc.relation.reference[1] S. Ammar, W. B. Gragg, L. Reichel, On the Eigenproblem for Orthogonal Matrices, Proc. 25th IEEE Conference on Decision and Control, pp.1963--1966. Athens: Greece (1986).\r\n[2] W. B. Gragg, The QR Algorithm for Unitrary Hessenberg Matrices, J. Comput. Appl. Math. vol. 16, pp.1--8 (1986).\r\n[3] E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. Mckenney, S. Ostrouchov, D. Sorensen, LAPACK Users` Guide, 2nd ed., SIAM, Philadelphia (1995).\r\n[4] J. Demmel, W. Kahan, Computing Small Singular Values of Bidiagonal Matrices With Guaranteed High Relative Accuracy, SIAM J. Sci. Statist. Comput. vol. 11, no. 5, pp. 873--912 (1990).\r\n[5] W. B. Gragg, L. Reichel, A Divide and Conquer Method for Unitrary and Orthogonal Eigenproblems, Numer. Math. vol. 57, pp. 695--718 (1990).\r\n[6] G. S. Ammar, L. Reichel, D. C. Sorensen, An Implementation of a Divide and Conquer Algorithm for the Unitrary Eigenproblem, ACM Trans. Math. Softw. vol. 18, no. 3, pp. 292--307 (1992).\r\n[7] T. L. Wang, Lecture Notes on Basic Matrix Eigenproblem Computations with the QR Transformation, unpublished manuscript.\r\n[8] V. F. Pisarenko, The retrieval of harmonics from a covariance function, Geophys. J. R. Astr. Soc. vol. 33, pp. 347--366 (1973).zh_TW
item.grantfulltextopen-
item.openairetypethesis-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.fulltextWith Fulltext-
Appears in Collections:學位論文
Files in This Item:
File SizeFormat
index.html115 BHTML2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.