![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
|
||||||||||||||||||||
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|

ETNA - Electronic Transactions on Numerical Analysis, pp. 326-346, 2026/07/20
The objective of this research is to compute the principal matrix square root using a sparse approximation. A new stable inversion-free iteration (SIFI) is presented. An analysis of the sparsity and error of the matrices involved in the iterative process is given. Based on the bandwidth and error analysis, a more efficient algorithm combining the SIFI with a filtering technique is proposed. The computational efficiency and accuracy of the proposed method are demonstrated through the computation of the principal square root of various matrices, confirming its superiority over existing approaches.
Keywords: matrix square root, iterative algorithm, error analysis, bandwidth analysis