Closed-form solution of a general three-term recurrence relation

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a closed-form solution for nth term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in detail. First, the recursive-sum theory, which gives the exact solution in a compact finite form using a recursive indexing. Second, the discrete dimensional-convolution procedure, which transforms the solution to the non-recursive expression of n, including a finite number of elementary operations and functions.

Cite

CITATION STYLE

APA

Gonoskov, I. (2014). Closed-form solution of a general three-term recurrence relation. Advances in Difference Equations, 2014(1). https://doi.org/10.1186/1687-1847-2014-196

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free