Complexity theory has become an increasingly important theme in mathematical research. This book deals with an approximate solution of differential or integral equations by algorithms using incomplete information. This situation often arises for equations of the form Lu = f where f is some function defined on a domain and L is a differential operator. We do not have complete information about f. For instance, we might only know its value at a finite number of points in the domain, or the values of its inner products with a finite set of known functions. Consequently the best that can be hoped for is to solve the equation to within a given accuracy at minimal cost or complexity. In this book, the theory of the complexity of the solution to differential and integral equations is developed. The relationship between the worst case setting and other (sometimes more tractable) related settings, such as the average case, probabilistic, asymptotic, and randomized settings, is also discussed. The author determines the inherent complexity of the problem and finds optimal algorithms (in the sense of having minimal cost). Furthermore, he studies to what extent standard algorithms (such as finite element methods for elliptic problems) are optimal. This approach is discussed in depth in the context of two-point boundary value problems, linear elliptic partial differential equations, integral equations, ordinary differential equations, and ill-posed problems. As a result, this volume should appeal to mathematicians and numerical analysts working on the approximate solution of differential and integral equations, as well as to complexity theorists addressing related questions in this area.
"synopsis" may belong to another edition of this title.
Arthur G. Werschulz, Associate Professor of Mathematics and Computer Science, Fordham University; Visiting Scholar, Columbia University.
"About this title" may belong to another edition of this title.
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_441173968
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # df5f01f9c63323cb41631eb4eaae964e
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 15994915-n
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198535898
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 15994915
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L1-9780198535898
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 15994915-n
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 15994915
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 730. Seller Inventory # C9780198535898
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. This book is concerned with a central question in numerical analysis: the approximate solution of differential or integral equations by algorithms using incomplete information. This situation often arises for equations of the form Lu = f, where f is some function defined on a domain and L is a differential operator. The function f may not be given exactly - we might only know its value at a finite number of points in the domain. Consequently the best that can behoped for is to solve the equation to within a given accuracy at minimal cost or complexity. The author develops the theory of the complexity of the solutions to differential andintegral equations and discusses the relationship between the worst-case setting and other (sometimes more tractable) related settings such as the average case, probabilistic, asymptotic, and randomized settings. Furthermore, he studies to what extent standard algorithms (such as finite element methods for elliptic problems) are optimal. This approach is discussed in depth in the context of two-point boundary value problems, linear elliptic partial differential equations,integral equations, ordinary differential equations, and ill-posed problems. As a result, this volume should appeal to mathematicians and numerical analysts working on the approximate solution ofdifferential and integral equations as well as to complexity theorists addressing related questions in this area. This book is concerned with a central question in numerical analysis: how efficient can algorithms be made given only incomplete information about a differential or integral equation? This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780198535898
Quantity: 1 available