Condition The Geometry of Numerical Algorithms /

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 shape...

Full description

Main Authors: Bürgisser, Peter. (Author, http://id.loc.gov/vocabulary/relators/aut), Cucker, Felipe. (http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Edition:1st ed. 2013.
Series:Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics, 349
Subjects:
Online Access:https://doi.org/10.1007/978-3-642-38896-5
LEADER 05131nam a22005895i 4500
001 978-3-642-38896-5
003 DE-He213
005 20210618083905.0
007 cr nn 008mamaa
008 130813s2013 gw | s |||| 0|eng d
020 |a 9783642388965  |9 978-3-642-38896-5 
024 7 |a 10.1007/978-3-642-38896-5  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a PBKS  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a PBKS  |2 thema 
082 0 4 |a 518.1  |2 23 
100 1 |a Bürgisser, Peter.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Condition  |h [electronic resource] :  |b The Geometry of Numerical Algorithms /  |c by Peter Bürgisser, Felipe Cucker. 
250 |a 1st ed. 2013. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2013. 
300 |a XXXI, 554 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics,  |x 0072-7830 ;  |v 349 
505 0 |a 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's Method -- 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 . 
520 |a 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 17th 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. 
650 0 |a Algorithms. 
650 0 |a Computer science—Mathematics. 
650 0 |a Probabilities. 
650 0 |a Computer mathematics. 
650 0 |a Mathematical optimization. 
650 1 4 |a Algorithms.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M14018 
650 2 4 |a Mathematics of Computing.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I17001 
650 2 4 |a Probability Theory and Stochastic Processes.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M27004 
650 2 4 |a Computational Mathematics and Numerical Analysis.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 
650 2 4 |a Computational Science and Engineering.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M14026 
650 2 4 |a Optimization.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M26008 
700 1 |a Cucker, Felipe.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642440120 
776 0 8 |i Printed edition:  |z 9783642388958 
776 0 8 |i Printed edition:  |z 9783642388972 
830 0 |a Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics,  |x 0072-7830 ;  |v 349 
856 4 0 |u https://doi.org/10.1007/978-3-642-38896-5 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)