Fundamental Problems in Algorithmic Algebra

Focuses on a collection of core problems in the field of Computer Algebra, or Algorithmic Algebra. It attempts to be self-contained in its mathematical development while addressing the algorithmic aspects of problems.

**Tag(s):**
Algebra
Computer Aided Mathematics

**Publication date**: 30 Dec 1999

**ISBN-10**:
0195125169

**ISBN-13**:
9780195125160

**Paperback**:
546 pages

**Views**: 22,454

Fundamental Problems in Algorithmic Algebra

Focuses on a collection of core problems in the field of Computer Algebra, or Algorithmic Algebra. It attempts to be self-contained in its mathematical development while addressing the algorithmic aspects of problems.

Terms and Conditions:

Book Excerpts:

These notes were first written for a course on Algebraic Computing: Solving Systems of Polynomial Equations, given at the Free University of Berlin. They were thoroughly revised following a similar course at the Courant Institute. Prerequisites are an undergraduate course in algebra and a graduate course in algorithmics.

These notes should be regarded as an introduction to computer algebra which uses quite distinct techniques, and satisfies requirements distinct from that in numerical analysis. In many areas of computer application (robotics, computer aided design. geometric modeling, etc) computer algebra is now recognized as an essential tool. This is partly driven by the wide-spread availability of powerful computer work-stations, and the rise of a new generation of computer algebra systems such as Mathematica or Maple to take advantage of this computing power.

The book consists of a selection of topics that are appropriate for bringing a student or researcher up to date on a spectrum of optimal-complexity algorithms. After some preliminary material, the tasks discussed range from fast integer multiplication using the fast Fourier transform, through greatest common divisor, subresultants, polynomial root isolation, factoring, linear and nonlinear elimination (Grbner bases), and polynomial ideal theory, to continued fractions.

The style of the book has been kept close to the lecture form in which this material originally existed. Of course, the lecture material is considerably expanded. This mainly consisted of the filling in of mathematical background; a well-equipped student may skip this.

Review(s):

:idea: Richard Fateman, Computing Reviews

"I see it as a sequel to a course in modern algebra for students interested in complexity aspects of constructive mathematics. For graduate students and researchers, it is an excellent review of the chosen topics with contemporary references."

:idea: Arjeh M. Cohen, Mathematics of Computation

"... it is an almost self-contained treatment of the most basic topics in computer algebra, well presented, and with good attention to complexity issues."

Chee Keng Yap wrote:This preliminary version may be freely copied, in part or wholly, and distributed for private or class use, provided this copyright page is kept intact with each copy.

Book Excerpts:

These notes were first written for a course on Algebraic Computing: Solving Systems of Polynomial Equations, given at the Free University of Berlin. They were thoroughly revised following a similar course at the Courant Institute. Prerequisites are an undergraduate course in algebra and a graduate course in algorithmics.

These notes should be regarded as an introduction to computer algebra which uses quite distinct techniques, and satisfies requirements distinct from that in numerical analysis. In many areas of computer application (robotics, computer aided design. geometric modeling, etc) computer algebra is now recognized as an essential tool. This is partly driven by the wide-spread availability of powerful computer work-stations, and the rise of a new generation of computer algebra systems such as Mathematica or Maple to take advantage of this computing power.

The book consists of a selection of topics that are appropriate for bringing a student or researcher up to date on a spectrum of optimal-complexity algorithms. After some preliminary material, the tasks discussed range from fast integer multiplication using the fast Fourier transform, through greatest common divisor, subresultants, polynomial root isolation, factoring, linear and nonlinear elimination (Grbner bases), and polynomial ideal theory, to continued fractions.

The style of the book has been kept close to the lecture form in which this material originally existed. Of course, the lecture material is considerably expanded. This mainly consisted of the filling in of mathematical background; a well-equipped student may skip this.

Review(s):

:idea: Richard Fateman, Computing Reviews

"I see it as a sequel to a course in modern algebra for students interested in complexity aspects of constructive mathematics. For graduate students and researchers, it is an excellent review of the chosen topics with contemporary references."

:idea: Arjeh M. Cohen, Mathematics of Computation

"... it is an almost self-contained treatment of the most basic topics in computer algebra, well presented, and with good attention to complexity issues."

Tweet

About The Author(s)

No information is available for this author.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Rexx
Microsoft .NET
Perl
PHP
R
Python
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors