Factorization-free decomposition algorithms in differential algebra

被引：66

作者：

Hubert, E ^{[1
]}

机构：

[1] Math Sci Res Inst, Berkeley, CA 94720 USA

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 2000年 / 29卷 / 4-5期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jsco.1999.0344

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Insight on the structure of differential ideals defined by coherent autoreduced set allows one to uncouple the differential and algebraic computations in a decomposition algorithm. Original results as well as concise new proofs of already presented theorems are exposed. As a consequence, an effective version of Ritt's algorithm can be simply described. (C) 2000 Academic Press.

引用

页码：641 / 662

页数：22

共 33 条

[1]

[Anonymous], 1973, PURE APPL MATH

[2]

Aubry P, 1999, J SYMB COMPUT, V28, P105, DOI 10.1006/jsco.1998.0269

[3]

AUBRY P, 1999, THESIS PARIS 6

[4]

Becker T., 1993, GROBNER BASES, V141