Recursive Estimation in the Moving Window: Efficient Detection of the Distortions in the Grids with Desired Accuracy

A. Stotsky
{"title":"Recursive Estimation in the Moving Window: Efficient Detection of the Distortions in the Grids with Desired Accuracy","authors":"A. Stotsky","doi":"10.15377/2409-5761.2022.09.14","DOIUrl":null,"url":null,"abstract":"The development of fast convergent and computationally efficient algorithms for monitoring waveform distortions and harmonic emissions will be an important problem in future electrical networks due to the high penetration level of renewable energy systems, smart loads, new types of power electronics, and many others. Estimating the signal quantities in the moving window is the most accurate way of monitoring these distortions. Such estimation is usually associated with significant computational loads, which can be reduced by utilizing the recursion and information matrix properties. Rank two update representation of the information matrix allows the derivation of a new computationally efficient recursive form of the inverse of this matrix and recursive parameter update law. Newton-Schulz and Richardson correction algorithms are introduced in this paper to prevent error propagation and for accuracy maintenance. Extensive comparative analysis is performed on real data for proposed recursive algorithms and the Richardson algorithm with an optimally chosen preconditioner. Recursive algorithms show the best results in estimation with ill-conditioned information matrices.","PeriodicalId":335387,"journal":{"name":"Journal of Advances in Applied & Computational Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Applied & Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15377/2409-5761.2022.09.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The development of fast convergent and computationally efficient algorithms for monitoring waveform distortions and harmonic emissions will be an important problem in future electrical networks due to the high penetration level of renewable energy systems, smart loads, new types of power electronics, and many others. Estimating the signal quantities in the moving window is the most accurate way of monitoring these distortions. Such estimation is usually associated with significant computational loads, which can be reduced by utilizing the recursion and information matrix properties. Rank two update representation of the information matrix allows the derivation of a new computationally efficient recursive form of the inverse of this matrix and recursive parameter update law. Newton-Schulz and Richardson correction algorithms are introduced in this paper to prevent error propagation and for accuracy maintenance. Extensive comparative analysis is performed on real data for proposed recursive algorithms and the Richardson algorithm with an optimally chosen preconditioner. Recursive algorithms show the best results in estimation with ill-conditioned information matrices.
移动窗口中的递归估计:有效检测网格中的畸变并达到所需的精度
由于可再生能源系统、智能负载、新型电力电子等的高渗透水平,开发用于监测波形畸变和谐波发射的快速收敛和计算效率高的算法将成为未来电网的一个重要问题。估计移动窗口中的信号量是监测这些失真的最准确方法。这种估计通常伴随着大量的计算负荷,可以通过利用递归和信息矩阵特性来减少计算负荷。信息矩阵的二阶更新表示允许推导出一种新的计算效率高的递归形式的逆矩阵和递归参数更新规律。本文介绍了牛顿-舒尔茨和理查德森校正算法,以防止误差传播和保持精度。在实际数据上对所提出的递归算法和理查德森算法进行了广泛的比较分析,并选择了最优预条件。递归算法对病态信息矩阵的估计效果最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信