Jump to content

Information-based complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Apapageorgiou (talk | contribs) at 20:02, 1 December 2006 (Created page with ''''Informatio-Based Complexity''' (IBC) studies optimal algorithms and computational complexity for the continuous problems which arise in physical science, economi...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Informatio-Based Complexity (IBC) studies optimal algorithms and computational complexity for the continuous problems which arise in physical science, economics, engineering, and mathematical finance. IBC has studied such continuous problems as path integration, partial differential equations, systems of ordinary differential equations, nonlinear equations, integral equations, fixed points, and very high-dimensional integration. All these problems involve functions (typically multivariate) of a real or complex variable. Since one can never obtain a closed-form solution of the problems of interest one has to settle for a numerical solution. Since a function of a real or complex variable cannot be entered into a digital computer, the solution of continuous problems involves