<p>Nonlinear matrix equations <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13662_2025_3977_Article_IEq1.gif" Format="GIF" Height="38" Rendition="HTML" Resolution="72" Type="Linedraw" Width="239" /> </InlineMediaObject> <EquationSource Format="MATHML"><math> <msup> <mi>X</mi> <mi>p</mi> </msup> <mo>=</mo> <mi>A</mi> <mo>+</mo> <munderover> <mo movablelimits="false">∑</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <msubsup> <mi>M</mi> <mi>i</mi> <mo>∗</mo> </msubsup> <msup> <mrow> <mo stretchy="false">(</mo> <mi>B</mi> <mo>+</mo> <msup> <mi>X</mi> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </msup> <msub> <mi>M</mi> <mi>i</mi> </msub> </math></EquationSource> <EquationSource Format="TEX">$X^{p} =A+\sum \limits _{i = 1}^{m} {M_{i}^{*}(B+X^{-1})^{-1}{M_{i}}} $</EquationSource> </InlineEquation> have extensive applications in control theory, ladder networks, dynamic programming, and stochastic filtering. In this paper a fixed-point acceleration iteration algorithm is proposed and, based on the basic characteristics of the Thompson metric space, the convergence and error estimator of the proposed algorithm are proved. Numerical comparison experiments show that the proposed algorithm is feasible and effective.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Fixed-point accelerated iterative method for solving a nonlinear matrix equation

  • Jingjing Peng,
  • Siting Yu,
  • Zhenyun Peng

摘要

Nonlinear matrix equations X p = A + i = 1 m M i ( B + X 1 ) 1 M i $X^{p} =A+\sum \limits _{i = 1}^{m} {M_{i}^{*}(B+X^{-1})^{-1}{M_{i}}} $ have extensive applications in control theory, ladder networks, dynamic programming, and stochastic filtering. In this paper a fixed-point acceleration iteration algorithm is proposed and, based on the basic characteristics of the Thompson metric space, the convergence and error estimator of the proposed algorithm are proved. Numerical comparison experiments show that the proposed algorithm is feasible and effective.