home

PDF (letter size)

my Maple cheat sheet


March 16, 2024   Compiled on March 16, 2024 at 5:16pm  [public]
1 OOP in Maple
1.1 How to use new object method calling in Maple 2021?
1.2 How to make a constructor for an Object?
1.3 How to make different constructors for an Object?
1.4 How to do OOP inheritance?
1.5 How to extend a base class and override its method with different one?
1.6 How to extend a class and call base class function from the extended class??
1.7 How to use object as user defined record inside a proc?
1.8 How to make copy of list of objects?
1.9 How to use OOP to implement ode solver?
1.10 How to make a complete OOP ode solver in Maple?
2 Differential equations
2.1 How to force dsolve to use specific method for solving?
2.2 How to find a particular solution to ODE?
2.3 How to find basis solutions for homogeneous ode?
2.4 How to solve a differential equation with initial conditions?
2.5 How to verify that the ODE solution given is correct?
2.6 How to know the type of ODE?
2.7 What packages to load for differential equations?
2.8 How to plot solution of differential equations?
2.9 On High precision. Using taylor to solve ODE
2.10 Obtain ODE in canonical coordinates (Lie symmetry)
2.11 How to use hint with symgen?
2.12 How to parse a single ode?
2.13 How to check if single ODE is valid?
2.14 How to check if an ode has \(y'\) in it?
2.15 How to check if an ode is linear ode?
2.16 How to find the order of an ode?
2.17 How to find the coefficients of a linear ode?
2.18 find order and degree of highest derivative
2.19 How to obtains list of all derivatives in expression?
2.20 How to invert roles of dependent variable and independent variable in an ode?
2.21 How to find the indicial equation for an ODE?
2.22 How to write derivative
2.23 How to solve heat PDE in 1D in Maple 2017?
2.24 How to make Maple display diff(y(x),x) as y’(x) or as y’ ?
2.25 How to set boundary conditions for dsolve or pdsolve?
2.26 How force dsolve to use Lie?
2.27 How to do change of variables on the dependent variable for an ODE?
2.28 How to do change of variable on the independent variable for an ODE?
2.29 ODE change of variable on both dependent and independent variable?
2.30 How to make phase plot of second order ODE?
2.31 How to move all terms with y to one side?
2.32 How to find all constants of integrations in an expression?
2.33 How to find if an ode is missing the dependent variable?
3 How to convert Mathematica expression to Maple?
4 How to debug internal procedures, such as dsolve?
5 How to display source code of a function?
6 How to display trace of a function as it runs in maple?
7 How to display a build in function code?
8 How to build a LIST or a SET on the fly?
9 make function display more information
10 How to plot a function?
11 How to run maple from command line?
12 How to use matrices in maple?
13 return more than value from a procedure
14 How does maple handle procedure arguments?
15 How to define your own data types?
16 find max element and position in matrix
17 How to create a package?
18 How to convert from floating point to Hex?
19 How to find taylor series expansion of functions?
20 How to print elements of a matrix?
21 How to find determinant of matrix?
22 How to generate Hilber matrix?
23 How to plot matrix data?
24 How to catch an error from a proc()?
25 How to convert 3456 to 3,456 ?
26 How to use units ?
27 How to evaluate catlan number and other sums?
28 write a text file that contains a package, and load it
29 How to find what packages are included in maple
30 How to plot the gradiant vector field?
31 How to put the digits of Pi into a list?
32 Digits of PI in maple and mma
33 How to find where functions are?
34 on maple data types
35 how to extract elements from a list based on some selection?
36 how to test if all elements of a matrix are integers?
37 how to use laplace transform?
38 questions I have
39 3D plotting
40 How to raise each element in a list to a power?
41 How to generate a sequence with any increment?
42 What shortcuts are there for matrix manipulation?
43 How to solve a set of equations for the derivative?
44 How to solve a set of equations for differentials?
45 How to plot binary tree
46 Problem 12.4 chapter 4, Boas book
47 example of doing convergence test in maple
48 Problem ch 14, 3.18, Boas book. contour integration
49 How to find multiple roots to an equation such as \(sin(x) = 0\)
50 Dr Basti Associated Legendre
51 Understanding conformal mapping in maple
52 Hide tilda character when using assumption
53 Fourier series in maple
54 How to plot graphs next to each others in a grid like fashion
55 How to generate Pi on X-axis
56 How to make output from FunctionAdvisor look better?
57 How to do partial fractions?
58 How to generate sequence sum symbolically
59 Nice plot from Maple
60 How to check if 2 expressions are the same?
61 converting series to factorials
62 How to find what new additions made to Maple?
63 Maple can’t solve laplace equation and numerically
64 Some Maple Matrix operations
65 How set diagonal elements to some value, say 1?
66 How to multiply roots of a polynomial?
67 How to plot a surface in 3D?
68 How to convert trigs to sinc function in an expression
69 How to find NullSpace and ColumnSpace of a matrix?
70 How to fix the interface to using Maple notation for input?
71 How to find all solutions using allvalues ?
72 Adding only to diagonal of a matrix
73 How to search help for updates on some package
74 How to work with groups in worksheet
75 How to read code into worksheet?
76 Code editors for Maple
77 How to find if package is module or table?
78 How to replace a string?
79 How to use geometry and plottools ?
80 How to simplify log expressions ?
81 How to simplify hyperbolic expression ?
82 How to create text file and append string to it?
83 How to search packages and libraries?
84 How to numerically solve a BVP ode and plot the solution?
85 How to display on screen for specific width?
86 Maple IDE links
87 loading, remove and finding what packages loaded
88 some rules of thumbs when using Maple
89 How to make multiple assumptions on a symbol?
90 How to check if expression is an equation?
91 How to check if expression is a set?
92 How to export a plot to PDF?
93 How to find all roots of complex number
94 How to convert matrix of matrices to a matrix?
95 How to do pattern matching in Maple?
95.1 Example 1
95.2 Example 2
96 How to find trig indetities?
97 How to find directional derivative of scalar function?
98 How to check if name is assigned a value?
99 How to select terms with sqrt or radical
100 How to simplify \(e^{\ln (x)+\ln (y)}\)
101 How to find all csgn() and replace them by 1
102 How to find symbols inside csgn() in an expression?
103 How to replace all abs(expr) by expr
104 Basis for Null space, Row space and column space of matrix
105 How to do Gaussian elimination on a Matrix?
106 How to find Reduced Echelon form of a Matrix?
107 How add a new row to bottom of matrix?
108 How to obtain list of all occurances of some function in an expression?
109 How to replace \(\ln (|x|)\) with \(\ln (x)\) in an expression?
110 How to find all signum functions in expression and simplify it?
111 How to replace all signum functions in expression by 1?
112 How to find the cofactor matrix of a matrix?
113 How to normalize eigenvectors?
114 How to find if some function is present in an expression
115 How to find all functions in an expression?
116 find all functions except builtin math functions
117 How to obtain a list of all arguments of function?
118 Find functions whose first argument is \(z\)
119 Find functions whose second argument is \(t\)?
120 How to typeset \(\hslash \)?
121 How to find the Curl of a vector?
122 See all steps in RREF of an augmented matrix
123 How to find column space of matrix?
124 How to use select with own type to find subexpressions?
125 How to write structured types to match some expressions?
125.1 type for \(\sin ^m(x)\cos ^n(x)\)
126 select only indexed variables from an expression
127 Show step by step. Calculus problem and differential equations.
128 How to obtain list of files with some extension in folder?
129 How to delete lines from text file that contains some string?
130 Given an expression, how to find all variables and functions in it?
131 How to check if an expression is integer, when it has symbols in it?
132 How to truncate a polynomial?
133 How to make a local declare like block inside a proc?
134 Using short name for a proc inside nested modules intead of long name
135 Remove duplicates objects in a list based on condition on a field
136 How to remove duplicates Vectors from a list?
137 How to find parameters such as \(\pi \) in an expression?
138 How to find all derivatives \(y'(x)\) in an expression?
139 How combine log terms?
140 How to find all poles and their order of a rational function?
141 find series of function with specific number of terms
142 How to call sibling’s proc without making the sibling module exported?
143 Find position in a list of items that are not numeric
144 Convert time to use seconds instead of milliseconds
145 How to change \(\arctan (y,x)\) to \(\arctan \left (\genfrac {}{}{}{}{y}{x}\right )\) in an expression
146 How to find all symbols that represent variables in an expression?
147 How to change first argument of function?
148 How to change last argument of function?
149 How to remove last argument of function?
150 How to find a pattern inside an expression
151 How to find parts of a Sum?
152 find if sequence or list is inside another and the indecies
153 find if some type inside some expression and its location
154 Change the summation index letter
155 How to replace generic function inside derivative?
156 Examples how to match types
157 On the order of terms when using indents

1 OOP in Maple

1.1 How to use new object method calling in Maple 2021?
1.2 How to make a constructor for an Object?
1.3 How to make different constructors for an Object?
1.4 How to do OOP inheritance?
1.5 How to extend a base class and override its method with different one?
1.6 How to extend a class and call base class function from the extended class??
1.7 How to use object as user defined record inside a proc?
1.8 How to make copy of list of objects?
1.9 How to use OOP to implement ode solver?
1.10 How to make a complete OOP ode solver in Maple?

1.1 How to use new object method calling in Maple 2021?

In Maple 2021, it is now possible to use object:-method(arg) notation. This makes is easier to use OOP in maple. To do this, use _self as follows

restart; 
 
module person() 
 option object; 
 local name::string:=""; 
 local age::integer:=0; 
 
 export get_name::static:=proc(_self,$) 
   return _self:-name; 
 end proc; 
 
 export set_name::static:=proc(_self,name::string,$) 
   _self:-name:=name; 
 end proc; 
 
 export get_age::static:=proc(_self,$) 
   return _self:-age; 
 end proc; 
 
 export set_age::static:=proc(_self,age::integer,$) 
   _self:-age:=age; 
 end proc; 
 
end module;
 

And now make an object and use it as follows

o:=Object(person) 
                  o := Object<<1846759887808>> 
 
o:-get_name(); 
             "" 
 
o:-get_age(); 
             0 
 
o:-set_name("joe doe"); 
o:-get_name(); 
           "joe doe"
 

1.2 How to make a constructor for an Object?

Add ModuleCopy proc in the class. This will automatically be called to initialize the object.

Here is an example

restart; 
 
module ODE() 
 option object; 
 local ode:=NULL; 
 local y::symbol; 
 local x::symbol; 
 local sol; 
 
 export ModuleCopy::static := proc( _self::ODE, proto::ODE, ode, func, $ ) 
    print("Initilizing object with with args: ", [args]); 
    _self:-ode:= ode; 
    _self:-y:=op(0,func); 
    _self:-x:=op(1,func); 
 end proc; 
 
 export dsolve::static:=proc(_self,$) 
   _self:-sol := :-dsolve(ode,y(x)); 
 end proc; 
 
 export get_sol::static:=proc(_self,$) 
   return sol; 
 end proc; 
 
end module;
 

And now make an object and use it as follows

o:=Object(ODE, diff(y(x),x)+y(x)=sin(x), y(x)); 
o:-dsolve(): 
o:-get_sol(); 
 
        #y(x) = -1/2*cos(x) + 1/2*sin(x) + exp(-x)*_C1
 

So a constructor just makes it easier to initialize the object without having to make a number of set() calls to initialize each memeber data.

1.3 How to make different constructors for an Object?

This is done using overload with different ModuleCopy proc in the class.

Here is an example. Lets make a constructor that takes an ode and initial conditions, and one that only takes an ode with no initial conditions.

restart; 
 
module ODE() 
 option object; 
 local ode:=NULL; 
 local y::symbol; 
 local x::symbol; 
 local ic:=NULL; 
 local sol; 
 
 export ModuleCopy::static:= overload( 
    [ 
       proc( _self::ODE, proto::ODE, ode, func, $ ) option overload; 
          _self:-ode:= ode; 
          _self:-y:=op(0,func); 
          _self:-x:=op(1,func); 
       end proc, 
 
       proc( _self::ODE, proto::ODE, ode, func, ic, $ ) option overload; 
          _self:-ode:= ode; 
          _self:-y:=op(0,func); 
          _self:-x:=op(1,func); 
          _self:-ic :=ic; 
       end proc 
    ] 
 ); 
 
 export dsolve::static:=proc(_self,$) 
    if evalb(ic=NULL) then 
       sol := :-dsolve(ode,y(x)); 
    else 
       sol := :-dsolve([ode,ic],y(x)); 
    fi; 
 end proc; 
 
 export get_sol::static:=proc(_self,$) 
   return sol; 
 end proc; 
 
end module;
                                                                                    
                                                                                    
 

And now use it as follows

o:=Object(ODE, diff(y(x),x)+y(x)=sin(x), y(x), y(0)=0); 
o:-dsolve(): 
o:-get_sol(); 
 
         #y(x) = -1/2*cos(x) + 1/2*sin(x) + 1/2*exp(-x) 
 
o:=Object(ODE, diff(y(x),x)+y(x)=sin(x), y(x)); 
o:-dsolve(): 
o:-get_sol(); 
 
    #y(x) = -1/2*cos(x) + 1/2*sin(x) + exp(-x)*_C1
 

1.4 How to do OOP inheritance?

In the child class you want to extend from the parent class, add option object(ParentName);

Here is an example

restart; 
module ODE() 
   option object; 
   local ode; 
 
   export set_ode::static:=proc(_self,ode,$) 
     _self:-ode :=ode; 
   end proc; 
 
  export get_ode::static:=proc(_self,$) 
     return _self:-ode; 
   end proc; 
end module; 
 
#create class/module which extends the above 
module second_order_ode() 
   option object(ODE); 
   export get_ode_order::static:=proc(_self,$) 
      return 2; 
   end proc; 
end module;
 

In the above second_order_ode inherts all local variables and functions in the ODE class and adds new proc. Use as follows

o:=Object(second_order_ode); #create an object  instance 
o:-set_ode(diff(y(x),x)=sin(x)); 
o:-get_ode(); 
o:-get_ode_order();
 

Note that the child class can not have its own variable with the same name as the parent class. This is limitation. in C++ for example, local variables in extended class overrides the same named variable in the parent class.

Even if the variable have different type, Maple will not allow overriding. For example, this will fail

restart; 
module ODE() 
   option object; 
   local ode; 
   local id::integer; 
 
   export set_ode::static:=proc(_self,ode,$) 
     print("Enter ode::set_ode"); 
     _self:-ode :=ode; 
   end proc; 
 
  export get_ode::static:=proc(_self,$) 
     return _self:-ode; 
   end proc; 
end module; 
 
module second_order_ode() 
   option object(ODE); 
   local id::string; 
   export get_ode_order::static:=proc(_self,$) 
      return 2; 
   end proc; 
end module; 
 
    Error, (in second_order_ode) local `id` is declared more than once
 

There might be a way to handle this, i.e. to somehow exlicitly tell Maple to override parant class proc or variable name in the child. I do not know now. The above is using Maple 2021.1

1.5 How to extend a base class and override its method with different one?

This is called polymorphism in OOP. This is a base class animal_class which has make_sound method. This method acts just as a place holder (interface), which the extending class must extends (override) with an actual implementation.

The class is extended to make cat class and implementation is made.

module animal_class() 
 option object; 
 
 export make_sound::static:=proc(_self,$) 
     error("Not implemented, must be overriden"); 
 end proc; 
end module; 
 
%--------------- 
module cat_class() 
 option object(animal_class); 
 
 make_sound::static:=proc(_self,$)  #note. DO NOT USE export 
     print("mewooo"); 
 end proc; 
 
end module;
 

And now

o:=Object(animal_class); 
o:-make_sound(); 
 
Error, (in anonymous procedure) Not implemented, must be overriden
 

The above is by design. As the animal_class is meant to be extended to be usable.

my_cat:=Object(cat_class); 
my_cat:-make_sound(); 
 
                            "mewooo"
 

So the base class can have number of methods, which are all meant to be be have its implementation provided by an extending class. Each class which extends the base class must provide implementation.

1.6 How to extend a class and call base class function from the extended class??

Once a base class is extended, all methods in the base class become part of the extending class. So to call a base class method just use same way as if calling any other method in the extending class itself.

Here is an example.

module person() 
    option object; 
    local age::integer:=100; 
 
    export ModuleCopy::static:= proc(_self,proto::person, age::integer,$) 
           _self:-age := age; 
    end proc; 
 
    local base_class_method::static:=proc(_self,$) 
        print("In base class method..."); 
    end proc; 
 
 
end module; 
 
#---- extend the above class 
module young_person() 
   option object(person); 
   export process::static:=proc(_self,$) 
      print("In young_person process"); 
     _self:-base_class_method(); 
   end proc; 
end module;
 

Here is an example of usage

o:=Object(young_person,20); 
o:-process() 
 
                   "In young_person process" 
                   "In base class method..."
 

The above in Maple 2023.1

1.7 How to use object as user defined record inside a proc?

A Maple Object can be used a record type in other languags, such as Ada or Pascal. This example shows how to define a local type inside a proc and use it as record.

restart; 
foo:=proc(the_name::string,the_age::integer)::person_type; 
     local module person_type() #this acts as a record type 
         option object; 
         export the_name::string; 
         export the_age::integer; 
     end module; 
 
     local person::person_type:=Object(person_type); 
 
     person:-the_name:=the_name; 
     person:-the_age:=the_age; 
     return person; 
 end proc; 
 
o:=foo("joe doe",100); 
 
o:-the_name; 
                           "joe doe" 
o:-the_age; 
                              100
 

In the above person is local variable of type person_type. In the above example, the local variable was returned back to user. But this is just an example. One can declare such variables and just use them internally inside the proc only. This method helps one organize related variables into one record/struct like type. The type can also be made global if needed.

1.8 How to make copy of list of objects?

Suppose we have list L1 of objects and we want to copy this list to another list, say L2. If we just do L2 = L1 then this will not make an actual copy as any changes to L1 are still reflected in L2. The above only copies the reference to the same list.

To make a physical copy, need to use the copy command as follows

restart; 
 
module person_type() 
  option object; 
  export the_name::string:="doe joe"; 
  export the_age::integer:=100; 
end module; 
 
L1:=[]; 
for N from 1 to 5 do 
    o:=Object(person_type); 
    o:-the_name:=convert(N,string); 
    L1:= [ op(L1), o]; 
od: 
 
L2:=map(Z->copy(Z),L1):
 

Now making any changes to L1 will not affect L2. If we just did L2 = L1 then both will share same content which is not what we wanted.

1.9 How to use OOP to implement ode solver?

This is a basic example of using OOP in Maple to implement an ode solver. There is a base module called ode_base_class (I will be using class instead of module, as this is more common in OOP)

This program will for now support first order and second order ode’s only.

The base ode class will contain the basic operations and data which is common to both first order and second order ode’s.

Next, we will make a first order ode class, and second order ode class. Both of these will extend the base ode class.

Next, we will have more ode classes. For example, for first order ode, there will be linear first order ode class, and separable first order ode class, and Bernoulli ode class and so on. Each one these classess will extend the first order ode class which in turn extends the base ode class.

Same for second order ode’s. There will be second order constant coefficients ode class, and second order variable coefficient ode class and so on. Each one of these classes will extend the second order ode class which in turn extends the base ode class.

Let base_ode_class be the base of an ode class which will contain all the neccessary methods that are generic and applicable to an ode of any order and type.

These can be the ode expression itself, its order and any other data and operations which applicable to any ode type.

Now we want to create a first order class. This will have its own operations and private variables that are specific and make sense only to any first order ode.

Then these will be the first order separable ode class, which has methods that implement solving the ode using separable method and has other methods which makes sense only for first order separable ode. The following diagram is partial illustration of the is-A relation among possible classes.

First we define the base ode class and define private variables and method that are common to any ode type.

restart; 
 
module base_ode_class() 
  option object; 
  local the_ode; 
  local the_order::integer; 
 
  export get_ode::static:=proc(_self,$) 
         RETURN(_self:-the_ode); 
  end proc; 
 
  export get_order::static:=proc(_self,$) 
         RETURN(_self:-the_order); 
  end proc; 
 
end module;
 

Note that the base ode class does not have constructor. Since it is meant to be extended only.

The following is the first order ode class.

module first_order_ode_class() 
  option object(base_ode_class); 
 
  local  initial_conditions; 
  local  solution_found; 
 
  export get_IC::static:=proc(_self,$) 
         RETURN(_self:-initial_conditions); 
  end proc; 
 
  export get_solution::static:=proc(_self,$) 
         RETURN(_self:-solution_found); 
  end proc; 
 
  export verify_solution::static:=proc(_self,$)::truefalse; 
      #code to verify if the solution found is valid or not 
      #using odetest() 
  end proc; 
 
end module;
 

The following is the first order separable ode class which extends the above first order ode class.

module first_order_separable_ode_class() 
  option object(first_order_ode_class); 
  local f,g;  #ode of form  y'=f(x)*g(y) 
 
  export ModuleCopy::static:= proc(_self,proto::first_order_separable_ode_class, 
                                   ode, IC,$) 
      _self:-the_ode  := ode; 
      _self:-initial_conditions := IC; 
  end proc; 
 
  export dsolve::static:=proc(_self,$) 
         #solve the ode for now we will use Maple but in my code 
         #I have my own solver ofcourse. 
         _self:-solution_found:=  :-dsolve([_self:-the_ode, _self:-initial_conditions]); 
  end proc; 
end module;
 

In the above, when we create a instance of first_order_separable_ode_class then it now have the whole chain of classes into one. i.e. first order separable class extending the first order class which in turn extends the base ode class. For example

o:=Object(first_order_separable_ode_class,diff(y(x),x)=3*sin(x)*y(x),y(0)=1) 
o:-dsolve(); 
o:-get_solution() 
       #y(x) = exp(3)*exp(-3*cos(x)) 
o:-get_ode() 
       #diff(y(x), x) = 3*sin(x)*y(x)
 

The above calls will all work, even though the first order separable class has no method in it called get_ode but it extends a class which does, hence it works as it.

Now we will do the same for second order ode’s.

Advantage of this design, is that methods in base classes that are being extended can be reused by any class which extends them. Only methods that applies and specific to the lower level classes need to be implemented.

As we add more specific solvers, we just have to extend the base classes and the new solvers just need to implement its own specific dsolve and any specific methods and data that it needs itself.

Ofcourse in practice the above design is not complete as is. The user should not have to specify which class to instantiate, as user does not care what the ode type or class it is. They just want to to do

o:=Object(ode_class,diff(y(x),x)=3*sin(x)*y(x),y(0)=1) 
o:-dsolve(); 
o:-get_solution()
 

To solve this problem we have to make a factory method which is called to make the correct instance of the class and return that to the user. The factory method figures out the type of ode and it creates the correct instance of the correct class and returns that. So the call will become

o := make_ode_object( diff(y(x),x)=3*sin(x)*y(x), y(0)=1) 
o:-dsolve(); 
o:-get_solution()
 

The function make_ode_object above is the main interface the user will call to make an ode object.

This will be explained next with examples. One possibility is to make the factory function a global function or better, a public method in a utility module. For now, it is given here as stadalone function for illustration. The user calls this method to make an object of the correct instance of the ode. Here is complete implementation of all the above including the factory method.

#factory method. Makes objects for users 
make_ode_object:=proc(ode::`=`,func::function(name)) 
   local x,y,the_order; 
   y:=op(0,func); 
   x:=op(1,func); 
   the_order := PDEtools:-difforder(ode,x); 
   if the_order=1 then 
        RETURN(first_order_ode_class:-make_ode_object(ode,func)); 
   elif the_order=2 then 
        #RETURN(second_order_ode_class:-make_ode_object(ode,func)); 
        #implement later 
        NULL; 
   else 
        error "Only first and second order ode's are currently supported"; 
   fi; 
 
end proc: 
 
######################### 
module base_ode_class() 
  option object; 
  local the_ode; 
  local the_order::integer; 
 
  #methods bound to the object 
  export get_ode::static:=proc(_self,$) 
         RETURN(_self:-the_ode); 
  end proc; 
 
  export get_order::static:=proc(_self,$) 
         RETURN(_self:-the_order); 
  end proc; 
 
end module: 
################## 
module first_order_ode_class() 
  option object(base_ode_class); 
 
  local  initial_conditions; 
  local  solution_found; 
 
  #public factory method not bound to the object. 
  export make_ode_object:=proc(ode::`=`,func::function(name)) 
     local x,y,ode_type::string; 
     y:=op(0,func); 
     x:=op(1,func); 
     ode_type:="separable"; #code here which determined first order ode type 
     if ode_type="separable" then 
        RETURN( Object(first_order_separable_ode_class,ode,func)); 
     elif ode_type="linear" then 
         RETURN( Object(first_order_linear_ode_class,ode,func)); 
     fi; 
     #more ode types added here 
  end proc; 
 
  #methods bound to the object 
  export get_IC::static:=proc(_self,$) 
         RETURN(_self:-initial_conditions); 
  end proc; 
 
  export get_solution::static:=proc(_self,$) 
         RETURN(_self:-solution_found); 
  end proc; 
 
  export verify_solution::static:=proc(_self,$)::truefalse; 
      #code to verify if the solution found is valid or not 
      #using odetest() 
  end proc; 
 
end module: 
 
################## 
module first_order_separable_ode_class() 
  option object(first_order_ode_class); 
  local f,g;  #ode of form  y'=f(x)*g(y) 
 
  export ModuleCopy::static:= proc(_self,proto::first_order_separable_ode_class,ode,func::function(name),$) 
      _self:-the_ode  := ode; 
  end proc; 
 
  export dsolve::static:=proc(_self,$) 
         #print("Enter first_order_separable_ode_class:-dsolve"); 
         #solve the ode for now we will use Maple but in my code 
         #I have my own solver ofcourse. 
         _self:-solution_found:=  :-dsolve(_self:-the_ode); 
         NULL; 
  end proc; 
end module:
 

It is used as follows

o:=make_ode_object(diff(y(x),x)=sin(x)*y(x),y(x)); 
o:-dsolve(); 
o:-get_solution(); 
                    y(x) = c__1 exp(-cos(x))
 

1.10 How to make a complete OOP ode solver in Maple?

Here, I will start making a complete small OOP ode solver in Maple.

At each step more classes are added and enhanced until we get a fully working small ode solver based on OOP design that solves a first and second order ode, this is to show how it all works. Another solvers can be added later by simply extending the base class.

The base class is called Base_ode_class. There will be Second_order_ode_class and First_order_ode_class and these classes extend the base ode class. We can later add higher_order_ode_class.

Next, there are different classes which extend these. There is First_order_linear_ode_class and First_order_separable_ode_class and so on, and these extend the First_order_ode_class.

For example, if a user wanted to solve a first order ode which happend to be say separable, then object of class First_order_separable_ode_class will be created and used.

Since the user does not know and should not know what object to create, then the factory class will be used. The factory class is what the user initially calls to make the ode object.

It is the factory class which determines which type of class to instantiate based on the ode given.

The factory class is singleton (standard module in Maple, not of type object), which has the make_ode method which is called by the user. This method parses the ode and determines its order and then based on the order determine which subclass to use, and then instantiate this and returns the correct object to the user to use.

This object will have the dsolve method and other methods the user can use on the object.

The make_ode method in the factory module accepts only the ode itself the function such as \(y(x)\). A typical use is given below

ode :=  ODE_factoy_class:-make_ode( diff(y(x),x)=sin(x), y(x) ); 
ode:-set_IC(....); 
ode:-set_hint("the hint"); 
..... 
 
ode:-dsolve();  #solves the ode 
ode:-is_solved(); #checks if ode was successfully solved 
ode:-verify_sol(); #verifies the solution using maple odetest() 
ode:-is_sol_verified(); #asks if solution is verified 
ode:-get_number_of_sol(); #returns number of solutions, 1 or 2 etc... 
ode:-get_sol(); #returns the solutions found in list 
#and more method 
...
 

Examples at the end will show how all the above works on actual odes’s.

The initial call to make an ode does not have initial conditions, or hint and any other parameters. This is so to keep the call simple. As the factory method only makes the concrete ode object.

Additional methods are then used to add more information if needed by using the returned object itself, such as initial conditions, and hint and so on before calling the dsolve method on the object.

Here is a very basic setup which include the base ode class and extended to first order two subclasses for now.

restart; 
ODE_factory_class :=module() 
   #notice, normal module. No option object. 
 
   export make_ode:=proc(ode::`=`,func::function(name),$) 
       local dep_variables_found::list,item; 
       local y::symbol; 
       local x::symbol; 
       local ode_order::integer; 
 
       if nops(func)<>1 then 
           error("Parsing error, dependent variable must contain one argument, found ", func); 
       fi; 
       y:=op(0,func); 
       x:=op(1,func); 
       if not has(ode,y) then 
          error ("Supplied ode ",ode," has no ",y); 
       fi; 
 
       if not has(ode,x) then 
          error ("Supplied ode ",ode," has no ",x); 
       fi; 
 
       if not has(ode,func) then 
           error ("Supplied ode ",ode," has no ",func); 
       fi; 
 
       ode_order := PDEtools:-difforder(ode,x); 
 
       #this will check that the dependent variable will show with 
       #SAME argument in the ode. i.e. if y(x) and y(t) show up in same ode, it 
       #will throw exception, which is what we want. 
 
       try 
           dep_variables_found := PDEtools:-Library:-GetDepVars([y],ode); 
       catch: 
           error lastexception; 
       end try; 
 
       #now go over dep_variables_found and check the independent 
       #variable is same as x i.e. ode can be y'(z)+y(z)=0 but function is y(x). 
       for item in dep_variables_found do 
           if not type(item,function) then 
              error("Parsing error. Expected ",func," found ",item," in ode"); 
           else 
              if op(1,item) <> x then 
                  error("Parsing error. Expected ",func," found ",item," in ode"); 
              fi; 
           fi; 
       od; 
 
      #now go over all indents in ode and check that y only shows as y(x) and not as just y 
      #as the PDEtools:-Library:-GetDepVars([_self:-y],ode) code above does not detect this. 
      #i.e. it does not check  y'(x)+y=0 
 
      if numelems(indets(ode,identical(y))) > 0 then 
           error("Parsing error, Can not have ",y," with no argument inside ",ode); 
      fi; 
 
      if ode_order=1 then 
         RETURN(make_first_order_ode(ode,y,x)); 
      elif ode_order=2 then 
         RETURN(make_second_order_ode(ode,y,x)); 
      else 
         RETURN(make_higher_order_ode(ode,y,x)); 
      fi; 
  end proc; 
 
  local make_first_order_ode:=proc(ode::`=`,y::symbol,x::symbol) 
     #decide on what specific type the ode is, and make instant of it 
 
     if first_order_ode_quadrature_class:-is_quadrature(ode,y,x) then 
        RETURN(Object(first_order_ode_quadrature_class,ode,y,x)); 
     elif first_order_ode_linear_class:-is_linear(ode,y,x) then 
        RETURN(Object(first_order_ode_linear_class,ode,y,x)); 
     fi; #and so on 
  end proc; 
 
  local make_second_order_ode:=proc(ode::`=`,y::symbol,x::symbol) 
     #decide on what specific type the ode is, and make instant of it 
     #same as for first order 
  end proc; 
end module; 
#------------------------- 
module solution_class() 
   option object; 
   local the_solution; 
   local is_verified_solution::truefalse:=false; 
   local is_implicit_solution::truefalse:=false; 
 
   export ModuleCopy::static:= proc(_self,proto::solution_class,the_solution::`=`,is_implicit_solution::truefalse,$) 
       _self:-the_solution:=the_solution; 
       _self:-is_implicit_solution:=is_implicit_solution; 
   end proc; 
 
   export get_solution::static:=proc(_self,$) 
        RETURN(_self:-the_solution); 
   end proc; 
 
   export is_verified::static:=proc(_self,$) 
        RETURN(_self:-is_verified_solution); 
   end proc; 
 
   export is_implicit::static:=proc(_self,$) 
        RETURN(_self:-is_implicit_solution); 
   end proc; 
 
   export is_explicit::static:=proc(_self,$) 
        RETURN(not(_self:-is_implicit_solution)); 
   end proc; 
 
   export verify_solution::static:= overload( 
   [ 
      proc(_self, ode::`=`,$) option overload; 
          local stat; 
          stat:= odetest(_self:-the_solution,ode); 
          if stat=0 then 
             _self:-is_verified_solution:=true; 
          else 
            if simplify(stat)=0 then 
                _self:-is_verified_solution:=true; 
            else 
                _self:-is_verified_solution:=false; 
            fi; 
         fi; 
      end, 
 
      proc(_self, ode::`=`,IC::list,$) option overload; 
          local stat; 
          stat:= odetest([_self:-the_solution,IC],ode); 
          if stat=[0,0] then 
             _self:-is_verified_solution:=true; 
          else 
            if simplify(stat)=[0,0] then 
                _self:-is_verified_solution:=true; 
            else 
                _self:-is_verified_solution:=false; 
            fi; 
         fi; 
      end 
   ]); 
end module: 
#------------------------- 
 
module ODE_base_class() 
   option object; 
   local y::symbol; 
   local x::symbol; 
   local func::function(name); #y(x) 
   local ode::`=`; 
   local ode_order::posint; 
   local IC::list:=[]; 
   local parsed_IC::list:=[]; 
   local the_hint::string:=""; 
   local solutions_found::list(solution_class):=[]; 
 
  #exported getters methods 
  export get_ode::static:=proc(_self,$) 
         RETURN(_self:-ode); 
  end proc; 
 
  export get_x::static:=proc(_self,$) 
         RETURN(_self:-x); 
  end proc; 
 
  export get_y::static:=proc(_self,$) 
         RETURN(_self:-y); 
  end proc; 
 
  export get_ode_order::static:=proc(_self,$) 
         RETURN(_self:-ode_order); 
  end proc; 
 
  export get_IC::static:=proc(_self,$) 
         RETURN(_self:-IC); 
  end proc; 
 
  export get_parsed_IC::static:=proc(_self,$) 
         RETURN(_self:-parsed_IC); 
  end proc; 
 
  export get_sol::static:=proc(_self,$) 
         local L:=Array(1..0): 
         local sol; 
         for sol in _self:-solutions_found do 
             L ,= sol:-get_solution(); 
         od; 
         RETURN(convert(L,list)); 
  end proc; 
 
  #exported setters methods 
  export set_hint::static:=proc(_self,hint::string,$) 
         #add code to check if hint is valid 
         _self:-the_hint:=hint; 
  end proc; 
end module; 
 
#------------------------- 
module first_order_ode_quadrature_class() 
  option object(ODE_base_class); 
  local f,g;  #ode of form  y'=f(x)*g(y) 
 
  #this method is not an object method. It is part of the module but does 
  #not have _self. It is called by the factory class to find if the ode 
  #is of this type first 
  export is_quadrature:=proc(ode::`=`,y::symbol,x::symbol)::truefalse; 
         RETURN(true); #for now 
  end proc; 
 
  export ModuleCopy::static:= proc(_self,proto::first_order_ode_quadrature_class,ode::`=`,y::symbol,x::symbol,$) 
      _self:-ode  := ode; 
      _self:-y  := y; 
      _self:-x  := x; 
      _self:-func  := _self:-y(_self:-x); 
      _self:-ode_order :=1; 
  end proc; 
 
  export dsolve::static:=proc(_self,$) 
         local sol,o; 
         #print("Enter first_order_ode_quadrature_class:-dsolve"); 
         #solve the ode for now we will use Maple but in my code 
         #I have my own solver ofcourse. 
         sol:= :-dsolve(_self:-ode,_self:-func); 
         o:=Object(solution_class,sol,false); 
         _self:-solutions_found:= [o]; 
         NULL; 
  end proc; 
end module: 
 
#------------------------- 
module first_order_ode_linear_class() 
  option object(ODE_base_class); 
  local f,g;  #ode of form  y'=f(x)*g(y) 
 
  #this method is not an object method. It is part of the module but does 
  #not have _self. It is called by the factory class to find if the ode 
  #is of this type first 
  export is_linear:=proc(ode::`=`,y::symbol,x::symbol)::truefalse; 
         RETURN(true); #for now 
  end proc; 
 
  export ModuleCopy::static:= proc(_self,proto::first_order_ode_linear_class,ode::`=`,y::symbol,x::symbol,$) 
      _self:-ode  := ode; 
      _self:-y  := y; 
      _self:-x  := x; 
      _self:-func  := _self:-y(_self:-x); 
      _self:-ode_order :=1; 
  end proc; 
 
  export dsolve::static:=proc(_self,$) 
         local sol,o; 
         sol:= :-dsolve(_self:-ode,_self:-func); 
         o:=Object(solution_class,sol,false); 
         _self:-solutions_found[1]:= [o]: 
  end proc: 
end module:
 

Example usage is

o:=ODE_factory_class:-make_ode(diff(y(x),x)=x,y(x)) 
o:-get_ode() 
                           d 
                          --- y(x) = x 
                           dx 
 
o:-dsolve(); 
o:-get_sol() 
                      [       1  2       ] 
                      [y(x) = - x  + c__1] 
                      [       2          ]
 

2 Differential equations

2.1 How to force dsolve to use specific method for solving?
2.2 How to find a particular solution to ODE?
2.3 How to find basis solutions for homogeneous ode?
2.4 How to solve a differential equation with initial conditions?
2.5 How to verify that the ODE solution given is correct?
2.6 How to know the type of ODE?
2.7 What packages to load for differential equations?
2.8 How to plot solution of differential equations?
2.9 On High precision. Using taylor to solve ODE
2.10 Obtain ODE in canonical coordinates (Lie symmetry)
2.11 How to use hint with symgen?
2.12 How to parse a single ode?
2.13 How to check if single ODE is valid?
2.14 How to check if an ode has \(y'\) in it?
2.15 How to check if an ode is linear ode?
2.16 How to find the order of an ode?
2.17 How to find the coefficients of a linear ode?
2.18 find order and degree of highest derivative
2.19 How to obtains list of all derivatives in expression?
2.20 How to invert roles of dependent variable and independent variable in an ode?
2.21 How to find the indicial equation for an ODE?
2.22 How to write derivative
2.23 How to solve heat PDE in 1D in Maple 2017?
2.24 How to make Maple display diff(y(x),x) as y’(x) or as y’ ?
2.25 How to set boundary conditions for dsolve or pdsolve?
2.26 How force dsolve to use Lie?
2.27 How to do change of variables on the dependent variable for an ODE?
2.28 How to do change of variable on the independent variable for an ODE?
2.29 ODE change of variable on both dependent and independent variable?
2.30 How to make phase plot of second order ODE?
2.31 How to move all terms with y to one side?
2.32 How to find all constants of integrations in an expression?
2.33 How to find if an ode is missing the dependent variable?

2.1 How to force dsolve to use specific method for solving?

To find what methods dsolve uses do

`dsolve/methods`[1] 
 
     [quadrature, linear, Bernoulli, separable, inverse_linear, 
      homogeneous, Chini, lin_sym, exact, Abel, pot_sym]
 

The above gives methods for first order ODEs. More are given by

`dsolve/methods`[1,'semiclass'] 
 
     [Riccati, inverse_Riccati, equivalent_to_Abel, 
      linearizable, linearizable_by_differentiation] 
 
`dsolve/methods`[1,'high_degree'] 
 
     [WeierstrassP, WeierstrassPPrime, JacobiSN, linearizable_by_differentiation, 
      missing, dAlembert, homogeneous_B, sym_implicit] 
 
`dsolve/methods`[1,"development"] 
 
     [linearizable_by_differentiation, linearizable, con_sym, 
      WeierstrassP, WeierstrassPPrime, equivalent_to_Abel, 
      Abel_AIR, special, Riccati_symmetries] 
 
`dsolve/methods`[1,extra] 
     [inverse_Riccati, Abel_AIL, `sym_pat/[F(x)*G(y),0]`, `sym_pat/[F(x),G(x)]`, 
      `sym_pat/[F(x),G(y)]`, `sym_pat/[F(x)+G(y),0]`, 
      `sym_pat/[F(x),G(x)*y+H(x)]`, sym_pat, exp_sym]
 

For example given a first order ode, we can ask dsolve to solve it using one of these methods as follows

restart; 
ode:=diff(y(x),x)=sqrt( sqrt( y(x) )* sin(x))/sqrt(y(x)) 
dsolve(ode,y(x),[`exact`]) 
 
     4/5*y(x)^(5/4) + Intat(-sqrt(sqrt(y(x))*sin(_a))/y(x)^(1/4), _a = x) + c__1 = 0
 

We can ask it to use symmetry with specific pattern as follows

restart; 
ode:=diff(y(x),x)=sqrt( sqrt( y(x) )* sin(x))/sqrt(y(x)) 
dsolve(ode,y(x),[`sym_pat/[F(x),G(x)*y+H(x)]`]) 
 
    c__1 + 4/5*y(x)^(3/2)*sqrt(sin(x))/sqrt(sqrt(y(x))*sin(x)) - Int(sqrt(sin(x)), x) = 0 
 
#or using short cut, same thing can be done as follows 
dsolve(ode,y(x),Lie) 
 
    c__1 + 4/5*y(x)^(3/2)*sqrt(sin(x))/sqrt(sqrt(y(x))*sin(x)) - Int(sqrt(sin(x)), x) = 0 
 
#another short cut for Lie is 
dsolve(ode,[`sym_pat`]) 
 
    c__1 + 4/5*y(x)^(3/2)*sqrt(sin(x))/sqrt(sqrt(y(x))*sin(x)) - Int(sqrt(sin(x)), x) = 0
 

To find all methods, and for higher order ode, we first use indices as follows

indices(`dsolve/methods`) 
 
    [high, linear_nonhomogeneous], 
    [1], 
    [1, high_degree], 
    [3, linear_homogeneous], 
    [2, "linear_homogeneous all methods"], 
    [2, "linear_homogeneous other"], 
    [2, linear_homogeneous], 
    [2, "special_functions"], 
    [3, linear_nonhomogeneous], 
    [2, "linear_homogeneous in Normal Form"], 
    [2, "development"], [2, "hypergeometric"], 
    [1, extra], 
    [high, linear_homogeneous], 
    [high, nonlinear], 
    [1, "special"], 
    [1, "development"], 
    [2, nonlinear], 
    [high, "development"], 
    [1, semiclass], 
    [3, nonlinear], 
    [2, linear_nonhomogeneous], 
    [2, "linear_homogeneous as given"], 
    [3, "development"]
 

Using the above, to find all methods for second order linear_homogeneous ode, the command is

`dsolve/methods`[2, "linear_homogeneous all methods"] 
 
    [quadrature, const_coeffs, Euler, linear_1, 
     `linear/missing_y`, Kovacic, special_functions, to_const_coeffs, 
      exact_linear, sym_1, Mathieu, MeijerG, Heun, HeunG, HeunC, HeunB, HeunD, 
      HeunT, mu_xy, equivalent_to_Bessel, to_Riccati, Bessel, elliptic, 
      Legendre, Whittaker, Kummer, cylindrical, hypergeometric, hypergeom1, 
      hypergeom2, Riemann, RNF, hypergeometricsols, rationalize_lode, with_periodic_functions] 
 
`dsolve/methods`[2, "linear_homogeneous other"] 
 
    [exact_linear, sym_1, to_const_coeffs, mu_xy, equivalent_to_Bessel, 
     to_Riccati, with_periodic_functions]
 

For example, given the ode \(y''+3 y'+ y=0\), we can now do

dsolve(ode,y(x)) 
     y(x) = c__1*exp(1/2*(sqrt(5) - 3)*x) + c__2*exp(-1/2*(3 + sqrt(5))*x) 
 
dsolve(ode,y(x),[`const_coeffs`]) 
    y(x) = c__1*exp(1/2*(sqrt(5) - 3)*x) + c__2*exp(-1/2*(3 + sqrt(5))*x) 
 
dsolve(ode,y(x),[`Kovacic`]) 
    y(x) = c__1*exp(1/2*(sqrt(5) - 3)*x) + c__2*exp(-1/2*(3 + sqrt(5))*x)
 

Not all methods ofcourse will work, as it depends on the ode type.

This function below lists all methods

ind:=indices(`dsolve/methods`); 
for item in ind do 
    cat("`dsolve/methods`",String(item)); 
    eval(parse(%)) 
od;
 

Which gives

"`dsolve/methods`[high, linear_nonhomogeneous]" 
    [quadrature, fully_exact_linear, linear_nonhomogeneous_[0,1], 
    exact_linear_nonhomogeneous, linear, exp_reduce] 
 
 
"`dsolve/methods`[1]" 
  [quadrature, linear, Bernoulli, separable, inverse_linear, 
    homogeneous, Chini, lin_sym, exact, Abel, pot_sym] 
 
"`dsolve/methods`[1, high_degree]" 
    [WeierstrassP, WeierstrassPPrime, JacobiSN, 
      linearizable_by_differentiation, missing, dAlembert, 
      homogeneous_B, sym_implicit] 
 
 
"`dsolve/methods`[3, linear_homogeneous]" 
     [quadrature, const_coeffs, Euler, fully_exact_linear, 
       to_const_coeffs, linear, exp_reduce, exact_linear, 
       with_periodic_functions] 
 
 
"`dsolve/methods`[2, "linear_homogeneous all methods"]" 
     [quadrature, const_coeffs, Euler, linear_1, linear/missing_y, 
      Kovacic, special_functions, to_const_coeffs, exact_linear, 
      sym_1, Mathieu, MeijerG, Heun, HeunG, HeunC, HeunB, HeunD, 
      HeunT, mu_xy, equivalent_to_Bessel, to_Riccati, Bessel, 
      elliptic, Legendre, Whittaker, Kummer, cylindrical, 
      hypergeometric, hypergeom1, hypergeom2, Riemann, RNF, 
      hypergeometricsols, rationalize_lode, with_periodic_functions] 
 
 
"`dsolve/methods`[2, "linear_homogeneous other"]" 
      [exact_linear, sym_1, to_const_coeffs, mu_xy, 
       equivalent_to_Bessel, to_Riccati, with_periodic_functions] 
 
"`dsolve/methods`[2, linear_homogeneous]" 
                      [linear_homogeneous] 
 
"`dsolve/methods`[2, "special_functions"]" 
    [Bessel, elliptic, Legendre, Kummer, Whittaker, hypergeometric, Mathieu] 
 
 
"`dsolve/methods`[3, linear_nonhomogeneous]" 
     [quadrature, fully_exact_linear, linear_nonhomogeneous_[0,1], 
      exact_linear_nonhomogeneous, linear, exp_reduce] 
 
 
"`dsolve/methods`[2, "linear_homogeneous in Normal Form"]" 
                           [linear_1] 
 
"`dsolve/methods`[2, "development"]" 
    [mu_xyp, mu_xyp2, mu_formal, mu_heuristic, exp_reduce, linear, 
     Bessel2, Whittaker_old, nonlinear_homogeneous, 
     exact_linear_nonhomogeneous, mu_y1, mu_x_y1, mu_y_y1, 
     mu_poly_yn, exp_sym, sym_pat, sym_8] 
 
 
"`dsolve/methods`[2, "hypergeometric"]" 
                      [hypergeom1, hyper3] 
 
"`dsolve/methods`[1, extra]" 
      [inverse_Riccati, Abel_AIL, sym_pat/[F(x)*G(y),0], 
       sym_pat/[F(x),G(x)], sym_pat/[F(x),G(y)], 
       sym_pat/[F(x)+G(y),0], sym_pat/[F(x),G(x)*y+H(x)], sym_pat, 
       exp_sym] 
 
 
"`dsolve/methods`[high, linear_homogeneous]" 
     [quadrature, const_coeffs, Euler, fully_exact_linear, 
       to_const_coeffs, linear, exp_reduce, exact_linear, 
       with_periodic_functions] 
 
"`dsolve/methods`[high, nonlinear]" 
     [linearizable_by_differentiation, linearizable, reducible, 
      exact_nonlinear, missing, mu_formal, lin_sym] 
 
"`dsolve/methods`[1, "special"]" 
                            [80, 81] 
 
"`dsolve/methods`[1, "development"]" 
     [linearizable_by_differentiation, linearizable, con_sym, 
      WeierstrassP, WeierstrassPPrime, equivalent_to_Abel, Abel_AIR, 
      special, Riccati_symmetries] 
 
 
"`dsolve/methods`[2, nonlinear]" 
    [Liouville, WeierstrassP, JacobiSN, linearizable, 
    linearizable_by_differentiation, mu_xy_2, missing, 
    mu_xyp2_dynamical_symmetries_fully_reducible, 
    mu_xyp_singularcases, sym_1, exact_nonlinear, reducible, 
    lin_sym, S-function, mu_xyp_generalcase, 
    mu_xyp2_dynamical_symmetries_not_fully_reducible] 
 
 
"`dsolve/methods`[high, "development"]" 
    [k25, RNF, mu_heuristic, MeijerG, nonlinear_homogeneous, 
     mu_poly_yn, exp_sym] 
 
"`dsolve/methods`[1, semiclass]" 
    [Riccati, inverse_Riccati, equivalent_to_Abel, linearizable, 
     linearizable_by_differentiation] 
 
 
"`dsolve/methods`[3, nonlinear]" 
   [linearizable_by_differentiation, linearizable, missing, 
     exact_nonlinear, reducible, mu_formal, lin_sym] 
 
 
"`dsolve/methods`[2, linear_nonhomogeneous]" 
     [quadrature, fully_exact_linear, linear_nonhomogeneous_[0,1], 
      linear_nonhomogeneous_[0,F(x)], linear_nonhomogeneous] 
 
"`dsolve/methods`[2, "linear_homogeneous as given"]" 
     [quadrature, const_coeffs, Euler, linear_1, linear/missing_y, 
      Kovacic, RNF, special_functions, MeijerG, Heun, 
      hypergeometricsols, rationalize_lode] 
 
"`dsolve/methods`[3, "development"]" 
     [k25, RNF, mu_heuristic, linear_patterns, MeijerG, 
      nonlinear_homogeneous, mu_y2, mu_poly_yn, exp_sym, pFq, 3F2, 
      2F2, 1F2, 0F2]
 

2.2 How to find a particular solution to ODE?

restart; 
ode:=diff(y(x),x)+y(x)^2*sin(x)-2*sin(x)/cos(x)^2 = 0; 
yp:=DETools:-particularsol(ode);
 

To step into the code, do

restart; 
ode:=diff(y(x),x)+y(x)^2*sin(x)-2*sin(x)/cos(x)^2 = 0; 
stopat(`DEtools/particularsol`); 
DETools:-particularsol(ode);
 

To print it do

print(`DEtools/particularsol`);
 

2.3 How to find basis solutions for homogeneous ode?

Use the output=basis option

ode:=diff(y(x),x$2)-x*diff(y(x),x)-x*y(x)=0; 
dsolve(ode,output=basis);
 

2.4 How to solve a differential equation with initial conditions?

To solve \[ y''-3y'+2y=10 e^{5 x} \] with \(y(0)=1,y'(0)=5\) do

eq1:= diff(y(x),x$2)-3*diff(y(x),x)+2*y(x)=10*exp(5*x); 
dsolve({eq1,y(0)=1,D(y)(0)=5},y(x)); 
 
Methods for second order ODEs: 
Trying to isolate the derivative d^2y/dx^2... 
Successful isolation of d^2y/dx^2 
--- Trying classification methods --- 
trying a quadrature 
trying high order exact linear fully integrable 
trying differential order: 2; linear nonhomogeneous with symmetry [0,1] 
trying a double symmetry of the form [xi=0, eta=F(x)] 
<- double symmetry of the form [xi=0, eta=F(x)] successful 
....
 

The above can also be written using D@@ notation, like this

eq:= (D@@2)(y)(x) - 3*D(y)(x) +2*y(x) = 10*exp(5*x); 
IC := y(0)=1,D(y)(0)=5; 
dsolve({eq,IC},y(x));
 

2.5 How to verify that the ODE solution given is correct?

use odetest and check if it gives zero.

eq1:= diff(diff(y(x),x),x)-3*diff(y(x),x)+2*y(x)=10*exp(5*x); 
ans:=dsolve({eq1,IC},y(x)); 
odetest(ans,eq1); 
 
                 0
 

2.6 How to know the type of ODE?

Maple can classify the ODE.

 
eq1:= diff(y(x),x$2)-3*diff(y(x),x)+2*y(x)=10*exp(5*x); 
R0 := DEtools['odeadvisor'](eq1,y(x)); 
 
          R0 := [[_2nd_order, _with_linear_symmetries]]
 

To get help on this type of ODE, do

DEtools['odeadvisor'](eq1,'help');
 

2.7 What packages to load for differential equations?

Use  with(DEtools);

2.8 How to plot solution of differential equations?

restart; 
eq1:= diff(y(x),x$2)-3*diff(y(x),x)+2*y(x)=10*exp(5*x); 
DEtools[DEplot](eq1,y(x),x=-2..5, [ [y(0)=0, D(y)(0)=0]], y=-3..3,linecolor=red);
 

To get a better plot, change the stepsize and independent variable range

restart; 
eq1:= diff(y(x),x$2)-3*diff(y(x),x)+2*y(x)=10*exp(5*x); 
DEtools[DEplot](eq1,y(x),x=-1..1,[[y(0)=0,D(y)(0)=0]],y=-3..3,stepsize=0.001,linecolor=red);
 

2.9 On High precision. Using taylor to solve ODE

From: Robert Israel (israel@math.ubc.ca) 
Subject: Re: given precision in Maple 
Newsgroups: comp.soft-sys.math.maple 
Date: 2003-07-16 20:19:06 PST 
 
Set Digits:= n and all calculations from this point will be done with n 
digits.  Mathematical functions will be correct to n digits as well (to 
the extent this is practical). 
 
If you want high-accuracy numerical ODE solutions, on the other hand, 
it's not so simple.  I think the best way is using the taylorseries 
method.  For example, consider the problem y' = y^2, y(1) = 1, where 
the exact solution y = 1/(2-x) has y(1.9) = 10. 
 
> Digits:= 30: 
  sol:= dsolve({D(y)(x)=y(x)^2, y(1) = 1}, y(x), numeric, 
            method=taylorseries, abserr=1e-25): 
  sol(1.9); 
 
          [x = 1.9, y(x) = 9.99999999999999999999999797691] 
 
> 10 - eval(y(x),%); 
 
                                       -23 
                            0.202309 10 
 
The other methods (in particular the default rkf45) do not give results 
anywhere near this good.
 

2.10 Obtain ODE in canonical coordinates (Lie symmetry)

How to obtain the ODE in canonical coordinates \(S(R)\) for an ode using Lie symmetry?

Here is a function I wrote with the help of Maple docs, that does that. For now, I am using first order ode. It takes the ode and the variables (coordinates) to use (\(R,S\)) is what normally used, and returns back the ODE in canonical coordinates. The ode should always be a quadrature for first order.

get_ODE_in_canonical:=proc(ode::`=`,y::symbol,x::symbol,S::symbol,R::symbol) 
  local infinitesimals,tr,itr,ODE; 
  infinitesimals := [DEtools:-symgen(ode)]; 
  if nops(infinitesimals)=0 then 
     RETURN(FAIL); 
  fi; 
  infinitesimals:=infinitesimals[1]; 
  tr  := DEtools:-canoni(infinitesimals,y(x),S(R)); 
  itr := op(1,[solve(tr,{x,y(x)})]); 
  ODE:= PDEtools:-dchange(itr,ode,[R,S(R)],simplify); 
  ODE:= op(solve(ODE,{diff(S(R),R)})); 
  RETURN(ODE); 
end proc:
 

Example

ODE := diff(y(x),x) = 1/x^2+y(x); 
get_ODE_in_canonical(ODE,y,x,S,R) 
 
    #diff(S(R), R) = 1/(exp(R)*R^2) 
 
ODE := diff(y(x),x) = x^2-2*x*y(x)+y(x)^2; 
get_ODE_in_canonical(ODE,y,x,S,R) 
   #diff(S(R), R) = 1
 

The following function is small change of the above. It accepts your choice of \(\xi ,\eta \) to use instead of the first one obtained by Maple. This makes it possible to experiment with different infinitesimals. Note that different infinitesimals will/can result in different canonical ODE, but the final solution for \(y(x)\) of course will always be the same after applying the transformation back to \(x,y\) coordinates.

restart; 
get_ODE_in_canonical_v2:=proc(ode::`=`,y::symbol,x::symbol,S::symbol,R::symbol,xi,eta) 
  local infinitesimals:=[xi,eta],tr,itr,ODE; 
  tr  := DEtools:-canoni(infinitesimals,y(x),S(R)); 
  itr := op(1,[solve(tr,{x,y(x)})]); 
  ODE:= PDEtools:-dchange(itr,ode,[R,S(R)],simplify); 
  ODE:= op(solve(ODE,{diff(S(R),R)})); 
  RETURN(simplify(ODE,symbolic)); 
end proc:
 

And now

ODE:=diff(y(x),x) = x^2-2*x*y(x)+y(x)^2; 
get_ODE_in_canonical_v2(ODE,y,x,S,R,1,1) 
 
    #diff(S(R), R) = 1/(R^2 - 1)
 

2.11 How to use hint with symgen?

Here is an example.

ode:=diff(y(x),x)=-y(x)^2/(exp(x)-y(x)) 
DEtools:-symgen(ode,y(x),HINT=[c1*x+c2*y+c3,c4*x+c5*y+c6]); 
 
      [_xi = 1, _eta = y]
 

Or

ode:=diff(y(x),x)=-y(x)^2/(exp(x)-y(x)) 
DEtools:-symgen(ode,y(x),HINT=[g(x),f(x)*y]); 
 
      [_xi = 1, _eta = y]
 

So not use y(x) but only y in the hint.

2.12 How to parse a single ode?

The following function takes in a single ode and parses it to verify it is valid. It returns back 3 values. The dependent variable, the indepenent variable and the ode order.

#added 12/8/2022. 
interface(warnlevel=4); 
kernelopts('assertlevel'=2): 
 
parse_single_ode:=proc(ode::`=`)::symbol,symbol,integer; 
#parses single ode. returns back  dep_var,indep_var,ode_order 
#throws exception when it detects parsing errors 
 
local func; 
local y,x; 
local dep_variables_found::list,item; 
local the_order; 
 
func:=PDEtools:-Library:-GetDepVars("not given",ode,onlydifferentiatedfunctions=true); 
if nops(func)=0 then 
   error ("not differential equation ",ode); 
fi; 
 
func := func[1]; 
 
if nops(func)<>1 then 
   error("Parsing error, dependent variable must contain one argument, found ", func); 
fi; 
 
y:=op(0,func); 
x:=op(1,func); 
 
#basic verification 
if not has(ode,y) then 
   error ("Supplied ode ",ode," has no ",y); 
fi; 
 
if not has(ode,x) then 
   error ("Supplied ode ",ode," has no ",x); 
fi; 
 
if not has(ode,func) then 
   error ("Supplied ode ",ode," has no ",func); 
fi; 
 
the_order := PDEtools:-difforder(ode,x); 
#if the_order=0 then 
#   error ("No derivative found in ",ode,". Input is not differential equation"); 
#fi; 
 
#note that the following call will also return y(x) if the input is not an ode 
#this will check that the dependent variable will show with SAME argument in the ode 
#i.e. if y(x) and y(t) show up in same ode, it will throw exception, which is what 
#we want. 
try 
   dep_variables_found := PDEtools:-Library:-GetDepVars([y],ode); 
catch: 
   error lastexception; 
end try; 
 
#now go over dep_variables_found and check the independent variable is same as x 
#i.e. ode can be y'(z)+y(z)=0 but function is y(x). 
for item in dep_variables_found do 
    if not type(item,function) then 
       error("Parsing error. Expected ",func," found ",item," in ode"); 
    else 
       if op(1,item) <> x then 
          error("Parsing error. Expected ",func," found ",item," in ode"); 
       fi; 
    fi; 
od; 
 
#now go over all indents in ode and check that y only shows as y(x) and not as just y 
#as the PDEtools:-Library:-GetDepVars([_self:-y],ode) code above does not detect this. 
#i.e. it does not check  y'(x)+y=0 
 
if numelems(indets(ode,identical(y))) > 0 then 
   error("Parsing error, Can not have ",y," with no argument inside ",ode); 
fi; 
 
return y,x,the_order; 
end proc:
 

To use do

y,x,the_order := parse_single_ode(diff(y(x),x)+y(x)=0);
 

An alternative to the above is to pass the dependent function itself as well as the ode. This is what I do myself in my ode solver. Like this

parse_single_ode:=proc(ode::`=`,func::function(name))::symbol,symbol,integer; 
#parses single ode. returns back  dep_var,indep_var,ode_order 
#throws exception when it detects parsing errors 
 
local y,x; 
local dep_variables_found::list,item; 
local the_order; 
 
    if nops(func)<>1 then 
       error("Parsing error, dependent variable must contain one argument, found ", func); 
    fi; 
 
    y:=op(0,func); 
    x:=op(1,func); 
 
    #basic verification 
    if not has(ode,y) then 
       error ("Supplied ode ",ode," has no ",y); 
    fi; 
 
    if not has(ode,x) then 
       error ("Supplied ode ",ode," has no ",x); 
    fi; 
 
    if not has(ode,func) then 
       error ("Supplied ode ",ode," has no ",func); 
    fi; 
 
    the_order := PDEtools:-difforder(ode,x); 
 
    #note that the following call will also return y(x) if the input is not an ode 
    #this will check that the dependent variable will show with SAME argument in the ode 
    #i.e. if y(x) and y(t) show up in same ode, it will throw exception, which is what 
    #we want. 
    try 
       dep_variables_found := PDEtools:-Library:-GetDepVars([y],ode); 
       #print("dep_variables_found=",dep_variables_found); 
    catch: 
       error lastexception; 
    end try; 
 
    #now go over dep_variables_found and check the independent variable is same as x 
    #i.e. ode can be y'(z)+y(z)=0 but function is y(x). 
    for item in dep_variables_found do 
        if not type(item,function) then 
           error("Parsing error. Expected ",func," found ",item," in ode"); 
        else 
           if op(1,item) <> x then 
              error("Parsing error. Expected ",func," found ",item," in ode"); 
           fi; 
        fi; 
    od; 
 
    #now go over all indents in ode and check that y only shows as y(x) and not as just y 
    #as the PDEtools:-Library:-GetDepVars([_self:-y],ode) code above does not detect this. 
    #i.e. it does not check  y'(x)+y=0 
 
    if numelems(indets(ode,identical(y))) > 0 then 
       error("Parsing error, Can not have ",y," with no argument inside ",ode); 
    fi; 
 
    return y,x,the_order; 
end proc:
 

To use do the same as before, but need to add \(y(x)\) as second argument. Like this

y,x,the_order := parse_single_ode(diff(y(x),x)+y(x)=0, y(x));
 

2.13 How to check if single ODE is valid?

This is very much the same as above, but this function returns True if the ode is syntactly valid, else false. Can be used just to check if the ode is valid before using it.

It takes in the ode and the function \(y(x)\) and returns either true or false.

#March 15, 2024 
 
export is_valid_single_ode :=proc(ode_in::`=`,func::function(name))::truefalse; 
    local x:=op(1,func),y:=op(0,func); 
    local ode:=ode_in; 
    local dep_variables_found::list; 
    local item; 
 
    if nops(func)<>1 then RETURN(false); fi; 
 
    if not has(ode,diff) then ode:=convert(ode,diff); fi; 
 
    if `or`(not has(ode,diff), not has(ode,x), not has(ode,func))  then 
       RETURN(false); 
    fi; 
 
    try 
        dep_variables_found := PDEtools:-Library:-GetDepVars([y],ode); 
    catch: 
       RETURN(false); 
    end try; 
 
    map( X-> `if`( `or`(not type(X,function), op(1,X) <> x) ,RETURN(false),NULL), 
       dep_variables_found 
    ); 
 
    #check there is no y on its own. Should always be y(x) 
    if nops(indets(ode,identical(y))) <> 0 then 
       RETURN(false); 
    fi; 
 
    RETURN(true); 
end proc:
 

Example usages

 
is_valid_single_ode(diff(y(x),x)+sin(x)=0, y(x) ) 
 
       true
 

To test, do

 
L:=[[3*(D@@2)(y)(x)+diff(y(x),x)+1=sin(x),y(x),true], 
                 [diff(y(x),x)^2=z,y(x),true], 
                 [diff(y(x),x)^2=z,y(x),true], 
                 [diff(y(x),x)^2=y(x)^2,y(x),true], 
                 [diff(y(x),x)=y(z)^2,y(x),false], 
                 [1/diff(y(x),x)=y(x)^2,y(x),true], 
                 [y(x)=1,y(x),false], 
                 [diff(y(x),z)=1,y(x),false], 
                 [D(y)(x)=1,y(x),true], 
                 [(D@@2)(y)(x)+diff(y(x),x)=sin(x),y(x),true], 
                 [diff(y(x),x)+diff(y(z),z)=1,y(x),false], 
                 [diff(y(x),x)+diff(g(z),z)=1,y(x),true] 
                 ]: 
 
map(X->evalb(is_valid_single_ode(X[1],X[2])=X[3]),L); 
if andmap(x->evalb(x=true),%) then 
   print("all tests passed"); 
else 
   print("WARNING, not all tests passed"); 
fi; 
 
#gives 
 
 [true, true, true, true, true, true, true, true, true, true, true, true] 
                       "all tests passed"
 

2.14 How to check if an ode has \(y'\) in it?

Suppose to want to check if an ode has \(y'(x)\) in it. We can not write has(ode, diff(y(x),x)) and see if this gives true or not, because this will also match \(y''\) and \(y'''\) and any higher order.

One way is to first convert the ode to D form and then use has on D(y)(x). This will not match \(y''\) anymore which is what we wanted, because \(y''\) becomes (D@@2)(y)(x) and so the check for first order diff will work as expected.

ode:=diff(y(x),x$2)+3*y(x)=0; 
ode:=convert(ode,D); 
has(ode,(D)(y)(x)) 
 
            #false
 

Another example

ode:=diff(y(x),x$2)+1/diff(y(x),x)=0; 
ode:=convert(ode,D); 
has(ode,(D)(y)(x)) 
 
            #true
 

The same thing if we wanted to check if the ode has \(y''\) or not.

ode:=diff(y(x),x$3)+diff(y(x),x)=0; 
ode:=convert(ode,D); 
has(ode,(D@@2)(y)(x)) 
 
       #false
 

2.15 How to check if an ode is linear ode?

ode:=diff(y(x),x$3)+ x*diff(y(x),x)+sin(x)=0; 
if has(DEtools:-odeadvisor(ode,y(x),['linear']),_linear) then 
   print("linear"); 
else 
   print("not linear ode"); 
fi
 

The above prints "linear"

ode:=y(x)*diff(y(x),x$3)+ x*diff(y(x),x)+sin(x)=0; 
if has(DEtools:-odeadvisor(ode,y(x),['linear']),_linear) then 
   print("linear"); 
else 
   print("not linear ode"); 
fi
 

The above prints "not linear ode". This works for any ode order.

2.16 How to find the order of an ode?

ode:=diff(y(x),x$3)+ x*diff(y(x),x)+sin(x)=0; 
PDEtools:-difforder(ode)
 

Gives \(3\).

2.17 How to find the coefficients of a linear ode?

Given a linear ode of the form \(A y''+B y' + C y= f(x)\) how to find \(A,B,C,f(x)\) ?

ode:=diff(y(x),x$3)+ x*diff(y(x),x)+99*y(x)=sin(x); 
L:=DEtools:-convertAlg(ode,y(x)); #this only works on linear ode's
 

Gives L := [[99, x, 0, 1], sin(x)].

\(L\) is a list. The second entry is \(f(x)\) and the first entry of \(L\) is a list which gives the coefficents of the ode. Notice they are ordered from lowest order to highest order of the ode. Since this is third order ode, then there are \(4\) entries. The first is the coefficient of \(y(x)\), the second is the coefficient of \(y'\) and the third is the coefficient of \(y''\) and the fourth entry is the coefficient of \(y'''\). Notice that coefficient of \(y''\) is zero since \(y''\) is missing from the ode.

This function DEtools:-convertAlg only works on linear ode’s. Therefore we need to check if the ode is linear first before using. How to check for linear ode is given above.

2.18 find order and degree of highest derivative

I need to find the degree of the highest derivative in an ode.

For example, if the input is \[ x \left (\frac {d^{2}}{d x^{2}}y \left (x \right )\right )^{5}+x \left (\frac {d^{2}}{d x^{2}}y \left (x \right )\right )^{2}+\left (\frac {d}{d x}y \left (x \right )\right ) y \left (x \right )+\left (\frac {d^{3}}{d x^{3}}y \left (x \right )\right )^{4} \sin \left (x \right )+5 y \left (x \right )+\sin \left (x \right )+\frac {d^{6}}{d x^{6}}r \left (x \right )+\left (\frac {d^{3}}{d x^{3}}y \left (x \right )\right )^{4} \cos \left (x \right ) = 0 \]

Then the degree for highest derivative of \(y\) w.r.t. \(x\) is 4. For \[ y''(x)^2 + y'(x)+y(x)=0 \] It will be 2.

This function returns the order and degree of such term.

 
find_all_derivatives_of_specific_order:=proc(expr,y::symbol,x::symbol,N::posint)::set; 
local t1,t2; 
 
if not has(expr,diff(y(x),x$N)) then 
   return {}; 
fi; 
 
t1  := identical(diff(y(x),x$N))^anything; 
t2  := identical(diff(y(x),x$N)); 
return indets[flat](expr,{t1,t2});  #MUST use flat 
 
end proc: 
 
get_order_and_degree_of_largest_derivative:=proc(expr,y::symbol,x::symbol)::integer,anything; 
local the_order,the_degree; 
local cand::set; 
local the_exponent; 
local item; 
 
    if not has(expr,diff(y(x),x)) then return 0,0; fi; 
    the_order := PDEtools:-difforder(expr,x); 
    cand       := find_all_derivatives_of_specific_order(expr,y,x,the_order); 
 
    if nops(cand)=0 then 
        the_degree := 0; 
    else 
        the_degree:=1; 
        for item in cand do 
            if type(item,`^`) then 
                the_exponent := op(2,item); 
                if type( the_exponent,symbol) or not type( the_exponent,numeric) then #assume larger 
                    the_degree :=the_exponent; 
                else 
                    if type(the_degree,symbol) or not  type( the_exponent,numeric) then 
                        next; 
                    else 
                        if op(2,item)>the_degree then 
                            the_degree := op(2,item); 
                        fi; 
                    fi; 
                fi; 
            else 
                if type(the_degree,symbol) then 
                    next; 
                else 
                    if the_degree=0 then 
                        the_degree := 1; 
                    fi; 
                fi; 
            fi; 
        od; 
    fi; 
 
    return the_order,the_degree; 
end proc:
 

And now it can be called as follows

ode:=diff(y(x),x$2)+diff(y(x),x)+y(x)=0; 
get_order_and_degree_of_largest_derivative(lhs(ode),y,x) 
 
    #2,1 
 
ode:=diff(y(x),x$2)*diff(y(x),x$2)^4+diff(y(x),x)+y(x)=0; 
get_order_and_degree_of_largest_derivative(lhs(ode),y,x) 
 
   #2,5 
 
ode:=y(x)=0; 
get_order_and_degree_of_largest_derivative(lhs(ode),y,x) 
 
   #0,0 
 
ode:=diff(y(x),x)^n=0; 
get_order_and_degree_of_largest_derivative(lhs(ode),y,x) 
 
   #1,n
 

2.19 How to obtains list of all derivatives in expression?

I had a need to find all derivatives of form  diff(y( anything), anything) in an ode so to check that \(y\) argument is not different among them.

For an example, given \[ a \left (\frac {d^{2}}{d x^{2}}y \left (x \right )\right ) \left (\frac {d^{3}}{d x^{3}}y \left (x \right )\right )-\sqrt {1+\left (\frac {d^{2}}{d x^{2}}y \left (x \right )\right )^{2}}+\frac {1}{\sin \left (\frac {d^{5}}{d x^{5}}y \left (x \right )\right )} = \frac {d}{d z}y \left (z \right )+{\mathrm e}^{y \left (x \right )+\frac {d}{d x}y \left (x \right )}+\frac {d}{d x}r \left (x \right ) \]

the result should be \[ \left [\begin {array}{c} \frac {d^{5}}{d x^{5}}y \left (x \right ) \\ \frac {d^{4}}{d x^{4}}y \left (x \right ) \\ \frac {d^{3}}{d x^{3}}y \left (x \right ) \\ \frac {d^{2}}{d x^{2}}y \left (x \right ) \\ \frac {d}{d x}y \left (x \right ) \\ \frac {d}{d z}y \left (z \right ) \end {array}\right ] \]

One issuse is how to check for diff and also check that the dependent variable is \(y\) so as not to pick other dependent variables such as \(z\) in this example. This was done by converting diff to D otherwise it will not work.

restart; 
expr:=a*diff(y(x),x$2)*diff(y(x),x$3)-sqrt(1+ diff(y(x),x$2)^2)+1/sin(diff(y(x),x$5))=diff(y(z),z)+exp(y(x)+diff(y(x),x))+diff(r(x),x); 
 
#this finds all derivatives 
list_of_diffs:=indets(expr,'satisfies'(s->op(0,s)='diff' and op([0,1],convert(s,D))=y)); 
 
#This finds all dependent variables 
list_of_diffs:=convert(list_of_diffs,list); 
list_of_indep_variables   := map(x->PDEtools:-Library:-GetIndepVars(x)[-1],list_of_diffs); 
 
#this converts it to set. If the ODE is valid, then the list_of_indep_variables should 
#have one entry $x$ in it and nothing else. 
list_of_indep_variables   := convert(ListTools:-Flatten(list_of_indep_variables),set); 
 
if nops(list_of_indep_variables)>1 then 
  error( cat("Only one independent variable expected in differential form, found ", 
                   convert(list_of_indep_variables,string)) ); 
fi; 
 
if list_of_indep_variables[1]<>x then 
   error( cat("Independent variable expected in differential form not same as independent variable in function given ", 
      convert(list_of_indep_variables,string)) ); 
fi;
 

Another option instead of doing all the above is to do this

expr:=a*diff(y(x),x$2)*diff(y(x),x$3)-sqrt(1+ diff(y(x),x$2)^2)+1/sin(diff(y(x),x$5))=diff(y(z),z)+exp(y(x)+diff(y(x),x))+diff(r(x),x); 
try 
   PDEtools:-Library:-GetDepVars([y(x)],expr); 
catch 
  error "functions with name [y] having different dependency: [[y(x), y(z)]]" 
end try;
 

The function  PDEtools:-Library:-GetDepVars([y(x)],expr) checks that only \(y(x)\) dependency shows up. It throws an error otherwise. So if an error is thrown, then this means \(y\) shows up with different independent variables.

2.20 How to invert roles of dependent variable and independent variable in an ode?

Sometimes it is useful to invert an ode. i.e. make the independent variable the dependent variable, and the dependent variable the independent. For example, given \[ 1+\left (\frac {x}{y \left (x \right )}-\sin \left (y \left (x \right )\right )\right ) \left (\frac {d}{d x}y \left (x \right )\right ) = 0 \] We want the ode to become \[ -\sin \left (y \right ) y +y \left (\frac {d}{d y}x \left (y \right )\right )+x \left (y \right ) = 0 \]

This can be done as follows

restart; 
 
ode:=1+ (x/y(x)-sin(y(x) ))*diff(y(x),x)=0; 
tr:={x=u(t),y(x)=t}; 
ode:=PDEtools:-dchange(tr,ode); 
ode:=eval(ode,[t=y,u=x]); 
ode:=simplify(ode);
 

\[ \frac {-\sin \left (y \right ) y +y \left (\frac {d}{d y}x \left (y \right )\right )+x \left (y \right )}{y \left (\frac {d}{d y}x \left (y \right )\right )} = 0 \]

In this case, we can get rid of the denomator, but this is a manual step for now.

ode:=numer(lhs(ode))=0;
 

\[ -\sin \left (y \right ) y +y \left (\frac {d}{d y}x \left (y \right )\right )+x \left (y \right ) = 0 \]

The above can now be solved more easily for \(x(y)\) than solving the orignal ode for \(y(x)\).

2.21 How to find the indicial equation for an ODE?

For say Bessel ode of order zero:

eq:= x^2*diff(y(x),x$2)+x*diff(y(x),x)+x^2*y(x)=0; 
DEtools[indicialeq](eq,x,0,y(x)); 
          #x^2 = 0
 

The third argument above is the singularity point of interest. So we have two roots, both zero. These are now used for finding the power series solution \(y(x)\) if needed.

Another example, is Bessel of order 1

eq:= x^2*diff(y(x),x$2)+x*diff(y(x),x)+(x^2-1)*y(x)=0; 
DEtools[indicialeq](eq,x,0,y(x)); 
          #x^2-1 = 0
 

2.22 How to write derivative

To write \(y'(x)=x\), one way is diff(y(x),x)=x and another is D(y)(x)=x. To write \(y''(x)=x\), one way is diff(y(x),x$2)=x and another is (D@@2)(y)(x)=x.

To convert from one form to another use convert(eq,diff) or convert(eq,D)

2.23 How to solve heat PDE in 1D in Maple 2017?

to solve \(\frac {\partial u(x,t)}{\partial t}=k \frac {\partial ^2 u(x,t)}{\partial x^2}\) with homogeneous dirichlet boundary conditions \(u(0,t)=0,u(L,t)=0\) the commands are

restart; 
pde:=diff(u(x,t),t)=k*diff(u(x,t),x$2); 
bc:=u(0,t)=0,u(L,t)=0; 
sol:=pdsolve([pde,bc]) assuming 0<L:
 

Which gives

\[ u \left ( x,t \right ) =\sum _{{\it \_Z1}=1}^{\infty }{\it \_C1} \left ( {\it \_Z1} \right ) \sin \left ( {\frac {\pi \,{\it \_Z1}\,x}{L}} \right ) {{\rm e}^{-{\frac {k{\pi }^{2}{{\it \_Z1}}^{2}t}{{L}^{2}}}}} \]

Which can be made more readable as follows

sol:=algsubs(_Z1=n,sol): 
sol:=algsubs(Pi*n/L=lambda(n),sol);
 

\[ u \left ( x,t \right ) =\sum _{n=1}^{\infty }{\it \_C1} \left ( n \right ) \sin \left ( x\lambda \left ( n \right ) \right ) {{\rm e}^{-kt \left ( \lambda \left ( n \right ) \right ) ^{2}}} \]

For homogeneous Neumann B.C., at \(x=0\), let \(\frac {\partial u}{\partial x}=0\) and at \(x=L\) let \(u(L,t)=0\), the solution it gives looks different than my hand solution

restart; 
pde:=diff(u(x,t),t)=k*diff(u(x,t),x$2); 
bc:=D[1](u)(0,t)=0,u(L,t)=0; 
pdsolve([pde,bc]) assuming 0<L;
 

It gives

\[ u \left ( x,t \right ) ={\it \_C3}\,{\it \_C2}\, \left ( {{\rm e}^{1/4\,{\frac {2\,i\pi \,xL-k{\pi }^{2}t}{{L}^{2}}}}}+{{\rm e}^{-1/4\,{\frac {\pi \, \left ( 2\,ixL+k\pi \,t \right ) }{{L}^{2}}}}} \right ) \]

I need to look more into the above and see if this comes out to be the same as my hand solution.

Another example, with initial conditions now given

restart; 
pde:=diff(u(x,t),t)=k*diff(u(x,t),x$2); 
bc:=D[1](u)(0,t)=0,u(L,t)=0; 
ic:=u(x,0)=f(x); 
sol:=pdsolve([pde,bc,ic],u(x,t)) assuming 0<L; 
sol1:=algsubs(_Z2=n,sol);
 

The result is

\[ u \left ( x,t \right ) =\sum _{n=1}^{\infty } \left ( 2\,{\frac {1}{L}{{\rm e}^{-1/4\,{\frac {k{\pi }^{2}t \left ( 1+2\,n \right ) ^{2}}{{L}^{2}}}}}\cos \left ( 1/2\,{\frac {\pi \,x \left ( 1+2\,n \right ) }{L}} \right ) \int _{0}^{L}f \left ( x \right ) \cos \left ( 1/2\,{\frac {\pi \,x \left ( 1+2\,n \right ) }{L}} \right ) \,{\rm d}x} \right ) \]

Another example

restart; 
pde:=diff(u(x,t),t)=k*diff(u(x,t),x$2); 
bc:=D[1](u)(0,t)=0,u(L,t)=0; 
ic:=u(x,0)=3*sin(Pi*x/L)-sin(3*Pi*x/L); 
sol:=pdsolve([pde,bc,ic],u(x,t)) assuming 0<L; 
sol1:=algsubs(_Z2=n,sol);
 

\[ u \left ( x,t \right ) =\sum _{n=1}^{\infty }768\,{\frac {1}{\pi \, \left ( 16\,{n}^{4}+32\,{n}^{3}-136\,{n}^{2}-152\,n+105 \right ) }{{\rm e}^{-1/4\,{\frac {k{\pi }^{2}t \left ( 1+2\,n \right ) ^{2}}{{L}^{2}}}}}\cos \left ( 1/2\,{\frac {\pi \,x \left ( 1+2\,n \right ) }{L}} \right ) } \]

Another example

restart; 
pde:=diff(u(x,t),t)=k*diff(u(x,t),x$2); 
bc:=u(0,t)=0,u(L,t)=0; 
ic:=u(x,0)=3*sin(Pi*x/L)-sin(3*Pi*x/L); 
sol:=pdsolve([pde,bc,ic],u(x,t)) assuming 0<L;
 

\[ u \left ( x,t \right ) =\sin \left ( {\frac {\pi \,x}{L}} \right ) {{\rm e}^{-9\,{\frac {{\pi }^{2}kt}{{L}^{2}}}}} \left ( -2\,\cos \left ( 2\,{\frac {\pi \,x}{L}} \right ) +3\,{{\rm e}^{8\,{\frac {{\pi }^{2}kt}{{L}^{2}}}}}-1 \right ) \]

The above answer seems wrong. There is not even a summation in it. It is different from my hand solution. Look more into it.

2.24 How to make Maple display diff(y(x),x) as y’(x) or as y’ ?

Add this

expr:=diff(y(x),x); 
Typesetting:-Settings(typesetprime=true, prime=x):
 

The above will display the expression as \(y'(x)\). To make it now show the \(x\) do

expr:=diff(y(x),x); 
Typesetting:-Settings(typesetprime=true, prime=x): 
Typesetting:-Suppress(y(x));
 

Now it will show the expression as just \(y'\). For all the above to work, make sure you have Typesetting level set to Extended in the GUI.

This is done inside Tools->Options->Display menu.

To clear all the above Typesetting, do restart or do Typesetting:-Unsuppress(y(x))

2.25 How to set boundary conditions for dsolve or pdsolve?

The Maple syntax for seeting initial and boundary conditions is very confusing, as compared to Mathematica, which seems to me to be simpler. So I wrote this to remind me of the syntax each time.

For PDE, assuming dependent variable is \(u(x,t)\) then

Conditions Maple code
\(u(0,t)=0\)  u(0,t)=0
\(\frac {\partial u}{\partial x}=0\) at \(x=0\) D[1](u)(0,t)=0
\(\frac {\partial ^2 u}{\partial x^2}=0\) at \(x=0\) D[1,1](u)(0,t)=0
\(\frac {\partial ^3 u}{\partial x^3}=0\) at \(x=0\) D[1,1,1](u)(0,t)=0
\(\frac {\partial u}{\partial t}=0\) at \(t=0\) D[2](u)(x,0)=0
\(\frac {\partial ^2 u}{\partial t^2}=0\) at \(t=0\) D[2,2](u)(x,0)=0
\(\frac {\partial ^3 u}{\partial t^3}=0\) at \(t=0\) D[2,2,2](u)(x,0)=0

Notice the syntax for the last one above. It is (D[1]@@2)(u)(0,t)=0 and not (D@@2)[1](u)(0,t)=0

For an ODE, assuming dependent variable is \(y(x)\) then the syntax is

Conditions Maple code
\(y(0)=0\)  y(0)=0
\(\frac {dy}{dx}=0\) at \(x=0\) D(y)(0)=0
\(\frac {d^2 y}{d x^2}=0\) at \(x=0\) (D@@2)(y)(0)=0

2.26 How force dsolve to use Lie?

Use dsolve(ode,Lie)

To find symmetries, do

DEtools:-symgen(ode,y(x),HINT=[c__1+c__2*x+c__3*y,c__4+c__5*x+c__6*y])

or just

DEtools:-symgen(ode,y(x))

To debug it do

stopat(`ODEtools/symgen`); before calling dsolve or DEtools:-symgen

2.27 How to do change of variables on the dependent variable for an ODE?

given an ode

\[ y \left (x \right ) = \left (\frac {d}{d x}y \left (x \right )\right )^{3} y \left (x \right )^{2}+2 x \left (\frac {d}{d x}y \left (x \right )\right ) \]

do change of variable \(u(x)=y(x)^2\)

restart; 
ode:=y(x)=diff(y(x),x)^3*y(x)^2+2*x*diff(y(x),x); 
new_ode:=PDEtools:-dchange({y(x)=sqrt(u(x))},ode,{u});
 

\[ \sqrt {u \left (x \right )} = \frac {\left (\frac {d}{d x}u \left (x \right )\right )^{3}}{8 \sqrt {u \left (x \right )}}+\frac {x \left (\frac {d}{d x}u \left (x \right )\right )}{\sqrt {u \left (x \right )}} \]

2.28 How to do change of variable on the independent variable for an ODE?

given an ode

\[ \frac {d^{2}}{d t^{2}}y \left (t \right )+y \left (t \right ) = 2 t \]

do change of variable \(t=\tau + \pi \)

restart; 
ode:=diff(y(t),t$2)+y(t)=2*t; 
PDEtools:-dchange({t=tau+Pi},ode,known={t},unknown={tau},params=Pi)
 

\[ \frac {d^{2}}{d \tau ^{2}}y \left (\tau \right )+y \left (\tau \right ) = 2 \tau +2 \pi \]

it is important to use  params=Pi. Watch what happens if we do not do that

restart; 
ode:=diff(y(t),t$2)+y(t)=2*t; 
PDEtools:-dchange({t=tau+Pi},ode,known={t},unknown={tau});
 

\[ \frac {d^{2}}{d \tau ^{2}}y \left (\tau , \pi \right )+y \left (\tau , \pi \right ) = 2 \tau +2 \pi \] Which is not what we want.

2.29 ODE change of variable on both dependent and independent variable?

This verifies solution given in https://math.stackexchange.com/questions/3477732/can-t-see-that-an-ode-is-equivalent-to-a-bessel-equation Where a change of variables on \[ \xi ^2 \frac {d^2\eta }{d\xi ^2} + \xi \frac {d\eta }{d\xi } - (\xi ^2+n^2)\eta =0 \] Was made using \[ \eta =\frac {y}{x^\alpha }, \quad \xi =\beta x^\gamma , \] To produce the ode \[ \frac {d^2y}{dx^2} - \frac {(2\alpha -1)}{x}\frac {dy}{dx} - (\beta ^2 \gamma ^2 x^{2\gamma -2}+\frac {n^2\gamma ^2-\alpha ^2}{x^2})y=0. \] In Maple the above is done using

restart; 
ode := zeta^2*diff(eta(zeta),zeta$2) + zeta*diff(eta(zeta),zeta) - (zeta^2 + n^2)*eta(zeta) = 0; 
the_tr:={zeta=beta*x^gamma,eta(zeta)=y(x)/x^alpha}; 
PDEtools:-dchange(the_tr,ode,{y(x),x},'known'={eta(zeta)},'uknown'={y(x)},'params'={alpha,beta,gamma}); 
simplify(%); 
numer(lhs(%))=0; 
simplify(numer(lhs(%))/(x^(1-alpha)))=0; 
numer(lhs(%))=0; 
collect(%,[y(x),diff(y(x),x),diff(y(x),x$2)]);
 

Which gives \[ \left (-\gamma ^{2} x^{-1+2 \gamma } \beta ^{2} x -\gamma ^{2} n^{2}+\alpha ^{2}\right ) y \left (x \right )+\left (-2 \alpha x +x \right ) \left (\frac {d}{d x}y \left (x \right )\right )+x^{2} \left (\frac {d^{2}}{d x^{2}}y \left (x \right )\right ) = 0 \]

Here is another example. Here to make change of variables to polar coordinates by making \(x=r \cos \theta \) and \(y=r \sin \theta \) The ode is \[ \frac {y-x y'}{\sqrt {1+(y')^2}}=x^2+y^2 \]

In Maple

restart; 
ode := (y(x)-x*diff(y(x),x))/sqrt(1+ diff(y(x),x)^2) = x^2+y(x)^2; 
the_tr:={x=r(t)*cos(t),y(x)=r(t)*sin(t)}; 
PDEtools:-dchange(the_tr,ode,{r(t),t},'known'={y(x)},'uknown'={r(t)});
 

Which gives

\[ \frac {r \left (t \right ) \sin \left (t \right )-\frac {r \left (t \right ) \cos \left (t \right ) \left (\left (\frac {d}{d t}r \left (t \right )\right ) \sin \left (t \right )+r \left (t \right ) \cos \left (t \right )\right )}{\left (\frac {d}{d t}r \left (t \right )\right ) \cos \left (t \right )-r \left (t \right ) \sin \left (t \right )}}{\sqrt {1+\frac {\left (\left (\frac {d}{d t}r \left (t \right )\right ) \sin \left (t \right )+r \left (t \right ) \cos \left (t \right )\right )^{2}}{\left (\left (\frac {d}{d t}r \left (t \right )\right ) \cos \left (t \right )-r \left (t \right ) \sin \left (t \right )\right )^{2}}}} = r \left (t \right )^{2} \left (\cos ^{2}\left (t \right )\right )+r \left (t \right )^{2} \left (\sin ^{2}\left (t \right )\right ) \]

Here is another example. Where we want to change \(R(r)\) to \(y(x)\) everywhere

\[ \frac {d^{2}}{d r^{2}}R \left (r \right )+\frac {d}{d r}R \left (r \right )+R \left (r \right ) = 0 \]

restart; 
ode:=diff(R(r),r$2)+diff(R(r),r)+R(r)=0; 
the_tr:={r=x,R(r)=y(x)}; 
PDEtools:-dchange(the_tr,ode,{y(x),x},'known'={R(r),r},'uknown'={y(x),x});
 

\[ \frac {d^{2}}{d x^{2}}y \left (x \right )+\frac {d}{d x}y \left (x \right )+y \! \left (x \right ) = 0 \]

The format of the transformation is old_independent_variable=new_independent_variable and old_dependent_variable=new_dependent_variable

2.30 How to make phase plot of second order ODE?

Make a phase plot of \[ \frac {d^{2}}{d t^{2}}x \left (t \right )+\frac {\frac {d}{d t}x \left (t \right )}{2}+x \left (t \right ) = u \left (t \right ) \]

By plotting \(x(t)\) vs \(x'(t)\) without solving the ODE.

restart; 
alias(DS=DynamicSystems): 
ode := diff(x(t),t$2) +1/2*diff(x(t),t)+ x(t) = u(t); 
sys:=DS:-DiffEquation(ode,'outputvariable'=[x(t)],'inputvariable'=[u(t)]); 
sys0:=DS:-StateSpace(sys); 
eq1:=diff(x1(t),t)=sys0:-a[1,..].Vector([x1(t),x2(t)]); 
eq2:=diff(x2(t),t)=sys0:-a[2,..].Vector([x1(t),x2(t)]); 
DEtools:-DEplot([eq1,eq2],[x1(t),x2(t)],t=0..35,[[x1(0)=1,x2(0)=1]],x1=-2..2,x2=-2..2, 
        numpoints=200, linecolor=black, axes=boxed);
 

2.31 How to move all terms with y to one side?

Given ode where \(y\) is dependent variable and \(x\) is independent variable, how to normalize the ode so that all terms with \(y(x)\) are on left side and everything is on the RHS? THis makes it easier to see what the forcing function is. i.e. we want to write the ode as

\[ a y''+b y'+c y= f(x) \]

Here is function to do this. This works for any ode or any expression.

export move_y_x_to_each_side:=proc(expr_in::`=`,y::symbol,x::symbol)::`=`; 
    local expr:=expr_in; 
    local stuff_with_y,stuff_not_with_y; 
    expr  := lhs(expr)-rhs(expr); 
    if not expr::`+` then 
      RETURN(expr_in); 
    fi; 
    expr  := numer(normal(expr)); 
    stuff_with_y,stuff_not_with_y := selectremove(has,expr,y); 
    stuff_not_with_y := convert(stuff_not_with_y,diff); 
 
    RETURN(stuff_with_y = -stuff_not_with_y); 
end proc:
 

Examples

ode:=diff(y(x),x$2)+x*y(x)+sin(x)-3=tan(x); 
expr:=move_y_x_to_each_side(ode,y,x); 
 
        # diff(y(x), x, x) + x*y(x) = 3 - sin(x) + tan(x)
 

And

ode:=diff(y(x),x$2)+x*y(x)+sin(x)-3=tan(x)+y(x)+Pi; 
expr:=move_y_x_to_each_side(ode,y,x); 
 
        # diff(y(x), x, x) + x*y(x) - y(x) = 3 - sin(x) + tan(x) + Pi
 

And

ode:=move_y_x_to_each_side(diff(x(t),t$2)/x(t) + diff(x(t),t)/x(t) - F(t)/x(t) =1,x,t) 
expr:=move_y_x_to_each_side(ode,x,t); 
 
        # diff(x(t), t, t) + diff(x(t), t) - x(t) = F(t)
 

2.32 How to find all constants of integrations in an expression?

Sometimes I make solution for an ode with constants of integrations. These must be of form _Cn where \(n\) is positive integer, such as _C1 or _C5. Now to integrate this solution once more, need to come up with new constant that does not already show in the solution.

To find current constants in an expression use this

sol:=x-_C1*x+_C3*x^2; 
indets(sol,And(symbol, suffixed(_C, nonnegint))); 
 
         {_C1, _C3}
 

Therefore, one way to make a new constant of integration, is to find the largest numbered one and increase by one. Like this

restart; 
sol:=x-_C1*x+_C3*x^2; 
myconstants:=indets(sol,And(symbol, suffixed(_C, nonnegint))); 
map(X->String(X),myconstants); 
map(X->X[3..],%); 
map(X->:-parse(X),%); 
n:=max(%); 
new_constant:=_C||(n+1);
 

2.33 How to find if an ode is missing the dependent variable?

Sometimes it is usefull to know if ode is missing \(y(x)\) as this allows one to do the substitution \(y'=u\) and reduce the order of the ode.

This is a function which takes in an ode and returns true if it is missing \(y(x)\) or false otherwise.

#added 2/18/2024. checks if an ode is missing y 
export is_ode_missing_y:=proc(ode_in::`=`,y::symbol,x::symbol)::truefalse; 
local ode:=ode_in; 
local ode_order::posint := PDEtools:-difforder(ode_in); 
local N::posint; 
 
    ode:=lhs(ode)-rhs(ode); 
    ode:=convert(ode,D); 
    for N from 1 to ode_order do 
        ode:=eval(ode,[(D@@N)(y)(x)=Y||N]); 
    od; 
 
    RETURN(not has(ode,y(x))); 
 
end proc;
 

To use do

restart; 
ode:=diff(y(x),x$2)+diff(y(x),x$4)+x=0; 
is_ode_missing_y(ode,y,x); 
 
       #true 
 
ode:=diff(y(x),x$2)+diff(y(x),x$4)+x=sin(x)+y(x); 
is_ode_missing_y(ode,y,x); 
 
      #false
 

3 How to convert Mathematica expression to Maple?

restart; 
with(MmaTranslator); #load the package 
FromMma(`Integrate[Cos[x],x]`);
 

Or

restart; 
with(MmaTranslator); #load the package 
convert(`Integrate[Cos[x],x]`, FromMma);
 

4 How to debug internal procedures, such as dsolve?

f:=proc() 
eq:=x*diff(y(x),x)+y(x)=exp(2*x); 
dsolve(eq,y(x)); 
end proc;
 

Then used the command stopat(f); then called the procedure f(); and now the debugger comes up. Did step command and now it steps inside dsolve

Some examples

stopat(`ODEtools/symtest`); 
stopat(`ODEtools/test`); 
stopat(`ODEtools/normal/expanded`); 
stopat(`ODEtools/odepde`); 
 
DEtools:-symtest([-3,y],ode,y(x));
 

‘ODEtools/normal/expanded‘

5 How to display source code of a function?

For integration use

infolevel[`evalf/int`]:=5;infolevel[int]:=5;
 

Another option

restart; 
interface(verboseproc=3) #(try 2 also)
 

then print(procedure); or eval(procedure_name); for example

restart: 
interface(verboseproc=3): 
print(LinearAlgebra:-GramSchmidt); 
print(lcm);
 

Also can use showstat, in this case interface(verboseproc=3) is not needed. Also showstat gives line numbers and I think it is easier to read. Some examples

showstat(`odsolve/2nd_order`) 
showstat(`evalf/hypergeom`); 
showstat(`evalf/exp/general`); 
showstat(`evalf/Psi`); 
showstat(`evalf/int`); 
showstat(`dsolve/SERIES`); 
 
#these 3 shows the main 3 functions by each solver 
showstat(`odeadv/dAlembert`);  #used by advisor 
showstat(`odsolve/dAlembert`);  # main API. 
showstat(`odsolve/dAlembert/integrate`); #used to integrate the ode 
 
showstat(`ODEtools/odeadv`); 
showstat(DEtools:-odeadvisor); 
showstat(`dsolve/series/froben/inhom`) 
showstat(`dsolve/series/froben`)
 

To stop at anyone of these functions in debugger do

stopat(`dsolve/series/froben/inhom`) 
#code here, say dsolve command.
 

The above will stop in the debugger in the above function.

There is also a function by Joe Riel here here is the post by Joe Riel:

"A disadvantage of showstat, particularly if you want to cut and paste the output, is that it includes line numbers. Here is a simple procedure I threw together to remove the line numbers."

PrintProc := proc(p::name,lines::{posint,posint..posint}) 
local width; 
option `Copyright (C) 2004 by Joseph S. Riel. All rights reserved.`; 
description "Print like showstat, but without line numbers"; 
width := interface('screenwidth'=200); 
try 
printf("%s", 
StringTools:-RegSubs( 
"\n ...." = "\n" 
,debugopts('procdump'= 
`if`(nargs=1,p,[args])))) 
catch "procedure name expected": 
error "%1 is not a procedure name",p 
finally interface('screenwidth'=width) 
end try; 
NULL 
end:
 

To print source code to file using the above, do the following

currentdir("C:\\data"); 
interface('prettyprint'=1): 
interface('verboseproc'=3): 
writeto("listing.txt") 
PrintProc('singular'); 
writeto('terminal'):
 

Now the output will show up in the file "listing.txt" and also no line wrapping. The above I found is the best solution so far to do this.

6 How to display trace of a function as it runs in maple?

trace(foo); 
untrace(foo);
 

also see debug(foo);

Also

infolevel[all]:=5: 
printlevel:=10:
 

See http://www.mapleprimes.com/questions/35951-How-To-Debugtrace-Things-In-Maple

Also look at kernelopts(opaquemodules=true)

Here is a useful post by Carl Love from Maple prime forum that summarizes all of these

Here are four things that you can do to get more information. I have listed them in order by how structured the information is, with the most structured first.

  1. Set

    infolevel[all]:= 5;
     
    

    That will cause programs to print out additional information of the programmers’ choosing. You can use higher or lower numbers for more or less information. Most programs don’t use levels higher than 5.

  2. Print the code of procedures with showstat:

    showstat(int); 
    showstat(sin); 
    showstat(cos);
     
    
  3. Trace the execution of particular procedures with trace:

    trace(int); 
    trace(sin);
     
    
  4. Trace the execution of everything with printlevel:

    printlevel:= 10000:
     
    

    You can use higher or lower numbers for more or less information.

7 How to display a build in function code?

Some examples

interface(verboseproc=3); 
print(DEtools) 
print(`ODEtools/symgen`); 
print(`symgen/methods`); 
print(`symgen/do`);
 

To stop the debugger at symgen do

stopat(`ODEtools/symgen`);
 

To get infolevel on symgen do

infolevel[`symgen`]:=5;
 

Or to see line numbers

interface(verboseproc=3); 
showstat(dsolve)
 

Or can use the Browse(); command

with(LibraryTools); 
Browse();
 

Another option I found is

s:=debugopts(procdump=`showstat`);
 

Then the above produces listing that can be copied as string with line wrapping ok.

8 How to build a LIST or a SET on the fly?

One way

L:=[]: 
for i from 1 to 3 do : 
    L:=[op(L),i]; 
end do;
 

But a better way is to use seq if one knows the length

L:=[seq(i,i=1..3)]; 
 
       L := [1, 2, 3]
 

Since list is unmutable, a more efficient method, for long lists, is to use Array, and then convert the result back to list at the end since Array can grow dynamically without preallocation each time something is inserted as follows

L:=Array(): 
for i from 1 to 3 do : 
    L(i):=i; 
end do; 
 
for i from 1 to numelems(L) do : 
    print(L[i]); 
end do; 
 
L := convert(L,list)
 

Which wil print

                            L := [1] 
 
                          L := [1, 2] 
 
                         L := [1, 2, 3] 
 
                               1 
 
                               2 
 
                               3 
 
                         L := [1, 2, 3]
 

Notice that to add to an Array, () is used. But to access an entry in an array [] is used.

And finally, using Array also, it can be done without using any indexing as follows

L:=Array(1..0): 
for i from 1 to 3 do : 
    L ,= i; 
end do; 
 
L := convert(L,list)
 

For the above to work, the array must be declared using Array(1..0). The new syntax  A ,= i  will append to the array, and there is no need to write  A(i) := i

9 make function display more information

By Carol Devore on the net:

Use infolevel. 
For example, to show what logic dsolve uses, do this: 
 
First try 
> infolevel[all]:= 5; 
 
That will probably give more information than you want, but if not, 
then try 
> printlevel:= 1000; 
 
If you want information about a specific procedure, you can use debug. 
 For example, 
restart; 
debug(`int/int`); 
int(p, x= 0..1); 
 
To find out what procedures are being called without getting too much 
extra information, use excallgraph.

Trying on dsolve

infolevel[dsolve]:= 3; 
dsolve({eq1},y(x)); 
 
Methods for second order ODEs: 
Trying to isolate the derivative d^2y/dx^2... 
Successful isolation of d^2y/dx^2 
--- Trying classification methods --- 
trying a quadrature 
trying high order exact linear fully integrable 
trying differential order: 2; linear nonhomogeneous with symmetry [0,1] 
trying a double symmetry of the form [xi=0, eta=F(x)] 
<- double symmetry of the form [xi=0, eta=F(x)] successful
 

10 How to plot a function?

Here, I am looking at fouries series expansion of \(f(x)=0\) between \(–\pi \) and 0, and \(f(x)=1\) between 0 and \(\pi \).

The Fouries series expansion is worked out to be as below. This shows that the series approximate the above \(f(x)\) as more terms are added

restart; 
f:=(x)-> 1/2 + (1/Pi)*(sin(x)+sin(3*x)/3+sin(5*x)/5+sin(7*x)/7); 
plot(f(x),x=-10..10);
 

11 How to run maple from command line?

From DOS, point to where your cmaple is

>"C:\Program Files\Maple 7\BIN.WNT\"cmaple

To make it execute maple commands use the < foo.txt to pipe maple commands in the file to it.

12 How to use matrices in maple?

A:= Matrix( [ [1, 2, 3] , 
              [3, 6, 7] , 
              [5, 6, 9] , 
              [7, 7, 7] 
            ]); 
whattype(A); 
       Matrix 
size:=LinearAlgebra:-Dimension(A); 
     size := 4, 3 
row:=size[1]; 
      row := 4 
col:=size[2]; 
      col := 3
 

You can extract any part of the matrix like this:

B:=A[1..3,2..2];
 

\[ \left [ \begin {array}{c} 2\\ 6\\ 6\end {array} \right ] \]

By Carl Devore http://mathforum.org/kb/message.jspa?messageID=1570678

Maple list and sequence structures are more flexible than Matrices, which are 
highly structured.  A Maple list of lists (called a listlist in Maplese) is akin 
to a matrix in some other languages.  Many matrix 
operations can be performed directly on the listlist form, but to do 
serious linear algebra, you should convert to a Matrix.  Of course, it is 
trivial to convert a listlist to Matrix: 
 
LL:= [[1,2], [3,4]]; 
M:= Matrix(LL); 
 
So here is another solution in line with your original wishes.  This is 
"index free", but the table-based solution I gave earlier should be 
faster.  (It is usually considered bad form to repeatedly append to a list or sequence.) 
 
L:= [][]; # Create a NULL sequence 
do 
   line:= readline(file); 
   if line::string then 
      if line contains valid data then 
         Z:= a list of that data; 
         L:= L, Z 
      fi 
   else 
      break 
   fi 
od 
 
A:= Matrix([L]); # Note []: seq -> list.
 

To move move a column into a matrix: Here, I want to copy 2nd column to the 3rd column:

A; \[ \left [ \begin {array}{ccc} 1&2&3\\ 3&6&7\\ 5&6&9\\ 7&7&7 \end {array} \right ] \]

B:=A[1..row,2]; \[ \left [ \begin {array}{c} 2\\ 6\\ 6\\ 7 \end {array} \right ] \]

 A[1..row,3]:=B: A;

\[ \left [ \begin {array}{ccc} 1&2&2\\ 3&6&6\\ 5&6&6\\ 7&7&7 \end {array} \right ] \]

13 return more than value from a procedure

Maple can return multiple values. Make sure to use the comma "," in the body of the procedure to separate each return value. Example:

size_matrix:=proc(x) 3*x, 4*x; end proc; 
row,col :=size_matrix(5);
 

14 How does maple handle procedure arguments?

When passing a variable to maple procesure, the variable VALUE is passed to the procedure (This is different from say Fortran where the default is pass by reference). But this is the same as with Mathematica.

For example, if a variable X had value 10, then you call a procedure FOO passing it X, then inside FOO, X will be the number 10, not the argument variable X. So, this means one can not have X on the left hand side inside FOO. Like this x:=1

The only way to assign new value to the input and return new value, is to use a local variable, like this:

one:= proc(x) 
        local y; 
        print(x); 
        y:=x+ 1; 
        print(x); 
        y; 
        end proc; 
 
z:='z'; 
z:=5; 
f:=one(z); 
 
      f := 6
 

15 How to define your own data types?

Use `type/name` to define new type name.

`type/char`:= x-> x::string and length(x)=1; 
 
P:= proc(c::char) print(c) end proc: 
P("x"); 
                           "x" 
P("xy"); 
Error, invalid input: P expects its 1st argument, c, to be of type char, but received xy 
 
> `type/byte`:= x-> x::integer and (x>= 0 and x<256); 
 
#will define a byte (unsigned integer)
 

16 find max element and position in matrix

Code from net by Carl Devore:

MMax:= proc(M::{Matrix,matrix}) 
   local C,r,c,mx,L,p; 
   C:= op(`if`(M::Matrix, [1,2], [2,2,2]), eval(M)); 
   L:= map(op, convert(M, listlist)); 
   mx:= max(L[]); 
   member(mx,L,'p'); 
   r:= iquo(p, C, 'c'); 
   mx, `if`(c=0, [r,C], [r+1,c]) 
end;
 

Code below from C W

A:=matrix(12,12,rand(100)); 
Ao:=array((proc(E) 
            local i; [seq(i=(rhs=lhs)(E[i]),i=1..nops(E))]end) 
            (sort(op(3,eval(A)),proc(E1,E2) if rhs(E1)>rhs(E2) 
             then 
                  true 
             else 
                  false 
             fi 
           end))); 
           Ao[1];
 

17 How to create a package?

First create the module:

restart; 
 
nma:= module() 
      option package; 
      export getMaxMatrix; 
      getMaxMatrix := proc (M::{matrix, Matrix}) 
          local C, r, c, mx, L, p; 
          C := op(`if`(M::Matrix,[1, 2],[2,2,2]),eval(M)); 
          L := map(op,convert(M,listlist)); 
          mx := max(L[]); member(mx,L,'p'); 
          r := iquo(p,C,'c'); 
          mx, `if`(c = 0,[r, C],[r+1, c]) 
       end proc; 
end module; 
 
A:= Matrix( [ [1, 2, 3] , 
              [3, 6, 7] , 
              [5, 6, 9] , 
              [7, 7, 7] 
            ]); 
 
nma[getMaxMatrix](A);|
 

Gives 9, [3, 3]. Now save the module.

savelibname := "C:/MAPLE_PACKAES"; 
march('create', savelibname, 20);
 

now save the library to disk.  savelib(nma);

Now we can test everything by reinitialize everything and reload the library.

>restart 
#Add my library to LIBNAME 
>libname:="C:/MAPLE_PACKAGES",libname; 
> A:=matrix( [ [1,2,3],[4,6,9] ]); 
>with(nma); 
>nma[getMaxMatrix](A);
 

Now to print a proc() in the package, do

>interface(verboseproc=3); 
> print(nma[getMaxMatrix]);
 

Now you can list what packages exist in the archive:

march('list',savelibname); 
march('extract',savelibname,":-1.m","C:MAPLE_PACKAGES/t.m")
 

Some notes. need to clean later

> module1lib:=`module1\\lib`; 
> system("md "||module1lib); 
> march('create',module1lib,100); 
> makehelp(module1,`module1/module1.mws`,module1lib): 
> makehelp(`module1/export1`,`module1/export1.mws`,module1lib): 
> savelibname:=module1lib: ### doesn't affect current libname 
> savelib(module1); ### no error message 
> restart; 
> module1lib:="module1\\lib": 
> libname:=module1lib,libname; ### now Maple will find module1 
> with(module1); 
> ?module1
 

Also there is a long thread here on Maple prime on making personal packages in Maple How-To-Create-A-Personal-Package

18 How to convert from floating point to Hex?

From: Robert Israel (israel@math.ubc.ca) 
Subject: Re: Getting non-integral results in hex 
Newsgroups: comp.soft-sys.math.maple 
Date: 2003-06-13 00:07:37 PST 
 
I assume you mean floating-point numbers.  Note that 
Maple floats (as opposed to "hardware floats") are 
in fact stored in base 10.  To convert a float to hex 
with n digits after the ".", you can use this: 
 
> `convert/hexfloat`:= proc(x::numeric, n::nonnegint) 
  local A,B,ax,R; 
  if nargs = 1 then return procname(x,round(Digits*log[16](10))) fi; 
  if x = 0 then return cat(`0.`,`0`$n) fi; 
  ax:= abs(x); 
  A:= floor(ax); 
  B:= round(frac(ax)*16^n); 
  if B = 16^n then A:= A+1; B:= 0 fi; 
  R:= cat(convert(A,hex),`.`); 
  if x < 0 then R:= cat(`-`,R) fi; 
  cat(R,substring(convert(16^n+B,hex),2..-1)); 
  end; 
 
And then, e.g.: 
 
> convert(1234.5678, hexfloat, 4); 
 
                               4D2.915B
 

19 How to find taylor series expansion of functions?

mtaylor(sin(x),[x],10);

\[ x-1/6\,{x}^{3}+{\frac {{x}^{5}}{120}}-{\frac {{x}^{7}}{5040}}+{\frac { {x}^{9}}{362880}} \]

20 How to print elements of a matrix?

restart; 
a:=Matrix([  [2,3,4],[4,5,6]   ]); 
nRow,nCol :=LinearAlgebra[Dimension](a); 
for i from 1 to nRow do 
    for j from 1 to nCol do 
        printf("a(%d,%d)=%d\n",i,j,a[i,j]); 
    end do; 
end do; 
 
a(1,1)=2 
a(1,2)=3 
a(1,3)=4 
a(2,1)=4 
a(2,2)=5 
a(2,3)=6
 

21 How to find determinant of matrix?

restart; 
a:=Matrix([ [2,4],[5,7] ]); 
LinearAlgebra:-Determinant(a); 
         -6
 

22 How to generate Hilber matrix?

H := LinearAlgebra:-HilbertMatrix(5);

\[ \left [ \begin {array}{ccccc} 1&1/2&1/3&1/4&1/5\\ \noalign {\medskip }1/ 2&1/3&1/4&1/5&1/6\\ \noalign {\medskip }1/3&1/4&1/5&1/6&1/7 \\ \noalign {\medskip }1/4&1/5&1/6&1/7&1/8\\ \noalign {\medskip }1/5&1/6&1 /7&1/8&1/9\end {array} \right ] \]

23 How to plot matrix data?

Matlab is much easier here. In maple, need to covert the matrix to a list of list of points first.

restart; 
H := LinearAlgebra:-HilbertMatrix(5): 
nRow,nCol :=LinearAlgebra[Dimension](H): 
L:=[seq([seq( [i,j,H[i,j]], i=1..nRow) ], j=1..nCol)]: 
plots:-surfdata(L);
 

24 How to catch an error from a proc()?

An error in maple raises an exception. So, use try catch to trap it as follows:

try 
   v,pos:=MMax(4); 
catch: 
   printf("an error is cought\n"); 
end try;
 

25 How to convert 3456 to 3,456 ?

From the net, by Carl Devor:

`print/commas`:= proc(N::integer) 
    local n,s,i,b; 
    n:= ListTools:-Reverse(convert(abs(N), base, 1000)); 
    if N<0 then n:= subsop(1= -n[1], n) fi; 
    nprintf("%s", sprintf(cat("%d", ",%03d" $ nops(n)-1), n[])) 
 end proc: 
 
commas(456554); 
 
         456,554
 

To convert a string to array of chars use array(StringTools:-Explode(S))

s:="Nasser M. Abbasi": 
r:=array(StringTools:-Explode(s)); 
              r:=["N" "a" "s" .......]
 

Now can use the string as normal array

r[4]; 
      "s"
 

26 How to use units ?

Units[GetDimensions](base); 
 amount_of_information, amount_of_substance, currency, electric_current, length, 
 logarithmic_gain, luminous_intensity, mass, thermodynamic_temperature, time
 

27 How to evaluate catlan number and other sums?

Use the Sum command.

restart; 
expr:= (-1)^i/(2*i+1)^2; 
Sum(expr,i=0..infinity); 
evalf(%,50); 
          0.91596559417721901505460351493238411077414937428167
 

Notice, if I used the sum command instead of the Sum command I get this result:

sum(expr,i=0..infinity); 
          Catalan
 

28 write a text file that contains a package, and load it

This shows how to do a simple package and use it without building a library. Just using a plain text file.

Create this nma_pkg1.txt file:

 
nma_pkg1 := module() 
  export f1; 
  option package; 
 
  f1:= proc() 
       print("in pakcage nma_pkg1"); 
  end proc; 
 
end module;
 

now save it, and from maple do

>read("c:\\nma_pkg1.txt");
 

now execute f1() as this:

>nma_pkg1[f1](); 
          "in pakcage nma_pkg1"
 

now put it in a library (so that we can use with, instead of read)

> savelibname:=("c:/maple"); 
> march('create', savelibname, 20); 
> savelib(nma_pkg1); 
>restart; 
> libname := "c:/maple",libname; 
> with(nma_pkg1); 
> f1(); 
    "in pakcage nma_pkg1"
 

now make changes to the nma_pkg1.txt file and updated again as above.

29 How to find what packages are included in maple

?index,package

30 How to plot the gradiant vector field?

restart; 
f:=3*x^2 + y* cos(x*y); 
the_grad :=linalg[grad](f,[x,y]); 
plots[fieldplot](the_grad,x=-2..2,y=-2..2);
 

or

or can do it in just one command: plots[gradplot](f,x=-2..2,y=-2..2);

31 How to put the digits of Pi into a list?

Suppose you want the 100 digits of Pi put in a list. This is one way to do it:

restart; 
L:=evalf(Pi,100); 
S:=convert(L,string); 
the_list:=[seq(parse(S[i]),i=3..length(S))]; 
 
    the_list := [1, 4, 1, 5, 9, 2, 6, 5, 3, ..
 

This below now tells how many times each digits occurs.

>stats[transform,tally](the_list); 
 
[Weight(0, 8), Weight(1, 8), Weight(2, 12), Weight(3, 11), 
Weight(4, 10), Weight(5, 8), Weight(6, 9), Weight(7, 7), 
Weight(8, 13), Weight(9, 13)]
 

32 Digits of PI in maple and mma

Written sometime in 2005? I should really record the time when I write something.

I just run these now, Auust 2014, and now Maple 18 as very fast. So this all below is no longer valid. I will leave it here for now for reference until I update it all later

I have written a few lines of code, which counts how many times each digit occurs after the decimal points of \(\pi \)

Written this in maple first. Then did similar thin in mma 5.0. Both are run on the same PC. No other applications are running at the time when I run the code.

The basic idea of the algorithm is to use evalf(Pi,digits) in maple to find \(\pi \) for any number of decimal digits, and to use N[Pi,digits] in mma for doing the same. (Where the variable digits above is the number of digits)

Then in maple convert the above \(\pi \) to a string, and generate a sequence of the characters to right of decimal point, then use stats[transform,tally] to do the actual counting.

In mma, I use RealDigits[] to get a list of the digits, and then use Count[] to do the counting.

This is result of some of the runs to find Pi to some digits, and the total time (to find Pi and do the counting)

All times are in cpu seconds, machine is P4, 2.8 Ghz, 500 MB of RAM, single CPU, hyperthreading enabled, running XP home edition. Maple 9.03 student version, and mma 5.0 student version.

Below is the result, and below that I show the maple code and the mma code.

Because of this, before each run in mma, I exited the application and started it fresh. In maple, it does not matter for the above reason.

100,000 digits: 
             Find_Pi     Total 
Maple 9.0      55          84 
Mma 5.0        0.9         1.54
 

Mma is 60 times faster in finding pi and about 56 times faster overall

300,000 digits: 
             Find_Pi     Total 
Maple 9.0     309         781 
Mma 5.0       3.7         6
 

Mma is 300 times faster in finding Pi, and 130 times faster overall.

3,000,000 digits 
             Find_Pi     Total 
Maple 9.0 
Mma 5.0        85        118 
 
Maple time in hours ! Still running.
 

Maple code

> restart; 
startingTime :=time(); 
L:=evalf(Pi,100000): 
timeToFindPiInSecs:=time()-startingTime; 
S:=convert(L,string): 
the_list:=[seq(parse(S[i]),i=3..length(S))]: 
stats[transform,tally](the_list); 
endingTime :=time(): 
cpuTimeInSecs := endingTime - startingTime;
 

mma code

Clear[] 
startingTime=TimeUsed[] 
t1=N[Pi,100000]; 
timeToFindPiInSecs=TimeUsed[]-startingTime 
{c,d}=RealDigits[t1]; 
theList=c[[Range[2,Length[c]]]]; 
f[digit_]:=Count[theList,digit]; 
r=Range[0,9]; 
Map[f,r] 
cpuTimeInSecs=TimeUsed[]-startingTime
 

update 12/25/03 Changed maple code on how to do the counting : To use

StringTools[CharacterFrequencies](S)
 

Now the counting in maple is much faster. It is always hard to know which is the best function to use.

restart; 
 startingTime :=time(); 
 L:=evalf(Pi,300000): 
 timeToFindPiInSecs:=time()-startingTime; 
 S:=convert(L,string): 
StringTools[CharacterFrequencies](S); 
endingTime :=time(): 
cpuTimeInSecs := endingTime - startingTime;
 

33 How to find where functions are?

From: Ken Lin (maplemath@tp.edu.tw) 
Subject: Re: how to find which package a function belongs to? 
Newsgroups: comp.soft-sys.math.maple 
Date: 2003-12-04 03:49:26 PST 
 
When Maple first loaded, There are only two kinds of "internal" 
commands which can be called directly. One is the "kernal" commands 
coded in C, and the other includes many "internal" prodecures 
programmed by the kernal commands which lies in the "Main Library", 
There are also many other "external" procedures which were categorized 
into so called "packages", plots[display](...) for example, plots[] is 
a package(Library), and display() is the prodecure inside plots[]. All 
the packages can be loaded by with() command, like 
> with(plots); 
 
 
Because Different Packages include user library might have the same 
procedure name, Maple doesn't realize the "procedure_name" you type 
in, it took it for a "symbol". If you really want to know which 
packages provided