Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Recurrence relation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== References == === Footnotes === {{reflist}} === Bibliography === * {{cite book|first1=Paul M. | last1=Batchelder |title=An introduction to linear difference equations |year=1967 |publisher=Dover Publications }} * {{cite book|first1=Kenneth S. | last1=Miller |title=Linear difference equations |year=1968 | publisher=W. A. Benjamin }} * {{cite news|first1=Jay P. | last1=Fillmore | first2=Morris L. | last2=Marx |title=Linear recursive sequences | journal= SIAM Rev. | volume=10|number=3 |pages=324β353 | jstor=2027658| year=1968}} * {{cite book| first1=Alfred | last1=Brousseau |title=Linear Recursion and Fibonacci Sequences |year=1971 |publisher=Fibonacci Association |url=http://www.fq.math.ca/linear.html }} * [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 1990. {{isbn|0-262-03293-7}}. Chapter 4: Recurrences, pp. 62β90. *{{cite book| first1=Ronald L. | last1=Graham | first2=Donald E. | last2=Knuth |first3=Oren | last3=Patashnik |title=Concrete Mathematics: A Foundation for Computer Science |edition=2 |publisher=Addison-Wesley |year=1994 |isbn=0-201-55802-5 }} *{{cite book |year = 2010 |url = http://eu.wiley.com/WileyCDA/WileyTitle/productCd-EHEP000338.html |first1 = Walter |last1 = Enders |title = Applied Econometric Times Series |edition = 3 |url-status = dead |archive-url = https://web.archive.org/web/20141110221941/http://eu.wiley.com/WileyCDA/WileyTitle/productCd-EHEP000338.html |archive-date = 2014-11-10 }} *{{cite book| first1=Paul | last1=Cull | first2=Mary | last2=Flahive|author2-link= Mary Flahive |first3=Robbie | last3=Robson |title=Difference Equations: From Rabbits to Chaos |title-link= Difference Equations: From Rabbits to Chaos |publisher=Springer | year=2005 | isbn=0-387-23234-6 }} chapter 7. * {{cite book| first1=Ian | last1=Jacques |title=Mathematics for Economics and Business | url=https://archive.org/details/mathematicsforec00jacq | url-access=limited |edition=Fifth |publisher=Prentice Hall |year=2006 |isbn=0-273-70195-9 |pages=[https://archive.org/details/mathematicsforec00jacq/page/n561 551]β568 }} Chapter 9.1: Difference Equations. * {{cite web | first1=Tang | last1=Minh | first2=Tan | last2=Van To | title=Using generating functions to solve linear inhomogeneous recurrence equations | pages=399β404 | url=http://www.wseas.us/e-library/conferences/2006lisbon/papers/517-481.pdf | year=2006 | work=Proc. Int. Conf. Simulation, Modelling and Optimization, SMO'06 | access-date=2014-08-07 | archive-date=2016-03-04 | archive-url=https://web.archive.org/web/20160304035925/http://www.wseas.us/e-library/conferences/2006lisbon/papers/517-481.pdf | url-status=dead }} * {{cite web| first1=Andrei D. | last1=Polyanin |title=Difference and Functional Equations: Exact Solutions |url=http://eqworld.ipmnet.ru/en/solutions/fe.htm}} at EqWorld - The World of Mathematical Equations. * {{cite web| first1=Andrei D. | last1=Polyanin |title=Difference and Functional Equations: Methods |url=http://eqworld.ipmnet.ru/en/education/edu-fe.htm}} at EqWorld - The World of Mathematical Equations. *{{cite journal | first1= Xiang-Sheng | last1=Wang | first2=Roderick | last2=Wong |title= Asymptotics of orthogonal polynomials via recurrence relations |journal = Anal. Appl. | year=2012 | volume=10 | number=2 |pages=215β235 | doi=10.1142/S0219530512500108 |arxiv=1101.4371| s2cid=28828175 }}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)