Reduced-Order Approximation of Bilinear Systems Using a New Hybrid Method based on Balanced Truncation and Iterative Rational Krylov Algorithms

IF 1.4 4区 工程技术 Q2 ENGINEERING, MULTIDISCIPLINARY Scientia Iranica Pub Date : 2023-08-16 DOI:10.24200/sci.2023.61596.7394
H. Nasiri Soloklo, N. Bigdeli
{"title":"Reduced-Order Approximation of Bilinear Systems Using a New Hybrid Method based on Balanced Truncation and Iterative Rational Krylov Algorithms","authors":"H. Nasiri Soloklo, N. Bigdeli","doi":"10.24200/sci.2023.61596.7394","DOIUrl":null,"url":null,"abstract":"This paper proposes a hybrid method for order reduction of the bilinear system model using Balanced Truncation (BT) and Bilinear Iterative Rational Krylov Algorithm (BIRKA). Bilinear BT (BBT) has low accuracy but guarantees stability, while BIRKA convergence suffers from sensitivity to initial choice of reduced-order system. The proposed method first determines the order of the reduced bilinear model by minimizing the index of Integral Square Error (ISE). Then, the initial guess of reduced-order system is provided via two approaches, BBT and Linear BT (LBT), to guarantee the convergence of BIRKA. The result of BBT is a good stable initial guess for BIRKA, but it is very computationally expensive to solve the generalized Lyapunov equations to find the solution. LBT decreases the computational complexity by providing the initial guess via solving the Lyapunov equations. To further decrease the complexity, the condition number is substituted in place of the eigenvalues in BIRKA. Three bilinear test systems are considered to show the efficiency of proposed method. Finally, the performance of the proposed method is compared with some classical methods. The results show that the convergence probability of BIRKA increases. Also, the time for the determining the model order reduction decreases.","PeriodicalId":21605,"journal":{"name":"Scientia Iranica","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientia Iranica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24200/sci.2023.61596.7394","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a hybrid method for order reduction of the bilinear system model using Balanced Truncation (BT) and Bilinear Iterative Rational Krylov Algorithm (BIRKA). Bilinear BT (BBT) has low accuracy but guarantees stability, while BIRKA convergence suffers from sensitivity to initial choice of reduced-order system. The proposed method first determines the order of the reduced bilinear model by minimizing the index of Integral Square Error (ISE). Then, the initial guess of reduced-order system is provided via two approaches, BBT and Linear BT (LBT), to guarantee the convergence of BIRKA. The result of BBT is a good stable initial guess for BIRKA, but it is very computationally expensive to solve the generalized Lyapunov equations to find the solution. LBT decreases the computational complexity by providing the initial guess via solving the Lyapunov equations. To further decrease the complexity, the condition number is substituted in place of the eigenvalues in BIRKA. Three bilinear test systems are considered to show the efficiency of proposed method. Finally, the performance of the proposed method is compared with some classical methods. The results show that the convergence probability of BIRKA increases. Also, the time for the determining the model order reduction decreases.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于平衡截断和迭代有理Krylov算法的双线性系统降阶逼近新方法
本文提出了一种利用平衡截断(BT)和双线性迭代有理克雷洛夫算法(BIRKA)对双线性系统模型进行降阶的混合方法。双线性BT (BBT)精度较低,但能保证稳定性,而BIRKA收敛对降阶系统的初始选择敏感。该方法首先通过最小化积分平方误差(ISE)指标来确定降阶双线性模型的阶数。然后,通过BBT和线性BT (LBT)两种方法给出了降阶系统的初始猜测,以保证BIRKA的收敛性。对于BIRKA来说,BBT的结果是一个很好的稳定的初始猜测,但要求解广义Lyapunov方程来找到解,计算成本非常高。LBT通过求解李雅普诺夫方程来提供初始猜测,从而降低了计算复杂度。为了进一步降低复杂度,用条件数代替BIRKA中的特征值。以三个双线性测试系统为例,验证了该方法的有效性。最后,将该方法的性能与一些经典方法进行了比较。结果表明,BIRKA的收敛概率增大。此外,确定模型订单减少的时间也减少了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Scientia Iranica
Scientia Iranica 工程技术-工程:综合
CiteScore
2.90
自引率
7.10%
发文量
59
审稿时长
2 months
期刊介绍: The objectives of Scientia Iranica are two-fold. The first is to provide a forum for the presentation of original works by scientists and engineers from around the world. The second is to open an effective channel to enhance the level of communication between scientists and engineers and the exchange of state-of-the-art research and ideas. The scope of the journal is broad and multidisciplinary in technical sciences and engineering. It encompasses theoretical and experimental research. Specific areas include but not limited to chemistry, chemical engineering, civil engineering, control and computer engineering, electrical engineering, material, manufacturing and industrial management, mathematics, mechanical engineering, nuclear engineering, petroleum engineering, physics, nanotechnology.
期刊最新文献
A New Approach to Estimating Destinations in Open Automated Fare Collection Systems based on errors-against-errors strategy Shared autonomous vehicle with pooled service, a modal shift approach Analysis of waves subjected to mechanical force and voids source in an initially stressed magneto-elastic medium with corrugated and impedance boundary Numerical study of slip and Magnetohydrodynamics (MHD) in calendering process using non-Newtonian fluid An efficient biogas-base tri-generation of power, heating and cooling integrating inverted Brayton and ejector transcritical CO2 cycles: exergoeconomic evaluation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1