Metraipolis › archive › dc_be41225008c2
Improving the efficiency of a Hyperpower method for approximating inverse matrices — arXiv:2609.04433
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.04433
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T23:19:09.190Z
- SHA-256 of the archived text
266ff612ff6b4e98196da56f2019672731a9137ac0075f1e16ed4c90d129d77c- Stable URL of this page
https://metraipolis.com/documento/dc_be41225008c2
How to cite
Improving the efficiency of a Hyperpower method for approximating inverse matrices — arXiv:2609.04433 — arXiv (en), https://arxiv.org/abs/2609.04433 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be41225008c2 (Metraipolis archive dc_be41225008c2, sha256 266ff612ff6b4e98196da56f2019672731a9137ac0075f1e16ed4c90d129d77c)
BibTeX
@misc{dcbe41225008c2,
title = {Improving the efficiency of a Hyperpower method for approximating inverse matrices — arXiv:2609.04433},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.04433},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be41225008c2; sha256 266ff612ff6b4e98196da56f2019672731a9137ac0075f1e16ed4c90d129d77c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04433. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this manuscript, scalar norm-type accelerators are used for first time in order to increase the order of convergence of known iterative methods for solving the matrix equation $X^{-1}-A=0$, while decreasing the number of matrix-matrix products. Specifically, our proposed scheme upgrades the order of convergence in a $50\%$, achieving the sixth-order of convergence with the computational cost of fourth-order Hyperpower method, in terms of matrix-matrix multiplications. In the main results, not only the convergence and its order is proven, but also its efficiency and stability. This new technique provides good numerical results, even compared with existing fourth-, sixth- and eighth-order schemes in large matrices of up to $10^6$ entries, but also promises the opening of a new kind of procedures with good performance and scalability. Finally, an application to digital image restoration is made to show the behavior of the method, compared with existing ones.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.04433 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:02:57.296Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).