The bases( ) ( ) ( ) ( ) { } 1 1 n i i n i z z z α − = ± ( ) i n 0 ≤ ≤ of the polynomial linear space [ ] n z 1 + are constructed by the bilinear transformation function. Generalized Bezout matrices under two different bases are investigated. By the generating functions of Bezout matrices, a fast algorithm formula and its corresponding triangular decomposition for the elements of this type of Bezout matrix are given. The formula shows that the cost of the algorithm is ( ) ο n 2 . Connection between two Bezout matrices under different bases is discussed. Finally, two numerical examples are given to demonstrate the validity of the theory.