政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/36398
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 112879/143845 (78%)
造访人次 : 50046089      在线人数 : 288
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/36398


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/36398


    题名: 移位QR算則在三對角矩陣上之收斂
    Convergence of the Shifted QR Algorithm on Tridiagonal Matrices
    作者: 蔡淑芬
    Tsai ,Shu-Fen
    贡献者: 王太林
    Wang ,Tai-Lin
    蔡淑芬
    Tsai ,Shu-Fen
    关键词: QR Algorithm
    Tridiagonal
    日期: 2003
    上传时间: 2009-09-18 18:28:39 (UTC+8)
    摘要: 在計算矩陣的特徵值(eigenvalues)中,QR演算法是一種常見的技巧. 尤其如果使用適當的移位,將可以較快得到特徵值. 在本文中提出一種新的移位策略, 我們證明這各方法是可行的,而且可適用於任何矩陣. 換句說, 本篇論文主旨即是提出有關新的移位QR演算法的收斂.
    The QR algorithm is a popular method for computing all the
    eigenvalues of a dense matrix. If we use a proper shift, we can
    accelerate convergence of the iterative process. Hence, we design a new shift strategy which includes an eigenvalue of the trailing principal 3-by-3 submatrix of the tridiagonal matrix. We prove the global convergence of the new strategy. In other words, the purpose of this thesis is to propose a theory of the convergence of a new shifted QR algorithm.
    Abstract i
    中文摘要 ii
    1 Introduction 1

    2 Preliminaries 2
    2.1 Notation 2
    2.2 The shifted QR algorithm 2
    2.3 Shift strategies 4
    2.4 The convergence of sequences 5

    3 A Residual Estimate 5

    4 Convergence of the QR Iteration 8

    5 Conclusions and Future Work 11

    Reference 12

    Appendix 14
    參考文獻: T. K. Dekker and J. F. Traub, The shifted QR algorithm for Hermitian matrices, Linear Algebra Appl., 4 (1971), pp. 137-154.
    James Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
    K. Gates and W. B. Gragg, Notes on TQR algorithms, J. Comput. Appl. Math., 86 (1997), pp. 195-203.
    G. H. Golub and C. F. Van Loan, Matrix Computations}, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
    W. Hoffmann, B.N. Parlett, A new proof of global convergence for
    the tridiagonal QL algorithm}, SIAM J. Numer. Anal., 15 (1978), pp. 929-937.
    E. Jiang and Z. Zhang, A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices}, Linear Algebra Appl., 65 (1985), pp. 261-272.
    B. N. Parlett, The Symmetric Eigenvalue Problem, revised ed., SIAM, Philadelphia, PA, 1998.
    Y. Saad, Shifts of origin for the QR algorithm, Proceedings IFIP
    Congress, Toronto, 1974.
    G. Thomas and R. Finney, Calculus and Analytic Geometry, 9th ed., Addison-Wesley publishing company, 1996.
    T.-L. Wang, Convergence of the tridiagonal QR algorithm, Linear Algebra Appl., 322 (2001), pp. 1-17.
    J. H. Wilkinson, Global convergence of tridiagonal QR algorithm
    with origin shifts, Linear Algebra Appl., 1 (1968), pp. 409-420.
    描述: 碩士
    國立政治大學
    應用數學研究所
    90751008
    92
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0090751008
    数据类型: thesis
    显示于类别:[應用數學系] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML2206检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈