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.

TWO ITERATION METHODS FOR SOLVING LINEAR ALGEBRAIC SYSTEMS WITH LOW ORDER MATRIX A AND HIGH ORDER MATRIX B: Y = (A ⊗ B) Y + ɸ

Shuang-suo Zhao, Zhang-hua Luo and Guo-feng Zhang
Journal of Computational Mathematics
Vol. 18, No. 4 (JULY 2000), pp. 419-430
Stable URL: http://www.jstor.org/stable/43692869
Page Count: 12
  • 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.
TWO ITERATION METHODS FOR SOLVING LINEAR ALGEBRAIC SYSTEMS WITH LOW ORDER MATRIX A AND HIGH ORDER MATRIX B: Y = (A ⊗ B) Y + ɸ
Preview not available

Abstract

This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A ⊗ B) Y + ɸ. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.

Page Thumbnails

  • Thumbnail: Page 
[419]
    [419]
  • Thumbnail: Page 
420
    420
  • Thumbnail: Page 
421
    421
  • Thumbnail: Page 
422
    422
  • Thumbnail: Page 
423
    423
  • Thumbnail: Page 
424
    424
  • Thumbnail: Page 
425
    425
  • Thumbnail: Page 
426
    426
  • Thumbnail: Page 
427
    427
  • Thumbnail: Page 
428
    428
  • Thumbnail: Page 
429
    429
  • Thumbnail: Page 
430
    430