SimilaritySolutions - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


PDEtools

  

SimilaritySolutions

  

computes the group invariant (point symmetry) solutions for a given PDE system

 

Calling Sequence

Parameters

Description

Examples

Compatibility

Calling Sequence

SimilaritySolutions(PDESYS, DepVars, S, 'options'='value')

Parameters

PDESYS

-

a PDE, or a set of PDEs, or a list of PDEs; it can include ODEs and non-differential equations

DepVars

-

optional - may be required; a function or a list of them indicating the dependent variables of the problem

S

-

optional - a list with the functional form of the infinitesimals of a symmetry generator, or a list of lists of them

checkconsistency = ...

-

optional - can be true or false (default), to check the consistency of PDESYS before proceeding

closesystem = ...

-

optional - can be true or false (default), to derive and then include in PDESYS, explicitly, all its integrability conditions before computing the determining system for its symmetries

degreeofinfinitesimals = ...

-

optional - related to the option typeofsymmetry = polynomial, indicates the upper bound degree of the polynomial infinitesimals with respect to all or each of the dependent variables

dependency = ...

-

optional - indicates the dependency of the invariant solutions, as a number (of jet variables), a range of them, a name, or a set of dependencies each of which can be a set or list of variables or numbers

dependencyofinfinitesimals = ...

-

optional - same as dependency but for the infinitesimals with which the invariant solutions are constructed

HINT = ...

-

optional - a list with the functional form of the infinitesimals of a symmetry generator

reducedsystemsolver = ...

-

optional - can be pdsolve or SimilaritySolutions, specifies the command to be used to attempt solving the reduced PDESYS

removeredundant = ...

-

optional - can be true or false, to remove or not redundant solutions - which happen to be particular cases of more general solutions being returned together

simplifier = ...

-

optional - indicates the simplifier to be used instead of the default simplify/size

specialize_Fn = ...

-

optional - can be true, false (default), or a set of procedures, to specialize any arbitrary functions that may appear in the infinitesimals

specialize_Cn = ...

-

optional - can be true (default) or false, to split or not the list of infinitesimals into cases by specializing the integration constants _Cn

typeofsymmetry = ...

-

optional - can be any of pointlike (default), contact, evolutionary, or general, or any of polynomial or functionfield, or And(<kind>, <functionality>) where kind is any of the first three types mentioned and functionality is any of polynomial or functionfield, indicates the type of symmetry to be computed

Description

• 

Given a PDE problem (PDESYS), as an equation or a set or list of them, SimilaritySolutions computes the so-called similarity solutions of PDESYS; these are solutions derived from a 1-dimensional symmetry group admitted by PDESYS, by reducing the number of independent variables by one then attempting solving this reduced problem.

• 

Similarity solutions are special cases of group invariant solutions that can be computed by reducing the number of independent variables by many in one go. Thus, if you are only interested in the PDE solutions, there is a difference to have in mind between these two solving approaches: computing similarity solutions requires computing additional symmetries for the reduced problem, after having reduced it, to further reduce the number of independent variables one at a time until obtaining an ODE problem, while that is not required when reducing the given PDE problem to an ODE problem in one go (i.e. reducing all but one of the independent variables in a single computational step) with InvariantSolutions.

• 

Similarity solutions can also be computed interactively, step by step, by first computing the determining PDE system, next solving this system to obtain the infinitesimals, with them you compute an similarity transformation to reduce by one the number of independent variables of PDESYS, finally you solve the reduced system to change variables back resulting in the solutions for PDESYS. You can compute any of these steps respectively using the commands: DeterminingPDE, Infinitesimals, SimilarityTransformation and dchange.

• 

If DepVars is not given, SimilaritySolutions will consider all the differentiated unknown functions in PDESYS as unknown of the problems. Specifying DepVars however permits not only restricting the unknowns in different ways but also specifying unknowns of the problems which do not appear differentiated in PDESYS.

• 

To avoid having to remember the optional keywords, if you type the keyword misspelled, or just a portion of it, a matching against the correct keywords is performed, and when there is only one match, the input is automatically corrected.

Optional arguments

  

A number of optional arguments can change the default computational behavior of InvariantSolutions in ways that, depending on the example or your needs, may be preferred.

• 

checkconsistency = true | false

The default value is false; when true, the consistency of PDESYS is checked before proceeding. Note that one could construct the determining system for the symmetries of an inconsistent PDESYS, in which case the solution of the determining system and everything else derived from it would be meaningless.

• 

closesystem = true | false

  

By default SimilaritySolutions processes PDESYS as given. If, in PDESYS, all the integrability conditions that can be derived from its equations are explicitly present, then the determining system for the symmetries is assured to have for solution all the symmetries of PDESYS. Otherwise, the determining system for the symmetries may in rare situations also (correctly) include equations that however may restrict the possible values of the symmetry solutions, and hence some of the symmetries be missed. Correspondingly, some invariant solutions may not be present in the output of SimilaritySolutions. Note also that, for a system to be closed, it is not sufficient to have it in reduced involutive or equivalent form produced by the casesplit and rifsimp commands or the DifferentialAlgebra package. To assure that all the integrability conditions are explicitly present use the option closesystem. See also the Library routine CloseSystem.

• 

degreeofinfinitesimals = nonnegint | set(function = nonnegint)

  

This option is related to the option typeofsymmetry = polynomial explained below. By default, an upper bound for the degree of the polynomial dependency of the infinitesimals on the jet variables is determined by the Library routine UpperBounds. To override this behavior pass degreeofinfinitesimals = n, where n is a non-negative integer, so that Infinitesimals, called by SimilaritySolutions, will search for infinitesimals all of them of degree n. You can also specify the degree of each infinitesimal, say, _&xi;1, _&xi;2, _&eta;1, passing, say, degreeofinfinitesimals = {_xi[1] = n, _xi[2] = m, _eta[1] = p}, where n, m, p are non-negative integers.

• 

dependency = name | nonnegint | range(nonnegint) | set(name) | list(name), or a set or list of any of the previous types

  

The right-hand-side is a positive integer, or a set or list of independent variables of the PDE problem represented by PDESYS, respectively indicating either the minimum number of independent variables on which the solutions are expected to depend, or the actual independent variables expected in this dependency. This option is relevant in connection with the fact that some of the group invariant solutions do not depend on all the independent variables of the problem.  If this option is not indicated, the solutions returned are computed regardless of their dependency, using as many symmetries as possible in one go.

• 

dependencyofinfinitesimals = name | nonnegint | range(nonnegint) | set(name) | list(name), or a set or list of any of the previous types

  

This option is used to specify the dependency of the infinitesimals, typically to restrict it so that their computation is easier.

– 

When dependencyofinfinitesimals = name, all the infinitesimals are assumed to depend only on that name variable.

– 

dependencyofinfinitesimals = n where n is a non-negative integer generates a search for infinitesimals depending on any of the permutations of n jet variables; this is useful in contexts where we need only infinitesimals depending on just some (n) variables.

– 

Specifying an integer range dependencyofinfinitesimals = n..m generates a search for infinitesimals depending on any permutation of k variables where n < k < m. In other words, depending on not less than n and no more than m variables.

– 

Specifying a set of lists, for instance, if the jet variables are x, t, and u, so that dependencyofinfinitesimals = {[x], [x, t], [t, u]},this option will generate a search for infinitesimals depending on any of the three lists of variables specified.

– 

Specifying a set or list of names generates a search for infinitesimals depending on any but only one of the indicated variables.

• 

HINT = <functional form of the infinitesimals>

  

The functional form of the infinitesimals can be specified as a list of algebraic expressions. There must be as many as the number n of independent variables plus the number m of dependent variables to be correspondingly associated with _&xi;1 to _&xi;n and with _&eta;1 to  _&eta;m. Alternatively this list can contain n+m equations, where the left-hand-sides contain any functions of name variables and the right-hand-sides contains the actual hint being suggested. In both cases, the algebraic expressions (or those in the right-hand- sides) may or not contain functions to be determined so that the problem has solution. If there are no functions, then either the given HINT exactly solves the determining system for the infinitesimals, and hence is used as given to construct solutions, or it doesn't in which case they are discarded.

• 

reducedsystemsolver = ...

  

The right-hand-side is either pdsolve or SimilaritySolutions, specifies the command to be used to attempt solving the reduced PDESYS. The default command used is a combination of pdsolve, dsolve and solve and whenever the solution obtained involves ODESolStruc or DESol, this solution is discarded as unsuitable for representing PDE solutions. (Note: this may change in the future.)

• 

removeredundant = ...

  

The right-hand-side is either true or false, to remove or not redundant solutions that frequently appear in the set of group invariant solutions; they may be redundant in that they may be particular cases of more general solutions being returned together.

• 

simplifier = ...

  

The right-hand-side indicates the simplifier to be used instead of the default which is simplify/size. This option is of use not just to simplify the solutions. You can specify any procedure to be used as simplifier; in this way you can have the computed InvariantSolutions post-processed entirely in the way you need before being returned (e.g. discard some, do something else with other ones, etc.).

• 

specialize_Cn = true | false

  

To split or not the list of infinitesimals into cases by specializing the integration constants _Cn (see related discussion in Infinitesimals) before computing invariants in the framework of the process to derive group-invariant solutions from these infinitesimals. The default of this option is true. This option is irrelevant when invariants are passed using the invariants = ... option described above.

• 

specialize_Fn = true | false | set(procedure)

  

By default the arbitrary functions Fn... entering the returned infinitesimals are not specialized. When specialize_Fn = true, these functions are specializing taking all of them but one equal to 0, the remaining one equal to 1 and to each of its arguments. So if an arbitrary function has - say - three arguments, then there will be four specializations. Alternatively you can specify a set of procedures to be applied to the arguments of the arbitrary functions, each one resulting in a different desired specialization.

• 

typeofsymmetry = pointlike | evolutionary | contact | general | polynomial | functionfield | And(symmetry_type, functionality_type)

  

By default InvariantSolutions will search for point symmetries to construct the corresponding invariant solutions. Alternatively you can request it to search for symmetries with polynomial or functionfield type of functionality, or of evolutionary, contact or general symmetry types instead of pointlike, where in this context general means infinitesimals depending on derivatives of each unknown of the system up to order n1, where n is the differential order of the unknown as found in the system, and evolutionary is like general but with the ξ infinitesimals (related to transformations of the independent variables) all equal to zero. The right-hand-side can also be of the form And(symmetry_type, functionality_type) where symmetry_type is any of pointlike, evolutionary, contact or general, and functionality_type is one of polynomial or functionfield, the latter related to the FunctionFieldSolutions command. In these cases, You can set the degree of the polynomial or functionfield form using the option degreeofinfinitesimals explained above.

Examples

Consider the wave equation in four dimensions to avoid redundant typing on input and on the display use diff_table and declare

withPDEtools&colon;

Udiff_tableux&comma;y&comma;z&comma;t&colon;

declareU

ux&comma;y&comma;z&comma;twill now be displayed asu

(1)

pde1Ux,x+Uy,y+Uz,zUt,t=0

pde1ux,x+uy,y+uz,zut,t=0

(2)

You can compute the similarity solutions corresponding to all the point symmetries of pde[1] in one step by entering SimilaritySolutions(pde[1]); or better: check first the infinitesimals corresponding to point symmetries admitted by pde[1], then examine the different solutions and choose the more suitable one

declare_&xi;&comma;_&eta;x&comma;y&comma;z&comma;t&comma;u

_&xi;x&comma;y&comma;z&comma;t&comma;uwill now be displayed as_&xi;

_&eta;x&comma;y&comma;z&comma;t&comma;uwill now be displayed as_&eta;

(3)

S1Infinitesimalspde1

S1_&xi;x=0&comma;_&xi;y=1&comma;_&xi;z=0&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=0&comma;_&xi;y=0&comma;_&xi;z=1&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=0&comma;_&xi;y=0&comma;_&xi;z=0&comma;_&xi;t=1&comma;_&eta;u=0,_&xi;x=1&comma;_&xi;y=0&comma;_&xi;z=0&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=0&comma;_&xi;y=t&comma;_&xi;z=0&comma;_&xi;t=y&comma;_&eta;u=0,_&xi;x=0&comma;_&xi;y=0&comma;_&xi;z=t&comma;_&xi;t=z&comma;_&eta;u=0,_&xi;x=t&comma;_&xi;y=0&comma;_&xi;z=0&comma;_&xi;t=x&comma;_&eta;u=0,_&xi;x=x&comma;_&xi;y=y&comma;_&xi;z=z&comma;_&xi;t=t&comma;_&eta;u=0,_&xi;x=0&comma;_&xi;y=0&comma;_&xi;z=0&comma;_&xi;t=0&comma;_&eta;u=u,_&xi;x=0&comma;_&xi;y=z&comma;_&xi;z=y&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=z&comma;_&xi;y=0&comma;_&xi;z=x&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=y&comma;_&xi;y=x&comma;_&xi;z=0&comma;_&xi;t=0&comma;_&eta;u=0,_&xi;x=xz&comma;_&xi;y=zy&comma;_&xi;z=z22+t22x22y22&comma;_&xi;t=zt&comma;_&eta;u=uz,_&xi;x=xy&comma;_&xi;y=y22+t22x22z22&comma;_&xi;z=zy&comma;_&xi;t=yt&comma;_&eta;u=uy,_&xi;x=xt&comma;_&xi;y=yt&comma;_&xi;z=zt&comma;_&xi;t=t22+x22+y22+z22&comma;_&eta;u=ut,_&xi;x=x22t22+y22+z22&comma;_&xi;y=xy&comma;_&xi;z=xz&comma;_&xi;t=xt&comma;_&eta;u=ux

(4)

These are the similarity solutions corresponding to the first list of infinitesimals in S[1]

SimilaritySolutionspde1&comma;U&comma;S11

u=&ExponentialE;_c1x_c2z&ExponentialE;2_c1xc__1+c__2&ExponentialE;2_c2zc__3+c__4sin_c1_c2tc__5+cos_c1_c2tc__6

(5)

You can test these results for correctness using the pdetest command

pdetest&comma;pde1

0

(6)

The approach by means of which SimilaritySolutions computes the solutions above consists of computing a similarity transformation that reduces the number of independent variables of the PDE system by one. For example, this is the similarity transformation

ITR,TRSimilarityTransformationS11&comma;U

ITR,TR_&psi;=y&comma;_&phi;1=x&comma;_&phi;2=z&comma;_&phi;3=t&comma;_&phi;4_&phi;1&comma;_&phi;2&comma;_&phi;3=u,t=_&phi;3&comma;x=_&phi;1&comma;y=_&psi;&comma;z=_&phi;2&comma;u=_&phi;4_&phi;1&comma;_&phi;2&comma;_&phi;3

(7)

So this is the transformation to be used with dchange - the command for changing variables:

dchangeTR&comma;pde1&comma;simplify

_&phi;4_&phi;1,_&phi;1+_&phi;4_&phi;2,_&phi;2_&phi;4_&phi;3,_&phi;3=0

(8)

Solve now this PDE problem depending now on three variables (one less than pde[1])

pdsolve&comma;build

_&phi;4_&phi;1&comma;_&phi;2&comma;_&phi;3=c__5sin_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__1&ExponentialE;_c1_&phi;1+c__5sin_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__2&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__1&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__2&ExponentialE;_c1_&phi;1+c__5sin_c1_c2_&phi;3c__4c__1&ExponentialE;_c1_&phi;1&ExponentialE;_c2_&phi;2+c__5sin_c1_c2_&phi;3c__4c__2&ExponentialE;_c2_&phi;2&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__4c__1&ExponentialE;_c1_&phi;1&ExponentialE;_c2_&phi;2+c__6cos_c1_c2_&phi;3c__4c__2&ExponentialE;_c2_&phi;2&ExponentialE;_c1_&phi;1

(9)

Evaluate now TR at this solution for _φ4(_φ1, _φ2, _φ3) to obtain the solution of the original pde[1]

selecthas&comma;evalTR&comma;&comma;u

u=c__5sin_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__1&ExponentialE;_c1_&phi;1+c__5sin_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__2&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__1&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__3&ExponentialE;_c2_&phi;2c__2&ExponentialE;_c1_&phi;1+c__5sin_c1_c2_&phi;3c__4c__1&ExponentialE;_c1_&phi;1&ExponentialE;_c2_&phi;2+c__5sin_c1_c2_&phi;3c__4c__2&ExponentialE;_c2_&phi;2&ExponentialE;_c1_&phi;1+c__6cos_c1_c2_&phi;3c__4c__1&ExponentialE;_c1_&phi;1&ExponentialE;_c2_&phi;2+c__6cos_c1_c2_&phi;3c__4c__2&ExponentialE;_c2_&phi;2&ExponentialE;_c1_&phi;1

(10)

Verify this result

pdetest&comma;pde1

0

(11)

By default, SimilaritySolutions will specialize arbitrary functions _Fn... found in the infinitesimals before attempting a reduction of the number of independent variables. This is so because infinitesimals with arbitrary functions are difficult to use, the invariants necessary may result, in practice, impossible to compute. On the other hand, when those invariants can be computed, the corresponding invariant solution is more general without specializing these arbitrary functions. To handle the latter case use the specialize_Fn = false, or with any procedure of your choice on the right-hand-side. Here are two examples illustrating the two situations.

Consider the wave equation in two dimensions:

Udiff_tableux&comma;t&colon;

PDEUx,xUt,t=0

PDEux,xut,t=0

(12)

Infinitesimals for this PDE can be computed and involve arbitrary functions

SInfinitesimalsPDE

S_&xi;xx&comma;t&comma;u=f__1t+x+f__2tx&comma;_&xi;tx&comma;t&comma;u=f__2tx+f__1t+x+1&comma;_&eta;ux&comma;t&comma;u=f__3t+x+f__4tx,_&xi;xx&comma;t&comma;u=f__5t+x+f__6tx&comma;_&xi;tx&comma;t&comma;u=f__6tx+f__5t+x&comma;_&eta;ux&comma;t&comma;u=u+f__7t+x+f__8tx

(13)

It is not possible to compute a SimilarityTransformation or for the case any symmetry related transformation with them, because of the arbitrary functions, all these commands return NULL:

SimilarityTransformationS1&comma;U

InvariantTransformationS1&comma;U

SymmetryTransformationS1&comma;U

In order to be able to use the infinitesimals S, these arbitrary functions are automatically specialized by all the symmetry commands (but for Infinitesimals), as you could see by interactively using specialize_Fn = true in the call to Infinitesimals

SInfinitesimalsPDE&comma;specialize_Fn

S_&xi;xx&comma;t&comma;u=1&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=0,_&xi;xx&comma;t&comma;u=1&comma;_&xi;tx&comma;t&comma;u=2&comma;_&eta;ux&comma;t&comma;u=0,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=1&comma;_&eta;ux&comma;t&comma;u=1,_&xi;xx&comma;t&comma;u=1&comma;_&xi;tx&comma;t&comma;u=1&comma;_&eta;ux&comma;t&comma;u=u,_&xi;xx&comma;t&comma;u=1&comma;_&xi;tx&comma;t&comma;u=−1&comma;_&eta;ux&comma;t&comma;u=u,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=1&comma;_&eta;ux&comma;t&comma;u=t+x,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=1&comma;_&eta;ux&comma;t&comma;u=tx,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=u+1,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=u+t+x,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=u+tx,_&xi;xx&comma;t&comma;u=t+x&comma;_&xi;tx&comma;t&comma;u=1+t+x&comma;_&eta;ux&comma;t&comma;u=0,_&xi;xx&comma;t&comma;u=tx&comma;_&xi;tx&comma;t&comma;u=t+x+1&comma;_&eta;ux&comma;t&comma;u=0,_&xi;xx&comma;t&comma;u=t+x&comma;_&xi;tx&comma;t&comma;u=t+x&comma;_&eta;ux&comma;t&comma;u=u,_&xi;xx&comma;t&comma;u=tx&comma;_&xi;tx&comma;t&comma;u=t+x&comma;_&eta;ux&comma;t&comma;u=u

(14)

In this way, all these commands can deal with PDE properly

SymmetryTransformationS1&comma;U

_t1=x+_&epsilon;&comma;_t2=t&comma;_u1_t1&comma;_t2=ux&comma;t

(15)

InvariantTransformationS1&comma;U

_t1=t+x&comma;_t2=t&comma;_u1_t1=ux&comma;ttx,t=_t2&comma;x=_t1_t2&comma;ux&comma;t=_u1_t12_t2_t1

(16)

SimilaritySolutionsPDE&comma;S4

ux&comma;t=c__1&ExponentialE;t2x2&ExponentialE;x

(17)

As an example where this approach leads to less general solutions consider this other PDE2, also admitting infinitesimals that depend on arbitrary functions

PDE2diffdiffdiffux&comma;t&comma;t&comma;x&comma;x=diffdiffdiffux&comma;t&comma;t&comma;t&comma;x

PDE2ut,x,x=ut,t,x

(18)

S2InfinitesimalsPDE2

S2_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=1&comma;_&eta;ux&comma;t&comma;u=f__1t+f__2x+f__3tx,_&xi;xx&comma;t&comma;u=1&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=f__4t+f__5x+f__6tx,_&xi;xx&comma;t&comma;u=x&comma;_&xi;tx&comma;t&comma;u=t&comma;_&eta;ux&comma;t&comma;u=f__7t+f__8x+f__9tx,_&xi;xx&comma;t&comma;u=0&comma;_&xi;tx&comma;t&comma;u=0&comma;_&eta;ux&comma;t&comma;u=u+f__10t+f__11x+f__12tx

(19)

For these other infinitesimals, despite the arbitrary functions it is possible to compute all kinds of symmetry transformations, although the results involve uncomputed integrals

SymmetryTransformationS21&comma;U

_t1=x&comma;_t2=t+_&epsilon;&comma;_u1_t1&comma;_t2=f__2x_&epsilon;` `t+_&epsilon;f__1_af__3_ax&DifferentialD;_a+f__1tf__3tx&DifferentialD;t+ux&comma;t

(20)

SimilarityTransformationS22&comma;U

_&psi;=x&comma;_&phi;1=t&comma;_&phi;2_&phi;1=f__4txf__5x+f__6tx&DifferentialD;x+ux&comma;t,t=_&phi;1&comma;x=_&psi;&comma;ux&comma;t=_&phi;2_&phi;1+f__4_&phi;1_&psi;+` `_&psi;f__5_a+f__6_&phi;1_a&DifferentialD;_a

(21)

Consequently, the default solution returned by SimilaritySolutions is less general than the one you obtain enforcing the use of the infinitesimals with specialize_Fn = false

SimilaritySolutionsPDE2

ux&comma;t=c__2+c__3lntxxc__3lntx+t+c__1,ux&comma;t=c__2+c__3lntxxc__3lntx+x+c__1,ux&comma;t=c__2+c__3lntxxc__3lntx+tx+c__1,ux&comma;t=c__2+c__3lntxxc__3lntx+c__1+lnx

(22)

SimilaritySolutionsPDE2&comma;specialize_Fn=false

ux&comma;t=` `xf__7t_ax+f__8_a+f__9_atxx_a&DifferentialD;_a+c__2+c__3lntxxc__3lntx+c__1

(23)

Compatibility

• 

The typeofsymmetry option was updated in Maple 15.

See Also

declare

DeterminingPDE

diff_table

InvariantSolutions

InvariantTransformation

PDEtools

PolynomialSolutions

SimilarityTransformation

SymmetrySolutions

SymmetryTest

SymmetryTransformation