Algebra for Symbolic Computation

  • Antonio Machì

Part of the UNITEXT book series (UNITEXT)

Also part of the La Matematica per il 3+2 book sub series (UNITEXTMAT)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Antonio Machì
    Pages 39-64
  3. Antonio Machì
    Pages 65-85
  4. Antonio Machì
    Pages 87-139
  5. Antonio Machì
    Pages 141-169
  6. Back Matter
    Pages 171-180

About this book

Introduction

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.

Keywords

Algebra Algorithms Computer

Authors and affiliations

  • Antonio Machì
    • 1
  1. 1.Department of MathematicsUniversity La SapienzaRomeItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-88-470-2397-0
  • Copyright Information Springer-Verlag Italia Srl. 2012
  • Publisher Name Springer, Milano
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-88-470-2396-3
  • Online ISBN 978-88-470-2397-0
  • Series Print ISSN 2038-5714
  • About this book