Convergence Analysis of ARD Algorithm

Q2 Computer Science

自动化学报 Pub Date : 2014-05-01 DOI:10.1016/S1874-1029(14)60011-2

Guang-Hui CHENG

引用次数: 1

Abstract

A convergence analysis of the altering row diagonalization (ARD) algorithm is made in this paper. Based on the convergence analysis, we present some advice on how to choose the initial matrix, and give a new terminal condition of the algorithm. For cross validating our analysis, three examples are also given.

查看原文本刊更多论文

ARD算法收敛性分析

本文对改变行对角化(ARD)算法的收敛性进行了分析。在收敛性分析的基础上，给出了初始矩阵的选择建议，并给出了该算法的一个新的终止条件。为了交叉验证我们的分析，还给出了三个例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

自动化学报 Computer Science-Computer Graphics and Computer-Aided Design

CiteScore

4.80

自引率

0.00%

发文量

6655

期刊介绍： ACTA AUTOMATICA SINICA is a joint publication of Chinese Association of Automation and the Institute of Automation, the Chinese Academy of Sciences. The objective is the high quality and rapid publication of the articles, with a strong focus on new trends, original theoretical and experimental research and developments, emerging technology, and industrial standards in automation.