Axiom: The Scientific Computation System
by Richard D. Jenks, Robert S. Sutor
Publisher: axiom-developer.org 2003
ISBN/ASIN: 0387978550
ISBN-13: 9780387978550
Number of pages: 1200
Description:
Axiom is a free general purpose computer algebra system. It consists of an interpreter environment, a compiler and a library, which defines a strongly typed, mathematically correct type hierarchy. The primary philosophy is that Axiom needs to develop several fundamental features in order to be useful to the next generation of computational mathematicians. The book gives the reader a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms newly developed by the symbolic computation community, and presents advanced programming and problem solving techniques.
Download or read it online for free here:
Download link
(3.8MB, PDF)
Similar books
Computer Algebra, Algorithms, Systems and Applicationsby Richard Liska, at al. - Czech Technical University
From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.
(18017 views)
Algorithmic Algebraby Bhubaneswar Mishra - Courant Institute of Mathematical Sciences
The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.
(22922 views)
Mathematics for Algorithm and Systems Analysisby Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(31512 views)
An Architecture for Combinator Graph Reductionby Philip J. Koopman, Jr. - 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.
(17428 views)