Modular matrix multiplication on GPU for polynomial system solving

DOI10.1145/3614408.3614411MaRDI QIDQ6536546

Dimitri Lesnoff, Theo A. Mary, Jérémy Berthomieu, Stef Graillat

Publication date: 13 May 2024

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Sparse FGLM algorithms
• Block-Krylov techniques in the context of sparse-FGLM algorithms
• Modular SIMD arithmetic in M <scp>athemagix</scp>

This page was built for publication: Modular matrix multiplication on GPU for polynomial system solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536546)