Condition
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)
Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)

Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)


     0     
5
4
3
2
1



International Edition


About the Book

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.

Table of Contents:
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​.

About the Author :
Peter Bürgisser is an internationally recognized expert in complexity theory. He is associate editor of the journal Computational Complexity and he was invited speaker at the 2010 International Congress Mathematicians. Felipe Cucker is well known for his work on complexity over the real numbers, jointly with L. Blum, S. Smale and M. Shub. He also worked in learning theory and made seminal contributions to condition numbers in optimization and their probabilistic analyses. F.C. is former chair of the Society for the Foundations of Computational Mathematics and the current managing editor of the society's journal.

Review :
“The book under review is divided into three parts, ‘which approximately correspond to themes of conditioning in linear algebra, linear programming, and polynomial equation solving’. … Given its detailed covering of a wide range of topics and its geometric approach, I think this book may well become a must-have for all who are seriously interested in numerical algorithms.” (S. C. Coutinho, The Mathematical Gazette, Vol. 99 (546), November, 2015) “This book published in 2013 is the first book devoted entirely on this subject. It must be said that this book is a full success since it realizes a synthesis of ideas and works on the mathematical foundations on conditioning. … The book is self contained and easy to read … . The book ends with the statement of eighteen open problems that shows that Mr. Condition has a bright future ahead of him.” (Jean-Claude Yakoubsohn, Jahresbericht der Deutschen Mathematiker-Vereinigung, Vol. 117, 2015) “The authors intend with this book to fill the gap by addressing the probabilistic analysis of the algorithms related to condition numbers. … Under the vigilant eyes of so many famous scientists, it is sure that this book is a milestone in this area of research. … The monograph under review is without any doubt a very carefully prepared one, and researchers interested in numerical analysis (and related topics) should become familiar with this book.” (Elena Pelican, Mathematical Reviews, August, 2014) “This book studies a type of numerical imprecision that arises universally. … Bürgisser (Technical Univ. of Berlin, Germany) and Cucker (City Univ. of Hong Kong) provide the first book-length treatment of the concept. … Summing Up: Recommended. Upper-division undergraduates through researchers/faculty.” (D. V. Feldman, Choice, Vol. 51 (11), July, 2014) “The authors of this book discuss the ways that such errors are produced in a computer, and consider the use of condition numbers to understand the performance of numerical algorithms. … this monograph not only offers a well-organized and systematic introduction to the subject, but also works as a useful reference for advanced researchers.” (Tanbir Ahmed, Computing Reviews, November, 2013)


Best Sellers


Product Details
  • ISBN-13: 9783642388958
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 554
  • Returnable: Y
  • Sub Title: The Geometry of Numerical Algorithms
  • ISBN-10: 3642388957
  • Publisher Date: 23 Aug 2013
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Series Title: 349 Grundlehren der mathematischen Wissenschaften
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Condition: The Geometry of Numerical Algorithms(349 Grundlehren der mathematischen Wissenschaften)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!