.png){kind=icon}
返回
A new fast QR algorithm based on a priori errors
.png){kind=icon}
PRE
AI
DOI：10.1109/97.641395.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter presents a new fast QR algorithm based on Givens rotations using a priori errors, The principles behind the triangularization of the weighted input data matrix via QR decomposition and the type of errors used in the updating process are exploited in order to investigate the relationships among different fast algorithms of the QR family, These algorithms are classified according to a general framework and a detailed description of the new algorithm is presented.
Keyword:
adaptive filters
fast QR decomposition
recursive least squares
RLS algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
.png){kind=icon}
