Ore polynomial rings and linear systems reducing

MaRDI QIDQ2563466zbMATH OpenFDO

Authors S. A. Abramov, Eugene Zima

Publication date 12 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

computer algebra systemsdifference equationsMAPLEordinary differential equationOre polynomials

Mathematics Subject Classification ID

Differential inequalities involving functions of a single real variable (34A40) Additive difference equations (39A10) Symbolic computation and algebraic computation (68W30)

Review text

A system of linear ordinary differential equations with variable coefficients can be solved by reduction to one equation for each unknown function. The same approach can be applied to difference equations, and the so called \(q\)-difference equations. But in computer algebra systems these problems are solved by different algorithms. In this note the authors propose a unified algorithm for the three types of problems. This algorithm is based on Ore polynomials, and is implemented under MAPLE.

Recommendations

• Publication:3031846
• On Ore rings, linear operators and factorization
• Ore polynomial rings in one variable in computer algebra.
• scientific article; zbMATH DE number 1944656
• On solving system of linear differential-algebraic equations using reduction algorithm

Cited in

(4)

• On Ore rings, linear operators and factorization
• Ore polynomial rings in one variable in computer algebra.
• Hyperexponential solutions of finite-rank ideals in orthogonal ore rings
• Integration of solutions of linear functional equations

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Ore polynomial rings and linear systems reducing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563466)