| 一种判断LR分解是否存在的优化算法 |
| |
| 引用本文： | 沈家铭. 一种判断LR分解是否存在的优化算法[J]. 长春工业大学学报(自然科学版), 2014, 0(5): 593-596 |
| |
| 作者姓名： | 沈家铭 |
| |
| 作者单位： | 四川大学数学学院,四川成都610065 |
| |
| 摘 要： | 使用定理直接判断方阵A是否存在LR分解的计算难度系数为O(n3),文中在此基础上提出了一个改进算法,将计算难度降为O(n2)。给出了设计思路及推导方法,并用Matlab实现了两种算法,通过例题验证了计算效率的提升。
|
| 关 键 词： | LR分解 方阵 算法 Matlab |
An optimization algorithm to determine the existence of LR decomposition |
| |
| SHEN Jia-ming. An optimization algorithm to determine the existence of LR decomposition[J]. , 2014, 0(5): 593-596 |
| |
| Authors: | SHEN Jia-ming |
| |
| Affiliation: | SHEN Jia-ming (School of Mathematics, Sichuan University, Chengdu 610065, China) |
| |
| Abstract: | Since the calculating difficulty coefficient of LR decomposition is O （n^3 ） , by using the theorem to judge whether phalanx A exists ,here we put forward an improved algorithm to reduce the calculating difficulty coefficient to O（n^2 ） .Design and derivation method are given ,and two algorithms are implemented with matlab .The calculation efficiency improvement is verified with examples . |
| |
| Keywords: | LR decomposition phalanx algorithm Matlab |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
