English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51713802      Online Users : 719
RC Version 6.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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大機構典藏 > 政大學報 > 第65期 > 期刊論文 >  Item 140.119/102861


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/102861


    Title: Two-Phase Semi-Asynchronous Parallel Iterative Methods for the Symmetric Linear Complementarity Problems
    Authors: 楊建民;張泰生
    Yang, Jiann-Min;Chang, Tai-Sheng
    Contributors: 資管系;應數系
    Date: 1992-09
    Issue Date: 2016-10-17 15:31:07 (UTC+8)
    Abstract: 在本文中，我們提出了一個在求解對稱線性互補問題上的二階段半非同步平行演算法。此法的求解程序可分成一連串交互的兩個演算階段。在第一階段中，我們進行完全非同步的演算，亦即，無論是各處理器在更新疊代解的次數上，或是各處理器之間的通訊次序上，都完全沒有任何的限制；而在第二階段的演算中，我們僅執行一個簡單的線性搜索步驟。此演算法大大地減少了因同步化及通訊上所產的冗額成本，因此增進了演算法的效率；而且由於此法在更新疊代解的演算中，擷取了大部份最新的資訊，也因而加快了收斂速度。至於在建立此法的收斂理論上，我們僅須對線性搜索範圍給予一微弱的限制，即可保證此半非同步演算過程，終將收斂到線性互補問題的解。我們將此法在IBM 3090的機器上模擬執行，並應用於求解一個由二次規劃所導出之對稱線性互補問題，其數值結果亦顯示出此法優於一些同步的平行疊代法。
    In this paper, we propose a two-phase semi-asynchronous parallel iterative method for solving the symmetric linear complementarity problem. The solution process is divided into 1st-phase and 2nd-phase alternatingly. In the 1st- phase, we allow the process to be completely asynchronous. That is. the computation for new iterate on separate processors and communication in between them could be absolutely tree and chaotic. We impose essentially no restrictions on the ordering and the number of times of such iterate updating and information exchanging among processors. In the 2nd-phase. we simply perform a line search. The method dramatically reduces the overhead arising from synchronization and communication. Moreover, the process has always used and taken advantage of the most recent information available, when updating the iterate. Convergence of the overall scheme is established under a mild restriction on the range of the line search. The method is simulated and implemented on the IBM 3090 machine for solving the symmetric linear complementarity problem arising from the constrained convex quadratic program. Numerical results are also reported.
    Relation: 國立政治大學學報, 65,595-612
    Data Type: article
    Appears in Collections:[第65期] 期刊論文

    Files in This Item:

    File Description SizeFormat
    fb160920112959.pdf971KbAdobe PDF2400View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 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 ©   - Feedback