Linear recurrence Σ c_k a_{n-k} = 0 has solutions a_n = r^n where r solves polynomial c_0 r^k + c_1 r^{k-1} + ... + c_k = 0. Repeated roots: a_n = (A + Bn)r^n. Foundation of discrete-time signal processing + algorithm-analysis (Master…
Linear recurrence Σ c_k a_{n-k} = 0 has solutions a_n = r^n where r solves polynomial c_0 r^k + c_1 r^{k-1} + ... + c_k = 0. Repeated roots: a_n = (A + Bn)r^n. Foundation of discrete-time signal processing + algorithm-analysis (Master…