arXiv (All)
open access
A randomized global GMRES method for matrix equations
In this paper, we develop a new Randomized Global Generalized Minimum Residual (RGlGMRES) algorithm for efficiently computing solutions to large scale linear systems with multiple right hand sides. The proposed method builds on a recently developed randomized global Gram Schmidt process, in which sk
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
- Distributed principal component analysis with limited communication#308498
- Mixed precision strategies for preconditioned GMRES: a comprehensive analysis#200670
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging#1061762
- Scalable s-step Preconditioned Conjugate Gradient with Chebyshev Basis and Gauss-Seidel Gram Solve#998136
Record · ID 972415
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