11 citations · 26 across the 8 of their papers we have counts for
3 papers · 1 filter
LU factorization with errors *
Jean-Guillaume Dumas, Joris Van Der Hoeven, Clément Pernet +1
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main alg…
Faster integer and polynomial multiplication using cyclotomic coefficient rings
David Harvey, Joris van der Hoeven
We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n…
Homotopy methods for multiplication modulo triangular sets
Alin Bostan, Muhammad Chowdhury, Joris van der Hoeven +1
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotop…