English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93190/123562 (75%)
Visitors : 27641937      Online Users : 247
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/27157
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/27157

    Title: Two-Phase Semi-Asynchronous Parallel Iterative Methods For The Symmetric Linear Complementarity Problems
    Authors: 楊建民;張泰生
    Yang,Jiann-Min;Chang, Tai-Sheng
    Date: 1992-09
    Issue Date: 2009-01-17 16:15:49 (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:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    595.pdf971KbAdobe PDF351View/Open

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

    社群 sharing

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