Related papers: Solving polynomials with ordinary differential equ…
We identify many new solvable subcases of the general dynamical system characterized by two autonomous first-order ordinary differential equations with purely quadratic right-hand sides; the solvable character of these dynamical systems…
We consider an ordinary nonlinear differential equation with generalized coefficients as an equation in differentials in algebra of new generalized functions. Then the solution of such equation will be a new generalized function. In the…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We study the theory of ordinary differential equations over a commutative finite dimensional real associative unital algebra $\mathcal{A}$. We call such problems $\mathcal{A}$-ODEs. If a function is real differentiable and its differential…
The second order partial difference equation of two variables $ \CD u:= A_{1,1}(x) \Delta_1 \nabla_1 u + A_{1,2}(x) \Delta_1 \nabla_2 u + A_{2,1}(x) \Delta_2 \nabla_1 u + A_{2,2}(x) \Delta_2 \nabla_2 u & \qquad \qquad \qquad \qquad + B_1(x)…
In this paper we construct high order numerical methods for solving third and fourth orders nonlinear functional differential equations (FDE). They are based on the discretization of iterative methods on continuous level with the use of the…
In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…
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…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
In this paper we report a few examples of algebraically solvable dynamical systems characterized by 2 coupled Ordinary Differential Equations which read as follows: x_n = P(n) (x1, x2) , n = 1, 2 , with P(n) (x1, x2) specific polynomials of…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
The main goal of this article is to show a new method to solve some Fractional Order Integral Equations (FOIE), more precisely the ones which are linear, have constant coefficients and all the integration orders involved are rational. The…
In present paper we propose an approach based on examination of the structure of the general solution of equations of the type dy/dx=P(x,y)/Q(x,y), with P and Q polynomials only in y. Under the term structure we mean the dependency…
Given a linear ordinary differential equation (ODE) on $\RE$ and a set of interface conditions at a finite set of points $I \subset \RE$, we consider the problem of determining another differential equation whose {\it global} solutions…
In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\prime}=p(y)$ over \emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time…
Given a first-order autonomous algebraic ordinary differential equation, we present a method for computing formal power series solutions by means of places. We provide an algorithm for computing a full characterization of possible initial…
We propose an algebraic method that finds a sequence of functions that exponentially approach the solution of any second-order ordinary differential equation (ODE) with any boundary conditions. We define an extended ODE (eODE) composed of a…
In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…