, , , e.a.

Algebraic Systems and Computational Complexity Theory

Gebonden EN 1994 9780792325338
€ 119,62
Levertijd ongeveer 16 werkdagen
Gratis verzonden

Samenvatting

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.

Specificaties

ISBN13:9780792325338
Taal:EN
Bindwijze:Gebonden
Aantal pagina's:256
Uitgever:Kluwer Academic Publishers

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Managementboek Top 100

€ 119,62
Levertijd ongeveer 16 werkdagen
Gratis verzonden

Rubrieken

    Personen

      Trefwoorden

        Artikelen

          Algebraic Systems and Computational Complexity Theory