Explore how small changes near ill-posed problems reveal big shifts in stability across core numerical tasks. This work shows a unifying view of condition numbers and distance to the nearest ill-posed problem, with concrete links to matrix inversion, eigenvalue computations, polynomial zeros, and pole assignment in control systems.
In clear terms, the book explains how the reciprocal of a condition number bounds how far a problem is from becoming ill-posed. It uses locally available information to answer a global question: how close is the nearest ill-posed case in several important problem classes? The discussion includes differential inequalities, explicit bounds, and practical implications for common numerical tasks, organized to let readers explore each topic independently.
- See how a problem’s sensitivity relates to its distance from ill-posedness.
- Learn the differential-inequality approach and how it yields upper and lower distance bounds.
- Compare results across matrix inversion, eigensystems, polynomial roots, and pole assignment.
- Understand the role of norms and gradients in deriving robust estimates.
Ideal for readers of advanced linear algebra and numerical analysis who want a cohesive framework for stability and conditioning in key computational problems, presented with accessible math and usable insights.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book focuses on the relationship between a problem's condition number and the distance to the nearest ill-posed problem. The condition number measures the sensitivity of the answer to small changes in the input, and an ill-posed problem is one with an infinite condition number. The author shows that for many problems in numerical analysis, there is a simple relationship between the condition number and the distance to the nearest ill-posed problem. This relationship is explained using differential inequalities and can be used to derive upper and lower bounds on the distance to the nearest ill-posed problem. The author also discusses the implications of this relationship for the conditioning of matrix inversion, eigendecompositions, polynomial zero finding, and pole assignment in linear control systems. Overall, this book provides a unified and insightful approach to understanding the conditioning of numerical problems and the distance to the nearest ill-posed problem. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332890002_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332890002
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332890002
Quantity: 15 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 28 pages. 9.02x5.98x0.06 inches. In Stock. This item is printed on demand. Seller Inventory # 1332890008
Quantity: 1 available