作者: G. Carra'Ferro , V. P. Gerdt
关键词: Set (abstract data type) 、 Computation 、 Ramer–Douglas–Peucker algorithm 、 Discrete mathematics 、 Wu's method of characteristic set 、 Mathematics 、 Differential (mathematics) 、 Algorithm 、 Reduction (complexity) 、 Rank (linear algebra) 、 Algebra 、 Algebraic number
摘要: An algorithm for computation of an extended characteristic sets finitely generated differential ideals is suggested. This improves the well-known Kolchin–Ritt algorithm. The improvement achieved through computing algebraic Grobner bases on intermediate stages process. rank set obtained less than or equal to that by Examples demonstrating reduction are presented.