2.1.36 Problem 37

Solved using first_order_ode_riccati
Solved as second order ode using change of variable on x method 2
Solved as second order ode using change of variable on x method 1
Solved as second order Bessel ode
Solved as second order ode using Kovacic algorithm
Maple
Mathematica
Sympy

Internal problem ID [8748]
Book : Own collection of miscellaneous problems
Section : section 1.0
Problem number : 37
Date solved : Sunday, March 30, 2025 at 01:29:58 PM
CAS classification : [_rational, _Riccati]

Solved using first_order_ode_riccati

Time used: 1.503 (sec)

Solve

xy2y+by2=cx4

In canonical form the ODE is

y=F(x,y)=cx4+by22yx

This is a Riccati ODE. Comparing the ODE to solve

y=cx3by2x+2yx

With Riccati ODE standard form

y=f0(x)+f1(x)y+f2(x)y2

Shows that f0(x)=cx3, f1(x)=2x and f2(x)=bx. Let

y=uf2u(1)=uubx

Using the above substitution in the given ODE results (after some simplification)in a second order ODE to solve for u(x) which is

(2)f2u(x)(f2+f1f2)u(x)+f22f0u(x)=0

But

f2=bx2f1f2=2bx2f22f0=b2xc

Substituting the above terms back in equation (2) gives

bu(x)x+bu(x)x2+b2xcu(x)=0

Solved as second order ode using change of variable on x method 2

Time used: 0.749 (sec)

In normal form the ode

(1)bux+bux2+b2xcu=0

Becomes

(2)u+p(x)u+q(x)u=0

Where

p(x)=1xq(x)=bcx2

Applying change of variables τ=g(x) to (2) gives

(3)d2dτ2u(τ)+p1(ddτu(τ))+q1u(τ)=0

Where τ is the new independent variable, and

(4)p1(τ)=τ(x)+p(x)τ(x)τ(x)2(5)q1(τ)=q(x)τ(x)2

Let p1=0. Eq (4) simplifies to

τ(x)+p(x)τ(x)=0

This ode is solved resulting in

τ=ep(x)dxdx=e1xdxdx=eln(x)dx=xdx(6)=x22

Using (6) to evaluate q1 from (5) gives

q1(τ)=q(x)τ(x)2=bcx2x2(7)=bc

Substituting the above in (3) and noting that now p1=0 results in

d2dτ2u(τ)+q1u(τ)=0d2dτ2u(τ)bcu(τ)=0

The above ode is now solved for u(τ).This is second order with constant coefficients homogeneous ODE. In standard form the ODE is

Au(τ)+Bu(τ)+Cu(τ)=0

Where in the above A=1,B=0,C=bc. Let the solution be u=eλτ. Substituting this into the ODE gives

(1)λ2eτλbceτλ=0

Since exponential function is never zero, then dividing Eq(2) throughout by eλτ gives

(2)bc+λ2=0

Equation (2) is the characteristic equation of the ODE. Its roots determine the general solution form.Using the quadratic formula

λ1,2=B2A±12AB24AC

Substituting A=1,B=0,C=bc into the above gives

λ1,2=0(2)(1)±1(2)(1)02(4)(1)(bc)=±bc

Hence

λ1=+bcλ2=bc

Which simplifies to

λ1=bc((1+i)signum(bc)1i)2λ2=bc((1+i)signum(bc)1i)2

The roots are complex but they are not conjugate of each others. Hence simplification using Euler relation is not possible here. Therefore the final solution is

u=c1eλ1τ+c2eλ2τ=c1eτbc((1+i)signum(bc)1i)2+c2eτbc((1+i)signum(bc)1i)2

Will add steps showing solving for IC soon.

The above solution is now transformed back to u(x) using (6) which results in

u(x)=c1ex2bc((1+i)signum(bc)1i)4+c2ex2bc((1+i)signum(bc)1i)4

Will add steps showing solving for IC soon.

Summary of solutions found

u(x)=c1ex2bc((1+i)signum(bc)1i)4+c2ex2bc((1+i)signum(bc)1i)4

Solved as second order ode using change of variable on x method 1

Time used: 0.107 (sec)

Solve

bux+bux2+b2xcu=0

In normal form the ode

(1)bux+bux2+b2xcu=0

Becomes

(2)u+p(x)u+q(x)u=0

Where

p(x)=1xq(x)=bcx2

Applying change of variables τ=g(x) to (2) results

(3)d2dτ2u(τ)+p1(ddτu(τ))+q1u(τ)=0

Where τ is the new independent variable, and

(4)p1(τ)=τ(x)+p(x)τ(x)τ(x)2(5)q1(τ)=q(x)τ(x)2

Let q1=c2 where c is some constant. Therefore from (5)

τ=1cq(6)=bcx2cτ=bcxcbcx2

Substituting the above into (4) results in

p1(τ)=τ(x)+p(x)τ(x)τ(x)2=bcxcbcx21xbcx2c(bcx2c)2=0

Therefore ode (3) now becomes

u(τ)+p1u(τ)+q1u(τ)=0(7)d2dτ2u(τ)+c2u(τ)=0

The above ode is now solved for u(τ). Since the ode is now constant coefficients, it can be easily solved to give

u(τ)=c1cos(cτ)+c2sin(cτ)

Now from (6)

τ=1cqdx=bcx2dxc=xbcx22c

Substituting the above into the solution obtained gives

u=c1cos(xbcx22)+c2sin(xbcx22)

Will add steps showing solving for IC soon.

Summary of solutions found

u=c1cos(xbcx22)+c2sin(xbcx22)

Solved as second order Bessel ode

Time used: 0.090 (sec)

Solve

bux+bux2+b2xcu=0

Writing the ode as

(1)x2uuxbcx4u=0

Bessel ode has the form

(2)x2u+ux+(n2+x2)u=0

The generalized form of Bessel ode is given by Bowman (1958) as the following

(3)x2u+(12α)xu+(β2γ2x2γn2γ2+α2)u=0

With the standard solution

(4)u=xα(c1BesselJ(n,βxγ)+c2BesselY(n,βxγ))

Comparing (3) to (1) and solving for α,β,n,γ gives

α=1β=bc2n=12γ=2

Substituting all the above into (4) gives the solution as

u=2c1xsin(bcx22)πbcx22c2xcos(bcx22)πbcx2

Will add steps showing solving for IC soon.

Summary of solutions found

u=2c1xsin(bcx22)πbcx22c2xcos(bcx22)πbcx2

Solved as second order ode using Kovacic algorithm

Time used: 0.389 (sec)

Solve

bux+bux2+b2xcu=0

Writing the ode as

(1)bux+bux2+b2xcu=0(2)Au+Bu+Cu=0

Comparing (1) and (2) shows that

A=bx(3)B=bx2C=b2xc

Applying the Liouville transformation on the dependent variable gives

z(x)=ueB2Adx

Then (2) becomes

(4)z(x)=rz(x)

Where r is given by

(5)r=st=2AB2BA+B24AC4A2

Substituting the values of A,B,C from (3) in the above and simplifying gives

(6)r=4bcx4+34x2

Comparing the above to (5) shows that

s=4bcx4+3t=4x2

Therefore eq. (4) becomes

(7)z(x)=(4bcx4+34x2)z(x)

Equation (7) is now solved. After finding z(x) then u is found using the inverse transformation

u=z(x)eB2Adx

The first step is to determine the case of Kovacic algorithm this ode belongs to. There are 3 cases depending on the order of poles of r and the order of r at . The following table summarizes these cases.

Case

Allowed pole order for r

Allowed value for O()

1

{0,1,2,4,6,8,}

{,6,4,2,0,2,3,4,5,6,}

2

Need to have at least one pole that is either order 2 or odd order greater than 2. Any other pole order is allowed as long as the above condition is satisfied. Hence the following set of pole orders are all allowed. {1,2},{1,3},{2},{3},{3,4},{1,2,5}.

no condition

3

{1,2}

{2,3,4,5,6,7,}

Table 2.7: Necessary conditions for each Kovacic case

The order of r at is the degree of t minus the degree of s. Therefore

O()=deg(t)deg(s)=24=2

The poles of r in eq. (7) and the order of each pole are determined by solving for the roots of t=4x2. There is a pole at x=0 of order 2. Since there is no odd order pole larger than 2 and the order at is 2 then the necessary conditions for case one are met. Since there is a pole of order 2 then necessary conditions for case two are met. Therefore

L=[1,2]

Attempting to find a solution using case n=1.

Looking at poles of order 2. The partial fractions decomposition of r is

r=bcx2+34x2

For the pole at x=0 let b be the coefficient of 1x2 in the partial fractions decomposition of r given above. Therefore b=34. Hence

[r]c=0αc+=12+1+4b=32αc=121+4b=12

Since the order of r at is Or()=2 then

v=Or()2=22=1

[r] is the sum of terms involving xi for 0iv in the Laurent series for r at . Therefore

[r]=i=0vaixi(8)=i=01aixi

Let a be the coefficient of xv=x1 in the above sum. The Laurent series of r at is

(9)rbcx+38bcx39128b3/2c3/2x7+271024b5/2c5/2x1140532768b7/2c7/2x15+1701262144b9/2c9/2x19153094194304b11/2c11/2x23+7217133554432b13/2c13/2x27+

Comparing Eq. (9) with Eq. (8) shows that

a=bc

From Eq. (9) the sum up to v=1 gives

[r]=i=01aixi(10)=bcx

Now we need to find b, where b be the coefficient of xv1=x0=1 in r minus the coefficient of same term but in ([r])2 where [r] was found above in Eq (10). Hence

([r])2=bcx2

This shows that the coefficient of 1 in the above is 0. Now we need to find the coefficient of 1 in r. How this is done depends on if v=0 or not. Since v=1 which is not zero, then starting r=st, we do long division and write this in the form

r=Q+Rt

Where Q is the quotient and R is the remainder. Then the coefficient of 1 in r will be the coefficient this term in the quotient. Doing long division gives

r=st=4bcx4+34x2=Q+R4x2=(bcx2)+(34x2)=bcx2+34x2

We see that the coefficient of the term x in the quotient is 0. Now b can be found.

b=(0)(0)=0

Hence

[r]=bcxα+=12(bav)=12(0bc1)=12α=12(bav)=12(0bc1)=12

The following table summarizes the findings so far for poles and for the order of r at where r is

r=4bcx4+34x2

pole c location pole order [r]c αc+ αc
0 2 0 32 12

Order of r at [r] α+ α
2 bcx 12 12

Now that the all [r]c and its associated αc± have been determined for all the poles in the set Γ and [r] and its associated α± have also been found, the next step is to determine possible non negative integer d from these using

d=αs()cΓαcs(c)

Where s(c) is either + or and s() is the sign of α±. This is done by trial over all set of families s=(s(c))cΓ until such d is found to work in finding candidate ω. Trying α=12 then

d=α(αc1)=12(12)=0

Since d an integer and d0 then it can be used to find ω using

ω=cΓ(s(c)[r]c+αcs(c)xc)+s()[r]

The above gives

ω=(()[r]c1+αc1xc1)+()[r]=12x+()(bcx)=12xbcx=2bcx212x

Now that ω is determined, the next step is find a corresponding minimal polynomial p(x) of degree d=0 to solve the ode. The polynomial p(x) needs to satisfy the equation

(1A)p+2ωp+(ω+ω2r)p=0

Let

(2A)p(x)=1

Substituting the above in eq. (1A) gives

(0)+2(12xbcx)(0)+((12x2bc)+(12xbcx)2(4bcx4+34x2))=00=0

The equation is satisfied since both sides are zero. Therefore the first solution to the ode z=rz is

z1(x)=peωdx=e(12xbcx)dx=ebcx22x

The first solution to the original ode in u is found from

u1=z1e12BAdx=z1e12bx2bxdx=z1eln(x)2=z1(x)

Which simplifies to

u1=ex2bc2

The second solution u2 to the original ode is found using reduction of order

u2=u1eBAdxu12dx

Substituting gives

u2=u1ebx2bxdx(u1)2dx=u1eln(x)(u1)2dx=u1(bcex2bc2bc)

Therefore the solution is

u=c1u1+c2u2=c1(ex2bc2)+c2(ex2bc2(bcex2bc2bc))

Will add steps showing solving for IC soon.

Summary of solutions found

u=c1ex2bc2+c2ex2bc2bc2bc

Taking derivative gives

u(x)=c1xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42+c2xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42

Doing change of constants, the solution becomes

y=(c1xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42+xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42)xb(c1ex2bc((1+i)signum(bc)1i)4+ex2bc((1+i)signum(bc)1i)4)

Summary of solutions found

y=(c1xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42+xbc((1+i)signum(bc)1i)ex2bc((1+i)signum(bc)1i)42)xb(c1ex2bc((1+i)signum(bc)1i)4+ex2bc((1+i)signum(bc)1i)4)
Maple. Time used: 0.004 (sec). Leaf size: 29
ode:=diff(y(x),x)*x-2*y(x)+b*y(x)^2 = c*x^4; 
dsolve(ode,y(x), singsol=all);
 
y=itan(ix2bc2+c1)x2cb

Maple trace

Methods for first order ODEs: 
--- Trying classification methods --- 
trying a quadrature 
trying 1st order linear 
trying Bernoulli 
trying separable 
trying inverse linear 
trying homogeneous types: 
trying Chini 
<- Chini successful
 

Maple step by step

Let’s solvex(ddxy(x))2y(x)+by(x)2=cx4Highest derivative means the order of the ODE is1ddxy(x)Solve for the highest derivativeddxy(x)=2y(x)by(x)2+cx4x
Mathematica. Time used: 0.242 (sec). Leaf size: 153
ode=x*D[y[x],x]-2*y[x]+b*y[x]^2==c*x^4; 
ic={}; 
DSolve[{ode,ic},y[x],x,IncludeSingularSolutions->True]
 
y(x)cx2(cos(12bcx2)+c1sin(12bcx2))b(sin(12bcx2)+c1cos(12bcx2))y(x)cx2tan(12bcx2)b
Sympy
from sympy import * 
x = symbols("x") 
b = symbols("b") 
c = symbols("c") 
y = Function("y") 
ode = Eq(b*y(x)**2 - c*x**4 + x*Derivative(y(x), x) - 2*y(x),0) 
ics = {} 
dsolve(ode,func=y(x),ics=ics)
 
RecursionError : maximum recursion depth exceeded