Rank-l Updating Algorithm for Near Banded Toeplitz Systems
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper,we describe a new fast parallel solution for near banded Toeplitz systems based on fast solution to banded Toeplitz systems and rank-l updatìng strategy,the serial times are 9nh +0(h),let p be the number of processor,when p≤n, parallel times are [n/p] (15/4 h2log2n+O(1),when p=3n, parallel times are 2h2log2n+ O(1),where his bandwidth.

    Reference
    Related
    Cited by
Get Citation

Cheng Lizhi, Jiang Zengrong. Rank-l Updating Algorithm for Near Banded Toeplitz Systems[J]. Journal of National University of Defense Technology,1995,17(1):104-108.

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 10,1994
  • Revised:
  • Adopted:
  • Online: June 11,2014
  • Published:
Article QR Code