AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (262.6 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

On a parameterized inversion-free iterative algorithm for solving the nonlinear matrix equation X + i = 1 m A i X p i A i = I

Changzhou Li1Boyu Wang2( )Chao Yuan3Shiliang Chen1
School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, 723001, China
School of Sciences, Northeast Electric Power University, Jilin, 132012, China
School of Mathematics and Information Science, Guangzhou University, Guangzhou, 510006, China
Show Author Information

Abstract

In this paper, we propose a parameterized inversion-free iterative algorithm to compute the positive definite solution of the nonlinear matrix equation X + i = 1 m A i X p i A i = I. Then, we prove that the proposed algorithm converges. Finally, in comparison with three well-known existing algorithms, the accuracy and effectiveness of the proposed algorithm are demonstrated by some numerical examples.

CLC number: 15A24, 47H10, 65H05

References

【1】
【1】
 
 
AIMS Mathematics
Pages 19018-19032

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Li C, Wang B, Yuan C, et al. On a parameterized inversion-free iterative algorithm for solving the nonlinear matrix equation X + i = 1 m A i X p i A i = I. AIMS Mathematics, 2025, 10(8): 19018-19032. https://doi.org/10.3934/math.2025850

1

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 25 June 2025
Revised: 07 August 2025
Accepted: 18 August 2025
Published: 15 August 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)