Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

The Computational Complexity of Differential and Integral Equations: An Information-Based Approach

by Arthur G. Werschulz
Save 17% Save 17%
Current price ₹6,703.00
Original price ₹8,044.00
Original price ₹8,044.00
Original price ₹8,044.00
(-17%)
₹6,703.00
Current price ₹6,703.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9780198535898
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Oxford University Press, USA
  • Publisher Imprint: Oxford University Press, USA
  • Publication Date:
  • Pages: 344
  • Original Price: GBP 46.49
  • Language: English
  • Edition: N/A
  • Item Weight: 704 grams
  • BISAC Subject(s): Differential Equations / General

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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us