{"ID":2855153,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.13427","arxiv_id":"2510.13427","title":"Verification Challenges in Sparse Matrix Vector Multiplication in High Performance Computing: Part I","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.","short_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....","url_abs":"https://arxiv.org/abs/2510.13427","url_pdf":"https://arxiv.org/pdf/2510.13427v1","authors":"[\"Junchao Zhang\"]","published":"2025-10-15T11:24:28Z","proceeding":"cs.LO","tasks":"[\"cs.LO\",\"cs.DC\",\"cs.MS\"]","methods":"[]","has_code":false}