arXiv (All)
open access
Error bounds for the Sherman-Morrison formula and its modification with improved stability
It is known that the Sherman--Morrison (SM) formula is not numerically stable. In recent work, we introduced SMIR, an algorithm that incorporates iterative refinement to enhance the SM backward error. In this paper we take a different route: adapting an algorithm of Govaerts, originally designed for
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
- 42 U.S.C. § 16277 — High-performance computation and supportive research#589012
- Long-step strategies in interior-point primal-dual methods#429967
- Active set Methods for Problems in Column Block Angular Form#770604
- Tight Convergence Bounds for the Classical Kaczmarz Method#1115990
- SLRAアルゴリズムによる多変数多項式の近似decomposition (Computer Algebra --Foundations and Applications)#442744
Record · ID 1000226
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