Modern computer algebra
Computer algebra systems are gaining more and more importance in all areas of science and engineering. This textbook gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. It is designed to accompany one- or two-semester courses for advanced un...
Enregistré dans:
Auteurs principaux : | , |
---|---|
Format : | Livre |
Langue : | anglais |
Titre complet : | Modern computer algebra / Joachim von zur Gathen and Jürgen Gerhard |
Publié : |
Cambridge :
Cambridge University Press
, 1999, cop. 1999 |
Description matérielle : | 1 vol. (XIII-753 p.) |
Sujets : |
- Introduction
- 1, Cyclohexane, cryptography, codes, and computer algebra
- I, Euclid
- 2, Fundamental algorithms
- 3, The euclidean algorithm
- 4, Application of the euclidean algorithm
- 5, Modular algorithms and interpolation
- 6, The resultant and ged computation
- 7, Application : decoding BCH codes
- II, Newton
- 8, Fast multiplication
- 9, Newton iteration
- 10, Fast polynomial evaluation and interpolation
- 11, Fast euclidan algorithm
- 12, Fast linear algebra
- 13, Fourier transform and image compression
- III, Gaub
- 14, Factoring polynomials over finite fields
- 15, Hensel lifting and factoring polynomials
- 16, Short vectors in lattices
- 17, Applications of basis reduction
- IV, Fermat
- 18, Primality testing
- 19, Factoring integers
- 20, Application : public key cryptography
- V, Hilbert
- 21, Gröbner bases
- 22, Symbolic integration
- 23, Symbolic summation
- 24, Applications
- Appendix
- 25, Fundamental concepts