Research Catalog
Computer algebra : systems and algorithms for algebraic computation
- Title
- Computer algebra : systems and algorithms for algebraic computation / J.H. Davenport, Y. Siret, E. Tournier ; translated from the French by A. Davenport and J.H. Davenport.
- Author
- Davenport, James Harold, 1953-
- Publication
- London ; San Diego : Academic Press, ©1993.
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
| Text | Use in library | QA155.7.E4 D39 1993 | Off-site |
Details
- Additional Authors
- Description
- xix, 298 p. : ill.; 24 cm.
- Summary
- An introduction to computer algebra that caters for both the interested beginner and the experienced pure mathematician and computer scientist.
- Uniform Title
- Calcul formel. English
- Alternative Title
- Calcul formel.
- Subject
- Note
- Includes index.
- Bibliography (note)
- Includes bibliographical references (p. 275-292).
- Contents
- 1. How to use a Computer Algebra system. 1.2. Features of Computer Algebra systems. 1.3. Syntax of the associated languages. 1.4. Areas covered by existing systems. 1.5. Computer Algebra by example. 1.6. MACSYMA's possibilities in Algebra. 1.7. Availability of MACSYMA. 1.8. Other systems. 1.9. AXIOM -- 2. The problem of data representation. 2.1. Representations of integers. 2.2. Representations of fractions. 2.3. Representations of polynomials. 2.4. Polynomials in several variables. 2.5. Representations of rational functions. 2.6. Representations of algebraic functions. 2.7. Representations of transcendentals. 2.8. Representations of matrices. 2.9. Representations of series -- 3. Polynomial simplification. 3.1. Simplification of polynomial equations. 3.2. Simplification of real polynomial systems -- 4. Advanced algorithms. 4.1. Modular methods. 4.2. p-adic methods -- 5. Formal integration and differential equations. 5.1. Formal integration. 5.2. Algebraic solutions of o.d.e.s.
- 5.3. Asymptotic solutions of o.d.e.s -- Appendix. Algebraic background. A.1. Square-free decomposition. A.2. The extended Euclidean algorithm. A.3. Partial fractions. A.4. The resultant. A.5. Chinese remainder theorem. A.6. Sylvester's identity. A.7. Termination of Buchberger's algorithm -- Annex. REDUCE: a Computer Algebra system. R.2. Syntax of REDUCE. R.3. Built-in facilities. R.4. Matrix algebra. R.5. IRENA.
- ISBN
- 0122042328
- 9780122042324
- 0122092328 (canceled/invalid)
- OCLC
- ocm28484932
- 28484932
- SCSB-9174948
- Owning Institutions
- Princeton University Library