Open AccessA new method for solving the linear recurrence relation with nonhomogeneous constant coefficients in some cases
Author(s) -
Ben-Chao Yang,
Xuefeng Han
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2113/1/012070
Subject(s) - relation (database) , constant (computer programming) , constant coefficients , sequence (biology) , homogeneous , mathematics , algorithm , linear programming , recurrence relation , computer science , calculus (dental) , mathematical optimization , mathematical analysis , combinatorics , data mining , programming language , medicine , genetics , dentistry , biology
Recursive relation mainly describes the unique law satisfied by a sequence, so it plays an important role in almost all branches of mathematics. It is also one of the main algorithms commonly used in computer programming. This paper first introduces the concept of recursive relation and two common basic forms, then starts with the solution of linear recursive relation with non-homogeneous constant coefficients, gives a new solution idea, and gives a general proof. Finally, through an example, the general method and the new method given in this paper are compared and verified.