Computer Algebra for Differential Equations

@techreport{RISC5735,
author = {S. McCallum and F. Winkler},
title = {{Resultants: Algebraic and Differential}},
language = {english},
abstract = {This report summarises ongoing discussions of the authors on the topic of differential resultantswhich have three goals in mind. First, we aim to try to understand existing literature on thetopic. Second, we wish to formulate some interesting questions and research goals based on ourunderstanding of the literature. Third, we would like to advance the subject in one or moredirections, by pursuing some of these questions and research goals. Both authors have somewhatmore background in nondifferential, as distinct from differential, computational algebra. For thisreason, our approach to learning about differential resultants has started with a careful review ofthe corresponding theory of resultants in the purely algebraic (polynomial) case. We try, as faras possible, to adapt and extend our knowledge of purely algebraic resultants to the differentialcase. Overall, we have the hope of helping to clarify, unify and further develop the computationaltheory of differential resultants.},
number = {18-08},
year = {2018},
month = {August},
length = {21},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}

@techreport{RISC5271,
author = {G. Grasegger and N.T. Vo},
title = {{An Algebraic-Geometric Method for Computing Zolotarev Polynomials}},
language = {english},
number = {16-02},
year = {2016},
length = {17},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}

@techreport{RISC5340,
author = {G. Grasegger},
title = {{An Algebraic-Geometric Method for Computing Zolotarev Polynomials — Additional Information}},
language = {english},
number = {16-07},
year = {2016},
length = {12},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}

@techreport{RISC5387,
author = {N. Thieu Vo},
title = {{Rational and Algebraic Solutions of First-Order Algebraic ODEs}},
language = {english},
abstract = {The main aim of this thesis is to study new algorithms for determining polynomial, rational and algebraic solutions of first-order algebraic ordinary differential equations (AODEs). The problem of determining closed form solutions of first-order AODEs has a long history, and it still plays a role in many branches of mathematics. There is a bunch of solution methods for specific classes of such ODEs. However still no decision algorithm for general first-order AODEs exists, even for seeking specific kinds of solutions such as polynomial, rational or algebraic functions. Our interests are algebraic general solutions, rational general solutions, particular rational solutions and polynomial solutions. Several algorithms for determining these kinds of solutions for first-order AODEs are presented.We approach first-order AODEs from several aspects. By considering the derivative as a new indeterminate, a first-order AODE can be viewed as a hypersurface over the ground field. Therefore tools from algebraic geometry are applicable. In particular, we use birational transformations of algebraic hypersurfaces to transform the differential equation to another one for which we hope that it is easier to solve. This geometric approach leads us to a procedure for determining an algebraic general solution of a parametrizable first-order AODE. A general solution contains an arbitrary constant. For the problem of determining a rational general solution in which the constant appears rationally, we propose a decision algorithm for the general class of first-order AODEs.The geometric method is not applicable for studying particular rational solutions. Instead, we study this kind of solutions from combinatorial and algebraic aspects. In the combinatorial consideration, poles of the coefficients of the differential equation play an important role in the estimation of candidates for poles of a rational solution and their multiplicities. An algebraic method based on algebraic function field theory is proposed to globally estimate the degree of a rational solution. A combination of these methods leads us to an algorithm for determining all rational solutions for a generic class of first-order AODEs, which covers every first-order AODEs from Kamke's collection. For polynomial solutions, the algorithm works for the general class of first-order AODEs.},
number = {16-11},
year = {2016},
month = {12},
note = {Thesis Dissertation},
length = {93},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Schloss Hagenberg, 4232 Hagenberg, Austria}
}