31 citations · 70 across the 19 of their papers we have counts for
14 papers · 1 filter
On the Complexity and Parallel Implementation of Hensel's Lemma and Weierstrass Preparation
Alexander Brandt, Marc Moreno Maza
Hensel's lemma, combined with repeated applications of Weierstrass preparation theorem, allows for the factorization of polynomials with multivariate power series coefficients. We…
Multivariate Power Series in Maple
Mohammadali Asadi, Alexander Brandt, Mahsa Kazemi +2
We present MultivariatePowerSeries, a Maple library introduced in Maple 2021, providing a variety of methods to study formal multivariate power series and univariate polynomials ov…
On the Parallelization of Triangular Decomposition of Polynomial Systems
Mohammadali Asadi, Alexander Brandt, Robert H. C. Moir +2
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decomposition. Algorithms for solving polynomial systems combine low-l…
Putting Fürer Algorithm into Practice with the BPAS Library
Sviatoslav Covanov, Davood Mohajerani, Marc Moreno-Maza +1
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{ö}nhage and Strassen designed…
Complexity Estimates for Fourier-Motzkin Elimination
Rui-Juan Jing, Marc Moreno-Maza, Delaram Talaashrafi
In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' w…
Symbolic-Numeric Integration of Rational Functions
Robert M. Corless, Robert H. C. Moir, Marc Moreno Maza +1
We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the stable yet efficient computation of…