Shows the methods and application of extension fields of similar matrixes.

In this paper,the new method is presented to determine the number of hidden nodes of RBF neural networks,it makes use of the whole inputting and outputting information of training samples to establish similar matrix of samples,then to determine the number of hidden nodes of RBF neural networks by maximal matrix element method.

By computing the power of Jordan matrix and the theory of similar matrix,the analytic formulation of the general solution of the constant coefficient homogeneous linear difference equation is presented.

Fuzzy clustering is associated with comprehensive assessment in the study of sorting when the number of object is large,and we improve the method of setting up fuzzy similar matrix.

Relation in characteristic vectors of similar matrices;

In this method,by computing the fuzzy similar matrices and transitive closure,fuzzy cluster is done with.

Based on from the fact that similar matrices have the same polynomial,we change and weaken concerned conditions in the propersition then get conclusions about charactersitc polynomials of matrices.

A similarity matrix is created according to the valuating function.

To study the transitive closure of similarity matrix in fuzzy clustering, the algorithm of once location for solving the transitive closure of similarity matrix is proposed.

In order to keep the serial similar block intact,it takes the measure of dividing the similarity matrix into some small matrixes,then calc.

By calculating upper and lower approximate rough entropy and determing similarity matrix of these objects,we can obtain the final discretization result.