This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Coefficient characterization of linear differential equations with maximal symmetries

J.C. Ndogmo jean-claude.ndogmo@wits.ac.za School of Mathematics, University of the Witwatersrand, Private Bag 3, Wits 2050, South Africa
Abstract

A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its general form such an equation can be expressed in terms of only two arbitrary functions, and its connection with the Laguerre-Forsyth form is clarified. The characterizing conditions are also used to derive an infinite family of semi-invariants, each corresponding to an arbitrary order of the linear equation. Finally a simplifying ansatz is established, which allows an easier determination of the infinitesimal generators of the induced pseudo group of equivalence transformations, for all the three most general canonical forms of the equation.

keywords:
Coefficient characterization, maximal symmetry algebra, canonical form, induced equivalence group, infinitesimal generators
MSC:
[2010] 70G65, 34C20

1 Introduction

By a result of Lie [1], a linear ordinary differential equation (ode) of a general order nn is known to have a symmetry algebra of maximal dimension dnd_{n} if it is reducible by a point transformation to the equation y(n)=0y^{(n)}=0, which will henceforth be referred to as the canonical form of the linear equation. In a much recent paper Krause and Michel [2] proved the converse of this result and also showed that a linear equation is iterative if and only if its symmetry algebra has the maximal dimension dn.d_{n}. (By the cited result of Lie [1], dn=n+4d_{n}=n+4 for n3n\geq 3). Characterizing linear equations having a symmetry algebra of maximal dimension is therefore the same as characterizing linear equations that are reducible by a point transformation to the canonical form. The latter characterization for the third-order equation y(3)+c2y′′+c1y+c0y=0y^{(3)}+c_{2}\,y^{\prime\prime}+c_{1}\,y^{\prime}+c_{0}\,y=0 is due to Lie [3] and Laguerre [4] who showed independently that this equation is reducible to the canonical form if and only if its coefficients satisfy the equation

54c018c1c2+4c2327c1+18c2c2+9c2′′=0.54c_{0}-18c_{1}c_{2}+4c_{2}^{3}-27c_{1}^{\prime}+18c_{2}c_{2}^{\prime}+9c_{2}^{\prime\prime}=0. (1)

This characterization also clearly applies to all nonlinear odes which are linearizable by point transformations [5, 6], as the latter transformations do not alter the dimension of the symmetry algebra.

In this paper, we extend this characterization to equations of higher orders. It turns out that for each equation of order nn there will be n2n-2 characterizing equations, and the limitation of our presentation of the characterizing equations only up to the order five is simpy due to their very large size. However, we give a description of the method for deriving this characterization for equations of any order. The derivation of these characterizing equations is also based on the canonical normal form of linear equations admitting a maximal symmetry algebra that was obtained in [5] from a symmetry approach, and in [7] from an iterative approach. These characterizing equations therefore also represent a generalization of the results of [5] and [7]. We then deduce that the most general form of a linear equation admitting a maximal symmetry algebra can be expressed in standard form in terms of only two arbitrary functions. We also deduce that the Laguerre-Forsyth form of a linear equation reduces to the canonical form if and only if the equation has maximal symmetries.

Although we do not give the characterizing equations for each linear equation of order nn, we note however that among the n2n-2 characterizing equations exactly one of them represents a semi-invariant of the equation, that is a function of the coefficients of the equation whose expression does not change when the dependent variable is transformed. We obtain an expression for these semi-invariants for equations of all orders and describe some of their properties.

Finally, using some simplifying assumptions and the method of [8], we give expressions for both the symmetry generator XnX_{n} of GSG_{\!S} and Xn0X_{n}^{0} of the induced pseudo group of transformations Gc,G_{c}, and for all three most general canonical forms of linear equations of a general order n.n. Here, GSG_{\!S} denotes the symmetry group of the general linear equation in which the arbitrary functions are considered as additional dependent variables.

2 Coefficient characterization

A method based on a symmetry approach has been proposed in [5] for characterizing the coefficients of linear ordinary differential equations (odes) that admit a maximal symmetry algebra, but only for equations in reduced normal form (in which the term of second highest order vanishes). In a more recent paper [7] a similar characterization based on an iterative approach was proposed, in which according to a result of Krause and Michel [2] a linear equation admitting a maximal symmetry is simply viewed as an iterative equation. By iterative equation, we mean an equation of the form

Ψn[y]\displaystyle\Psi^{n}[y] =0,y=y(x),n1\displaystyle=0,\quad y=y(x),\quad n\geq 1 (2a)
where
Ψ1[y]\displaystyle\vspace{-5mm}\Psi^{1}[y] =ry+sy,Ψn[y]=Ψn1[Ψ[y]],\displaystyle=ry^{\prime}+sy,\quad\Psi^{n}[y]=\Psi^{n-1}\left[\Psi[y]\right], (2b)

and where r=r(x)r=r(x) and s=s(x)s=s(x) are the parameters of the source equation Ψ1[y]=0\Psi^{1}[y]=0. This characterization shows that in its reduced normal form, a general linear equation depends solely on one arbitrary function a=a(x)a=a(x). For equations of orders three to five, the corresponding equations are given as follows:

y(3)+ay+a2y=0\displaystyle y^{(3)}+ay^{\prime}+\frac{a^{\prime}}{2}y=0 (3a)
y(4)+ay′′+ay+(310a′′+9100a2)y=0\displaystyle y^{(4)}+ay^{\prime\prime}+a^{\prime}y^{\prime}+\left(\frac{3}{10}a^{\prime\prime}+\frac{9}{100}a^{2}\right)y=0 (3b)
y(5)+ay(3)+32ay′′+(910a′′+16100a2)y+(15a(3)+16100aa)y=0.\displaystyle y^{(5)}+ay^{(3)}+\frac{3}{2}a^{\prime}y^{\prime\prime}+\left(\frac{9}{10}a^{\prime\prime}+\frac{16}{100}a^{2}\right)y^{\prime}+\left(\frac{1}{5}a^{(3)}+\frac{16}{100}aa^{\prime}\right)y=0. (3c)

However, as a linear equation need not occur in its reduced normal form, but rather in the most general standard form, it is thus useful to obtain the corresponding characterization for equations in standard form. We let the general linear equation be given in standard form as

Δ(x,y(n);C)y(n)+cn1y(n1)+cn2y(n2)++c0y=0.\Delta(x,y_{(n)};C)\;\equiv\;y^{(n)}+c_{n-1}\,y^{(n-1)}+c_{n-2}\,y^{(n-2)}+\dots+c_{0}\,y=0. (4)

where C=(c0,,cn1).C=(c_{0},\dots,c_{n-1}). Suppose that such an equation has a symmetry algebra of maximal dimension and let its corresponding reduced normal form be given by

y(n)+Bn2y(n2)+Bn3y(n3)++B0y=0,y^{(n)}+B_{n-2}\,y^{(n-2)}+B_{n-3}\,y^{(n-3)}+\dots+B_{0}\,y=0, (5)

where the BjB_{j} for j=0,,n2j=0,\dots,n-2 are its coefficients and depend as already noted above on a single arbitrary function a=Bn2a=B_{n-2} and its derivatives. Let

y(n)+An1y(n1)+An2y(n2)++A0y=0y^{(n)}+A_{n-1}\,y^{(n-1)}+A_{n-2}\,y^{(n-2)}+\dots+A_{0}\,y=0 (6)

be the corresponding standard form of (5), which may be obtained by a transformation of the form

yye1nx0xAn1𝑑x.y\mapsto ye^{-\frac{1}{n}\int_{x_{0}}^{x}A_{n-1}dx}. (7)

Then (4) and (6) must be identical, and in particular the nonzero coefficient An1A_{n-1} introduced by the transformation (7) satisfies An1=cn1A_{n-1}~{}=~{}c_{n-1}, and more generally we have

cj=Aj, for j=0,,n1.c_{j}=A_{j},\quad\text{ for $j=0,\dots,n-1$}. (8)

Note that the coefficients cjc_{j} in (4) are mere symbols and we wish to find a relationship among them. Given that in (5) the function Bn2B_{n-2} is precisely the arbitrary function a(x)a(x) labeling the equation, it can be shown by a recursive procedure, or even by induction on nn that

An2=a+n12ncn12+n22cn1.A_{n-2}=a+\frac{n-1}{2n}\,c_{n-1}^{2}+\frac{n-2}{2}\,c_{n-1}^{\prime}.

Therefore, solving the equation cn2=An2c_{n-2}=A_{n-2} for aa gives

a=cn2(n12ncn12+n22cn1).a=c_{n-2}-\left(\frac{n-1}{2n}\,c_{n-1}^{2}+\frac{n-2}{2}\,c_{n-1}^{\prime}\right). (9)

Consequently, the characterizing equations for linear equations in standard form with maximal symmetry algebra are given by the remaining n2n-2 equations

cj=Aj,j=0,,n3,c_{j}=A_{j},\quad\text{$j=0,\dots,n-3$}, (10)

in which the function aa and its derivatives are substituted with the corresponding expressions given by (9).

Proposition 1.

If a linear equation in standard form (4) has maximal symmetry, then in its general form it may be expressed in terms of only two arbitrary functions, namely the functions cn1c_{n-1} and cn2c_{n-2}, and their derivatives.

Proof.

The result readily follows from the fact that the functions AjA_{j} in (10) then depend only on aa and its derivatives, while (9) shows that the function aa depends precisely on cn1c_{n-1}, cn2c_{n-2}, and their derivatives. ∎

Corollary 1.

A linear equation in standard form (4) with cn1=cn2=0c_{n-1}=c_{n-2}=~{}0 has maximal symmetry algebra if and only if cj=0c_{j}=0 for all jj. In other words a linear equation has maximal symmetry algebra if and only if its Laguerre-Forsyth form corresponds to the canonical equation y(n)=0y^{(n)}=0.

Proof.

After all a Laguerre transformation is also a point transformation although it cannot always be explicitly constructed for a given equation. Since equations equivalent under point transformation have similar Lie algebras, it readily follows that if the Laguerre-Forsyth form of an equation is y(n)=0y^{(n)}=0, then the equation has maximal symmetry algebra. The converse of the corollary is a direct application of proposition 1, and the fact that in (10) the cjc_{j} turn out to be polynomial functions with no constant terms of cn1c_{n-1}, cn2c_{n-2}, and their derivatives. ∎

As an immediate consequence of the corollary, linear equations such as y(3)+f(x)y=0y^{(3)}+f(x)y=0 or y(4)+f(x)y=0y^{(4)}+f(x)y^{\prime}=0 have maximal symmetry algebras if and only if the function f(x)f(x) vanishes identically. We now make use of (10) and (9) to explicitly derive the characterizing equations for maximal symmetry algebras for equations of orders three to five.

For n=3n=3, it is readily found that in (6) we have

A0=154(18ac2+2c23+27a+18c2c2+18c2′′),A_{0}=\frac{1}{54}\left(18ac_{2}+2c_{2}^{3}+27a^{\prime}+18c_{2}c_{2}^{\prime}+18c_{2}^{\prime\prime}\right), (11)

while the corresponding expression for aa in (9) reduces to

a=c1(c223+c22).a=c_{1}-\left(\frac{c_{2}^{2}}{3}+\frac{c_{2}^{\prime}}{2}\right). (12)

Applying (12) into (11) and substituting the resulting expression for A0A_{0} into (10) gives exactly the already cited equation (1) found by Lie [3] and Laguerre [4] and given by

54c018c1c2+4c2327c1+18c2c2+9c2′′=0.54c_{0}-18c_{1}c_{2}+4c_{2}^{3}-27c_{1}^{\prime}+18c_{2}c_{2}^{\prime}+9c_{2}^{\prime\prime}=0.

The most general form of a linear third-order equation admitting a maximal symmetry algebra can thus be expressed in terms of only two arbitrary functions c1(x)c_{1}(x) and c2(x)c_{2}(x) in the form of

y(3)+c2y′′+c1y+154(18c1c24c23+27c118c2c29c2′′)y=0.y^{(3)}+c_{2}\,y^{\prime\prime}+c_{1}\,y^{\prime}+\frac{1}{54}\left(18c_{1}c_{2}-4c_{2}^{3}+27c_{1}^{\prime}-18c_{2}c_{2}^{\prime}-9c_{2}^{\prime\prime}\right)y=0. (13)

Equation (13) naturally reduces to (3a) for c2=0.c_{2}=0.

For n=4,n=4, we successively get

a\displaystyle a =18(8c23c3212c3)\displaystyle=\frac{1}{8}\left(8c_{2}-3c_{3}^{2}-12c_{3}^{\prime}\right) (14a)
A1\displaystyle A_{1} =12(ac3+c3316+a+34c3c3+c3′′)\displaystyle=\frac{1}{2}\left(ac_{3}+\frac{c_{3}^{3}}{16}+a^{\prime}+\frac{3}{4}c_{3}c_{3}^{\prime}+c_{3}^{\prime\prime}\right) (14b)
6400A0=576a2+400a(c32+4c3)+5[5c34+120c32c3+320c3(a+c3′′)]+80(15c32+24a′′+20c3(3)).\displaystyle\begin{split}6400A_{0}&=576a^{2}+400a(c_{3}^{2}+4c_{3}^{\prime})\\ &+5\left[5c_{3}^{4}+120c_{3}^{2}c_{3}^{\prime}+320c_{3}(a^{\prime}+c_{3}^{\prime\prime})\right]\\ &+80\left(15c_{3}^{\prime 2}+24a^{\prime\prime}+20c_{3}^{(3)}\right).\end{split} (14c)

Substituting (14a) into (14b) and (14c) gives the two equations

8c1+\displaystyle 8c_{1}+ =4c2c3c33+8c26c3c34c3′′\displaystyle=4c_{2}c_{3}-c_{3}^{3}+8c_{2}^{\prime}-6c_{3}c_{3}^{\prime}-4c_{3}^{\prime\prime} (15a)
1600c0=144c2211c34+400c3c2288c32c3336c328c2(c32+4c3)+480c2′′560c3c3′′320c3(3)\displaystyle\begin{split}1600c_{0}&=144c_{2}^{2}-11c_{3}^{4}+400c_{3}c_{2}^{\prime}-288c_{3}^{2}c_{3}^{\prime}-336c_{3}^{\prime 2}\\ &\quad-8c_{2}(c_{3}^{2}+4c_{3}^{\prime})+480c_{2}^{\prime\prime}-560c_{3}c_{3}^{\prime\prime}-320c_{3}^{(3)}\end{split} (15b)

which represent the characterizing equations for maximal symmetry algebra for equations of order 44. Note that conversely any linear fourth order equation whose coefficients satisfy (15) must be iterative, which is why conditions such as (15) are termed characterizing equations. Indeed, if the coefficients of a fourth order equation of the form (4) satisfy (5), then its reduced normal form has, after the substitution of the expressions for c0c_{0} and c1c_{1} given by (5) in terms of c2,c3,c_{2},c_{3}, and their derivatives, the form

w(4)\displaystyle w^{(4)} +Q2w′′+Q1w+Q0w=0\displaystyle+Q_{2}w^{\prime\prime}+Q_{1}w^{\prime}+Q_{0}w=0 (16a)
where
Q2\displaystyle Q_{2} =c238(c32+4c3)\displaystyle=c_{2}-\frac{3}{8}(c_{3}^{2}+4c_{3}^{\prime}) (16b)
Q1\displaystyle Q_{1} =c234(c3c3+2c3′′)\displaystyle=c_{2}^{\prime}-\frac{3}{4}(c_{3}c_{3}^{\prime}+2c_{3}^{\prime\prime}) (16c)
Q0=36400(192c22+27c3448c32144c2(c32+4c3))+36400(27c34+216c32c3+640c2′′480c3c3′′960c3′′′).\displaystyle\begin{split}Q_{0}&=\frac{3}{6400}(192c_{2}^{2}+27c_{3}^{4}-48c_{3}^{\prime 2}-144c_{2}(c_{3}^{2}+4c_{3}^{\prime}))\\ &\quad+\frac{3}{6400}(27c_{3}^{4}+216c_{3}^{2}c_{3}^{\prime}+640c_{2}^{\prime\prime}-480c_{3}c_{3}^{\prime\prime}-960c_{3}^{\prime\prime\prime}).\end{split} (16d)

The coefficients QjQ_{j} thus obtained clearly satisfy the conditions

Q1=Q2 and Q0=(310Q2′′+9100Q22)Q_{1}=Q_{2}^{\prime}\quad\text{ and }\quad Q_{0}=(\frac{3}{10}Q_{2}^{\prime\prime}+\frac{9}{100}Q_{2}^{2})

prescribed by (3b) for iterative equations, as required.

For equations of order n=5n=5, by proceeding as above for the orders three and four, we obtain the following n2=3n-2=3 characterizing equations

c2\displaystyle c_{2} =(30c3c48c43+75c360c4c4+50c4′′)/50\displaystyle=(30c_{3}c_{4}-8c_{4}^{3}+75c_{3}^{\prime}-60c_{4}c_{4}^{\prime}+50c_{4}^{\prime\prime})/50 (17a)
1250c1=+200c3218c44+750c4c3580c42c4850c4210c3(c42+5c4)+1125c3′′1400c4c4′′1000c4(3)\displaystyle\begin{split}1250\,c_{1}&=+200c_{3}^{2}-18c_{4}^{4}+750c_{4}c_{3}^{\prime}-580c_{4}^{2}c_{4}^{\prime}-850c_{4}^{\prime 2}\\ &\quad-10c_{3}(c_{4}^{2}+5c_{4}^{\prime})+1125c_{3}^{\prime\prime}-1400c_{4}c_{4}^{\prime\prime}-1000c_{4}^{(3)}\end{split} (17b)
6250c0=200c32c4+14c4525c42c3+40c43c4125c3c4750c4c42+1125c4c3′′850c42c4′′2750c4c4′′+1250c3(3)2000c4c4(3)1250c4(4)10c3(11c43+100c385c4c475c4′′).\displaystyle\begin{split}6250\,c_{0}&=200c_{3}^{2}c_{4}+14c_{4}^{5}-25c_{4}^{2}c_{3}^{\prime}+40c_{4}^{3}c_{4}^{\prime}\\ &\quad-125c_{3}^{\prime}c_{4}^{\prime}-750c_{4}c_{4}^{\prime 2}+1125c_{4}c_{3}^{\prime\prime}-850c_{4}^{2}c_{4}^{\prime\prime}\\ &\quad-2750c_{4}^{\prime}c_{4}^{\prime\prime}+1250c_{3}^{(3)}-2000c_{4}c_{4}^{(3)}-1250c_{4}^{(4)}\\ &\quad-10c_{3}(11c_{4}^{3}+100c_{3}^{\prime}-85c_{4}c_{4}^{\prime}-75c_{4}^{\prime\prime}).\end{split} (17c)

3 Semi-invariants of linear equations

The group of equivalence transformations of the general linear equation (4) is given by invertible point transformations of the form

x=f(z),y=g(z)w(z),x=f(z),\quad y=g(z)w(z), (18)

and they preserve the linearity and the homogeneity of the equation. Let

w(n)+Qn1w(n1)+Qn2w(n2)++Q0w=0w^{(n)}+Q_{n-1}\,w^{(n-1)}+Q_{n-2}\,w^{(n-2)}+\dots+Q_{0}\,w=0 (19)

be the transformed version of (4) under (18). By a semi-invariant of (4) we shall mean a function F=F(c0,c1,,cn1)F=F(c_{0},c_{1},\dots,c_{n-1}) of the coefficients of the equation which have the same expression for the transformed equation when the dependent variable (alone) changes. It is well known that under (18) the expression of the semi-invariant for the transformed equation is related to that for the original equation [9, 10] by the equality

F(Q0,Q1,,Qn1)=(dxdz)μF(c0,c1,,cn1),F(Q_{0},Q_{1},\dots,Q_{n-1})=\left(\frac{dx}{dz}\right)^{\mu}F(c_{0},c_{1},\dots,c_{n-1}), (20)

where μ\mu is an integer. In this case we say that the semi-variant FF has index μ.\mu. To each expression of the form dkcj/dxk,d^{k}c_{j}/dx^{k}, let us assign the weight (nj)+k(n-j)+k, and we let this weight function be multiplicative so that the product cpcqc_{p}c_{q} has weight (np)+(nq).(n-p)+(n-q). It is well known that for a given semi-invariant all terms have the same weight and that this weight coincides with the index of the semi-invariant [9, 10] .

A closer look at the set of characterizing equations (10) shows that precisely one of them corresponds to a semi-invariant of the equation, namely the relation cn3=An3c_{n-3}=A_{n-3}, which gives rise to the semi-invariant F=An3cn3F=A_{n-3}-c_{n-3}.

First of all, using the method of either [7] or [5], it can be proved that the coefficient Bn3B_{n-3} in (5) satisfies Bn3=n22a.B_{n-3}=\frac{n-2}{2}a^{\prime}. Consequently, using the expression of the function aa in (9) it follows by induction on nn that the coefficient An3A_{n-3} in (6) is given by

An3=n2ncn1cn2(n1)(n2)3n2cn13+n22cn2(n1)(n2)2ncn1cn1(n1)(n2)12cn1′′,\begin{split}A_{n-3}=&\frac{n-2}{n}c_{n-1}c_{n-2}-\frac{(n-1)(n-2)}{3n^{2}}c_{n-1}^{3}+\frac{n-2}{2}c_{n-2}^{\prime}\\ &-\frac{(n-1)(n-2)}{2n}c_{n-1}c_{n-1}^{\prime}-\frac{(n-1)(n-2)}{12}c_{n-1}^{\prime\prime},\end{split} (21)

so that the corresponding invariant function InI_{n} has expression

In=n2ncn1cn2(n1)(n2)3n2cn13+n22cn2(n1)(n2)2ncn1cn1(n1)(n2)12cn1′′cn3.\begin{split}I_{n}=&\frac{n-2}{n}c_{n-1}c_{n-2}-\frac{(n-1)(n-2)}{3n^{2}}c_{n-1}^{3}+\frac{n-2}{2}c_{n-2}^{\prime}\\ &-\frac{(n-1)(n-2)}{2n}c_{n-1}c_{n-1}^{\prime}-\frac{(n-1)(n-2)}{12}c_{n-1}^{\prime\prime}-c_{n-3}.\end{split} (22)

The fact that the function In=In(c0,c1,,cn1)I_{n}=I_{n}(c_{0},c_{1},\dots,c_{n-1}) in (22) is a semi-invariant can readily be verified. First each term in this expression has weight three, and we readily see that

In(Q0,Q1,,Qn1)=f(z)3In(c0,c1,,cn1),I_{n}(Q_{0},Q_{1},\dots,Q_{n-1})=f^{\prime}(z)^{3}I_{n}(c_{0},c_{1},\dots,c_{n-1}),

which proves the assertion.

Although the invariant functions InI_{n} in (22) are originally defined only for n3,n\geq 3, their expression shows that they vanish identically for n=1n=1 or n=2n=2, by letting cj=0c_{j}=0 for j<0.j<0. This vanishing can be interpreted by the fact that all first order and all second order linear equations are all equivalent through a point transformation to the equations y=0y^{\prime}=0 and y′′=0y^{\prime\prime}=0, respectively, and therefore they do not have nontrivial invariant functions.

On the other hand it should be noted that the other equations in the characterizing system (10) do not give rise to invariant functions except for the value j=n3j=n-3 in that system of equations. Indeed, denote collectively by CC and QQ the coefficients in equations (4) and (19), respectively, and for n=4n=4 denote by J(C)=1600(c0A0)J(C)=1600(c_{0}-A_{0}) the normalized function obtained from 2.9 with j=0j=0. Then it can be seen that although each term in the expression of J(C)J(C) has weight four, we have

J(Q)=f(z)4J(C)200h(z)h(z)f(z)3I4(C),J(Q)=f^{\prime}(z)^{4}J(C)-200\frac{h^{\prime}(z)}{h(z)}f^{\prime}(z)^{3}I_{4}(C),

clearly showing that the function JJ is not a semi-invariant.

4 Infinitesimal generators of the induced group action

The equivalence group GG in (18) of the general linear equation (4) induces another Lie pseudo group GcG_{c} acting on the coefficients of (4) [3]. For linear equations with maximal symmetries, their most general form depends as already noted on only two arbitrary functions, instead of nn. For instance, the most general form of linear equations of order four admitting a maximal symmetry algebra is given on account of (15) by

y(4)+c3y(3)+c2y′′+18[4c2c3c33+8c26c3c34c3′′]y+11600[144c2211c34+400c3c2288c32c3336c328c2(c32+4c3)+480c2′′560c3c3′′320c3(3)]y=0\begin{split}y^{(4)}&+c_{3}y^{(3)}+c_{2}y^{\prime\prime}+\frac{1}{8}\Big{[}4c_{2}c_{3}-c_{3}^{3}+8c_{2}^{\prime}-6c_{3}c_{3}^{\prime}-4c_{3}^{\prime\prime}\Big{]}y^{\prime}\\ &+\frac{1}{1600}\Big{[}144c_{2}^{2}-11c_{3}^{4}+400c_{3}c_{2}^{\prime}-288c_{3}^{2}c_{3}^{\prime}-336c_{3}^{\prime 2}\\ &\qquad-8c_{2}\big{(}c_{3}^{2}+4c_{3}^{\prime}\big{)}+480c_{2}^{\prime\prime}-560c_{3}c_{3}^{\prime\prime}-320c_{3}^{(3)}\Big{]}y=0\end{split} (23)

and it is expressible solely in terms of the coefficients cn1c_{n-1} and cn2c_{n-2}, here c3c_{3} and c2c_{2}.

Although Eq. (23) is a very special case of the general Eq. (4), its equivalence group is the same group GG in (18) because equivalent equations have similar symmetry groups. Consequently the infinitesimal generators X0X^{0} of the group GcG_{c} for (4) will also be valid for equations with maximal symmetries. In particular to obtain the specific infinitesimal generators for equations with maximal symmetries expressed only in terms of the two arbitrary functions, it will be sufficient to substitute the characterizing equations (10) into the expression for X0X^{0}.

A method for finding the infinitesimal generator X0X^{0} has been proposed in [8]. If we denote by

X=ξx+ηy+ϕn1cn1++ϕ0c0X=\xi\,\partial_{x}+\eta\,\partial_{y}+\phi_{n-1}\,\partial_{c_{n-1}}+\dots+\phi_{0}\,\partial_{c_{0}} (24)

the infinitesimal generator of (4) in which the coefficients

C=(c0,c1,,cn1)C=(c_{0},c_{1},\dots,c_{n-1})

are also considered as dependent variables, then the method of [8] consists of finding a set of minimum conditions for which the projection V=ξx+ηyV=\xi\,\partial_{x}+\eta\,\partial_{y} of XX on the (x,y)(x,y)-space reduces to the infinitesimal generator V0={ξ0,η0}V^{0}=\left\{\xi^{0},\eta^{0}\right\} of the equivalence group GG. This set of minimal conditions imposed to ϕ=(ϕ0,ϕ1,,ϕn1)\phi=(\phi_{0},\phi_{1},\dots,\phi_{n-1}) yields a function ϕ0=(ϕ00,ϕ10,,ϕn10)\phi^{0}=(\phi_{0}^{0},\phi_{1}^{0},\dots,\phi_{n-1}^{0}) so that the expression for X0X^{0} takes the form

X0=ξ0x+ϕn10cn1++ϕ00c0.X^{0}=\xi^{0}\,\partial_{x}+\phi_{n-1}^{0}\,\partial_{c_{n-1}}+\dots+\phi_{0}^{0}\,\partial_{c_{0}}. (25)

In practice, the determination of the symmetry generator XX for the general linear equation (4) is computationally exhaustive, and a popular Lie symmetry software such as MathLie (See [11]) computes XX only for n4n\leq 4 due to computer memory problems (on an Intel Core2 Quad CPU machine) while another well-known similar Lie symmetry software such as SYM [12] does not compute symmetries such as XX that involve several dependent variables for a single independent variable.

We therefore need an efficient simplifying ansatz for the manual computation of X0X^{0} at orders higher than the fourth. For this, we note that as the full symmetry group of (4) with CC considered also as dependent variable should leave the equation invariant, the transformation of the dependent and the independent variables should preserve the form of the equation, except for the introduction of a constant term independent of yy which should be offset by the subsequent transformations of the coefficient CC. This means that in (24), we must have

ξ=f(x),η=g(x)y+h(x).\xi=f(x),\qquad\eta=g(x)y+h(x). (26)

A verification of (26) is possible by direct calculation for equations of order not higher than the fourth using the MathLie software, while for orders higher than four, the validity of the generators XX and X0X^{0} found can be tested through the satisfaction of the infinitesimal condition of invariance applied to the general linear equation (4), and to the semi-invariants InI_{n} found in (22), respectively. Recall that the infinitesimal criterion of invariance for the infinitesimal generator XX of (4) is given by

X[n][Δ(x,y(n);C)]=0,whenever Δ(x,y(n);C)=0,X^{[n]}\left[\Delta(x,y_{(n)};C)\right]=0,\quad\text{whenever $\Delta(x,y_{(n)};C)=0,$} (27)

where X[n]X^{[n]} represents the nn-th prolongation of X.X. Regarding the verification of the infinitesimal condition of invariance for semi-invariants, we note that if for some group element αGc\alpha\in G_{c} we set Q=αC,Q=\alpha\cdot C, then every semi-invariant of GcG_{c} satisfies F(αC)=𝐰(α)F(C)F(\alpha\cdot C)=\mathbf{w}(\alpha)\cdot F(C) for some weight function 𝐰,\mathbf{w}, and X0X^{0} is an infinitesimal generator of GcG_{c} if and only if

X0F=d𝐰(e)F,X^{0}\cdot F=-d\mathbf{w}(e)F,

for all such functions F,F, where 𝐰(e)\mathbf{w}(e) is the differential of 𝐰\mathbf{w} at the identity element ee of Gc.G_{c}. In the actual case of (4) and GcG_{c} (which is the same as G except that it acts on the space of coefficients), for α(f,g)\alpha\equiv(f,g) specified in (18) we have 𝐰(α)=f(z)3,\mathbf{w}(\alpha)=f^{\prime}(z)^{3}, and for each generator X0X0(n)X^{0}\equiv X^{0}(n) found, it is readily verified that

X0In=3f(x)In,X^{0}\cdot I_{n}=-3f^{\prime}(x)I_{n}, (28)

as required.

To our knowledge the infinitesimal generators X0X^{0} of the induced pseudo group GcG_{c} has been computed only for third order equations, or for the normal or the Laguerre-Forsyth forms of equations of low orders not exceeding five [13, 14, 9]. This is due in part as already mentioned to the intensive computational requirements for the calculation of these generators, but also because the more systematic method for finding them proposed in [8] is relatively recent.

We list in the next three theorems the general expressions for the infinitesimal generators XnX_{n} of GSG_{\!S} and Xn0X_{n}^{0} of GcG_{\!c} and for the three most general canonical forms of linear equations, where the subscript nn denotes the order of the equation.

Theorem 1.

For the general linear equation of order nn in standard form (4), the infinitesimal generators XnX_{n} of GSG_{\!S} and Xn0X_{n}^{0} of GcG_{\!c} have the following expressions, where f,gf,g and hh are arbitrary functions of xx, and δ0k\delta_{0}^{k} denotes the Kronecker delta.

  1. a)
    Xn=fx+(yg+h)y+k=0n1Φknck,\displaystyle X_{n}=f\partial_{x}+\left(yg+h\right)\partial_{y}+\sum_{k=0}^{n-1}\Phi_{k}^{n}\partial_{c_{k}}, (29a)
    where
    Φkn=(nk)ckf+j=1nkck+j[(k+jj+1)f(j+1)(k+jj)g(j)]+δ0k[ckhy+j=1nkck+j(k+jj)h(j)y],for k=0,,n1.\displaystyle\begin{split}&\Phi_{k}^{n}=-(n-k)c_{k}f^{\prime}+\sum_{j=1}^{n-k}c_{k+j}\left[\binom{k+j}{j+1}f^{(j+1)}-\binom{k+j}{j}g^{(j)}\right]\\ &\quad\qquad+\delta_{0}^{k}\left[-c_{k}\dfrac{h}{y}+\sum_{j=1}^{n-k}c_{k+j}\binom{k+j}{j}\dfrac{h^{(j)}}{y}\right],\quad\text{for $k=0,\dots,n-1$.}\end{split} (29b)
  2. b)
    Xn0=fx+k=0n1Φknck,\displaystyle X_{n}^{0}=f\partial_{x}+\sum_{k=0}^{n-1}\Phi_{k}^{n}\partial_{c_{k}}, (30a)
    where
    Φkn=(nk)ckf+j=1nk[(k+jj)g(j)+(k+jj+1)f(j+1)]ck+j,for k=0,,n1.\displaystyle\begin{split}&\Phi_{k}^{n}=-(n-k)c_{k}f^{\prime}+\sum_{j=1}^{n-k}\left[-\binom{k+j}{j}g^{(j)}+\binom{k+j}{j+1}f^{(j+1)}\right]c_{k+j},\\ &\qquad\qquad\text{for $k=0,\dots,n-1$.}\end{split} (30b)
Proof.

We let the generator XnX_{n} be in the form

Xn=\displaystyle X_{n}= ξx+ηy+k=0n1Φknck,\displaystyle\xi\partial_{x}+\eta\partial_{y}+\sum_{k=0}^{n-1}\Phi_{k}^{n}\partial_{c_{k}}, (31)

where the functions ξ\xi, η\eta, and Φkn\Phi_{k}^{n} are to be specified. We know from the ansatz (26) that ξ=f(x)\xi=f(x) and η=g(x)y+h(x)\eta=g(x)y+h(x) for some arbitrary functions f,gf,g and hh of xx. The prolongation formula for Xn[n]X_{n}^{[n]} is well-known [15]. Writing down this expression and applying the infinitesimal condition of invariance (27) gives the usual determining equations for the coefficients ξ,η\xi,\eta and Φkn\Phi_{k}^{n}. Although the procedure is a lengthy one, thanks to the ansatz (26) these determining equations are easily solved and lead to the expressions in (29).

For the second part of the theorem, the result follows by noting that according to the algorithm of [8] already described for finding Xn0X_{n}^{0}, one essentially only need to find the minimum set of conditions which reduce the projection {f(x),g(x)y+h(x)}\{f(x),g(x)y+h(x)\} of XnX_{n} onto the (x,y)(x,y)-space to the infinitesimal generator of the equivalence group. From the expressions of the equivalence transformations given in (18), it follows that the required minimal set of condition reduces to {h=0}\{h=0\}. Applying these conditions to (29) and dropping the term in y\partial_{y} gives the required expression (30). ∎

Theorem 2.

For the general linear equation in reduced normal form, i.e. in the form (4) with cn1=0c_{n-1}=0, the generators XnX_{n} of GSG_{\!S} and Xn0X_{n}^{0} of GcG_{\!c} have the following expressions, in terms of the arbitrary functions ff and hh of xx.

  1. a)
    Xn=fx+[y[(n12)f+K1]+h]y+k0n2Φknck,\displaystyle X_{n}=f\partial_{x}+\left[y\left[\left(\dfrac{n-1}{2}\right)f^{\prime}+K_{1}\right]+h\right]\partial_{y}+\sum_{k-0}^{n-2}\Phi_{k}^{n}\partial_{c_{k}}, (32a)
    where
    Φkn=(nk)fck+j=1nkck+j[(k+jj+1)(k+jj)n12]f(j+1)+δ0k[ckhy+j=1nkck+j(k+jj)h(j)y],for k=0,,n2.\displaystyle\begin{split}&\Phi_{k}^{n}=-(n-k)f^{\prime}c_{k}+\sum_{j=1}^{n-k}c_{k+j}\left[\binom{k+j}{j+1}-\binom{k+j}{j}\dfrac{n-1}{2}\right]f^{(j+1)}\\ &\qquad\quad+\delta_{0}^{k}\left[-c_{k}\dfrac{h}{y}+\sum_{j=1}^{n-k}c_{k+j}\binom{k+j}{j}\dfrac{h^{(j)}}{y}\right],\quad\text{for $k=0,\dots,n-2$.}\end{split} (32b)
  2. b)
    Xn0=fx+k=0n2Φknck,\displaystyle X_{n}^{0}=f\partial_{x}+\sum_{k=0}^{n-2}\Phi_{k}^{n}\partial_{c_{k}}, (33a)
    where
    Φkn=(nk)ckf+j=1nkak+j[(k+jj+1)(k+jj)n12]f(j+1),for k=0,,n2.\displaystyle\begin{split}&\Phi_{k}^{n}=-(n-k)c_{k}f^{\prime}+\sum_{j=1}^{n-k}a_{k+j}\left[\binom{k+j}{j+1}-\binom{k+j}{j}\dfrac{n-1}{2}\right]f^{(j+1)},\\ &\qquad\quad\text{for $k=0,\dots,n-2$.}\end{split} (33b)
Proof.

The expressions for XnX_{n} and Xn0X_{n}^{0} are to be sought in the form (29) and (30), respectively, as the normal form of (4) is a special case of that equation. The main difference is that the equivalence transformations for the normal form are no longer given by (18) but by the much restricted version

x=\displaystyle x= T(z),y=λ[T(z)]n12w(z)\displaystyle T(z),\quad y=\lambda\left[T^{\prime}(z)\right]^{\frac{n-1}{2}}w(z) (34)

where TT is an arbitrary function and λ\lambda an arbitrary constant. This has infinitesimal generator

V=\displaystyle V= f(x)x+y(n12f(x)+k1)y,\displaystyle f(x)\partial_{x}+y\left(\dfrac{n-1}{2}f^{\prime}(x)+k_{1}\right)\partial_{y}, (35)

where ff is an arbitrary function and k1k_{1} an arbitrary constant. Since the functions ff and gg in (29) and (30) are precisely the parameters of the infinitesimal generator of the equivalence group, to obtain (32) and (33), we only need to replace gg in the latter expressions by the substitution g=n12f+k1g=\frac{n-1}{2}f^{\prime}+k_{1} and to drop the term in cn1c_{n-1}. This yields (32) and (33). ∎

The Laguerre-Forsyth form of the general linear equation is the equation of the form (4) in which the coefficients cn1c_{n-1} and cn2c_{n-2} of terms of second and third highest orders have vanished. In principle, such a transformation can be realized by means of the change of variables of the form

{z,x}\displaystyle\left\{z,x\right\} =12n(n1)(n+1)cn2,y=wexp(1nz0zcn1𝑑x),\displaystyle=\frac{12}{n(n-1)(n+1)}c_{n-2},\quad y=w\exp\left(-\frac{1}{n}\int_{z_{0}}^{z}c_{n-1}dx\right), (36a)
where
{z,x}\displaystyle\left\{z,x\right\} =[zz(3)(3/2)z′′2]z2\displaystyle=\big{[}z^{\prime}z^{(3)}-(3/2)z^{\prime\prime 2}\big{]}z^{\prime\,-2} (36b)

is the Schwarzian derivative, and z=dz/dx.z^{\prime}=dz/dx. The Laguerre-Forsyth form of (4) is therefore of an implicit nature in the sense that (36) can not always be solved explicitly for zz. Nevertheless, such a form is still of interest, in particular because linear equations often occur in this form.

Theorem 3.

For the general linear equation (4) in Laguerre-Forsyth form, the infinitesimal generators XnX_{n} of GSG_{\!S} and Xn0X_{n}^{0} of GcG_{\!c} have the following expressions, where a0,a1,a2,a_{0},a_{1},a_{2}, and k1k_{1} are arbitrary constants, and hh an arbitrary function.

  1. a)
    Xn=(a2x2+a1x+a0)x+[y[k1+n12(2a2x+a1)]+h]y+k=0n3[(nk)(2a2x+a1)ck+a2(k+1)(k+1n)ck+1+δ0k[ckhy+j=1nk(k+jj)h(j)y]]ck\displaystyle\begin{split}&X_{n}=(a_{2}x^{2}+a_{1}x+a_{0})\partial_{x}+\Big{[}y\big{[}k_{1}+\dfrac{n-1}{2}\big{(}2a_{2}x+a_{1}\big{)}\big{]}+h\Big{]}\partial_{y}\\ &\qquad\quad+\sum_{k=0}^{n-3}\Big{[}-(n-k)(2a_{2}x+a_{1})c_{k}+a_{2}(k+1)(k+1-n)c_{k+1}\\ &\qquad\quad+\delta_{0}^{k}\big{[}-c_{k}\dfrac{h}{y}+\sum_{j=1}^{n-k}\binom{k+j}{j}\dfrac{h^{(j)}}{y}\big{]}\Big{]}\partial_{c_{k}}\end{split} (37)
  2. b)
    Xn0=(a2x2+a1x+a0)x+k=0n3[(nk)(2a2x+a1)ck+a2(k+1)(k+1n)ck+1]ck.\displaystyle\begin{split}&X_{n}^{0}=\left(a_{2}x^{2}+a_{1}x+a_{0}\right)\partial_{x}\\ &\qquad\quad+\sum_{k=0}^{n-3}\left[-(n-k)(2a_{2}x+a_{1})c_{k}+a_{2}(k+1)(k+1-n)c_{k+1}\right]\partial_{c_{k}}.\end{split} (38)
Proof.

As in the proof of Theorem 2, we only need to note that as the Laguerre-Forsyth form is a special case of the normal form, its generators XnX_{n} and Xn0X_{n}^{0} should be sought in the form (32) and (33), respectively. More exactly, we only need to find the specific expression for the parameter ff of the equivalence transformation corresponding to the Laguerre-Forsyth form and substitute this into (32) and (33), and to drop the term involving cn2c_{n-2} in the resulting expressions. It is well-known that the equivalence transformations of the Laguerre-Forsyth form of (4) are invertible transformations of the form (34) in which T(z)T(z) is a linear fractional transformation. The corresponding infinitesimal generator is thus of the form (35), in which f(x)=a2x2+a1x+a0f(x)=a_{2}x^{2}+a_{1}x+a_{0}, for some arbitrary constants a2,a1a_{2},a_{1}, and a0.a_{0}. This is the expression for ff which was to be found, and this completes the proof. ∎

Thanks to the ansatz (26) a direct computation of XnX_{n} and Xn0X_{n}^{0} for equations of low orders up to seven has been performed and confirms the validity of the expressions given in the three preceding theorems. It should also be noted that unlike the case of equations in standard or in normal forms, the generator Xn0X_{n}^{0} of GcG_{\!c} in the case of the Laguerre-Forsyth form involves only a finite number of constant parameters. This means that the invariant functions for this form of the general linear equation are much easier to compute, as already noted by Forsyth [10] who obtained an expression for them by a direct analysis.

As noted earlier, for equations with a maximal symmetry algebra which are already expressed solely in terms of the two coefficients cn1c_{n-1} and cn2,c_{n-2}, to obtain the corresponding infinitesimal generator X0,X^{0}, it suffices to substitute in the expression for Xn0X_{n}^{0} corresponding to the general linear equation (4) the corresponding characterizing equations which give an expression for the other coefficients solely in terms of cn1c_{n-1} and cn2c_{n-2} alone. For instance, for n=4,n=4, the expression for Xn0X_{n}^{0} corresponding to the normalized equation (23) has, on account of (15) and (29), an expression given by

ξ=fϕ30=c3f4g+6f′′ϕ20=2c2f3c3g+3c3f′′6g′′+4f(3)ϕ10=38f(c338c2+6c3c3+4c3′′)3c3g′′+c3f(3)+c2(32c3f2g+f′′)4g(3)+f(4)ϕ00=18g(8c2c3(4c2+c32+6c3)4c3′′)c2g′′c3g(3)g(4)1400f[144c2211c34288c32c38c2(c32+4c3)80c3(5c27c3′′)+16(21c3230c2′′+20c3(3))].\begin{split}\xi&=f\\ \phi_{3}^{0}&=-c_{3}f^{\prime}-4g^{\prime}+6f^{\prime\prime}\\ \phi_{2}^{0}&=-2c_{2}f^{\prime}-3c_{3}g^{\prime}+3c_{3}f^{\prime\prime}-6g^{\prime\prime}+4f^{(3)}\\ \phi_{1}^{0}&=\frac{3}{8}f^{\prime}(c_{3}^{3}-8c_{2}^{\prime}+6c_{3}c_{3}^{\prime}+4c_{3}^{\prime\prime})-3c_{3}g^{\prime\prime}+c_{3}f^{(3)}\\ &\quad+c_{2}\left(-\frac{3}{2}c_{3}f^{\prime}-2g^{\prime}+f^{\prime\prime}\right)-4g^{(3)}+f^{(4)}\\ \phi_{0}^{0}&=-\frac{1}{8}g^{\prime}(8c_{2}^{\prime}-c_{3}(-4c_{2}+c_{3}^{2}+6c_{3}^{\prime})-4c_{3}^{\prime\prime})-c_{2}g^{\prime\prime}-c_{3}g^{(3)}\\ &\quad-g^{(4)}-\frac{1}{400}f^{\prime}\Big{[}144c_{2}^{2}-11c_{3}^{4}-288c_{3}^{2}c_{3}^{\prime}-8c_{2}(c_{3}^{2}+4c_{3}^{\prime})\\ &\quad-80c_{3}(5c_{2}^{\prime}-7c_{3}^{\prime\prime})+16(21c_{3}^{\prime 2}-30c_{2}^{\prime\prime}+20c_{3}^{(3)})\Big{]}.\end{split} (39)

5 Concluding remarks

We reiterate the fact already mentioned that the symmetry properties obtained in this paper for linear equations also apply to the infinite dimensional class of nonlinear equations which are equivalent to a given linear equation admitting a maximal symmetry algebra. For instance, in the simplest case of the free fall equation y′′=0,y^{\prime\prime}=0, an invertible point transformation of the form x=f(z,w),y=g(z,w)x=f(z,w),\;y=g(z,w) shows that the most general class of second order (linear or nonlinear) equations admitting a maximal symmetry algebra has the form

fzgz,zgzfz,z+wz3(gwfw,w+fwgw,w)+wz2(gzfw,w2gwfz,w+fzgw,w+2fwgz,w)+wz(2gzfz,wgwfz,z+2fzgz,w+fwgz,z)+(fzgwfwgz)wz,z=0.\begin{split}&f_{z}g_{z,z}-g_{z}f_{z,z}+w_{z}^{3}\left(-g_{w}f_{w,w}+f_{w}g_{w,w}\right)\\ &+w_{z}^{2}\left(-g_{z}f_{w,w}-2g_{w}f_{z,w}+f_{z}g_{w,w}+2f_{w}g_{z,w}\right)\\ &+w_{z}\left(-2g_{z}f_{z,w}-g_{w}f_{z,z}+2f_{z}g_{z,w}+f_{w}g_{z,z}\right)+\left(f_{z}g_{w}-f_{w}g_{z}\right)w_{z,z}=0.\end{split}

Moreover, linearization methods under point transformations are available for odes of order up to three [5, 6], and this is very meaningful as for practical considerations most odes of physical relevance fall within this range.

One of the most interesting properties of linear equations with maximal symmetries is that their solution can be obtained by a very simple superposition formula from that of the second order source equation [2]. More specifically, thanks to (7), any such equation can always be assumed to be in the normal reduced form (5). In particular, the corresponding second order source equation has the form y′′+by=0,y^{\prime\prime}+by=0, for a certain function b=b(x).b=b(x). If we let uu and vv be two linearly independent solutions of this source equation, then nn linearly independent solutions of an equation of the form (5) with the same source equation are given by

yk=ukvn1k,k=0,,n1.y_{k}=u^{k}v^{n-1-k},\qquad k=0,\dots,n-1.

The latter fact can be used not only for finding analytic solutions of nonlinear equations, but also in the test of numerical schemes. Indeed, when testing a numerical scheme, it is always helpful to have an appropriate collection of nonlinear problems for which one or more explicit analytic solutions are available [16, 17].

The infinitesimal generators Xn0X_{n}^{0} of the induced pseudo group of transformations GcG_{c} found in Section 4 are of a more general interest. One of their main role is in the determination of the invariants (and semi-invariants) of the family of equations, and these functions can in turn be used for a complete classification of the given family of equations [18, 19], thus reducing the study in each equivalence class to that of the canonical equation. For a much practical and immediate use, they are very efficient in testing whether a given function is an invariant of the related family of equation, and any given invariant of the family can also easily be used to test some necessary conditions of equivalence between two given equations.

References

  • [1] S. Lie, Klassification und Integration von gewöhnlichen Differentialgleichungen zwischen x,y,x,y, die eine Gruppe von Transformationen gestetten. I, Math. Ann. 22 (1888) 213–253.
  • [2] J. Krause, L. Michel, Equations différentielles linéaires d’ordre n>2n>2 ayant une algèbre de Lie de symétrie de dimension n+4,n+4, C.R. Acad. Sci. Paris 307 (1988) 905–910.
  • [3] S. Lie, Theorie der Transformationsgruppen, Dritter Abschnitt, Abteilun. I. Unter Mitwirkung von Pr. F. Engel, Teubner, Leipzig, 1893.
  • [4] E. Laguerre, Sur les équations différentielles linéaires du troisième ordre, C.R. Acad. Sci. Paris 88 (1879) 116–119.
  • [5] F.M. Mahomed, P.G.L. Leach, Symmetry Lie Algebras of nnth Order Ordinary Differential Equations, J. Math. Anal. Appl. 151 (1990) 80–107.
  • [6] N.H. Ibragimov, F. Magri, Geometric proof of Lie’s linearization theorem, Nonlinear Dynam. 36 (2004) 41–46.
  • [7] J.C. Ndogmo, F.M. Mahomed, On certain properties of linear iterative equations, Cent. Eur. J. Math. 12 no. 4, (2014) 648–657, arXiv:1207.6851.
  • [8] J.C. Ndogmo, A method for the equivalence group and its infinitesimal generators, J. Phys. A: Math. Theor. 41 (2008) 102001.
  • [9] J.C. Ndogmo, Generating Relative and Absolute Invariants of Linear Differential Equations, Int. Math. Forum 4 (2009) 873–886.
  • [10] A.R. Forsyth, Invariants, covariants, and quotient-derivatives associated with linear differential equations, Philos. Trans. R. Soc. Lond. 179 (1888) 377–489.
  • [11] G. Baumann, Symmetry Analysis of Differential Equations with Mathematica, Springer, New York, 2000.
  • [12] S. Dimas D. Tsoubelis, SYM: A new symmetry–finding package for Mathematica, in: N.H. Ibragimov, C. Sophocleous, P.A. Damianou (Eds.), Proceedings of 10th International Conference in Modern Group Analysis, Larnaca, Cyprus, 2004, pp 64–70.
  • [13] N.H. Ibragimov, Infinitesimal method in the theory of invariants of algebraic and differential equations, Not. S. Afr. Math. Soc. 29 (1997) 61–70.
  • [14] J.C. Ndogmo, On structure-preserving point transformations of differential equations, Phys. Lett. A 373 (2009) 1226–1232.
  • [15] P.J. Olver, Applications of Lie Groups to Differential Equations, Springer, New York, 1986.
  • [16] B. Bradie, A Friendly Introduction to Numerical Analysis, Prentice-Hall, Upper Saddle River, 2006.
  • [17] N.J. Higham, Accuracy and Stability of Numerical Algorithms, Second Edition, SIAM, Philadelphia, 2002.
  • [18] M. Fels, P.J. Olver, Moving coframes. II. Regularization and theoretical foundations, Acta. Appl. Math. 55 (1999) 127–208.
  • [19] O.I. Morozov, Contact-equivalence problem for linear hyperbolic equations, J. Math Sci. (N.Y.) 135 (2006) 2680–2694.