pith. sign in

arxiv: 1311.4774 · v1 · pith:RHP732PFnew · submitted 2013-11-11 · 🧮 math.CA

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

classification 🧮 math.CA
keywords solutionclosed-formfinitegeneralrecurrencerelationthree-termapproaches
0
0 comments X
read the original abstract

We present a closed-form solution for n-th 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.