AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple, focusing on triangular decomposition algorithms. We show substantial improvements over existing Maple implementations; our code also outperforms Magma on many examples. Profiling data show that data conversion can become a bottleneck for some algorithms, leaving room for further improvements
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebra...
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying ...
AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple,...
We demonstrate new routines for sparse multivariate polynomial multiplication and division over the ...
One of the core commands in the RegularChains library isTriangularize. The underlying decomposes the...
Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm w...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebra...
The Maple computer algebra system is described. Brief sample sessions show the user syntax and the m...
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distribute...
The principal data structure in Maple used to represent polynomials and general mathematical express...
A common data structure that is used for multivariate polynomials is a linked list of terms sorted i...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebra...
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying ...
AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple,...
We demonstrate new routines for sparse multivariate polynomial multiplication and division over the ...
One of the core commands in the RegularChains library isTriangularize. The underlying decomposes the...
Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm w...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebra...
The Maple computer algebra system is described. Brief sample sessions show the user syntax and the m...
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distribute...
The principal data structure in Maple used to represent polynomials and general mathematical express...
A common data structure that is used for multivariate polynomials is a linked list of terms sorted i...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebra...
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying ...