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

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.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025605
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Huiling Wang, Zhaolu Tian, Yufeng Nie
AIMS Mathematics
Matrix Theory and Algorithms
article

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

Huiling Wang, Zhaolu Tian, Yufeng Nie
article en

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.

AIMS MathematicsVol. 10(6)
Shanxi University of Finance and Economics (CN), Northwestern Polytechnical University (CN)
Openalex Percentile: Top 85%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.