論文使用權限 Thesis access permission:校內校外均不公開 not available
開放時間 Available:
校內 Campus:永不公開 not available
校外 Off-campus:永不公開 not available
論文名稱 Title |
解大型稀疏矩陣之演算法實作 The Implement of The Algorithm to solve Large Sparse Linear Systems |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
31 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2004-07-14 |
繳交日期 Date of Submission |
2005-07-28 |
關鍵字 Keywords |
稀疏矩陣、線性系統 sparse linear system, CGS |
||
統計 Statistics |
本論文已被瀏覽 5646 次,被下載 0 次 The thesis/dissertation has been browsed 5646 times, has been downloaded 0 times. |
中文摘要 |
當電腦不停進步,過去許多無法計算的難題都有了解答的機會,計算線性系統的解一直都是數學家與電腦學家的目標。從一九五零年代左右發表了許許多多的論文在討論這個問題。當所要解的線性系統越來越大,所需要的電腦效能也越來越大。以至於求出大型線性系統的解成為一個困難的問題。到了現在,這個問題也漸漸露出曙光。 在本論文中,將探討幾個專門用來求得線性系統解的演算法,以及它們提出的背景與想法,並且加以實作。 |
Abstract |
As computers keeping advancing, many difficult problems which were unable to compute formerly now have the chance to get answered. It is always the goal of mathematicians and computer scientists to compute and get the answers of the linear systems. Since 1950s, there have been a lot of published papers discussing the issue. As the linear systems larger and larger, the computer efficiency required is higher and higher, so that it is very difficult to get the answers of large linear systems. Now, the problems are showing aurora. In this dissertation, several mathematical calculations to compute the linear systems will be discussed, as well as their background and theory. Moreover, they will also be practiced. |
目次 Table of Contents |
Chapter 1 序論 ……………………………………………… 5 1.1 研究動機 ……………………………………………… 5 1.2 研究目標 ……………………………………………… 8 Chapter 2 各種演算法的簡介 ……………………………… 10 Chapter 3各類演算法及pseudocode ……………………… 12 3.1 Conjugate Gradient method ……………………… 12 3.2 Bi-Conjugate Gradient method …………………… 14 3.3 Squaring the Conjugate Gradient method ……… 16 Chapter 4 實作的過程 ……………………………………… 18 4.1 CGS algorithm …………………………………………19 4.2 驗證解的正確性 ……………………………………… 19 Chapter 5 實作數據 ………………………………………… 21 5.1 在實數系上的實驗 …………………………………… 22 5.2 在GF(2)上的實驗 ………………………………………23 Chapter 6 結論與討論 ……………………………………… 28 參考文獻 ……………………………………………………… 30 |
參考文獻 References |
[1].R. Barrett and M. Berry etc. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM,Philadelphia. 1994 [2].R.Fletcher. Conjugate Gradient Methods for Indefinite Systems, Lecture Notes in Mathematics 506, Springer-Verlag, Berlin, Heidelberg, New York, 1976, pp73-89 [3].P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 10(1989), pp 36-52. [4].-,Solution of systems of linear equations by minimized iterations, J. Res. Nat. Bur. Stand., 49(1952), pp. 33-53. [5].C.Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Stand., 45(1950), pp. 255-282 [6] Positive Definite Matrix, mathworld, http://mathworld.wolfram.com/PositiveDefiniteMatrix.html |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:校內校外均不公開 not available 開放時間 Available: 校內 Campus:永不公開 not available 校外 Off-campus:永不公開 not available 您的 IP(校外) 位址是 18.216.220.21 論文開放下載的時間是 校外不公開 Your IP address is 18.216.220.21 This thesis will be available to you on Indicate off-campus access is not available. |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |