A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We design an algorithm which finds first-order quasi-linear generalized divisors of a second-order quasi-linear ordinary differential equation. ... We prove that a quasi-linear common multiple of a pair of quasi-linear equations always exists and design an algorithm which yields a quasilinear common multiple. ... The first author is grateful to the Max-Planck Institut für Mathematik, Bonn for its hospitality during writing this paper and to Labex CEMPI (ANR-11-LABX-0007-01). ...doi:10.1007/978-3-319-02297-0_12 fatcat:72ipzs6ao5cy3g6hihw3jevvba
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented. ... We hope that the examples and ideas outlined in this paper will be useful for elementary and advanced courses on ordinary differential equations, as well as for solving differential equations which occur ... ) for solving differential equations. ...arXiv:1104.4025v1 fatcat:2vgimuiaargp5lo54fihykkhwy
A new algorithm for linearization of a third-order ordinary differential equation is presented. ... The algorithm consists of composition of two operations: reducing order of an ordinary differential equation and using the Lie linearization test for the obtained second-order ordinary differential equation ... New algorithm If the order of a third-order ordinary differential equation is reduced, then one can apply the Lie test for linearization. ...doi:10.1088/0305-4470/39/49/005 fatcat:2zfxufnbyjb3ti6wl626hryvwu
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented. ... We hope that the examples and ideas outlined in this paper will be useful for elementary and advanced courses on ordinary differential equations, as well as for solving differential equations which occur ... ) for solving differential equations. ...doi:10.3390/mca16040784 fatcat:ql7eirlz5beifbnsgian7a637e
ordinary differential equations. ... Some efficiently vectorizable algorithms for factorizing these types of matrices and solving the corresponding linear systems are described. ...
Differential operators already provide a rich algebraic structure with a wealth of results and algorithmic methods. ... In particular, we discuss normal forms, basic algebraic properties, and the computation of polynomial solutions for ordinary integro-differential equations with polynomial coefficients. ... For studying linear differential equations, the basic algebraic structure is the noncommutative ring of differential operators over a differential algebra. ...doi:10.1145/2930889.2930942 dblp:conf/issac/Regensburger16 fatcat:5gwlcmcuvrgslke5vb7ki2xtjm
Lecture Notes in Computer Science
We design an algorithm which for a class of quasi-linear partial differential polynomials of order k + 1 finds its quasi-linear divisors of order k. ... A differential polynomial G is called a divisor of a differential polynomial F if any solution of the differential equation G = 0 is a solution of the equation F = 0. ... The first author is grateful to the Max-Planck Institut für Mathematik, Bonn for its hospitality during writing this paper and to Labex CEMPI (ANR-11-LABX-0007-01). ...doi:10.1007/978-3-319-24021-3_12 fatcat:t3cipzyyirgaxenq4pogckzu7i
We establish a relationship between the solutions of the system and the solutions of an associated first order autonomous ordinary differential equation, that we call the reduced differential equation. ... Moreover, if the reduced differential equation is non trivial, for every given point (x_0,y_0) in the complex plane, we prove the existence of a convergent Puiseux series solution y(x) of the original ... Note that in  it is shown that for general systems of algebraic ordinary differential equations the existence of non-constant formal power series solutions can not be decided algorithmically. ...arXiv:2001.10992v1 fatcat:3ngrl76c2ffr5obhutxnzxprti
This paper reports a method to solve ordinary fourth-order differential equations in the form of ordinary power series and, for the case of regular special points, in the form of generalized power series ... The program for solving ordinary fourth-order differential equations could be used to construct Green's functions of boundary problems, to solve differential equations with private derivatives, a system ... Study  presented two algorithms for solving ordinary linear differential equations of the second order. ...doi:10.15587/1729-4061.2021.233944 fatcat:gpsftxmpavew3ivuaoldj6yqfu
Lecture Notes in Computer Science
For ordinary differential equations, the operations implemented include computing Green's operators, composing boundary problems and integrodifferential operators, and factoring boundary problems. ... We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. ... We extended these results to a differential algebra setting in , where we also developed a factorization method applicable to boundary problems for ordinary differential equations (ODEs). ...doi:10.1007/978-3-642-04103-7_24 fatcat:de776qaeqfegvbzatrlc7ptzgu
ordinary differential equations by means of interval analytical methods. ... In this instructive paper the authors consider the initial value problem for a system of m ordinary differential equations of first order with an interval input vector and a perturbation parameter in the ...
The two algorithms for obtaining the orthogonal matrix Q at step k (in factored form) are formu- 65L Ordinary differential equations 2001b:65075 lated and it is explained how to use them. ... The computation of the orthogonal factor Q of the QR factoriza- tion of some or all columns of the fundamental solution matrix Y of a linear system of ordinary differential equations dY/dt = A(t)Y is considered ...
We establish a relationship between the solutions of the system and the solutions of an associated first order autonomous ordinary differential equation, that we call the reduced differential equation. ... Moreover, if the reduced differential equation is non trivial, for every given point (x 0 , y 0 ) ∈ C 2 , we prove the existence of a convergent Puiseux series solution y(x) of the original system such ... To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. ...doi:10.1007/s11786-020-00478-w fatcat:6rvtd7orkrcijdnyhgira4qznu
Diestler, The discretization of continuous infinite sets of coupled ordinary linear differential equations: application to the collision-induced dissociation of a diatomic molecule by an atom (pp. 40-52 ... Ortiz, Approximation of eigenvalues defined by ordinary differential equations with the tau method (pp. 90-102); Axel Ruhe, The two-sided Arnoldi algorithm for nonsymmetric eigenvalue problems (pp. 104 ...
European Congress of Mathematics
Galois theory has now produced algorithms for solving linear ordinary differential and difference equations in closed form. ... After introducing the relevant parts of the theory, we describe the latest algorithms for solving such equations. ... -A. Weil for their many useful comments and remarks during the preparation of this paper, as well as Prof. W. Decker for inviting me to present this survey at 3ecm. ...doi:10.1007/978-3-0348-8266-8_9 fatcat:lrc2t5nvyvf25dbje33akytwai
« Previous Showing results 1 — 15 out of 87,656 results