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 (279.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

The HSS splitting hierarchical identification algorithms for solving the Sylvester matrix equation

Huiling Wang1( )Zhaolu Tian1Yufeng Nie2
College of Applied Mathematics, Shanxi University of Finance and Economics, Taiyuan 030006, China
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi'an 710072, China
Show Author Information

Abstract

By combining the hierarchical identification principle with HSS splitting, we presented the HSS splitting hierarchical identification algorithm for solving the Sylvester matrix equation in this paper. To enhance the convergence rate of the algorithm, the momentum item was introduced in the iteration. We conducted an in-depth analysis of the sufficient conditions that ensured the convergence properties of the proposed algorithms. Additionally, the optimal parameters involved in the algorithms were computed exactly in each iteration by the minimum residual technique for specific cases. Thus, the adaptive forms of the corresponding algorithms were obtained. Finally, several numerical examples were implemented to demonstrate the superiority and effectiveness of the designed algorithms in this paper.

CLC number: 15A24, 65F30

References

【1】
【1】
 
 
AIMS Mathematics
Pages 13476-13497

{{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:
Wang H, Tian Z, Nie Y. The HSS splitting hierarchical identification algorithms for solving the Sylvester matrix equation. AIMS Mathematics, 2025, 10(6): 13476-13497. https://doi.org/10.3934/math.2025605

772

Views

17

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 07 March 2025
Revised: 02 June 2025
Accepted: 04 June 2025
Published: 12 June 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)