首页 | 本学科首页   官方微博 | 高级检索  
     

一种采用Householder变换递归实现的复矩阵QR分解算法
引用本文:胡冰新,李宁,吕俊. 一种采用Householder变换递归实现的复矩阵QR分解算法[J]. 系统仿真学报, 2004, 16(11): 2432-2434
作者姓名:胡冰新  李宁  吕俊
作者单位:1. 解放军理工大学通信工程学院,南京,210007
2. 解放军理工大学科研部,南京,210007
摘    要:QR分解可以改善矩阵条件数,从而提高数值稳定性。由于传统的基于Householder变换的QR分解算法无法有效处理复数矩阵,限制了它的进一步应用。本文提出了一种复数形式的QR分解算法,该算法通过对传统算法进行修改,采用Householder变换递归实现了复矩阵的QR分解,修正后的算法公式可以有效处理复数信号,同时保持了实矩阵QR分解算法的良好性能。新的算法公式对于各种采用QR分解的应用均具有重要意义。通过对其在最小二乘问题中的应用进行仿真,验证了算法在复信号环境下的性能。

关 键 词:复数QR分解  Householder变换  最小二乘  数值稳定性
文章编号:1004-731X(2004)11-2432-03
修稿时间:2003-09-18

A Complex QR Decomposition Algorithm Using Recursive Householder Transformation
HU Bing-xin,LI Ning,LV Jun. A Complex QR Decomposition Algorithm Using Recursive Householder Transformation[J]. Journal of System Simulation, 2004, 16(11): 2432-2434
Authors:HU Bing-xin  LI Ning  LV Jun
Affiliation:HU Bing-xin1,LI Ning2,LV Jun 1
Abstract:QR decomposition can improve the condition number of a matrix and then improve the numerical stability. Because the conventional QR decomposition algorithm based on the Householder transformation cannot handle complex matrix effectively, the application of it is limited. A complex QR decomposition algorithm is proposed. By means of Householder transformation the QR decomposition of a complex matrix can be done recursively. Thereby complex signal data can be processed effectively through this new algorithm while maintaining the performance of its real counterpart. Simulation results in least square problems have demonstrated the validity of the proposed algorithm.
Keywords:complex QR decomposition   Householder transformation   least square   numerical stability  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号