Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/90190
DC FieldValueLanguage
dc.contributor.advisor王太林zh_TW
dc.contributor.author黃建發zh_TW
dc.creator黃建發zh_TW
dc.date1990en_US
dc.date1989en_US
dc.date.accessioned2016-05-03T06:17:43Z-
dc.date.available2016-05-03T06:17:43Z-
dc.date.issued2016-05-03T06:17:43Z-
dc.identifierB2002005455en_US
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/90190-
dc.description碩士zh_TW
dc.description國立政治大學zh_TW
dc.description應用數學系zh_TW
dc.description.abstractQR 算則是目前常用的一種計算矩陣特徵值的方法,而適當的運用位移可增加比算則的收斂速度,本文探討五種己知的位移,並提出二種新位移.我們首先對各種位移做摘要性的探討及其收斂性的研究,其次舉出一些例子以說明各位移的利弊及其相互間的比較,並就下列三類方式對位移做排行:zh_TW
dc.description.tableofcontents0 Introduction.....................................1\r\n1 Preliminary\r\n1.1 The QR Algorithm............................2\r\n1.2 The Importance of Shifts...........................3\r\n2 Shift Strategies ...........................5\r\n3 Analysis\r\n3.1 The Optimal Shift...........................11\r\n3.2 The Modified Optimal Shift...........................16\r\n3.3 The Third-order Shift ...........................20\r\n4 NumericaI Examples\r\n4.1 The Mixed Shift...........................24\r\n4.2 Comparison of Shifts ...........................25\r\n4.3 Properties of Convergence ...........................27\r\n4.4 Estimate of Eigenvalues ...........................28\r\n5 Conclusions ...........................31\r\nAppendix ...........................33\r\nReferences...........................41zh_TW
dc.source.urihttp://thesis.lib.nccu.edu.tw/record/#B2002005455en_US
dc.title三對角QR算則之位移策略zh_TW
dc.titleShifts of origin for the real symmetric tridiagonal QR algorithmen_US
dc.typethesisen_US
dc.relation.reference[Da] Bernard Danloy (1986). \"Improved Strategies of Shift for the QL Algorithm and for Inverse Iteration in the Symmetric Case,\"Department of Pure and Applied Mathematics Chemin du Cyclotron,2, 1348 Louvain-la-Neuve Belgium, unpublished paper.\r\n[DT] T. J. Dekker and J. F. Traub (1971). \"The Shifted QR Algorithm for Hermitian Matrices,\" 1. Linear Algebra Appl. 4, p137--54.\r\n[HP] W. Hoffman and B. N. Parlett (1978). \"A New Proof of Global Convergence for the Tridiagonal QL Algorithm,\" SIAM. J. Numer.Anal. 15, p929-37.\r\n[JZ] Jiang Erxiong and Zhang Zhenyue (1985). \"A New shift of the QL Algorithm for Irreducible Symmetric Tridiagonal Matrices,\" J. Linear Algebra Appl. 65, p261-72.\r\n[Pa] B. N. Parlett (1980). The Symmetric Eigenvalue Problem, PrenticeHall, Englewood Cliffs, N.J.\r\n[Sa] Youcef Saad (1974). \"Shifts of Origin for the QR Algorithm,\"Toronto: Pro. IFIP Congress.\r\n[Wa] Tai-Lin Wang (1988). Unpublished manuscripts.\r\n[Wi1] J. H. Wilkinson (1965). The Algebraic Eigenvalue Problem,Clarendon Press, Oxford.\r\n[Wi2] J. H. Wilkinson (1968). \"Global Convergence of Tridiagonal QR Algorithm with Origin Shifts,\" 1. Linear Algebra Appl. I, p409-20.zh_TW
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairetypethesis-
item.openairecristypehttp://purl.org/coar/resource_type/c_46ec-
item.cerifentitytypePublications-
Appears in Collections:學位論文
Files in This Item:
File SizeFormat
index.html113 BHTML2View/Open
Show simple item record

Google ScholarTM

Check


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