Logo

Algorithmic Mathematics by Leonard Soicher, Franco Vivaldi

Algorithmic Mathematics
by

Publisher: Queen Mary University of London
Number of pages: 94

Description:
This text contains sufficient material for a one-semester course in mathematical algorithms, for second year mathematics students. The course requires some exposure to the basic concepts of discrete mathematics, but no computing experience. The aim of this course is twofold. Firstly, to introduce the basic algorithms for computing exactly with integers, polynomials and vector spaces. In doing so, the student is expected to learn how to think algorithmically and how to design and analyze algorithms. Secondly, to provide a constructive approach to abstract mathematics, algebra in particular. When introducing the elements of ring and field theory, algorithms offer concrete tools, constructive proofs, and a crisp environment where the benefits of rigour and abstraction become tangible. We shall write algorithms in a straightforward language, which incorporates freely standard mathematical notation. The specialized constructs are limited to the if-structure and the while-loop, which are universal.

Home page url

Download or read it online for free here:
Download link
(0.5MB, PDF)

Similar books

Book cover: Curves and Surfaces in Geometric Modeling: Theory and AlgorithmsCurves and Surfaces in Geometric Modeling: Theory and Algorithms
by - Morgan Kaufmann
This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work -- whether you are a graduate student, scientist, or practitioner.
(3174 views)
Book cover: Mathematics for Computer ScientistsMathematics for Computer Scientists
by - BookBoon
In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.
(21614 views)
Book cover: An Architecture for Combinator Graph ReductionAn Architecture for Combinator Graph Reduction
by - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
(12421 views)
Book cover: Pictures of Julia and Mandelbrot SetsPictures of Julia and Mandelbrot Sets
- Wikibooks
The purpose of this book is to show how the computer can draw technically perfect pictures of Julia and Mandelbrot sets. All the necessary theory is explained and some words are said about how to put the things into a computer program.
(11769 views)