Linear discrete multitime multiple recurrence
Cristian Ghiu, Raluca Tuliga, Constantin Udrişte
Abstract
Open-access reader
Cristian Ghiu, Raluca Tuliga, Constantin Udrişte
Abstract
Open-access reader
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is why, the aim of our paper is to formulate and solve problems concerning nonautonomous multitime multiple recurrence equations. Among other things, we discuss in detail the cases of linear recurrences with constant coefficients, highlighting in particular the theorems of existence and uniqueness of solutions.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is why, the aim of our paper is to formulate and solve problems concerning nonautonomous multitime multiple recurrence equations. Among other things, we discuss in detail the cases of linear recurrences with constant coefficients, highlighting in particular the theorems of existence and uniqueness of solutions.
Key concepts: Uniqueness, Queueing theory, Recurrence relation, Mathematics, Applied mathematics, Constant (computer programming), Algebra over a field, Algorithm