arXiv (All)
open access
Accelerating Direct Sparse Solvers with Graph Computing Accelerators
Solving large sparse linear systems by Gaussian elimination is a challenging computational task due to the introduction of non-zero elements, or fill-in. Practitioners use heuristics such as the nested dissection reordering algorithm to try to reduce fill-in. In practice, reordering codes do not ach
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
- Accelerating Direct Sparse Solvers with Graph Computing Accelerators#1605201
- Computation-Friendly Compression of Matrices: Speeding up Linear and Boolean Algebra#1458832
- SpSYRK: Half the Work in Distributed Sparse Matrix Multiplication#441743
- A GPU Engine for Sparse Matrix-Vector Products on $k^2$-Tree-Compressed Graphs#1587590
- A GPU Engine for Sparse Matrix-Vector Products on $k^2$-Tree-Compressed Graphs#1527911
Record · ID 1636375
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