Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 2000
- First Edition
- Hardcover
- Used
Seller: Materia Prima Books, New haven, CT, U.S.A.Materia Prima Books
5-star seller
AbeBooks seller since January 25, 2022
Hardcover
Condition: Used - Fine
US$ 35.00
US$ 4.50 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketItem description from seller
First Edition. 9.5 x 7.75 in. xv, 511 pp. Glossy illustrated boards. No internal markings, faint shelf-wear. Near Fine.
Seller Inventory # 5173
- Title
- Fundamental Problems of Algorithmic Algebra
- Author
- Yap, Chee Keng
- Publisher
- Oxford University Press
- Publication year
- 2000
- Condition
- Fine
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0195125169
- ISBN 13
- 9780195125160
- Edition
- 1st Edition
Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.
Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.
Features
· Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system
· Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor
· Aims to be self-contained in its mathematical development
· Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students
Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.
Features
· Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system
· Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor
· Aims to be self-contained in its mathematical development
· Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students
"Synopsis" may belong to another edition of this title.
About the Author
Chee Keng Yap is at New York University.
"About the title" may belong to another edition of this title.
Materia Prima Books
New haven, CT, U.S.A.
5-star seller
AbeBooks seller since January 25, 2022
Shipping rates within U.S.A.
| Item | 5 to 14 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 4.50 | US$ 12.50 |
Payment methods
Seller's business information
Materia Prima Books
CT, U.S.A.