
Real Analysis Real Analysis Math Forum 
 LinkBack  Thread Tools  Display Modes 
February 3rd, 2019, 05:08 AM  #1 
Newbie Joined: Feb 2019 From: France Posts: 1 Thanks: 0  Solving recurrence of order n
Hi, I came across this sequence $u_n$ where $u_1=1$ and subsequent terms are given by the recursive formula $$u_{n}\sum_{k=1}^{n1}T(n,k)u_{k}=f(n)$$ where $T(n,k)$ are real non constant coefficients and $f$ is a given function. Is there a general method to solve this equation? ... Thanks in advance. 
February 3rd, 2019, 02:45 PM  #2 
Senior Member Joined: Dec 2015 From: iPhone Posts: 476 Thanks: 73 
Solve the system of equations given for $\displaystyle n=1,2,...$ to $\displaystyle n1$ .


Tags 
order, recurrence, solving 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
How to find order of a recurrence relation? help  siri  Math  3  June 17th, 2017 12:03 PM 
Discrete Mathematics: Linear homogeneous recurrence of order 2  reza767  Number Theory  0  April 10th, 2015 02:42 PM 
Need help solving(another) recurrence  restin84  Computer Science  1  October 5th, 2012 12:04 AM 
Solving a recurrence  restin84  Computer Science  4  September 19th, 2012 08:01 AM 
solving recurrence  hayood  Computer Science  1  January 31st, 2011 12:52 PM 