A new method for solving algebraic systems of positive dimension
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica
Solving zero-dimensional algebraic systems
Journal of Symbolic Computation
A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
Journal of Symbolic Computation
Algorithmic algebra
Simple multivariate polynomial multiplication
Journal of Symbolic Computation
Modern computer algebra
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Polynomial Gcd Computations over Towers of Algebraic Extensions
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
About a New Method for Computing in Algebraic Number Fields
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
An elementary approach to subresultants theory
Journal of Symbolic Computation
The truncated fourier transform and applications
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Fast arithmetic for triangular sets: from theory to practice
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Comprehensive triangular decomposition
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Computing cylindrical algebraic decomposition via triangular decomposition
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Spiral-generated modular FFT algorithms
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algorithms for computing triangular decompositions of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Solving bivariate polynomial systems on a GPU
ACM Communications in Computer Algebra
Inverting matrices modulo regular chains
ACM Communications in Computer Algebra
FFT-based dense polynomial arithmetic on multi-cores
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Algorithms for computing triangular decomposition of polynomial systems
Journal of Symbolic Computation
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Algorithms for the universal decomposition algebra
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
The computation of triangular decompositions involve two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations based on modular methods and fast polynomial arithmetic. We rely on new results connecting polynomial subresultants and GCDs modulo regular chains. We report on extensive experimentation, comparing our code to pre-existing Maple implementations, as well as more optimized Magma functions. In most cases, our new code outperforms the other packages by several orders of magnitude.