English  |  正體中文  |  简体中文  |  Items with full text/Total items : 66984/66984 (100%)
Visitors : 22947247      Online Users : 406
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/7843


    Title: C++物件導向之數值方法在叢集電腦上的應用;C++ object-oriented programming with CG in PC Cluster
    Authors: 陳美華;Mei-Hua Chen
    Contributors: 數學研究所
    Keywords: 叢集電腦;平行;共軛梯度法;稀疏矩陣;物件導向;Object-Oriented;Sparse Matrix;PC Cluster;MPI;Parallel;Conj;C++
    Date: 2004-06-16
    Issue Date: 2009-09-22 11:06:55 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在本篇論文中,我們採用c++物件導向程式設計的方式,並利用最常使用的數值方法(conjugate gradient method),來解 Ax = b 的問題;由於,經由Finite Difference Method或者是Finite Element Method所產生的矩陣,都是Sparse Matrix ,本論文將列七種sparse matrix的儲存方式,來處理Sparse Matrix的問題;但是,在做conjugate gradient method 時, 我們發現,需要花相當多的時間在做矩陣乘向量的乘法上,當矩陣愈大時,所花的時間也相對的多,因此,我們將利用叢集電腦系統,搭配使用MPI函式庫,對此種求解的方法做平行化;在此,我們只將兩種稀疏矩陣的儲存格式平行化。並且舉兩個數值範例,在平行化之後,看看在效能上是否有提升。 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.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File SizeFormat
    0KbUnknown891View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明