
Algebraic Systems and Computational Complexity Theory
Algebraic Systems and Computational Complexity Theory (Hardcover)
R 2 689.00
Loot · checked 2 days ago
- Average
- R 2 689.00
- Lowest seen
- R 2 689.00
- Highest seen
- R 2 689.00
- Last change
- R 0.00
- First indexed
- 28 Sep 2026
- Retailer
- Loot
Description
Significant progress has been made during the last 15 years in the solution of nonlinear systems, particularly in computing fixed points, solving systems of nonlinear equations and applications to equilibrium models. This volume presents a self-contained account of recent work on simplicial and continuation methods applied to the solution of algebraic equations. The contents are divided into eight chapters. Chapters 1 and 2 deal with Kuhn's algorithm. Chapter 3 considers Newton's method, and a comparison between Kuhn's algorithm and Newton's method is presented in Chapter 4. The following four chapters discuss respectively, incremental algorithms and their cost theory, homotopy algorithms, zeros of polynomial mapping, and piecewise linear algorithms. This text is designed for use by researchers and graduates interested in algebraic equations and computational complexity theory.
Similar products

Loot
The Algebraic Theory of Modular Systems
R 1 100.00

Loot
Operator Algebras in Dynamical Systems
R 3 636.00

Loot
Poincare Duality Algebras, Macaulay's Dual Systems, and Steenrod Operations
R 3 626.00

Loot
Lie Algebras, Geometry, and Toda-Type Systems
R 1 494.00

Loot
Automata, Formal Languages And Algebraic Systems - Proceedings Of Aflas 2008
R 2 594.00

Loot
Symmetries in Science 5
R 2 558.00
Takealot
The Laplace Transform
R 395.00

Takealot
Lie Algebraic Methods in Integrable Systems
R 6 566.00
−12%Takealot
Algebraic and Differential Topology of Robust Stability
R 6 597.00R 8 855.00