This paper illustrates that the iterative procedure of producing new constant items in the expansion algorithm of pseudo—bilinear equations nlay not terminate by an example and its improved expansion algorithm is presented The equivalent transformation theorems of pseudo—bilinear equations are extended into pseudo—bilinear equation systems.An expansion algorithm of pseudo— bilinear equation systems is designed by means of these extended equivalent transformation theorems and the improved expansion algorithm.
1 Backus J W.Can programming be liberated from the yon Neumann style? a functional style and its algebra nf pro-
grams.CACM,1978,21(8):613—641.
2 孙永强,黄仁龄.拟双线性方程的展开算法及其求解.中国科学(A辑).1986,1:75—83.
3 tlarrison P G.Linearisation:an optimization for nonlinear functional programs.Sci.Comput.Programming.
1988,10(3):281—318.
4 Harrison P G.On the expansion of non—linear functions.Acta Informatica.1991.28(6):559—574.
5 Banerjee D.Atechniquefor solving a class of quadratic FP equations.Sci.Comput.Programming.1992,19(1):61
—85.
6 袁华强.非线性函数方程(组)的求解与展开算法[硕士论文].国防科技人学.1992.