Add to ORKGThere are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
The general context The multiplication of polynomials is a primitive widely used in computer algebra...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
The special-purpose computer algebra system FELIX is designed for computations in constructive commu...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
Although scientific computing is very often associated with numeric computations, the use of compute...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
Computers in Nonassociative Rings and Algebras provides information pertinent to the computational a...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
The general context The multiplication of polynomials is a primitive widely used in computer algebra...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
The special-purpose computer algebra system FELIX is designed for computations in constructive commu...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
Although scientific computing is very often associated with numeric computations, the use of compute...
In recent years a number of algorithms have been designed for the "inverse" computational ...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
Computers in Nonassociative Rings and Algebras provides information pertinent to the computational a...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
The general context The multiplication of polynomials is a primitive widely used in computer algebra...