Muutke küpsiste eelistusi

E-raamat: Recent Advances in Real Complexity and Computation

Edited by , Edited by
  • Formaat: 185 pages
  • Sari: Contemporary Mathematics
  • Ilmumisaeg: 01-Dec-2013
  • Kirjastus: American Mathematical Society
  • ISBN-13: 9781470414092
  • Formaat - PDF+DRM
  • Hind: 100,78 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 185 pages
  • Sari: Contemporary Mathematics
  • Ilmumisaeg: 01-Dec-2013
  • Kirjastus: American Mathematical Society
  • ISBN-13: 9781470414092

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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