Algebraic Systems and Computational Complexity Theory
内容简介
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 ...
(展开全部)
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.
您对《Algebraic Systems and Computational Complexity Theory》有什么评价吗,点击右上角“我想说两句”,说出你的看法吧。
有什么“读后感”吗?您可点击右上角“我要写长评”来进行评价噢。
猜您喜欢读
网友关注
网友关注
精品推荐
分类导航
评价“Algebraic Systems and Computational Complexity Theory”