Author: Wang Zeke et al.
Language: English
ISBN/ISSN: 7030039440
1994; Hardcover;165x250mm;243

This monograph provides a systematical and self-contained presentation of the developments.

Table of Contents


CONTENTS

Chapter 1 Kuhn’s algorithm for algebraic equations
Chapter 2 Efficiency of Kuhn’s algorithm
Chapter 3 Newton method and approximate zeros
Chapter 4 A complexity comparison of Kuhn’s algorithm and Newton method
Chapter 5 Incremental algorithms and cost theory
Chapter 6 Homotopy algorithms
Chapter 7 Probabilistic discussion on zero of polynomial mappings
Chapter 8 Piecewise linear algorithms