Research on LS Optimization Algorithm Based on QR Factorization
Author:
Affiliation:
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
|
文章评论
摘要:
本文对基于 QR 分解的 LS 优化算法进行研究，通过构造矩阵的方法，优化 Q 矩阵和 R 矩阵的计算算法，实现了对 LS 算法的优化，减少了算法对时间和空间资源的需求，并对算法进行了时间复杂度和空间复杂度分析，证明了该优化算法的有效性。
Abstract:
The research on LS optimization algorithm based on QR factorization is presented in this paper. A method which optimizes the calculation algorithm of Q and R matrices is obtained by constructing a matrix to optimize LS algorithm. The demand of time and space time is reduced and the time complexity and space complexity of the algorithm are analyzed. The result shows that the optimization algorithm is effective.
