求超定线性方程组T-解的一类DP型算法的构造

Construction of DP—Type Algorithms for Finding T—Solution of Overdetermined Systems of Linear Equations

本文对文[1]提出的用有限次最小二乘法求超定线性方程组的T—解的定向扰动(DP)过程进行了改善,给出了确定扰动解的更一般的方法.例如用A^T或单位阵E代替原过程中使用的广义逆A^+均可得到同样结果.这样,在应用上可大大简化程序,节约计算时间;在理论上和算法的构造上则更具一般性.

This paper refines upon the process of Directional Perturbation(DP)Algorithm which was proposed by [1]. More general DP-Type Algorithms are given. Consequently DP-Type algorithms are simpler and more economical for computing T-solution than DP-Algorithm in [1].