Rational Solutions of Riccati-like Partial Differential Equations

  title={Rational Solutions of Riccati-like Partial Differential Equations},
  author={Ziming Li and Fritz Schwarz},
  journal={J. Symb. Comput.},
When factoring linear partial differential systems with a finite-dimensional solution space or analysing symmetries of nonlinear ODEs, we need to look for rational solutions of certain nonlinear PDEs. The nonlinear PDEs are called Riccati-like because they arise in a similar way as Riccati ODEs. In this paper we describe the structure of rational solutions of a Riccati-like system, and an algorithm for computing them. The algorithm is also applicable to finding all rational solutions of Lie?s… 
Rational General Solutions of High Order Non-autonomous ODEs ∗
In this paper, we generalize the results of Ngô and Winkler [18, 20, 21] to the case of high order non-autonomous algebraic ODE with a birational parametrization of the corresponding algebraic
Solving Second-Order Equations
The results of the preceding chapters are applied now for solving differential equations of second order for an unknown function z(x,y). At first some general properties of the solutions are
Polynomial solutions for first order ODEs with constant coefficients
This paper gives a necessary and sufficient condition for an ODE with constant coefficients to have polynomial general solutions and gives an algorithm of complexity to decide if it has a polynometric general solution and to compute the solution if it exists.
Solving Second-Order Differential Equations with Lie Symmetries
Lie"s theory for solving second-order quasilinear differential equations based on its symmetries is discussed in detail. Great importance is attached to constructive procedures that may be applied
Algorithmic Reduction and Rational General Solutions of First Order Algebraic Differential Equations
An algorithm is given for the computation of rational general solutions of these equations if they exist under the assumption that a rational parametrization is provided, based on an algorithmic reduction of first order algebraic differential equations with algebraic genus zero and without movable critical point to classical Riccati equations.
Rational general solutions of algebraic ordinary differential equations
An algorithm to compute a rational general solution if it exists is given based on the relation between rational solutions of the first order ODE and rational parametrizations of the plane algebraic curve defined by thefirst order ODR and Padé approximants.
Loewy’s Results for Ordinary Differential Equations
The idea of factoring an ordinary differential operator, or the corresponding linear ordinary differential equation (ode), into components of lower order originated from the analogous problem for
On solutions of linear functional systems and factorization of modules over Laurent-Ore algebras
A Laurent-Ore algebra L over a field F is a mathematical abstraction of common properties of linear partial differential and difference operators. A linear (partial) functional system is of the form
Factoring systems of linear PDEs with finite-dimensional solution spaces


Linear ordinary differential equations: breaking through the order 2 barrier
This work presents an efficient algorithm for this subproblem, which has been implemented in the AXIOM computer algebra system for equations of arbitrary order over arbitrary fields of characteristic O, which never needs to compute with the individual complex singularities of the equation, and algebraic numbers are added only when they appear in the potential solutions.
Liouvillian Solutions of Linear Differential Equations with Liouvillian Coefficients
This paper studies triangular differential systems arising from various decompositions of partial differential polynomial systems. In theoretical aspects, we emphasizeon translating differential
Specializations in differential algebra
1. Objectives and summary. Much of elementary differential algebra can be regarded as a generalization of the algebraic geometry of polynomial rings over a field to an analogous theory for rings of
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
An algorithm is presented which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomials, which implies the following theorem.
Algebraic factoring and rational function integration
A new, simple, and efficient algorithm for factoring polynomials in several variables over an algebraic number field is presented and a constructive procedure is given for finding the least degree extension field in which the integral can be expressed.
An algebraic differential variety is defined as the zero-set of a differentialpolynomial set,and algebraic differential geometry is devoted to the study of such varieties.We give various
Chebyshev and Legendre Spectral Methods in Algebraic Manipulation Languages
  • J. Boyd
  • Computer Science
    J. Symb. Comput.
  • 1993
This tutorial shows how to combine Galerkin and collocation methods with algebraic manipulation languages in REDUCE and Maple, and offers many guidelines and suggestions.
Factoring Rational Polynomials Over the Complex Numbers
After reducing to the two-variable, square-free case, the classical algebraic geometry fact that the absolute irreducible factors of P(z_1 ,z_2 ) = 0) correspond to the connected components of the real surface (or complex curve) minus its singular points is applied.