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.
参考文献
相似文献
引证文献
引用本文
成礼智,蒋增荣.拟带宽 Toeplitz 系统的秩 1 修正算法[J].国防科技大学学报,1995,17(1):104-108. 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.