Applications of recurrence relation

Description

Sequences often occur in many branches of applied mathematics. Recurrence
relation is a powerful tool to characterize and study sequences. Some
commonly used methods for solving recurrence relations will be investigated.
Many examples with applications in algorithm, combination, algebra, analysis,
probability, etc, will be discussed. Finally, some well-known contest
problems related to recurrence relations will be addressed.

Links & Downloads

1. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626107-130246

Tags

characteristic equation

characteristic root

constant coefficients

conjugate root

distinct root

Fibonacci numbers

general solution

homogeneous

method of annihilator

linear

method of binary number system

method of change of variable

method of divide-and-conquer relation

method of generating function

multiple root

method of logarithmic transformation

nonhomogeneous

nonlinear

operator

partial-fraction decomposition

particular solution

recurrence relation

recurrence sequences

Additional Fields

Identifer	oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0626107-130246
Date	26 June 2007
Creators	Chuang, Ching-hui
Contributors	Mong-Na Lo Huang, Fu-Chuen Chang, Mei-Hui Guo
Publisher	NSYSU
Source Sets	NSYSU Electronic Thesis and Dissertation Archive
Language	Cholon
Detected Language	English
Type	text
Format	application/pdf
Source	http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626107-130246
Rights	not_available, Copyright information available at source archive