Condition by Bürgisser, Peter; Cucker, Felipe;

The Geometry of Numerical Algorithms

Sorozatcím: Grundlehren der mathematischen Wissenschaften; 349;

20% KEDVEZMÉNY?
A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.

Kiadói listaár EUR 149.79
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.

62 125 Ft (59 167 Ft + 5% áfa)
Kedvezmény(ek) 20% (cc. 12 425 Ft off)
Kedvezményes ár 49 700 Ft (47 334 Ft + 5% áfa)

62 125 Ft

Beszerezhetőség

Megrendelésre a kiadó utánnyomja a könyvet. Rendelhető, de a szokásosnál kicsit lassabban érkezik meg.

A termék adatai:

Kiadás sorszáma Softcover reprint of the original 1st ed. 2013
Kiadó Springer Berlin Heidelberg
Megjelenés dátuma 2015. augusztus 22.
Kötetek száma 1 pieces, Previously published in hardcover

ISBN 9783642440120
Kötéstípus Puhakötés
Lásd még 9783642388958
Terjedelem554 oldal
Méret 235x155 mm
Súly 8774 g
Nyelv angol
Illusztrációk XXXI, 554 p.

Kategóriák

Hosszú leírás:

This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspect in the understanding of the performance ---regarding both stability and complexity--- of numerical algorithms. While the role of condition was shaped in the last half-century, so far there has not been a monograph treating this subject in a uniform and systematic way. The book puts special emphasis on the probabilistic analysis of numerical algorithms via the analysis of the corresponding condition. The exposition's level increases along the book, starting in the context of linear algebra at an undergraduate level and reaching in its third part the recent developments and partial solutions for Smale's 17^th problem which can be explained within a graduate course. Its middle part contains a condition-based course on linear programming that fills a gap between the current elementary expositions of the subject based on the simplex method and those focusing on convex programming.

Több

Tartalomjegyzék:

Preface.- Overture: On the Condition of Numerical Problems and the Numbers that Measure It.- I Condition in Linear Algebra (Adagio): 1 Normwise Condition of Linear Equation Solving.- 2 Probabilistic Analysis.- 3 Error Analysis of Triangular Linear Systems.- 4 Probabilistic Analysis of Rectangular Matrices.- 5 Condition Numbers and Iterative Algorithms.- Intermezzo I: Condition of Structured Data.- II Condition in Linear Optimization (Andante): 6 A Condition Number for Polyhedral Conic Systems.- 7 The Ellipsoid Method.- 8 Linear Programs and their Solution Sets.- 9 Interior-point Methods.- 10 The Linear Programming Feasibility Problem.- 11 Condition and Linear Programming Optimization.- 12 Average Analysis of the RCC Condition Number.- 13 Probabilistic Analyses of the GCC Condition Number.- Intermezzo II: The Condition of the Condition.- III Condition in Polynomial Equation Solving (Allegro con brio): 14 A Geometric Framework for Condition Numbers.- 15 Homotopy Continuation and Newton'sMethod.- 16 Homogeneous Polynomial Systems.- 17 Smale's 17th Problem: I.- 18 Smale's 17th Problem: II.- 19 Real Polynomial Systems.- 20 Probabilistic Analysis of Conic Condition Numbers: I. The Complex Case 4.- 21 Probabilistic Analysis of Conic Condition Numbers: II. The Real Case.- Appendix.

Több

Mostanában megtekintett