Features of Generation Sequences of Refined Fibonacci Polynomial Matrices
The features of generating the $n$th sequence of refined Fibonacci polynomial matrices of the $m$th order, the elements of which are Fibonacci polynomials of no higher than $(m+n–2)th$ number, are considered. The obtained Fibonacci matrices allow finding both their determinants and inverse matrices suitable for matrix encryption of block data.