%0 Journal Article
%T ALGORITHMS OF ELIMINATION AND SIMPLIFICATION BASED ON GEOMETRIC ALGEBRA IN AUTOMATIC PROVING OF GEOMETRIC THEOREM<br>几何代数在定理证明中的消元与化简算法
%A CAO Yuanhao
%A LI Hongbo
%A <br>曹源昊
%A 李洪波
%J 系统科学与数学
%D 2009
%I 
%X In symbolic computing, a major bottleneck is middle expression swell. Symbolic geometric computing based on invariant algebra can alleviate this difficulty. For example, the size of proofs of Euclidean geometric theorems can be reduced significantly based on null bracket algebra. In this paper, we consider algorithms of elimination, duality and ungrading in null bracket algebra from the viewpoint of program implementation.
%K Conformal geometric algebra
%K null bracket algebra
%K automated geometry reasoning
%K algorithm<br>共形几何代数
%K 零括号代数
%K 几何自动推理
%K 算法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=7E5F518F4B8DA654545147A9705FDE18&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=9CF7A0430CBB2DFD&sid=53A4507B400B4E65&eid=EB3DE2AA673AE431&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0