Atjaunināt sīkdatņu piekrišanu

Recent Advances in Real Complexity and Computation [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 185 pages, weight: 295 g
  • Sērija : Contemporary Mathematics
  • Izdošanas datums: 01-Dec-2013
  • Izdevniecība: American Mathematical Society
  • ISBN-10: 0821891502
  • ISBN-13: 9780821891506
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 87,23 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 185 pages, weight: 295 g
  • Sērija : Contemporary Mathematics
  • Izdošanas datums: 01-Dec-2013
  • Izdevniecība: American Mathematical Society
  • ISBN-10: 0821891502
  • ISBN-13: 9780821891506
Citas grāmatas par šo tēmu:
This volume is composed of six contributions derived from the lectures given during the UIMP-RSME Lluis Santalo Summer School on ""Recent Advances in Real Complexity and Computation'', held July 16-20, 2012, in Santander, Spain. The goal of this Summer School was to present some of the recent advances on Smale's 17th Problem: ``Can a zero of $n$ complex polynomial equations in $n$ unknowns be found approximately, on the average, in polynomial time with a uniform algorithm?'' These papers cover several aspects of this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity aspects (both worse and average cases and both upper and lower complexity bounds) as well as aspects of the underlying geometry of the problem. Some of the contributions also deal with either real or multiple solutions solving.

This book is published in cooperation with Real Sociedad Matematica Espanola (RSME).
Editors' preface ix
Topics in real and complex number complexity theory
1(54)
Martijn Baartse
Klaus Meer
Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
55(16)
Bernd Bank
Marc Giusti
Joos Heintz
The complexity and geometry of numerically solving polynomial systems
71(34)
Carlos Beltran
Michael Shub
Multiplicity hunting and approximating multiple roots of polynomial systems
105(24)
M. Giusti
J.-C. Yakoubsohn
On the intrinsic complexity of elimination problems in effective algebraic geometry
129(22)
Joos Heintz
Bart Kuijpers
Andres Rojas Paredes
Newton iteration, conditioning and zero counting
151
Gregorio Malajovich