arXiv (All)
open access
Error Estimates for the Arnoldi Approximation of a Matrix Square Root
The Arnoldi process provides an efficient framework for approximating functions of a matrix applied to a vector, i.e., of the form $f(M)\bm{b}$, by repeated matrix-vector multiplications. In this paper, we derive error estimates for approximating the action of a matrix square root using the Arnoldi
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
- Improving the efficiency of a Hyperpower method for approximating inverse matrices#927723
- Component-wise accurate fixed point iterations for computing the square root of a singular M-matrix#1064064
- Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots#1128454
- The Moment Method for Computing Real Points of Sparse Polynomial Systems#1118025
- On Some Applications to the Newton--Raphson Method#1011941
Record · ID 1142545
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