The Computational Complexity of Differential and Integral Equations:An Information-Based Approach(Oxford Mathematical Monographs)

数学史

售   价:
474.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
1991年08月29日
装      帧
精装
ISBN
9780198535898
复制
页      码
342
开      本
234x156mm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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? Typically this question might arise when an equation is of the form Lu = f, where f is some function defined on a domain and L is a differential operator. We may not be given f exactly, merely its value at a finite number of points in the domain. Consequently the best that can be hoped 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 solution to differential and integral equations and discusses the relationship between the worst-case setting and two (sometimes more tractable) related problems: the average-case setting and the probalistic setting. He addresses both the computation of the complexity of algorithms and also determining optimal algorithms (in the sense of having minimal cost).
馆藏图书馆
Princeton University Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个