Andere Kunden interessierten sich auch für
![Quasiconvex Optimization and Location Theory]( "Quasiconvex Optimization and Location Theory")
Quasiconvex Optimization and Location Theory126,99 €![Computational Statistics]( "Computational Statistics")
Computational Statistics154,99 €![Computational Statistics]( "Computational Statistics")
Computational Statistics67,99 €![Introduction to Global Optimization]( "Introduction to Global Optimization")
Introduction to Global Optimization125,99 €![Global Optimization with Non-Convex Constraints]( "Global Optimization with Non-Convex Constraints")
Global Optimization with Non-Convex Constraints335,99 €![Nondifferentiable Optimization and Polynomial Problems]( "Nondifferentiable Optimization and Polynomial Problems")
Nondifferentiable Optimization and Polynomial Problems110,99 €![Continuation and Bifurcations: Numerical Techniques and Applications]( "Continuation and Bifurcations: Numerical Techniques and Applications")
Continuation and Bifurcations: Numerical Techniques and Applications111,99 €
Significant progress has been made during the last fifteen 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.
For researchers and graduates interested in algebraic equations and computational complexity theory.
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.
For researchers and graduates interested in algebraic equations and computational complexity theory.