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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of engineering (Stevenage, England) Ročník 2014; číslo 10; s. 560 - 562
Hlavní autor: Nepomuceno, Erivelton Geraldo
Médium: Journal Article
Jazyk:angličtina
Vydáno: The Institution of Engineering and Technology 01.10.2014
Wiley
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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, as 𝔻 is not complete, the representation of fn on 𝔻 is subject to an error. Then fn and fm are considered equal when its differences computed on 𝔻 are equal or lower than the sum of error of each fn and fm. An example is given to illustrate the use of the theorem.
AbstractList 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, as 𝔻 is not complete, the representation of fn on 𝔻 is subject to an error. Then fn and fm are considered equal when its differences computed on 𝔻 are equal or lower than the sum of error of each fn and fm. An example is given to illustrate the use of the theorem.
A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions { f n } 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, as is not complete, the representation of f n on is subject to an error. Then f n and f m are considered equal when its differences computed on 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.
A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {f(n)} 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, as 𝔻 is not complete, the representation of f(n) on 𝔻 is subject to an error. Then f(n) and f(m) are considered equal when its differences computed on 𝔻 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.
Author Nepomuceno, Erivelton Geraldo
Author_xml – sequence: 1
  givenname: Erivelton Geraldo
  surname: Nepomuceno
  fullname: Nepomuceno, Erivelton Geraldo
  email: nepomuceno@ufsj.edu.br
  organization: 2Model and Control Group, Department of Electrical Engineering, Federal University of São João del-Rei, São João del-Rei, Brazil
BookMark eNp9kc1PAjEQxRuDiYgcve_Fg4eF6QdL96gEFELCBc9Nt50lJbAl3QXjf28RTYgRT520v_dm-uaWtCpfISH3FHoURN5fe-wxoKIHjMkr0mYwoCnnMGid1TekW9drAKBcMBC0TfojXx0wrLAymPgyCWj2oXYHTMp9ZRrnqzrxVWL8drdvMNR35LrUmxq732eHvE3Gy9FrOl-8TEdP89RwyUVKC2MZpVra0mIcL4Ms51KWWSbRWlkwk0vLZHwqqLaFtTa3nBUDAF4A5Ix3yPTka71eq11wWx0-lNdOfV34sFI6NM5sUEk00iCHwqIULEeth9FEi6GhgtliGL34ycsEX9cBS2Vco49_a4J2G0VBHSNUMUJ1jFAdI4yq9JfqZ4pLfHbi390GP_6H1XI2Zs-TuAcQUfh4EjpsIrYPVQz2YpOHP9jZYnzmvbMl_wTX6p5Z
CitedBy_id crossref_primary_10_1080_21642583_2017_1387874
crossref_primary_10_1016_j_amc_2018_02_020
Cites_doi 10.1007/BF01020332
10.1038/261459a0
10.1049/el:20030881
10.1017/CBO9780511626296
10.1137/1.9780898718072
10.1007/BF02703801
10.1007/s11071-013-1007-4
ContentType Journal Article
Copyright 2021 The Institution of Engineering and Technology
Copyright_xml – notice: 2021 The Institution of Engineering and Technology
DBID IDLOA
24P
AAYXX
CITATION
DOA
DOI 10.1049/joe.2014.0228
DatabaseName IET Digital Library Open Access
Wiley Online Library Open Access
CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: 24P
  name: Wiley Online Library Open Access
  url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  sourceTypes: Publisher
– sequence: 2
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2051-3305
EndPage 562
ExternalDocumentID oai_doaj_org_article_8ec8ce30bde8429eaa73b0a47c142db7
10_1049_joe_2014_0228
TJE2BF00104
Genre article
GrantInformation_xml – fundername: CNPq/INERGE
GroupedDBID 24P
5VS
AAJGR
ADACO
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BFFAM
GROUPED_DOAJ
IDLOA
KQ8
OCL
OK1
RIE
RIG
RNS
RUI
0R~
1OC
AAHJG
ABJCF
ABQXS
ACCMX
ACESK
ACXQS
AFKRA
ARAPS
AVUZU
BENPR
BGLVJ
CCPQU
EBS
HCIFZ
IAO
IGS
IPNFZ
ITC
M43
M7S
M~E
PIMPY
PTHSS
ROL
AAMMB
AAYXX
ADMLS
AEFGJ
AFFHD
AGXDD
AIDQK
AIDYY
CITATION
PHGZM
PHGZT
PQGLB
WIN
ID FETCH-LOGICAL-c3834-1bcd211a8dfde0496069388f668edd8b2c98d28e04b1adbddd9d32b5003b00923
IEDL.DBID DOA
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000215583300090&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2051-3305
IngestDate Fri Oct 03 12:53:05 EDT 2025
Wed Oct 29 21:24:55 EDT 2025
Tue Nov 18 21:56:03 EST 2025
Wed Jan 22 16:30:48 EST 2025
Tue Jan 05 21:45:52 EST 2021
Thu May 09 18:03:13 EDT 2019
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Keywords convergent function sequence
metric space
numerical computation
recursive functions
convergence of numerical methods
set theory
recursive function fixed points
recursive function convergence
Language English
License Attribution-NonCommercial-NoDerivs
http://creativecommons.org/licenses/by-nc-nd/3.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3834-1bcd211a8dfde0496069388f668edd8b2c98d28e04b1adbddd9d32b5003b00923
OpenAccessLink https://doaj.org/article/8ec8ce30bde8429eaa73b0a47c142db7
PageCount 3
ParticipantIDs wiley_primary_10_1049_joe_2014_0228_TJE2BF00104
crossref_citationtrail_10_1049_joe_2014_0228
iet_journals_10_1049_joe_2014_0228
doaj_primary_oai_doaj_org_article_8ec8ce30bde8429eaa73b0a47c142db7
crossref_primary_10_1049_joe_2014_0228
ProviderPackageCode IDLOA
RUI
PublicationCentury 2000
PublicationDate October 2014
PublicationDateYYYYMMDD 2014-10-01
PublicationDate_xml – month: 10
  year: 2014
  text: October 2014
PublicationDecade 2010
PublicationTitle Journal of engineering (Stevenage, England)
PublicationYear 2014
Publisher The Institution of Engineering and Technology
Wiley
Publisher_xml – name: The Institution of Engineering and Technology
– name: Wiley
References Feigenbaum, M.J. (C1) 1978; 19
Dudek, P.; Juncu, V. (C6) 2003; 39
May, R.M. (C5) 1976; 261
1976
1978; 19
2008
1994
2003; 39
1976; 261
2001
November 2013
February 2006
e_1_2_5_7_1
Rudin W. (e_1_2_5_8_1) 1976
e_1_2_5_10_1
e_1_2_5_6_1
e_1_2_5_5_1
e_1_2_5_4_1
e_1_2_5_3_1
e_1_2_5_2_1
Schröder B.S. (e_1_2_5_9_1) 2008
References_xml – volume: 39
  start-page: 1431
  year: 2003
  end-page: 1432
  ident: C6
  article-title: Compact discrete-time chaos generator circuit
  publication-title: Electron. Lett.
– volume: 19
  start-page: 25
  issue: 1
  year: 1978
  end-page: 52
  ident: C1
  article-title: Quantitative universality for a class of nonlinear transformations
  publication-title: J. Stat. Phys.
– volume: 261
  start-page: 459
  issue: 5560
  year: 1976
  end-page: 467
  ident: C5
  article-title: Simple mathematical models with very complicated dynamics
  publication-title: Nature
– volume: 261
  start-page: 459
  issue: 5560
  year: 1976
  end-page: 467
  article-title: Simple mathematical models with very complicated dynamics
  publication-title: Nature
– start-page: 819
  year: November 2013
  end-page: 830
  article-title: Difference map and its electronic circuit realization
– volume: 39
  start-page: 1431
  year: 2003
  end-page: 1432
  article-title: Compact discrete‐time chaos generator circuit
  publication-title: Electron. Lett.
– volume: 19
  start-page: 25
  issue: 1
  year: 1978
  end-page: 52
  article-title: Quantitative universality for a class of nonlinear transformations
  publication-title: J. Stat. Phys.
– start-page: 69
  year: February 2006
  end-page: 78
  article-title: Electronic circuit realization of the logistic map
– year: 1976
– year: 1994
– year: 2008
– year: 2001
– ident: e_1_2_5_2_1
  doi: 10.1007/BF01020332
– ident: e_1_2_5_6_1
  doi: 10.1038/261459a0
– ident: e_1_2_5_7_1
  doi: 10.1049/el:20030881
– ident: e_1_2_5_5_1
  doi: 10.1017/CBO9780511626296
– volume-title: Principles of mathematical analysis
  year: 1976
  ident: e_1_2_5_8_1
– ident: e_1_2_5_10_1
  doi: 10.1137/1.9780898718072
– ident: e_1_2_5_3_1
  doi: 10.1007/BF02703801
– ident: e_1_2_5_4_1
  doi: 10.1007/s11071-013-1007-4
– volume-title: Mathematical analysis: a concise introduction
  year: 2008
  ident: e_1_2_5_9_1
SSID ssj0001342041
Score 1.9876859
Snippet A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {fn} is...
A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {fn } is...
A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions { f n } is...
A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {f(n)} is...
SourceID doaj
crossref
wiley
iet
SourceType Open Website
Enrichment Source
Index Database
Publisher
StartPage 560
SubjectTerms convergence of numerical methods
convergent function sequence
metric space
numerical computation
recursive function convergence
recursive function fixed points
recursive functions
set theory
SummonAdditionalLinks – databaseName: Wiley Online Library Open Access
  dbid: 24P
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4HeDAGzFeqhDiRNmatCQ9AtqEJjQ4ANotyqsICa1oG_x-7LQMdhgS4tq4aerYtZ0m3wdwop2VnnMTs0y2AoVZrDPpY5EJVuRGWhGQmJ5uRa8n-_38vuY5pbMwFT7EZMGNPCN8r8nBtalYSDCpJScvCeUySc8JwWUeFpOECzJrlt5_L7LwlLUCeyVD44uxds9qnE3soznVw1RcCvD9GG1e_Hg6aQ1Rp7P27_Guw2qdcEaXlYVswJwfbMLKDxjCLWhe09bzcArTR2URDWkNnra1RxT1gmFG5SCyNQHEaBseO-2H65u4JlKILRagaZwY67DQ09IVzuNosGjJuZTFxYX0zknDbC4dk9hkEu2Mcy53nJkMPd4QKBPfgYVBOfC7EHmBvSQ6bTliKeHeWI-yRWGsLDCV0g04-1KjsjXKOJFdvKrwtzvNFepBkR4U6aEBpxPxtwpeY5bgFc3JRIhQscOFcvisaidT0ltpPW8Z5yXGWa-1wBfQqbBJypwRDTjGGVW1l45mPeloSqh71_5uVG-uaEAzzPPvA1YP3Ta76gT8o70_37EPy3S92jV4AAvj4bs_hCX7MX4ZDY-CkX8CNoX5nw
  priority: 102
  providerName: Wiley-Blackwell
Title Convergence of recursive functions on computers
URI http://digital-library.theiet.org/content/journals/10.1049/joe.2014.0228
https://onlinelibrary.wiley.com/doi/abs/10.1049%2Fjoe.2014.0228
https://doaj.org/article/8ec8ce30bde8429eaa73b0a47c142db7
Volume 2014
WOSCitedRecordID wos000215583300090&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 20241231
  omitProxy: false
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVWIB
  databaseName: Wiley Online Library Free Content
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: WIN
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
– providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: 24P
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LTwIxEJ4o8aAH4zPig2yM8eTKblvY7lEIRIkiB1RuTV-baAwYQI_-dqfdFeGAXrz0sJ20k5m2M9OdfgNwJo3mllIVkhqPfAmzUNa4DZNaQrJUcZ14JKbH26Tb5YNB2psr9eVywnJ44FxwVW4115ZGyliOZ6eVMqEqkizRMSNG-XfkUZLOBVP-doUyErG4ANVEL7j6MnKgmDG7dIAvC0bIY_WjaXm200UP1ZuY9hZsFr5hcJXztA0rdrgDG3OIgbtQbboscf9g0gajLBi763KXgR44A-XXUDAaBrqo1TDZg4d2q9-8DouaB6HGWJGFsdIGYzLJTWYs8o3xRUo5z-p1bo3hiuiUG8KxS8XSKGNMaihRNdycyuEn0X0oDUdDewCBTXCUWLLIuIIi1CptkTbLlOYZej2yDBffQhC6AAR3dSlehf8xzVKBMhNOZsLJrAznM_K3HAljGWHDSXRG5ACs_QdUqyjUKv5SaxlOUR-i2FCTZTNVFog6962fTvFmsjJUvT5_Z1j0Oy3SaHuoosP_YP4I1t3gec7fMZSm43d7Amv6Y_o8GVdglbBexa9XbO8-W9g-3XS_AGHb7Yo
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4ScCBN2I8K4Q4UbalKU2PgDbxGIPDQNyivIqG0Iq2we_HTstgB5AQ18ZNU8euYzf5PoADZY1wUaRDFouapzALVSxcmMQJy1ItTOKRmB5aSbstHh_Tu2-n-At8iFHBjTzDf6_JwakgXSScnEAyn3OCuazzY4JwmYRpjpGGOAwYv_uqskSc1Tx9JUPrCzF5j0ugTeyjOtbDWGDy-P0YbrpuOL5q9WGnufj_AS_BQrnkDE4LG1mGCddbgflvQISrUD2nzef-HKYL8izoUxWeNrYHFPe8aQZ5LzAlBcRgDe6bjc75RVhSKYQGU1Ae1rWxmOopYTPrcDSYtqSRENnJiXDWCs1MKiwT2KTrymprbWojpmP0eU2wTNE6TPXyntuAwCXYS13xmiWekshp41A2y7QRGS6mVAWOPvUoTYkzTnQXL9L_7-apRD1I0oMkPVTgcCT-WgBs_CR4RpMyEiJcbH8h7z_J0s2kcEYYF9W0dQIjrVMqwRdQPDFoG1YnFdjHKZWlnw5-etLumNDVbeOrUb7arAJVP9G_D1h2rhrsrOkRkDb_fMcezF50blqyddm-3oI5kin2EG7D1LD_5nZgxrwPu4P-rrf4DxGB_YE
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB5RQBUcoLRFLK9GqOqp6W4chzhHHrvipe0eaMXN8mOCQGiDdhd-PzNOWNgDSFWv8cSx5-HxTOxvAL4b7xSmqY1FpjqhhFlsMoVxnuWiLKxyeUBi-nuR9_vq6qoYvLrFX-NDTBNubBlhvWYDx3tf1gGnZJDM24phLhP5iyFcPsCCzGidZWxnOXjJsqRSdEL5SkHaF1PwnjVAm9RHe6aHGccU8PvJ3dzgZHbXGtxOb_X_B_wJVpotZ3RQ68gazOHwMyy_AiL8Au0jPnwe7mFiVJXRiLPwfLA9Yr8XVDOqhpFrSkCMv8KfXvfy6CRuSinEjkJQGSfWeQr1jPKlRxoNhS1FqlS5v6_Qe2WFK5QXippsYrz13hc-FTYjm7cMy5Suw_ywGuIGRJhTL4mRHc91SlK0Dom2LK1TJW2mTAt-PvNRuwZnnMtd3Onwv1sWmvigmQ-a-dCCH1Py-xpg4y3CQxbKlIhxscODanStGzPTCp1ymHasR0WeFo3JaQJG5i6Rwtu8BXskUt3Y6fitL-3OEJ397r40apJpC9pB0O8PWF-edcVhLyAgbf7zG9_g4-C4py9O--dbsMQk9RHCbZifjB5wBxbd4-RmPNoNCv8EuCn9BQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Convergence+of+recursive+functions+on+computers&rft.jtitle=Journal+of+engineering+%28Stevenage%2C+England%29&rft.au=Erivelton+Geraldo+Nepomuceno&rft.date=2014-10-01&rft.pub=Wiley&rft.eissn=2051-3305&rft_id=info:doi/10.1049%2Fjoe.2014.0228&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_8ec8ce30bde8429eaa73b0a47c142db7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2051-3305&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2051-3305&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2051-3305&client=summon