Axiom. The scientific computation system
The book is a rather extensive manual for the symbolic computation system AXIOM. Axiom is a commercial realisation of the system SCRATCHPAD, developed by the Symbolic Computation Group of the Mathematical Sciences Department, IBM Thomas J. Watson Research Center at Yorktown Heights. Among other widely used systems like Mathematica, Maple, Reduce, or Macsyma, AXIOM is the most oriented toward abstract mathematical structures, theorem proving and computer algebra. The book, written by the developers of the system is, of course, the best that can be, presenting a systematic introduction to the system, it is endowed with many excellent examples, a glossary, an index, and practical instructions for the user. It should be recommended to everyone interested in symbolic computations, or even to those mathematicians who do not have any experience with such systems, or who do not know how much they can do within AXIOM. The present version of AXIOM is, unfortunately, available only for the IBM Risc System/600 series, under the IBM AIX operating system, and requires 32MB of memory, and 100 MB disk space.
- scientific article; zbMATH DE number 3941556
- Open source computer algebra systems: Axiom
- A system for axiomatic programming
- On the Performance of Axiom Systems
- An axiomatic system suggested by quantum computation
- scientific article; zbMATH DE number 3204590
- Axioms of an experimental system
- Scientific Computation
- Univariate polynomial factorization over finite fields
- AXIOM
- Sketches and parametrization
- Solving a system of algebraic equations with symmetries
- On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
- Pseudo differential operators and integrable systems in AXIOM
- On second order homogeneous linear differential equations with Liouvillian solutions
- On square-free factorization of multivariate polynomials over a finite field.
- Indexed types
- Equality in computer algebra and beyond.
- A constructive algebraic hierarchy in Coq.
- Examples of using dynamic constructible closure.
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Cyclic caps in \(\mathrm{PG}(3,q)\)
- Dynamic evaluation and algebraic closure in Axiom
- Arcs in \(\mathrm{PG}(n,q)\) fixed by \(A_5\) and \(A_6\)
- On the construction of arbitrary order schemes for the many dimensional wave equation
- Implementing a method for stochastization of one-step processes in a computer algebra system
- On a machine-checked proof for fraction arithmetic over a GCD domain
- Some reflections about the success and impact of the computer algebra system \textit{DERIVE} with a 10-year time perspective
- Modelling algebraic structures and morphisms in ACL2
- Locales: a module system for mathematical theories
- A geometric approach to alternating \(k\)-linear forms
- Formalizing mathematical knowledge as a biform theory graph: a case study
- Invariants for the FoCaL language
- Hidden verification for computational mathematics
- The adjacency graph of a real algebraic surface
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- Radiation-reaction in classical off-shell electrodynamics. I: The above mass-shell case
- A system for axiomatic programming
- Quadratic Lie algebras.
- Efficient Finite Fields in the Maxima Computer Algebra System
- Generic, type-safe and object oriented computer algebra software
- Evaluation of a Java Computer Algebra System
- A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy
- Trace forms and ideals on commutative algebras satisfying an identity of degree four
- scientific article; zbMATH DE number 3941556 (Why is no real title available?)
- scientific article; zbMATH DE number 4090783 (Why is no real title available?)
- On Strong Pseudoprimes to Several Bases
- scientific article; zbMATH DE number 645809 (Why is no real title available?)
- Rabin-Miller Primality Test: Composite Numbers Which Pass It
- Refiner: A Problem-Solving Environment for Scientific Simulator Creation
- scientific article; zbMATH DE number 1507955 (Why is no real title available?)
- Calcul de résolvantes avec les modules de Cauchy
- Employing C++ templates in the design of a computer algebra library
- An algebraic study of the Klein bottle
- Open source computer algebra systems: Axiom
- Basic polynomial algebra subprograms
- Retargeting OpenAxiom to Poly/ML: towards an integrated proof assistants and computer algebra system framework
- Exploring abstract algebra in constructive type theory
- The basic polynomial algebra subprograms
- Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code
- The HD and H D methods for accelerating the convergence of three-center nuclear attraction and four-center two-electron Coulomb integrals over B functions and their convergence properties
- On the links between triangular sets and dynamic constructible closure
- Commutative algebra in the Mizar system
- A bridge between dynamic geometry and computer algebra
- Software portability for computer algebra
- Global, regional, and local contexts
- PSEUDO: applications of streams and lazy evaluation to integrable models
- Connecting the 3D DGS Calques3D with the CAS Maple
This page was built for publication: Axiom. The scientific computation system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023355)
