Recursive relation

From: Alex (akhmel_at_hotmail.com)
Date: 11/20/04 

Date: 20 Nov 2004 14:03:29 -0800

We have the following recursive relation:

C_{nk}=a_{11} C_{n-1,k} + a_{12} D_{n,k-1};
D_{nk}=a_{21} C_{n-1,k} + a_{22} D_{n,k-1}

Where a_{11}, a_{12}, a_{21}, a_{22} are constants.

Anyone know how to resolve this relation, namely, to write explicit
expression for C_{nk} and D_{nk} through these constants and initial
conditions?

Thanks,

Alex

Relevant Pages

  • Re: Recursive relation
    ... >We have the following recursive relation: ... >Anyone know how to resolve this relation, namely, to write explicit ... contains only exponential functions s^n of n where s runs through the ... eigenvalues of A; when A is not diagonizable, ...
    (sci.math.research)
  • Recursive relation
    ... We have the following recursive relation: ... Anyone know how to resolve this relation, namely, to write explicit ... Alex ...
    (sci.math.num-analysis)
  • Recursive relation
    ... We have the following recursive relation: ... Anyone know how to resolve this relation, namely, to write explicit ... Alex ...
    (sci.math.research)