Related papers: Computer Algebra Solving of Second Order ODEs Usin…

We have already dealt with the problem of solving First Order Differential Equations (1ODEs) presenting elementary functions before in [1, 2]. In this present paper, we have established solid theoretical basis through a relation between the…

Here we present an efficient method for finding and using a nonlocal symmetry admitted by a rational second order ordinary differential equation (rational 2ODE) in order to find a Liouvillian first integral (belonging to a vast class of…

We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…

Here we present/implement an algorithm to find Liouvillian first integrals of dynamical systems in the plane. In \cite{JCAM}, we have introduced the basis for the present implementation. The particular form of such systems allows reducing…

In this study, we propose high-order implicit and semi-implicit schemes for solving ordinary differential equations (ODEs) based on Taylor series expansion. These methods are designed to handle stiff and non-stiff components within a…

In this set of papers we formulate a stand alone method to derive maximal number of linearizing transformations for nonlinear ordinary differential equations (ODEs) of any order including coupled ones from a knowledge of fewer number of…

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

A subroutine for very-high-precision numerical solution of a class of ordinary differential equations is provided. For given evaluation point and equation parameters the memory requirement scales linearly with precision $P$, and the number…

We introduce DDE-Solver, a Maple package designed for solving Discrete Differential Equations (DDEs). These equations are functional equations relating algebraically a formal power series F(t, u) with polynomial coefficients in a…

We present a novel numerical method for solving ODEs while preserving polynomial first integrals. The method is based on introducing multiple quadratic auxiliary variables to reformulate the ODE as an equivalent but higher-dimensional ODE…

This study will explicitly demonstrate by example that an unrestricted infinite and forward recursive hierarchy of differential equations must be identified as an unclosed system of equations, despite the fact that to each unknown function…

Previous algorithms can solve convex-concave minimax problems $\min_{x \in \mathcal{X}} \max_{y \in \mathcal{Y}} f(x,y)$ with $\mathcal{O}(\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been…

Lie symmetry group method is applied to study the Telegraph equation. The symmetry group and its optimal system are given, and group invariant solutions associated to the symmetries are obtained. Finally the structure of the Lie algebra…

By using Lie symmetry methods, we identify a class of second order nonlinear ordinary differential equations invariant under at least one dimensional subgroup of the symmetry group of the Ermakov-Pinney equation. In this context, nonlinear…

Meleshko presented a new method for reducing third order autonomous ordinary differential equations (ODEs) to Lie linearizable second order ODEs. We extended his work by reducing fourth order autonomous ODEs to second and third order…

Ordinary Differential Equations (ODE) are used throughout science where the capture of rates of change in states is sought. While both pieces of commercial and open software exist to study such systems, their efficient and accurate usage…

In this article, we introduce a novel parallel-in-time solver for nonlinear ordinary differential equations (ODEs). We state the numerical solution of an ODE as a root-finding problem that we solve using Newton's method. The affine…

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which…

Second-order methods, which utilize gradients as well as Hessians to optimize a given function, are of major importance in mathematical optimization. In this work, we prove tight bounds on the oracle complexity of such methods for smooth…

This paper presents a sequence of deferred correction (DC) schemes built recursively from the implicit midpoint scheme for the numerical solution of general first order ordinary differential equations (ODEs). It is proven that each scheme…