arXiv (All)
open access
Improving the efficiency of a Hyperpower method for approximating inverse matrices
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Error Estimates for the Arnoldi Approximation of a Matrix Square Root#1142545
- Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra#996996
- Algorithm with variable coefficients for computing matrix inverses#665672
- Algorithm with variable coefficients for computing matrix inverses#664172
- Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots#1128454
Record · ID 927723
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive