加权配对最小二乘系统的快速求解
Fast solving of Weighted Pairing Least-Squares systems
摘要:
本文提出了一种推广的“加权最小二乘”(WLS),命名为“加权配对最小二乘”(WPLS),它使用一个矩形的权重矩阵,适用于数据对齐问题。研究了两种既适用于满秩系统又适用于亏秩系统的快速求解方法。计算实验清楚地表明,最好的方法,在速度,精度和数值稳定性,是基于一个特殊的{1,2,3}-逆,其计算减少到一个非常简单的推广通常的“Cholesky分解向后替代”方法求解线性系统。
英文摘要:
This paper presents a generalization of the "weighted least-squares" (WLS), named "weighted pairing least-squares" (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods, suitable for solving full rank systems as well as rank deficient systems, are studied. Computational experiments clearly show that the best method, in terms of speed, accuracy, and numerical stability, is based on a special {1, 2, 3}-inverse, whose computation reduces to a very simple generalization of the usual "Cholesky factorization-backward substitution" method for solving linear systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。