| 解线性方程组的子空间直交基裂分法 |
| |
| 引用本文： | 汤兴华,黄红伟,马乐荣. 解线性方程组的子空间直交基裂分法[J]. 云南大学学报(自然科学版), 2003, 25(4): 299-302 |
| |
| 作者姓名： | 汤兴华 黄红伟 马乐荣 |
| |
| 作者单位： | 云南大学,数学系,云南,昆明,650091 |
| |
| 摘 要： | 提出了一种解线性方程组的新方法,目的在于降低方程组的阶数进行计算,比Schur算法在计算量方面大为减少,特别对阶数越高稀疏性越强的方程组计算量的减少越为显著,并且该方法的算法比较简单,是一个有效的算法,在实用和理论上都有一定意义;最后在计算机上举数值例子与Schur方法进行比较.
|
| 关 键 词： | 线性方程组 解法 直交基裂分法 |
| 文章编号： | 0258-7971(2003)04-0299-04 |
| 修稿时间： | 2002-11-19 |
Solution of linear equation system based on splitting orthogonal basis in subspace |
| |
| TANG Xin-hua,HUANG Hong-wei,MA Le-rong. Solution of linear equation system based on splitting orthogonal basis in subspace[J]. Journal of Yunnan University(Natural Sciences), 2003, 25(4): 299-302 |
| |
| Authors: | TANG Xin-hua HUANG Hong-wei MA Le-rong |
| |
| Affiliation: | Department of Mathematical, Yunnan University, Kunming 650091, China |
| |
| Abstract: | A new method for solving linear equation system is proposed,and the aim is to decline the order of equation system to solve.The working capacity of the solution is greatly less than the Schur algorithm.Especially with the increasing of order and the openness,the reducing of working capacity is very predominant;in addition,the algorithm is very simple and efficient.It has an effect in application and theory.Finally an instance is given to compare with the Schur algorithm by computer. |
| |
| Keywords: | linear equation system solution splitting orthogonal basis in subspace |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《云南大学学报(自然科学版)》下载全文 |
|
