Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.04433

Improving the efficiency of a Hyperpower method for approximating inverse matrices

Alicia Cordero·Juan R. Torregrosa
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.NAcs.NA

Keep this discovery

BibTeXRIS

Alicia Cordero, Juan R. Torregrosa. 2026-09-03. Improving the efficiency of a Hyperpower method for approximating inverse matrices. https://arxiv.org/abs/2609.04433

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.NA subjectmath.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT↗
arXiv2026

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA↗
arXiv2021

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA↗