A quartically fast iteration solver with convergence analysis for numerically determining the sign of a matrix
The calculation of the matrix sign function (MSF) is pivotal in numerous mathematical contexts, offering a matrix-based transformation that identifies the sign for every eigenvalue within an invertible matrix. This paper introduces a new iteration procedure tailored to effectively compute the MSF, with a particular focus on expanding the order of convergence. Our proposed solver achieves fourth-order convergence, rendering it effective for a broad spectrum of matrices. Numerical experiments for both real and complex matrices are included to support the derivations.
Authors
- Tao Liu (ORCID: https://orcid.org/0000-0003-1024-3201)
- Runqi Xue
- Stanford Shateyi (ORCID: https://orcid.org/0000-0002-5829-8634)
- Shuai Wang (ORCID: https://orcid.org/0009-0009-9489-3295)
- Ying Liu (ORCID: https://orcid.org/0000-0001-9114-3426)
Institutions
- Sichuan University (CN)
- Changchun University (CN)
- University of Venda (ZA)
- Northeastern University (CN)
Publication Details
- Journal
- AIMS Mathematics
- Published
- 2025-01-01
- DOI
- https://doi.org/10.3934/math.2025632
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00