In this paper,an algorithm for linear programming basis iteration with continuous variable parameters is discussed,and the problem in expression in computerization of the rational polynomials appeared in the computing process is discussed.

The solution of optimal lineac programming can be greatly simplified by usingthe continual matrix primary transformation instead of the basis change and iteration in the simplex method.

Compared with some power-based methods such as Oja method, the projection approximation subspace tracking (PAST) method, and the novel information criterion(NIC)method, the modified natural power method(MNP) has the fastest.

This paper mainly describes Fundamental Iterative algorithm which can manipulate matrixes in many settings,when used on the syndrome matrix,its equivalence to BM algorithm is widely accepted.