航空学报 > 1989, Vol. 10 Issue (9): 511-516

求解线性矛盾方程组的递推Householder变换法

刘整社, 陈宗基, 文传源   

  1. 北京航空航天大学
  • 收稿日期:1987-12-20 修回日期:1900-01-01 出版日期:1989-09-25 发布日期:1989-09-25

A RECURSIVE HOUSEHOLDER TRANSFORMATION ALGORITHM FOR SOLVING LINEAR OVER-DETERMINED EQUATIONS

Liu Zhengshe, Chen Zongji, Wen Chuanyuan   

  1. Beijing University of Aeronautics and Astronautics
  • Received:1987-12-20 Revised:1900-01-01 Online:1989-09-25 Published:1989-09-25

摘要:

求解线性矛盾方程组是工程实践中经常遇到的问题。目前主要采用法方程组解法和基于各种正交变换的三角化解法。由于法方程组系数矩阵的病态条件数是原矛盾方程组系数矩阵病态条件数的平方,所以计算精度较差,有时甚至得到完全错误的结果。因此一些计算精度要求高的问题和高阶方程组的求解,多采用三角化法。但是,三角化法只能进行一次性处理,尚未出现随数据更新的实时递推算法。许多需要在线处理和数据存储最大的问题,只好采用一般递推最小二乘法。

关键词: 实时递推算法, 矛盾方程组, Househoider变换

Abstract:

A Real-time Householder transformation algorithm for solving linear overdetermined equations is proposed. The algorithm is more accurate than the Traditional Recursive Least Squares Algorithm (TRLSA)because the ill-condition is worsened by TRLSA. Another benefit of our algorithm is that its computational time is just about 2/n of TRLSA where n is the number of theunknown parameters.

Key words: real-time recursive algorithms over-determined equa- tions, householder transformation