✦ LIBER ✦

Factorization-free Decomposition Algorithms in Differential Algebra

✍ Scribed by Evelyne Hubert

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 371 KB
Volume: 29
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0344

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Free Group Algebras in the Field of Frac

Free Group Algebras in the Field of Fractions of Differential Polynomial Rings and Enveloping Algebras

✍ M Shirvani; J.Z Gonçalves 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 196 KB

We construct free group algebras in the quotient ring of the differential w x polynomial ring K X; ␦ , for suitable division rings K and nonzero derivations ␦ in K.

Computer Algebra Algorithms and Routines

Computer Algebra Algorithms and Routines for the Computation of Conservation Laws and Fixing of Gauge in Differential Expressions

✍ T. Wolf; A. Brand; M. Mohammadzadeh 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 303 KB

In this paper we present three different approaches for the determination of conservation laws. For three corresponding REDUCE computer algebra programs CONLAW1/2/3 the necessary subroutines are described. All three programs use subroutines which remove redundant functions and constants in the gener

On the self-weighted alternating triline

On the self-weighted alternating trilinear decomposition algorithm—the property of being insensitive to excess factors used in calculation

✍ Zeng-Ping Chen; Hai-Long Wu; Ru-Qin Yu 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB