Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

A NEW GENERALIZED ASYNCHRONOUS PARALLEL MULTISPLITTING ITERATION METHOD

Zhong-zhi Bai
Journal of Computational Mathematics
Vol. 17, No. 5 (SEPTEMBER 1999), pp. 449-456
Stable URL: http://www.jstor.org/stable/43692802
Page Count: 8
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A NEW GENERALIZED ASYNCHRONOUS PARALLEL MULTISPLITTING ITERATION METHOD
Preview not available

Abstract

For the large sparse systems of linear and nonlinear equations, a new class of generalized asynchronous parallel multisplitting iterative method is presented, and its convergence theory is established under suitable conditions. This method not only unifies the discussions of various existing asynchronous multisplitting iterations, but also affords new algorithmic and theoretical results for the parallel solution of large sparse system of linear equations. Besides its generality, this method is also much more suitable for implementing on the MIMD multiprocessor systems.

Page Thumbnails

  • Thumbnail: Page 
[449]
    [449]
  • Thumbnail: Page 
450
    450
  • Thumbnail: Page 
451
    451
  • Thumbnail: Page 
452
    452
  • Thumbnail: Page 
453
    453
  • Thumbnail: Page 
454
    454
  • Thumbnail: Page 
455
    455
  • Thumbnail: Page 
456
    456