A theorem is presented which has applications in the numerical computation of fixedpoints of recursivefunctions. If a sequence of functions {fn} is convergent on a metric space I subset of R, then it is possible to ...
详细信息
A theorem is presented which has applications in the numerical computation of fixedpoints of recursivefunctions. If a sequence of functions {fn} is convergent on a metric space I subset of R, then it is possible to observe this behaviour on the set D subset of Q of all numbers represented in a computer. However, as D is not complete, the representation of fn on D is subject to an error. Then f(n) and f(m) are considered equal when its differences computed on D are equal or lower than the sum of error of each f(n) and f(m). An example is given to illustrate the use of the theorem.
暂无评论