| 解循环三对角线性方程组的追赶法 |
| |
| 引用本文： | 李青,王能超. 解循环三对角线性方程组的追赶法[J]. 小型微型计算机系统, 2002, 23(11): 1393-1395 |
| |
| 作者姓名： | 李青 王能超 |
| |
| 作者单位： | 1. 上海大学,计算机工程与科学学院,上海,200072
2. 华中科技大学,并行计算研究所,湖北,武汉,430074 |
| |
| 基金项目： | 国家自然科学基金(编号60073044)资助;上海市高等学校科学技术发展基金项目资助 |
| |
| 摘 要： | 循环三对角、循环 Toeplitz三对角线性方程组的求解在科学与工程计算中有着广泛的应用 .运用矩阵分解给出此类方程组的直接解法 ;通过分析其特性 ,给出了达到机器精度的截断算法 ,其计算复杂度几乎等同于求解一个三对角线性方程组的计算复杂度 .数值实验的结果与理论分析的结果十分吻合 .该算法还推广到求解拟三对角线性方程组 .
|
| 关 键 词： | 循环三对角线性方程组 矩阵分解 机器精度 |
| 文章编号： | 1000-1220(2002)11-1393-03 |
An Algorithm for Solving Circulant Tridiagonal Systems |
| |
| LI Qing ,WANG Neng-chao. An Algorithm for Solving Circulant Tridiagonal Systems[J]. Mini-micro Systems, 2002, 23(11): 1393-1395 |
| |
| Authors: | LI Qing WANG Neng-chao |
| |
| Affiliation: | LI Qing 1,WANG Neng-chao 2 1 |
| |
| Abstract: | An algorithm for solving circulant tridiagonal systems is proposed. The algorithm is based on the direct factorization of coefficient matrix. When the system is diagonally dominant, the truncated version of this algorithm provides an approximate solution which equals to the exact solution within machine accuracy and the number of its arithmetic operations is O(8n) -- nearly the same as the number of arithmetic operations for solving a tridiagonal system. The analytic results match closely with the results measured from the numerical experiments. |
| |
| Keywords: | circulant tridiagonal linear systems diagonally dominant machine accuracy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
