摘要
本文提出了变形T—型方程组的一种快速算法,所需乘、加运算量为O(N2),比已有的常见解法(如高斯消去法)运算量少了一个数量级,其中N表示方程组的阶。
In this paper, a concept of bi-Toeplitz matrix is introduced and a fast algorithm for solving bi-Toeplitz systems is proposed. The total number of operations is O(N^2). There, N is the order of bi-Toeplitz matrix.
出处
《计算技术与自动化》
2003年第4期44-46,58,共4页
Computing Technology and Automation