一种判断 LR 分解是否存在的优化算法

摘要

使用定理直接判断方阵A是否存在LR分解的计算难度系数为O（n3），文中在此基础上提出了一个改进算法，将计算难度降为 O（n2）。给出了设计思路及推导方法，并用Matlab实现了两种算法，通过例题验证了计算效率的提升。%Since the calculating difficulty coefficient of LR decomposition is O (n3 ) , 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(n2 ) .Design and derivation method are given ,and two algorithms are implemented with matlab .The calculation efficiency improvement is verified with examples .