Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13489
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarakostas, G. L.en
dc.contributor.authorStevic, S.en
dc.date.accessioned2015-11-24T17:28:02Z-
dc.date.available2015-11-24T17:28:02Z-
dc.identifier.issn1023-6198-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13489-
dc.rightsDefault Licence-
dc.subjectdifference equationen
dc.subjectslowly varyingen
dc.subjectrelatively prime integersen
dc.subjectfull solutionen
dc.subjectrecursive sequence x(n+1)en
dc.subjectperiodic-solutionsen
dc.titleSlowly varying solutions of the difference equation x(n+1)=f(x(n),...,x(n-k))+g(n,x(n),x(n-1),...,x(n-k))en
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDoi 10.1080/10236190310001625271-
heal.identifier.secondary<Go to ISI>://000220307600002-
heal.identifier.secondaryhttp://www.tandfonline.com/doi/pdf/10.1080/10236190310001625271-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2004-
heal.abstractWe provide conditions which guarantee that all bounded solutions of the difference equation x(n+1) = f(x(n),...,x(n-k)) + g(n,x(n),x(n-1),...,x(n-k)) are slowly varying in the sense that lim(x(n+1) - x(n)) = 0.en
heal.publisherTaylor & Francisen
heal.journalNameJournal of Difference Equations and Applicationsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Karakostas-2004-Slowly varying solut.pdf139.46 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons