arXiv (All)
open access
Component-wise accurate fixed point iterations for computing the square root of a singular M-matrix
We analyze two fixed-point iterations for computing the principal square root of an M-matrix $A$. Although these iterations, with customary initialization, converge sublinearly when $A$ is a singular M-matrix, we show that, under suitable mild conditions on the initial approximation, the convergence
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
- A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices#1128455
- NGMRES convergence analysis and proof of acceleration for contractive and noncontractive iterations#971833
- Parameter optimization for restarted mixed precision iterative sparse solver#798573
- Parameter optimization for restarted mixed precision iterative sparse solver#797160
Record · ID 1064064
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