首页> 外文期刊>Journal of the Franklin Institute >A relaxed MSIO iteration algorithm for solving coupled discrete Markovian jump Lyapunov equations
【24h】

A relaxed MSIO iteration algorithm for solving coupled discrete Markovian jump Lyapunov equations

机译:一种求解耦合离散的Markovian Jump Lyapunov方程的轻松MSIO迭代算法

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, combining the multi-step Smith-inner-outer (MSIO) iteration framework with some tunable parameters, a relaxed MSIO iteration method is proposed for solving the Sylvester matrix equation and coupled Lyapunov matrix equations (CLMEs) in the discrete-time jump linear systems with Markovian transitions. The convergence properties of the relaxed MSIO iteration method are investigated, and the choices of the parameters are also discussed. In order to accelerate the convergence rate of the relaxed MSIO iteration method for solving the CLMEs, a current-estimation-based and a weighted relaxed MSIO iteration algorithms are presented, respectively. Finally, several numerical examples are given to verify the superiorities of the proposed relaxed algorithms. ? 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
机译:在本文中,将多步史密斯内外(MSIO)迭代框架与一些可调参数组合,提出了一种放松的MSIO迭代方法,用于在离散时间内求解Sylvester矩阵方程和耦合的Lyapunov矩阵方程(CLME)跳跃线性系统与马尔可夫过渡。研究了松弛的MSIO迭代方法的收敛性质,还讨论了参数的选择。为了加速用于求解CLME的松弛MSIO迭代方法的收敛速率,分别呈现了基于电流估计的和加权松弛的MSIO迭代算法。最后,给出了若干数值例子来验证所提出的宽松算法的优越性。 ? 2021年富兰克林学院。 elsevier有限公司出版。保留所有权利。

著录项

  • 来源
    《Journal of the Franklin Institute》 |2021年第6期|3051-3076|共26页
  • 作者单位

    Shanxi Univ Finance & Econ Coll Appl Math Taiyuan 030006 Peoples R China;

    Shanxi Univ Finance & Econ Coll Informat Taiyuan 030006 Peoples R China;

    Shanxi Univ Finance & Econ Coll Informat Taiyuan 030006 Peoples R China;

    Changsha Univ Sci & Technol Sch Math & Stat Changsha 410076 Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号