arXiv (All)
open access
Scalable s-step Preconditioned Conjugate Gradient with Chebyshev Basis and Gauss-Seidel Gram Solve
We present a variant of the s--step Preconditioned Conjugate Gradient (PCG) method that combines a Chebyshev--stabilized Krylov basis with a Forward Gauss--Seidel (FGS) iteration for the solution of the reduced Gram systems. In s--step PCG, multiple search directions are generated per outer iteratio
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
- A randomized global GMRES method for matrix equations#972415
- An error bound-based convergence analysis framework for a class of randomized algorithms#798805
- An error bound-based convergence analysis framework for a class of randomized algorithms#797391
- Efficient Test-Time Finetuning of LLMs via Convex Reconstruction and Gradient Caching#238592
- ShardTensor: Domain Parallelism for Scientific Machine Learning#178856
Record · ID 998136
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