×







We sell 100% Genuine & New Books only!

Algebraic Systems And Computational Complexity Theory 1994 Edition at Meripustak

Algebraic Systems And Computational Complexity Theory 1994 Edition by TSE-K'O WANG, S. XU, SPRINGER

Books from same Author: TSE-K'O WANG, S. XU

Books from same Publisher: SPRINGER

Related Category: Author List / Publisher List


  • Price: ₹ 11552.00/- [ 0.00% off ]

    Seller Price: ₹ 11552.00

Estimated Delivery Time : 4-5 Business Days

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)TSE-K'O WANG, S. XU
    PublisherSPRINGER
    ISBN9780792325338
    Pages256
    BindingHardback
    Publish YearDecember 1994

    Description

    SPRINGER Algebraic Systems And Computational Complexity Theory 1994 Edition by TSE-K'O WANG, S. XU

    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.



    Book Successfully Added To Your Cart