Convergence of recursive functions on computers

A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {fn} is convergent on a metric space I ⊆ ℝ, then it is possible to observe this behaviour on the set 𝔻 ⊂ ℚ of all numbers represented in a computer. However,...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of engineering (Stevenage, England) Vol. 2014; no. 10; pp. 560 - 562
Main Author:	Nepomuceno, Erivelton Geraldo
Format:	Journal Article
Language:	English
Published:	The Institution of Engineering and Technology 01.10.2014 Wiley
Subjects:	convergence of numerical methods convergent function sequence metric space numerical computation recursive function convergence recursive function fixed points recursive functions set theory convergent function sequence metric space numerical computation recursive functions convergence of numerical methods set theory recursive function fixed points recursive function convergence
ISSN:	2051-3305, 2051-3305
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!