Verification Challenges in Sparse Matrix Vector Multiplication in High Performance Computing: Part I

October 15, 2025 · The Ethereal · 🏛 Electronic Proceedings in Theoretical Computer Science

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Junchao Zhang arXiv ID 2510.13427 Category cs.LO: Logic in CS Cross-listed cs.DC, cs.MS Citations 0 Venue Electronic Proceedings in Theoretical Computer Science Last Checked 5 months ago
Abstract
Sparse matrix vector multiplication (SpMV) is a fundamental kernel in scientific codes that rely on iterative solvers. In this first part of our work, we present both a sequential and a basic MPI parallel implementations of SpMV, aiming to provide a challenge problem for the scientific software verification community. The implementations are described in the context of the PETSc library.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS