引用本文: | 成礼智,蒋增荣.拟带宽 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[点击复制] |
|
|
|
本文已被:浏览 6339次 下载 6018次 |
拟带宽 Toeplitz 系统的秩 1 修正算法 |
成礼智, 蒋增荣 |
(国防科技大学 系统工程与数学系 湖南 长沙 410073)
|
摘要: |
本文以带宽 Toeplitz系统的快速并行解法为基础,通过建立秩 1 的修正格式讨论了拟带宽 Toeplitz 系统的一种快速并行算法,其串行运算量为 9nh+O (h). 设p为处理机台数,当p≤n时,并行运算量为[n/p] (15/4 h2log2n+O (1));当p=3n时,运算量2h2log2n+O(1),其中 h 表示拟带宽宽度。 |
关键词: Toeplitz 系统,并行算法,秩 1 修正 |
DOI: |
投稿日期:1994-10-10 |
基金项目:国防预研基金项目资助 |
|
Rank-l Updating Algorithm for Near Banded Toeplitz Systems |
Cheng Lizhi, Jiang Zengrong |
(Department of Systems Engineering and Mathematics)
|
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. |
Keywords: Toeplitz systems,parallel algorithm,rank-1 updating |
|
|