Library Services | Technical University of Kenya

Your cart is empty.
Normal view MARC view ISBD view

Algebra for Symbolic Computation [electronic resource] / by Antonio Machì.

By: Machì, Antonio [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: UNITEXT: Publisher: Milano : Springer Milan : Imprint: Springer, 2012Description: VIII, 180 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9788847023970.Subject(s): Mathematics | Algebra | Mathematics | AlgebraDDC classification: 512 Online resources: Click here to access online
Contents:
The Euclidean algorithm, the Chinese remainder theorem and interpolation -- p-adic series expansion -- The resultant -- Factorisation of polynomials -- The discrete Fourier transform.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

The Euclidean algorithm, the Chinese remainder theorem and interpolation -- p-adic series expansion -- The resultant -- Factorisation of polynomials -- The discrete Fourier transform.

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.

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue