For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.   A symmetric tensor decomposition can be determined by a set of generating polynomials, which can be represented by a generating matrix. Generally, a symmetric tensor decomposition can be determined by a generating matrix satisfying certain conditions. Based on them, an efficient method is given for computing symmetric tensor decompositions.