LinApart2: efficient parallel partial fraction decomposition algorithm for denominators with polynomials of general degree

Abstract

We present LinApart2, a major update to the LinApart algorithm for univariate partial fraction decomposition. Unlike its predecessor, LinApart2 can handle denominators of arbitrary polynomial degree without explicit factorization, while retaining the efficiency and parallelizability of the Laurent series method. Benchmarks show substantial speedups in both runtime and memory usage compared to Mathematica's built-in routine Apart and to the Euclidean algorithm, enabling computations that were previously intractable.

23 pages, 12 figures, code is available at https://github.com/fekeshazy/LinApart, the manuscript has been submitted to Computer Physics Communication