Algebra for symbolic computation
Author(s)
Bibliographic Information
Algebra for symbolic computation
(Collana unitext, 61 . La matematica per il 3+2)
Springer, c2012
- : [pbk.]
Available at / 5 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature. The topics covered range from classical results such as the Euclidean algorithm, the Chinese remainder theorem, and polynomial interpolation, to p-adic expansions of rational and algebraic numbers and rational functions, to reach the problem of the polynomial factorisation, especially via Berlekamp's method, and the discrete Fourier transform. Basic algebra concepts are revised in a form suited for implementation on a computer algebra system.
Table of Contents
The Euclidean algorithm, the Chinese remainder theorem and interpolation.- p-adic series expansion.- The resultant.- Factorisation of polynomials.- The discrete Fourier transform.
by "Nielsen BookData"