Abstract
Essential connections between the classical symmetry and nonclassical symmetry of a partial differential equations (PDEs) are established. Through these connections, the sufficient conditions for the nonclassical symmetry of PDEs can be derived directly from the inconsistent conditions of the system determining equations of the classical symmetry of the PDE. Based on the connections, a new algorithm for determining the nonclassical symmetry of a PDEs is proposed. The algorithm make the determination of the nonclassical symmetry easier by adding compatibility extra equations obtained from system of determining equations of the classical symmetry to the system of determining equations of the nonclassical symmetry of the PDE. The findings of this study not only give an alternative method to determine the nonclassical symmetry of a PDE, but also can help for better understanding of the essential connections between classical and nonclassical symmetries of a PDE. Concurrently, the results obtained here enhance the efficiency of the existing algorithms for determining the nonclassical symmetry of a PDE. As applications of the given algorithm, a nonclassical symmetry classification of a class of generalized Burgers equations and the nonclassical symmetries of a KdV-type equations are given within a relatively easier way and some new nonclassical symmetries have been found for the Burgers equations.
1. Introduction
The nonclassical symmetry method, proposed by G. Bluman et al. in [1], is one of generalization of the classical Lie symmetry method for obtaining exact solutions of nonlinear PDEs which can not be obtained through its classical symmetries [2,3]. It has a close relation with the ‘direct’ method, Bcklund transformations and functionally invariant solutions etc. [4,5,6].
Determining classical and nonclassical symmetries of a PDE is equivalent to exactly solving the so-called the systems of determining equations arising from the invariance of the PDE under such symmetry transformations. There exist algorithms and software packages [7] to produce such systems of determining equations. However, to obtain nonclassical symmetries, exactly solving the system is a hard task due to its nonlinearity, unlike the situation for classical symmetries [8]. For this reason, nonclassical symmetries of many PDEs in physics and mechanics have not been found [9]. In [10,11,12,13,14], the authors investigate ways of simplifying the solution of the system of nonlinear determining equations based on the Grebner basis method and Wu’s method. In both methods, a system of determining equations is regarded as one of differential polynomials. Therefore, the set of solutions (equivalent to the set of symmetries of the PDE) of the system of determining equations is the same as the set of zero points (algebra variety) of the corresponding system of differential polynomials. Consequently, the problem of solving the system of determining equations is turned to determining the set of zero points of the corresponding polynomial system. This is suitably dealt with within the frameworks of the Grebner basis method and Wu’s method. These methods lead to the development of algorithms for directly dealing with the system of determining equations. However, in these algorithms, the computation of the differential Grebner basis or the characteristic set of the system of corresponding determining equations is a difficult task and this is hardly implemented for higher dimensional PDEs [8]. Recently, in [15], we investigate an alternative algorithm to construct nonclassical symmetries of a PDE basing on so called ‘potential conditions’ and Wu’s method. The conditions come from an ‘observation’ of link between classical and nonclassical symmetries of the PDE. However, the algorithm still depends on the calculation of the characteristic set of the determining system.
The aim of this article was to further investigate the more efficient way for determining nonclassical symmetry of a PDE. Particularly, some essential connections between the classical and nonclassical symmetries of a PDE are established through comparing the determining polynomials of the nonclassical symmetries with those of the classical symmetries. By the connections, some additional information on the existence of nonclassical symmetries of a PDE can be derived directly from the classical symmetries of the PDE. In particular, the connections provide supplementary conditions for nonclassical symmetries so that the corresponding nonlinear determining system is easier to solve. This leads to a more efficient method to determine the nonclassical symmetry of a PDE without calculating such characteristic set of the determining system and having these ‘observations’. Our results not only reveal the more close connection between classical and nonclassical symmetries of a PDE, but also improve the efficiency of the methods in [10,11,12,13,14,15].
The rest of this paper is organized as follows. In Section 2, we give some preliminaries on the classical and nonclassical symmetries of a PDE and present a reduction formula of differential polynomial with respect to a differential ascending chain. In Section 3, we present our main results on connection between classical and nonclassical symmetries of a PDE in terms of the determining polynomial systems of the symmetries and inclusions connections of their zero point sets. In Section 4, as applications of the obtained connections, nontrivial nonclassical symmetries are found for both a class of generalized Burgers equations and system of KdV-type equations in a relatively easier way. In Section 5, we summarize our results and include some concluding remarks.
2. Preliminary
2.1. Notations
Let and be independent and dependent variables, respectively. Let be the set of non-negative integers. For a multi-index , we denote the differential operator as with order ; we use to denote the set for a fixed . Let be a characteristic zero field of differential functions of and let be the differential polynomial ring in indeterminates for all non-negative integer k over .
A system of differential equations where are polynomials in is denoted shortly as where is the set of left side polynomials of the equations, i.e., . For a system of differential equations in polynomial form, one has a corresponding system of differential polynomials . Use Z to denote the set of zero points of the differential polynomial system over field . Thus the solution set to the system of equations is the same as the set Z.
Under a differential polynomial rank (order), the coefficient of the leading derivative of a differential polynomial is called initial of the polynomial. The partial derivative of a differential polynomial with respect to its leading derivative is called the separant of the polynomial. For a differential polynomial system , a product of initials and separants of the polynomials in the system is called IS product of the system, denote it as IS or IS.
For two systems and Q of differential polynomials, we denote .
The notation denotes the set of values of the differential polynomial at all points in Z.
In all examples, we use the graded lexicographic differential polynomial rank [10,12,16,17] for differential polynomials in with no further elaboration.
2.2. A Reduction Formula
A reduction of a differential polynomial with respect to another one or an ascending chain of differential polynomials is a basic operation in polynomial algebra. A reduction formula frequently used is the pseudo-reduction given in [16,17]. It has been used in the methods given in [7,10] and [18,19] under different names such as Kolchin-Ritt reduction and Ritt-Wu reduction. We apply the reduction in this article for setting up a connection between classical and nonclassical symmetries of a PDE and analyze the set of zero points of a system of differential polynomials.
The reduction is related to the concept of the differential ascending chain of a differential polynomial system given below.
Definition 1.
A differential ascending chain is a finite set of differential polynomials
if, under a differential polynomial rank ≺, it has the two properties showing below:
- (a)
- ;
- (b)
- is reduced with respect to (the terms in can not be eliminated by ) for
The Ritt-Wu reduction for a differential polynomial with respect to a differential ascending chain is given as follows.
Theorem 1.
For a differential polynomial and a differential ascending chain , there exist differential operators with and an IS product IS of such that
where the , called the remainder of h with respect to and denoted by , is reduced with respect to (any term in R cannot be eliminated further by the polynomials in ) and the is the total differential operator related to with respect to .
The Equation (2) is proved by successively removing from h all terms that are differentiation of the leading derivatives of the elements of under a polynomial order until the procedure cannot be continued (the details are seen in [16,17,18]). The procedure of building Equation (2) is constructive and can be implemented by a computer algebra system [12]. For a differential polynomial system , we use the notation
In addition, a basic algorithm used in this article is the well-known Wu’s algorithm (also called the characteristic set algorithm) for constructing a differential characteristic set for any given finite differential polynomial system. We use the algorithm to reduce a system of determining equations of the symmetries of a PDE into a differential ascending chain. The details of the algorithm appear in [18,19,20,21].
2.3. Classical and Nonclassical Symmetries of a PDE
For simplicity, we consider the case of a scale PDE. Actually, the results presented in the article hold in the case of a system of PDEs.
A more detailed discussion on the nonclassical symmetry for a general PDEs is given in [10].
Let an kth order PDE
be given with independent variables and one dependent variable u. Suppose is a polynomial in its arguments.
Let
be the generator of classical symmetry of Equation (3) where and are the infinitesimal functions of the generator with independent variables .
The system of determining equations of generator Equation (4) satisfied by and is derived from the invariance criterion: when . Here is the prolongation of on the jet space of u. Explicitly solving the system, one determines generator Equation (4), i.e., the classical symmetry of PDE Equation (3).
The generator of the nonclassical symmetry of Equation (3)
is obtained by requiring that both Equation (3) and its invariance surface equation
are simultaneously invariant under the symmetry transformation of Equation (5). The invariance criterion: when and leads to the system of determining equations for nonclassical symmetry Equation (5). The system is a nonlinear PDEs for the infinitesimal functions and that appear in Equations (5) and (6). Thus, in principle, after exactly solving the system, one finds the nonclassical symmetry Equation (5). However, this is, in general, a hard task [8,10].
The concept of equivalent generators plays a key rule in this article.
Definition 2.
Equivalent symmetry generators of a PDE generate the same reduced solutions of the PDE.
Remark 1.
In this article, without loss of generality, we assume in Equation (5). Otherwise, we successively assume and and discuss each case separately. Hence, by Definition 2, we set . Conventionally, in the case of an evolution equation case, each is the coefficient of in generator corresponding to the time variable, usually denoted by τ. Hence, in the regular case of the nonclassical symmetries for an evaluation equation, we set .
In the following, let and be the systems of determining equations for the symmetry generators and of PDE Equation (3). The sets of the left hand sides and of the two systems are called determining polynomial systems of the classical and nonclassical symmetries respectively. Then, the zero point sets and are the sets of the classical and nonclassical symmetries of the PDE.
In convenience, we use the following additional notations: , , and , . Thus, generators Equations (4) and (5) can be written shortly as and by scalar product rule of finite dimensional vector space.
Our main goal is to determine some connections between the systems and .
3. Connections between Classical and Nonclassical Symmetries of a PDE
It is well-known that the set of classical symmetries of a PDE is a subset of the nonclassical symmetries of the PDE. Hence, the classical symmetry of a PDE has equivalent expressions in the coordinates and .
Therefore, we use a map between any with and as coordinately
If a nonclassical symmetry represents a classical symmetry, then there exists an equivalent such that and have a unified proportional relationship. Hence, the transformation Equation (7) map a classical symmetry expressed by an into equivalence one expressed by the corresponding and vice versa.
Let ≺ be a differential polynomial rank on with having the highest rank, i.e., . Let be an ascending chain form of which can be obtained by Wu’s algorithm under the rank. In [12], we have proved that for a PDE if . Hence, the set represents the classical symmetry of the PDE under the conditions that the initials of are not zero.
Remark 2.
Here, we emphasize that it is unnecessary for to be a characteristic set of , which is required in the algorithms given in [12,15]. Here, the cost of calculating is much less than that of calculating the characteristic set of . In the latter, it is involved the calculations of integral conditions of a system which is a recognized hard problem [16,17,18].
In evidence, the set is an irreducible ascending chain due to its linearity.
Throughout this article, we assume that the initials of the differential polynomials in are not zero, i.e.,
Remark 3.
Assumption Equation (8) is not critical for a PDE. Since the the polynomials in are linear, the initials of are polynomials in terms of the independent variable , so they are never zero if the PDE does not contain parameters.
Now, we obtain the connections between classical and nonclassical symmetries of a PDE, which provides sufficient conditions to determine the existence of a nontrivial nonclassical symmetry.
Theorem 2.
For an , if, after using transformationsEquation (7) for a , the as a differential polynomial system in has no zero points, i.e., Z (equivalently, equations is inconsistence), then the operator is a nontrivial nonclassical symmetry of the PDE.
Proof.
If the is equivalent to a classical symmetry, then there exists such that and the are equivalent under transformation Equation (7). This means . This is a contradiction with respect to the assumption of the theorem. □
Use the notation to denote the set of the differential polynomials in whose leading derivatives are the derivatives of with respect to . Thus, for any subset , one has the following corollaries of this theorem.
Corollary 1.
The Theorem 2 is also true when replacing in the theorem with any subset . In particular, when Q is or the complement set , the theorem is still true.
Let . Use to denote a set of polynomials obtained from Q or total derivatives of some polynomials in Q.
Then we have the following second corollary of Theorem 2.
Corollary 2.
The Theorem 2 is also true when replacing in the theorem with or for any subset .
Proof.
The theorem is a direct conclusion of Theorem 2 and the inclusion relation Z Z. □
In the following, based on Equation (2) and transformation Equation (7), we turn into a system of differential polynomials in so that it connects the classical symmetries Z and nonclassical symmetries Z.
From the structure of an ascending chain, we know that the both set and the complement set are differential ascending chain in . Using transformation Equation (7), we change and to the systems in (again denote therm as and ). It is noticed that the rank ≺ on induces a rank on through matching and matching . Obviously, it keeps the highest rank of . Under the induced rank, we do the reduction
through Equation (2). In the reduction of C, the operation on is not involved. Therefore, due to the highest rank of and the linearity of both and transformations Equation (7), each element in C, as a differential polynomial in has the same rank and initials as its corresponding one in the . Hence, the C inherits the differential ascending chain property of the as well as the linearity of its polynomials in their leading derivatives with Equation (8).
So far, we have turned into the .
For the convenience, denote
and
Thus, we have connection between C and as follows.
Theorem 3.
Proof.
For an , since a classical symmetry with is equivalent to a nonclassical symmetry of the same PDE, there is a connecting through transformations Equation (7). The construction procedure for C immediately shows that . This ends the proof of the Theorem. □
Now, we can establish a connection between classical and nonclassical symmetries of a PDE in terms of the dependence of the determining polynomials in on the ones in C as stated in the following theorem.
Theorem 4.
For each , there exist differential operators with coefficients in and an IS product IS of C such that the identities
hold for all differential functions ξ and η.
Proof.
From the construction of C, for each , there exist some differential operators and an IS product IS of such that
from reduction Equation (2). Here the remainder is reduced with respect to . The obtained identity with assumption Equation (8) implies
Noticing that and using above inclusions, we can easily prove that
Furthermore, the equality (11) shows that the differential ascending chain is irreducible since the is irreducible.
On the other hand, for each , there are some differential operators and an IS product IS of C, such that
from reduction Equation (2). Here the remainder is reduced with respect to C. It, from Equation (9), is also noticed that the R is also reduced with respect to . Hence the remainder R is reduced with respect to irreducible ascending chain .
Since , the identity Equation (12) and Theorem 3 imply that the remainder is identically equal to zero on Z, i.e.,
Summarizing the above discussions, we have the inclusions:
Remark 4.
Theorems 2–4 and Corollaries 1 and 2 give relationships between the classical and nonclassical symmetries of PDE Equation (3) in terms of the determining polynomial systems and of the two kinds of symmetries, in which the set C plays the rule of a bridge between classical and nonclassical symmetries of a PDE.
From the viewpoint of practical applications, the inclusions Equation (13) imply that more additional equations from C can be used to extended system for nonclassical symmetry. In fact, any subset or is compatible with . Hence, we get some extended system of by appending Q or to . The extended system is more easily solved than the original since it contains more equations. It may yield a nonclassical symmetry of the underling PDE.
Obviously, the above process of proving Equation (10) is constructive and forms an algorithm for constructing Equation (10).
The following is an illustrative example to show how well the above theorems and algorithm work well.
Example 1.
We consider the Burgers - Huxley equation
The whole classical symmetries admitted by the equation are obvious symmetries
corresponding to time and space translations for any .
We first establish identities Equation (10) following the procedure (algorithm) of proving Theorem 4.
Step 1.Computing and . The systems of determining equations for a nonclassical symmetry and a classical symmetry of the equation are given by and respectively, where
and
Step 2.Turning into ascending chain form. Obviously, the system is already an ascending chain form under rank . Hence and
with .
Step 3.Substituting the transformation Equation (7) with into , then computing the reduction Rem() and after deleting the common factor , we have the differential ascending chain under the induced rank of the rank in Step 2. Here
with IS
This implies Z Z, i.e., the right side inclusion of Equation (13) holds.
Obviously, the first classical symmetry in Equation (15) with is contained in Z, i.e., Theorem 3 is satisfied. We notice that the with
is in Z for but does not correspond to any classical symmetry, i.e., Z. This verified the Theorem 2. It also shows that in general Z may be larger than the set of classical symmetries.
4. Applications
We give two examples to show the applications of Theorems 2–4 and Corollaries 1 and 2 to determine nontrivial nonclassical symmetries of a given PDE.
4.1. A Nonclassical Symmetry Classification of a Class of Generalized Burgers Equations
The nonclassical symmetry classification of a PDE with arbitrary functions is a hard problem in symmetry analysis of a PDE [9,10]. We solve this problem by using given Theorems 2–4 and Corollaries 1 and 2.
Consider the nonclassical symmetry classification of a class of generalized Burgers equations
with two arbitrary functions parameters and , which covers a wide range of mathematical models describing various processes in physics, biology and ecology(see [11,22,23,24] and references therein).
For the case , the equation represents: the Huxley equation if ; the Fisher’s equation if ; the generalized Fisher’s equations if or ; the Chaffee – Infante or Newell – Whitehead equation if ; the generalized KPP equation if ; the Fitzhugh – Nagumo equation if , etc.;
For the case , the equation represents: the Burgers equation if ; the Burgers - Huxley equation if , etc.;
For the case , the equation represents: the generalized Burgers – Fisher equation if ; the generalized Burgers – Huxley equation if , etc.
In [22], the authors considered Equation (19) with and gave the nonclassical (there Q-conditional) symmetry classification with respect to . For , the complete nonclassical symmetry classification is given in [11]. In [23,24], the complete classical symmetry classification of the equations was given.
Now we consider the nonclassical symmetry classification of Equation (19) in general sense for two arbitrary parameters and by using the method given in the article.
The system of determining polynomials of classical symmetry of Equation (19) is given by
Under the order , the system is already in differential chain form. Hence .
By using the given algorithm, we find the relationships Equation (10) between and as follows
where
with IS.
From the transformation Equation (7) in this example, we have which implies that Equations (19) admits a nonclassical symmetry when and Z from Theorem 2. Therefore, based on the reasonable information we consider the cases of and respectively.
Case 1:
In the case, from Theorem 2 we can impose more restrictions on the system so that it is solved easily and yields nontrivial nonclassical symmetries of the equation. It is observed that if one takes as , then never be zero under transformation Equation (7) for . Hence, according to Theorem 2, such and yield a nontrivial nonclassical symmetry of the equation. Based on the analysis, an ansatz of the infinitesimal functions that fits these conditions is and with or .
Remark 5.
Actually, one takes in more general form. However, it is easy to deduce that when .
Under these restrictions, system is reduced significantly and solved easily. In particular, we have the following three groups of nonclassical symmetries.
for where and are arbitrary constants with or or ;
for , where and are arbitrary constants with ;
for , where and are solutions to the system
where and are arbitrary constants with .
Case 2: .
In the case, the additional condition gives a first step simplification of the system of determining equations. In order to further simplify the system, we use Theorem 2 to find more information on nontrivial nonclassical symmetry of the equation. For a Z, under transformation Equation (7), we have
It is clear that Z if . Hence, by Corollary 1, we look for a nontrivial nonclassical symmetry of the form with . Now, we suppose from the . These significantly simplify the system of determining equations.
For simplicity, denote and .
Now, the rests of determining equations and become
for , where
and
for and , where
Since the f and g are functions of a single variable u, the coefficients and must be constants. After simple analysis, we can prove that Equation (19) does not admit a nontrivial nonclassical symmetry unless and .
Solving the first equation, we get
and
for arbitrary constant k.
It easily proves that the compatibility condition of Equation (27) for case Equation (28) of is , i.e., . Meantime, the satisfies which further determines b and c from the equations in Equation (27). Consequently, we obtain nonclassical symmetries of Equation (19) as follows.
with and
where and are arbitrary constants and .
In case Equation (29), the Equation (19) becomes a linear equation. The determining equations for nonclassical symmetries of the linear equation yield
where the functions and satisfy
It may be not possible to find the general solutions of the above PDE system. In the following, we give some special solutions.
Solving the system under the condition , we obtain two groups of solutions:
and
with in terms of arbitrary constants and .
In the special case where the functions and are independent of t, we have a additional group of solutions to the determining equations given by
in terms of an arbitrary constants .
Summarizing the above procedure, we obtain a nonclassical symmetry classification of Equation (19). We have proven that the equation admits nontrivial nonclassical symmetry when is a polynomial with degree less than four in u and g is linear in u. The symmetries (30) with (31) and (32) with (35) were given in [11]. The symmetries (21), (22), (32) with (33) and (34) are new ones. The symmetries (23) are more general than those given in [11].
Moreover, here in the case , we recovered the symmetry classification results in [11] obtained by P. A. Clarkson and E. L. Mansfield who directly treat the system of determining equations by the Grebner basis method. In the case , we recovered the results in [22] given by Roman Cherniha who dealt with the determining system by direct calculation. Here, we solve the problem for Equation (19) by an alternative method using Theorems 2 and 3 and Corollaries 1 and 2 in general sense for arbitrary and and show that only in the case when g is linear and is cubic polynomials in u, the class of Equations (19) admits a nontrivial nonclassical symmetry. In particular, compared with the ways for symmetry classification problem existing in literatures [10,11,12,22], our method avoids a lot calculations for dealing with the determining equations.
Of physical interest is that there are many important equations, such as the Huxley equation, the Chaffee–Infante or Newell–Whitehead equation, the generalized Fisher’s equations with or , the generalized KPP equation, the Fitzhugh–Nagumo equation, Burgers equation, the Burgers–Huxley equation, that admit nontrivial nonclassical symmetries. Nevertheless, equations such as the generalized Burgers–Fisher equation, the generalized Burgers–Huxley equation (), the Fisher’s equation, the generalized Fisher’s equations with and do not admit nontrivial nonclassical symmetries.
4.2. Nonclassical Symmetry of a KdV-Type Equations
Consider a KdV-type equations in soliton theory [6,12] given by
The system of determining polynomials for the classical symmetry of the equations is given by
and it has , where
and are arbitrary constants. It yields classical symmetries
of Equations (36). By our given algorithm, we have the set , where
The system of determining polynomials of the nonclassical symmetry of the equations is consists of 11 strongly nonlinear equations, variable coefficients and long expressions for differential polynomials. We can establish the identities Equation (10) between the system and C by our given algorithm. Due to complexity and massive scale, we here omit the expressions of the connections. The system is difficult to deal with directly. Nevertheless, we can get some specific nonclassical symmetries of Equation (36) by using Corollaries 1 and 2.
We notice that there are three identities in Equation (10) that only involve the and . In order to reduce the system, we deliberately set . In addition, we take some analysis on nonclassical symmetry of the equations. From the set , we see that if one of , , and is not zero. Hence they may provide sufficient conditions for existence of nonclassical symmetries of Equations (36) by Theorem 2. With considering the sufficient conditions and for further simplifying the determining equations, we take and as more conditions by Corollary 2. Under these conditions the infinitesimal functions are simplified as
With symbolic computations, substituting the solutions into the system of determining equations and setting the coefficients of u and v as zero, we obtain solutions
in which (ct(t), cs(t))=(, sech) and (ct(t), cs(t))=(, csch ), and are arbitrary constants. Obviously, these solutions are not in Z since .
These recovered the results in [12]. Compared with the calculation of the method in [12], the calculation here is simpler.
5. Conclusions
Some relationships (Theorems 2–4 and Corollaries 1 and 2) between the classical and nonclassical symmetries of a PDE are given. An important innovation idea presented in the connections is that additional information on the nonclassical symmetry to be determined is obtained directly from the inconsistence of the determining system of classical symmetry of the PDE. Another more interesting point is the use of the equivalent transformation Equation (7) and deriving the set C. The set C connects such symmetries of the PDE in terms of their determining polynomials. In addition, Wu’s reduction formula and algorithm play fundamental rules in deriving these results. In particular, an algorithm based on the reduction algorithm is given for constructing connections Equation (10).
These obtained connections efficiently yield sufficient conditions on the existence of the nonclassical symmetries of a PDEs, which make it easier to solve the system of nonlinear determining equations. Because these connections provide further information for the nonclassical symmetry, it is not necessary to calculate the characteristic set of the system of the determining equations at the beginning. Hence the computation is much more cheaper. Consequently, the connections give an alternative way to obtain nontrivial nonclassical symmetry of a PDE and improve the efficiency of the algorithms given in literatures. Moreover, the connections yield a way to better understand the relationship between classical and nonclassical symmetries of given PDEs. The higher efficiency applications of the obtained results for determining nontrivial nonclassical symmetries yielded new nonclassical symmetries for a class of the generalized Burgers equations.
Author Contributions
Investigation, G.B.; Methodology, C.T. and L.T. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by Natural science foundation of China, under grand numbers: 11571008.
Acknowledgments
The first two authors are supported by Natural science foundation of China, under grand numbers: 11571008. George Bluman acknowledges financial support from the National Sciences and Engineering Research Council of Canada. Authors thanks reviewers’ kind and valuable comments and suggestions.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Bluman, G.W.; Cole, J.D. The general similarity solution of the heat equation. J. Math. Mech. 1969, 18, 1025–1042. [Google Scholar]
- Bluman, G.W.; Kumei, S. Symmetries and Differential Equations; Springer: New York, NY, USA, 1989. [Google Scholar]
- Olver, P.J. Applications of Lie Groups to Differential Equations, 2nd ed.; Springer: New York, NY, USA, 1993. [Google Scholar]
- Clarkson, P.A. Nonclassical symmetry reductions of the Boussinesq equation. Chaos Solitons Fractals 1995, 12, 2261–2301. [Google Scholar] [CrossRef]
- Nucci, M.C.; Clarkson, P.A. The nonclassical method is more general than the direct method for symmetry reductions. An example of the Fitzhugh-Nagumo equation. Phys. Lett. A 1992, 164, 49–56. [Google Scholar] [CrossRef]
- Baumann, G.; Haager, G.; Nonnenmacher, T.F. Applications of nonclassical symmetries. J. Phys. A: Math. Gen. 1994, 27, 6479–6493. [Google Scholar] [CrossRef]
- Mansfield, E.L. Applications of the differential algebra package diffgrob2 to classical symmetries of differential equations. J. Symb. Comput. 1993, 5–6, 517–533. [Google Scholar]
- Clarkson, P.A.; Mansfield, E.L. Open problems in symmetry analysis. Contemp. Math. 2001, 285, 195–205. [Google Scholar]
- Ibragimov, N.H. CRC Handbook of Lie Group Analysis of Differential Equations. Vol 2: Applications in Engineering and Physical Sciences; CRC Press: London, UK; Tokyo, Janpan, 1994. [Google Scholar]
- Clarkson, P.A.; Mansfield, E.L. Algorithms for the non-classical method of symmetry reductions. SIAM J. Appl. Math. 1994, 54, 1693–1719. [Google Scholar] [CrossRef]
- Clarkson, P.A.; Mansfield, E.L. Symmetry reductions and exact solutions of a class of nonlinear heat equations. Phys. D Nonlinear Phenom. 1994, 70, 250–288. [Google Scholar] [CrossRef]
- Temuer, C.; Bluman, G. An algorithmic method for showing existence of nontrivial non-classical symmetries of partial differential equations without solving determining equations. J. Math. Anal. Appl. 2014, 411, 281–296. [Google Scholar]
- Temuer, C. New algorithm for classical and nonclassical symmetry of a PDE based on Wu’s method. Sci. Sin. Math. 2010, 40, 331–348. (In Chinese) [Google Scholar]
- Temuer, C.; Pang, J. An algorithm for the complete symmetry classification of differential equations based on Wu’s method. J. Eng. Math. 2010, 66, 181–199. [Google Scholar]
- Bai, T.; Temuer, C. A Potential Constraints Method of Finding Nonclassical Symmetry of PDEs Based on Wu’s Method. Adv. Math. Phys. 2019, 2019, 272347. [Google Scholar] [CrossRef]
- Ritt, J.F. Differential Algebra; American Mathematical Society: Providence, RI, USA, 1950; Volume 33. [Google Scholar]
- Kolchin, E.R. Differential Algebra and Algebraic Groups; Academic Press: New York, NY, USA; London, UK, 1973. [Google Scholar]
- Wu, W.T. On the foundation of algebraic differential geometry. Syst. Sci. Math. Sci. 1989, 2, 289–312. [Google Scholar]
- Wu, W.T. Mathematics Mechanization; Mathematics and Its Applications; Science Press: Beijing, China; Kluwer Academic Publishers: Dordrecht, The Netherlands; Boston, MA, USA; London, UK, 2000; Volume 489. [Google Scholar]
- Gao, X.S.; Wang, D.K.; Liao, Q.; Yang, H. Equation Solving and Machine Proving—Problem Solving with MMP; Science Press: Beijing, China, 2006. (In Chinese) [Google Scholar]
- Temuer, C. An algorithmic theory of reduction of a differential polynomial system. Adv. Math. 2003, 32, 208–220. [Google Scholar]
- Cherniha, R. New Q-conditional symmetries and exact solutions of some reaction-diffusion-convection equations arising in mathematical biology. J. Math. Anal. Appl. 2007, 326, 783–799. [Google Scholar] [CrossRef]
- Serov, M.I.; Cherniha, R.M. Lie symmetries and exact solutions of nonlinear equations of heat conductivity with convection term. Ukr. Math. J. 1997, 49, 1423–1443. [Google Scholar] [CrossRef]
- Cherniha, R.; Serov, M. Symmetries, ansatze and exact solutions of nonlinear second-order evolution equations with convection terms, II. Eur. J. Appl. Math. 2006, 17, 597–605. [Google Scholar] [CrossRef]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).