Application developed using Maple and MapleSim. You can observe the vector analysis using Maple and the simulation using MapleSim. Also included a video of the result. It is a simple structure. A pole fastened by two cables and a force applied to the top. The results are to calculate tensions one and two. Consider the mass of each rope. In spanish.

Integral transforms, implemented in Maple as the inttrans package, are special integrals that appear frequently in mathematical-physics and that have remarkable properties. One of the main uses of integral transforms is for the computation of exact solutions to ordinary and partial differential equations with initial/boundary conditions. In Maple, that functionality is implemented in dsolve/inttrans and in pdsolve/boundary conditions.

During the last months, we have been working heavily on several aspects of these integral transform functions and this post is about that. This is work in progress, in collaboration with Katherina von Bulow.

The integral transforms are represented by the commands of the inttrans package:

>

(1)

Three of these commands, addtable, savetable, and setup (this one is new, only present after installing the Physics Updates) are "administrative" commands while the others are computational representations for integrals. For example,

>

(2)

>

(3)

For all the integral transform commands, the first argument is the integrand, the second one is the dummy integration variable of a definite integral and the third one is the evaluation point. (also called transform variable). The integral representation is also visible using the convert network

>

(4)

Having in mind the applications of these integral transforms to compute integrals and exact solutions to PDE with boundary conditions, five different aspects of these transforms received further development:

•

Compute Derivatives: Yes or No

•

Numerical Evaluation

•

Two Hankel Transform Definitions

•

More integral transform results

•

Mellin and Hankel transform solutions for Partial Differential Equations with boundary conditions

The project includes having all these tranforms available at user level (not ready), say as FourierTransform for inttrans:-fourier, so that we don't need to input anymore. Related to these changes we also intend to have not return anymore, and return itself instead, unevaluated, so that one can set its value according to the problem/preferred convention (typically 0, 1/2 or 1) and have all the Maple library following that choice.

The material presented in the following sections is reproducible already in Maple 2019 by installing the latest Physics Updates (v.435 or higher),

Compute derivatives: Yes or No.

For historical reasons, previous implementations of these integral transform commands did not follow a standard paradigm of computer algebra: "Given a function , the input should return the derivative of ". The implementation instead worked in the opposite direction: if you were to input the result of the derivative, you would receive the derivative representation. For example, to the input you would receive . This is particularly useful for the purpose of using integral transforms to solve differential equations but it is counter-intuitive and misleading; Maple knows the differentiation rule of these functions, but that rule was not evident anywhere. It was not clear how to compute the derivative (unless you knew the result in advance).

To solve this issue, a new command, setup, has been added to the package, so that you can set "whether or not" to compute derivatives, and the default has been changed to computederivatives = true while the old behavior is obtained only if you input . For example, after having installed the Physics Updates,

>

(1.1)

the current settings can be queried via

>

(1.2)

and so differentiating returns the derivative computed

>

(1.3)

while changing this setting to work as in previous releases you have this computation reversed: you input the output (1.3) and you get the corresponding input

>

(1.4)

>

(1.5)

Reset the value of computederivatives

>

(1.6)

>

(1.7)

In summary: by default, derivatives of integral transforms are now computed; if you need to work with these derivatives as in previous releases, you can input . This setting can be changed any time you want within one and the same Maple session, and changing it does not have any impact on the performance of intsolve, dsolve and pdsolve to solve differential equations using integral transforms.

>

Numerical Evaluation

In previous releases, integral transforms had no numerical evaluation implemented. This is in the process of changing. So, for example, to numerically evaluate the inverse laplace transform (invlaplace command), three different algorithms have been implemented: Gaver-Stehfest, Talbot and Euler, following the presentation by Abate and Whitt, "Unified Framework for Numerically Inverting Laplace Transforms", INFORMS Journal on Computing 18(4), pp. 408–421, 2006.

For example, consider the exact solution to this partial differential equation subject to initial and boundary conditions

>

>

Note that these two conditions are not entirely compatible: the solution returned cannot be valid for and simultaneously. However, a solution discarding that point does exist and is given by

>

(2.1)

Verifying the solution, one condition remains to be tested

>

(2.2)

Since we now have numerical evaluation rules, we can test that what looks different from 0 in the above is actually 0.

>

(2.3)

Add a small number to the initial value of t to skip the point

>

The default method used is the method of Euler sums and the numerical evaluation is performed as usual using the evalf command. For example, consider

>

The Laplace transform of F is given by

>

(2.4)

and the inverse Laplace transform of LT in inert form is

>

(2.5)

At we have

>

(2.6)

>

(2.7)

This result is consistent with the one we get if we first compute the exact form of the inverse Laplace transform at t = 1:

>

(2.8)

>

(2.9)

In addition to the standard use of evalf to numerically evaluate inverse Laplace transforms, one can invoke each of the three different methods implemented using the MathematicalFunctions:-Evalf command

>

(2.10)

>

(2.11)

>

(2.12)

>

(2.13)

Regarding the method we use by default: from a numerical experiment with varied problems we have concluded that our implementation of the Euler (sums) method is faster and more accurate than the other two.

Two Hankel transform definitions

In previous Maple releases, the definition of the Hankel transform was given by

where is the function. This definition, sometimes called alternative definition of the Hankel transform, has the inconvenience of the square root in the integrand, complicating the form of the hankel transform for the Laplacian in cylindrical coordinates. On the other hand, the definition more frequently used in the literature is

With it, the Hankel transform of is given by the simple ODE form . Not just this transform but several other ones acquire a simpler form with the definition that does not have a square root in the integrand.

So the idea is to align Maple with this simpler definition, while keeping the previous definition as an alternative. Hence, by default, when you load the inttrans package, the new definition in use for the Hankel transform is

>

(3.1)

You can change this default so that Maple works with the alternative definition as in previous releases. For that purpose, use the new inttrans:-setup command (which you can also use to query about the definition in use at any moment):

>

(3.2)

This change in definition is automatically taken into account by other parts of the Maple library using the Hankel transform. For example, the differentiation rule with the new definition is

>

(3.3)

This differentiation rule resembles (is connected to) the differentiation rule for BesselJ, and this is another advantage of the new definition.

>

(3.4)

Furthermore, several transforms have acquired a simpler form, as for example:

>

(3.5)

Let's compare: make the definition be as in previous releases.

>

(3.6)

>

(3.7)

The differentiation rule with the previous (alternative) definition was not as simple:

>

(3.8)

And the transform (3.5) was also not so simple:

>

(3.9)

Reset to the new default value of the definition.

>

(3.10)

>

(3.11)

More integral transform results

The revision of the integral transforms includes also filling gaps: previous transforms that were not being computed are now computed. Still with the Hankel transform, consider the operators

>

Being able to transform these operators into algebraic expressions or differential equations of lower order is key for solving PDE problems with Boundary Conditions.

Consider, for instance, this ODE

>

(4.1)

>

(4.2)

Its Hankel transform is a simple algebraic expression

>

(4.3)

An example with formula_plus

>

(4.4)

>

(4.5)

In the case of hankel , not just differential operators but also several new transforms are now computable

>

(4.6)

>

(4.7)

>

Mellin and Hankel transform solutions for Partial Differential Equations with Boundary Conditions

In previous Maple releases, the Fourier and Laplace transforms were used to compute exact solutions to PDE problems with boundary conditions. Now, Mellin and Hankel transforms are also used for that same purpose.

Example:

>

>

(5.1)

As usual, you can let pdsolve choose the solving method, or indicate the method yourself:

>

>

(5.2)

It is sometimes preferable to see these solutions in terms of more familiar integrals. For that purpose, use

>

(5.3)

An example where the hankel transform is computable to the end:

One of my favorite videogames is pokémon as you can probably guess from the title. As a player I always wanted to optimize my chances of obtaining the rarest and best pokémon in the game. I have been working on an application that aims to use graph theory to analyze the game Pokémon Blue. The application explores the following questions:

Which is the rarest pokémon in the game?
Where can I find an specific pokémon and with what probabilities?
What is the place with most different species of wild pokémon?

I also included algorithms for the following: Given a certain desired team

Find the minimum amount of places to visit to catch them and return the list of the places the player will need to visit.

What are the routes with best probabilities to catch each pokémon from my desired team?