DC 欄位 |
值 |
語言 |
DC.contributor | 數學系 | zh_TW |
DC.creator | 陳美華 | zh_TW |
DC.creator | Mei-Hua Chen | en_US |
dc.date.accessioned | 2004-6-21T07:39:07Z | |
dc.date.available | 2004-6-21T07:39:07Z | |
dc.date.issued | 2004 | |
dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=91221006 | |
dc.contributor.department | 數學系 | zh_TW |
DC.description | 國立中央大學 | zh_TW |
DC.description | National Central University | en_US |
dc.description.abstract | 在本篇論文中,我們採用c++物件導向程式設計的方式,並利用最常使用的數值方法(conjugate gradient method),來解 Ax = b 的問題;由於,經由Finite Difference Method或者是Finite Element Method所產生的矩陣,都是Sparse Matrix ,本論文將列七種sparse matrix的儲存方式,來處理Sparse Matrix的問題;但是,在做conjugate gradient method 時, 我們發現,需要花相當多的時間在做矩陣乘向量的乘法上,當矩陣愈大時,所花的時間也相對的多,因此,我們將利用叢集電腦系統,搭配使用MPI函式庫,對此種求解的方法做平行化;在此,我們只將兩種稀疏矩陣的儲存格式平行化。並且舉兩個數值範例,在平行化之後,看看在效能上是否有提升。 | zh_TW |
dc.description.abstract | In this paper,we use c++ object-oriented programming to design our program. We use OOP to solve conjugate gradient method in sparse matrix. we introduce severn sparse matrix format in this paper . And using MPI libery to parallel our program in PC Cluster . Then we analysis these result of data. | en_US |
DC.subject | 叢集電腦 | zh_TW |
DC.subject | 平行 | zh_TW |
DC.subject | 共軛梯度法 | zh_TW |
DC.subject | 稀疏矩陣 | zh_TW |
DC.subject | 物件導向 | zh_TW |
DC.subject | Object-Oriented | en_US |
DC.subject | Sparse Matrix | en_US |
DC.subject | PC Cluster | en_US |
DC.subject | MPI | en_US |
DC.subject | Parallel | en_US |
DC.subject | Conj | en_US |
DC.subject | C++ | en_US |
DC.title | C++物件導向之數值方法在叢集電腦上的應用 | zh_TW |
dc.language.iso | zh-TW | zh-TW |
DC.title | C++ object-oriented programming with CG in PC Cluster | en_US |
DC.type | 博碩士論文 | zh_TW |
DC.type | thesis | en_US |
DC.publisher | National Central University | en_US |