9780195125160
Fundamental Problems Of Algorithmic Algebra - Chee Keng Yap
Oxford University Press (1999)
In Collection
#7897

Read It:
Yes
Algebra - Data processing, Algorithms

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 DT Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system DT Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor DT Aims to be self-contained in its mathematical development DT Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students

Product Details
LoC Classification QA155.7.E4 .Y36 2000
Dewey 512.0285
Format Hardcover
Cover Price 135,00 €
No. of Pages 528
Height x Width 243 x 200 mm