学术报告-刘建州

发布人:
责任人:
点击数:
更新时间:
2018-05-16 11:33:00

学术报告

题      目:New matrix bounds and iterative algorithms for the discrete coupled algebraic Riccati equation

报  告  人:刘建州 教授  (邀请人:黎稳)

                            湘潭大学数学与计算科学学院


时      间:2018-05-16 10:00--11:00

地      点:学院401

报告人简介:

       刘建州,博士,教授,博士生导师,主要从事数值代数、矩阵理论及其应用、控制理论等方面的研究工作。现任湘潭大学运筹学与控制论硕士点负责人,湖南省数学学会秘书长、常务理事, 湖南省运筹学会副理事长,美国《数学评论》评论员,SCI期刊《J. Math.Inequal.》、《Open Auto. Control Syst. J.》 编委;已主持国家自然科学基金项目3项、湖南省自然科学基金重点项目1项、其它省部级项目多项,获湖南省自然科学三等奖(主持人);已在国际数学和计算科学权威刊物上发表学术论文100余篇,其中 SCI论文50余篇。


摘      要:

      The discrete coupled algebraic Riccati equation (DCARE) has wide applications in control theory and linear system. In general, for the DCARE, one discusses every term of the coupled term, respectively. In this talk, we consider the coupled term as a whole, which is different from the recent results. When applying eigenvalue inequalities to discuss the coupled term, our method has less error. In terms of the properties of special matrices
and eigenvalue inequalities, we propose several upper and lower matrix bounds for the solution of DCARE. Further, we discuss the iterative algorithms for the solution of the DCARE. In the fixed point iterative algorithms, the scope of Lipschitz factor is wider than the recent results. Finally, we provider corresponding numerical examples to illustrate the effectiveness of the derived results