Computer algebra: systems and algorithms for algebraic computation
Computer algebra: systems and algorithms for algebraic computation
Elements of computer algebra with applications
Elements of computer algebra with applications
AXIOM: the scientific computation system
AXIOM: the scientific computation system
Maple V: learning guide
The Mathematica book (3rd ed.)
The Mathematica book (3rd ed.)
Symbolic integration I: transcendental functions
Symbolic integration I: transcendental functions
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
| Hi-index | 0.01 |
Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish computer algebra from numerical analysis, the other principal branch of scientific computation. (1) Computer algebra involves computation in algebraic structures, such as finitely presented groups, polynomial rings, rational function fields, algebraic and transcendental extensions of the rational numbers, or differential and difference fields. (2) Computer algebra manipulates formulas. Whereas in numerical computation the input and output of algorithms are basically (integer or floating point) numbers, the input and output of computer algebra algorithms are generally formulas. So, typically, instead of computing