Selection of slowly growing sequences whose members satisfy given recursions

Infinite vector sequences are considered whose members satisfy a given linear recursion with matrix coefficients that depend on the index. In the set of such sequences, it is required to select sequences whose members grow more slowly than the corresponding powers of a given positive number. A method for solving this problem is proposed and examined.