Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/25511
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 18034/20233 (89%)
Visitors : 23633064      Online Users : 757
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
    CNU IR > Chna Nan Annual Bulletin > Vol.10 (1984) >  Item 310902800/25511
    Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/25511


    Title: 稀釋性矩陣圖論分析
    A Graphic Analysis of Sparse Matrix
    Authors: 沈清泉
    Contributors: 電算中心
    Date: 1984
    Issue Date: 2012-09-12 16:29:26 (UTC+8)
    Abstract: 今日科技之發達,已逐漸將計算機帶入人類之各頂生活領域上,尤其是對繁雜之數學計算,更非得靠計算機以便節省人類之體力,及不必要驗算的時間。以高斯消去法(Gaussian elimination)求解大型性聯立方程組,便是其中之一,因此如何建立一中心法則去撰寫計算機之軟體程式,是目前急待解決之問題。本文是以圖論分析探討大型、稀釋性線性聯立方程組AX = B在計算機以高斯消去法求解時,對係數距陣A在計算變換上,如何尋找樞軸元素及最佳樞軸元素次序。使所產生之新的非零元素為最少,以節省計算機儲存體之計算空間,而不必浪費不必要的儲存體空間以及所責鉅大耗時計算時間的再增加,同時並進而結合最佳之修正單純法(Simplex method ),去解大型之線性程式規劃之問題。修正單純法對於解大型線性程式規劃最有效,只是運用目前二元進位之計算機求其計算時,計算機之磁蕊線儲存器( Core- rope memory )即無足夠之儲存空間演算A-1,因此利用圖論結合處理計算問題,當屬必要,而產生新的同義矩陣A,可按本文探討之最佳樞軸元素次序做高斯消去法運算,雖耗時但很有效益。
    Relation: 嘉南學報 10期 : p.73-87
    Appears in Collections:[Chna Nan Annual Bulletin] Vol.10 (1984)

    Files in This Item:

    There are no files associated with this item.



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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback