摘要
本文建立一种对既约方程组求解的图上作业法.证明了:既约方程组只有有理解当且仅当它的解唯一,同时提出了通解图的概念,通解图可以从既约方程组有效地构造,并且从通解图上容易求出它的所有解,看出这些解之间的关系,通解图是全体解的一种有穷表示.
In this paper,it creats a graphical method to find the solutions forreduced systems,and prove that a reduced system has only rationalsolutions iff its solution is unique.Moreover,a concept on general graphof solutions is proposed which can be easily constructed from reducedsystem,all solutions can be ahtained from this general graph and therelations among these solutions can be known well.The general graph isa finitely representation.
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
1990年第3期1-5,共5页
Journal of Lanzhou University(Natural Sciences)
基金
国家自然科学基金
关键词
树代数
PROLOG
逻辑程序设计
tree-algebra
PROLOG
reduced system of equations
logical programming
design