Fundamental Problems of Algorithmic Algebra - Hardcover

Yap, Chee Keng

 
9780195125160: Fundamental Problems of Algorithmic Algebra
Hardcover
ISBN 10: 0195125169 ISBN 13: 9780195125160
Publisher: Oxford University Press, 1999

Synopsis

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

"synopsis" may belong to another edition of this title.

About the Author

Chee Keng Yap is at New York University.

"About this title" may belong to another edition of this title.

Publisher
Oxford University Press
Publication date
1999
Language
English
ISBN 10 
0195125169
ISBN 13 
9780195125160
Binding
Hardcover
Edition number
1
Number of pages
528