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

Author:   A.G. Werschulz
Publisher:   Oxford University Press
ISBN:  

9780198535898


Pages:   342
Publication Date:   29 August 1991
Format:   Hardback
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Our Price $73.95 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

In this text the author develops the theory of the complexity of the solution to differential and integral equations and discusses the relationship between the worst-case setting and two related problems: the average-case setting and the probalistic setting.

Full Product Details

Author:   A.G. Werschulz
Publisher:   Oxford University Press
Imprint:   Oxford University Press
Dimensions:   Width: 16.40cm , Height: 2.50cm , Length: 24.10cm
Weight:   0.702kg
ISBN:  

9780198535898


ISBN 10:   0198535899
Pages:   342
Publication Date:   29 August 1991
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   To order   Availability explained
Stock availability from the supplier is unknown. We will order it for you and ship this item to you once it is received by us.

Table of Contents

Introduction; EXAMPLE: A TWO-POINT BOUNDARY VALUE PROBLEM: Introduction; Error, cost, and complexity; A minimal error algorithm; Complexity bounds; Comparison with the finite element method; Standard information; Final remarks; GENERAL FORMULATION: Introduction; Problem formulation; Information; Model of computation; Algorithms, their errors, and their costs; Complexity; Randomized setting; Asymptotic setting; THE WORST CASE SETTING: GENERAL RESULTS: Introduction; Radius and diameter; Complexity; Linear problems; The residual error criterion; ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS IN THE WORST CASE SETTING; Introduction; Variational elliptic boundary value problems; Problem formulation; The normed case with arbitrary linear information; The normed case with standard information; The seminormed case; Can adaption ever help?; OTHER PROBLEMS IN THE WORST CASE SETTING: Introduction; Linear elliptic systems; Fredholm problems of the second kind; Ill-posed problems; Ordinary differential equations; THE AVERAGE CASE SETTING: Introduction; Some basic measure theory; General results for the average case setting; Complexity of shift-invariant problems; Ill-posed problems; The probabilistic setting; COMPLEXITY IN THE ASYMPTOTIC AND RANDOMIZED SETTINGS: Introduction; Asymptotic setting; Randomized setting; Appendices; Bibliography.

Reviews

'This book ... is a most welcome addition to the theoretical computer science and numerical analysis literature. Though it is intended as a summary of current research, it is of the quality that would make it an excellent textbook on the subject for advanced numerical analysis and computer science courses .. it reads easily and lucidly.' R.S. Andersen 'An excellent and accessible introduction to the complexity of basic arithmetic operations ... it adds an interesting new dimension to the study of numerical methods for the solution of PDEs.' Notices of the A.M.S.


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List