{"title":"ARD算法收敛性分析","authors":"Guang-Hui CHENG","doi":"10.1016/S1874-1029(14)60011-2","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 5","pages":"Pages 980-982"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60011-2","citationCount":"1","resultStr":"{\"title\":\"Convergence Analysis of ARD Algorithm\",\"authors\":\"Guang-Hui CHENG\",\"doi\":\"10.1016/S1874-1029(14)60011-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":35798,\"journal\":{\"name\":\"自动化学报\",\"volume\":\"40 5\",\"pages\":\"Pages 980-982\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60011-2\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"自动化学报\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1874102914600112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"自动化学报","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874102914600112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
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.
自动化学报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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
