arXiv (All)
open access
A Mixed-Precision Model for Matrix-Splitting Methods
The performance of stationary iterative methods is memory-bound, due to the low arithmetic intensity. So, we propose a mixed-precision technique to reduce the amount of data movement in matrix-splitting iterative methods. We demonstrate both theoretically and experimentally that this technique will
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
- Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#798603
- Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#797190
- Low-Fidelity FDM Spectral Guidance for Neural Eigenvalue Solvers#1200346
- Dense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization#1077692
- Near-Optimal Parallel $M$-Matrix Scaling#1357957
Record · ID 1215517
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