杨中华, 薛毅. 一个超定线性立程组的L逼近算法[J]. 北京工业大学学报, 1991, 17(4): 62-67,75.
    引用本文: 杨中华, 薛毅. 一个超定线性立程组的L逼近算法[J]. 北京工业大学学报, 1991, 17(4): 62-67,75.
    Yang Zhonghua, Xue Yi. A New Algorithm for L Approximation to Overdetermined Linear System[J]. Journal of Beijing University of Technology, 1991, 17(4): 62-67,75.
    Citation: Yang Zhonghua, Xue Yi. A New Algorithm for L Approximation to Overdetermined Linear System[J]. Journal of Beijing University of Technology, 1991, 17(4): 62-67,75.

    一个超定线性立程组的L逼近算法

    A New Algorithm for L Approximation to Overdetermined Linear System

    • 摘要: 就求解超定线性方程组残量的l-范数极小化问题提出了一个新算法,该算法属于直接下降算法。可在有限步内得到函数的极小点,它具有算法简单,便于计算机实现等优点。

       

      Abstract: The algorithm, proposed for the computation of overdetermmed linear system with minimized L-morn of the residual vector, is a direct descent method which minimizes the function in finite number of steps and is similar to that used in our algorithm for L-problem. The algorithm, simple and convenient, is closely related to the active set method for solving linear programming. Finally the performance of the algorithm is demonstrated by solving a number of numerical examples on the IBM-PC micro-computer.

       

    /

    返回文章
    返回