拟带宽Toeplitz系统的秩1修正算法

Rank-1 Updating Algorithm for Near Banded Toeplitz Systems

本文以带宽Ｔｏｅｐｌｉｔｚ系统的快速并行解法为基础，通过建立秩１的修正格式讨论了拟带宽Ｔｏｅｐｌｉｔｚ系统的一种快速并行算法，其串行运算量为９ｎｈ＋Ｏ（ｈ）．设ｐ为处理机台数，当ｐ≤ｎ时，并行运算量为 ；当ｐ＝３ｎ时，运算量为２ｈ￣２ｌｏｇ２ｎ＋Ｏ（１），其中ｈ表示拟带宽宽度。

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-1 updating strategy,the serial times are 9nh+O (h),let p be the number of processor,when p≤n,parallel times are,when p=3n, parallel times are 2h2log2n+O(1),where h is bandwidth.