New features and updates in Advanced Math:
Branch Cuts of Mathematical Expressions
Intersecting Plane Curves
Linear Inequality Solving
Semialgebraic System Solving
Solving Equations with Branch Cuts
Maple 17 is the result of many thousands of hours of work by talented developers at Maplesoft as well as experts in research labs and universities all around the world. Maple 17 offers numerous advancements in a variety of branches of mathematics that push the frontiers of mathematical knowledge, including ground-breaking achievements in solving new classes of differential equations. Maple 17 also features major advancements in solving systems of equations, introducing new solution methods for polynomial and linear inequalities, as well as new algorithms for finding limits of bivariate rational functions.
Maple 17 introduces new packages in Group Theory and Signal Processing, and major updates to Graph Theory, Differential Geometry, Physics and Statistics. There are also new commands for finding intersecting points in algebraic curves, and updates to many core commands that solve and explore branch cuts in mathematical expressions.
The limit command has been enhanced for the case of limits of bivariate rational functions. Many such limits that could not be determined previously are now computable. The new algorithm specifically handles the case where the function has an isolated singularity at the limit point.
In Maple 16, the following limit calls would return unevaluated, but they can be computed in Maple 17:
Let us plot these three functions in the neighborhood of the origin:
In the last two examples, we can visually verify the existence of the limit.
In the first example, by inspecting the graph we can identify two different directions with different limits, namely y=x and y=−x. Indeed:
How does Maple determine these limits? Let us consider a circle C given by x2+y2=r2, where we will later let r →0. Using the theory of Lagrange multipliers, the extremal values (maxima and minima) of the function f on the circle, for a fixed radius r, satisfy the condition that the gradient of the function and the gradient of the constraint equation of the circle are parallel:
Thus, the maximal and minimal values of f on C occur when both C=0 and eq=0. For the bivariate limit, this means that it is sufficient to consider only those critical paths satisfying eq=0. In the example, there are two such paths, namely, y=x and y=−x, and indeed they are exactly the same two paths from above leading to the extremal values 12 and −12. Since we have found two directions with different limits, we can conclude that the bivariate limit does not exist.
The following graph depicts both critical paths in the x,y-plane:
Note that the critical paths are not necessarily always lines. For example, in the second example above:
In fact, we can give nonlinear closed form expressions for the critical paths:
In our example, the limits along all of the critical paths are identical:
This is a proof that the bivariate limit of g at the origin exists and is equal to 0.
The following graph depicts the function g as well as all of the critical paths:
The FunctionAdvisor can now compute, algebraically, branch cuts (discontinuities) of mathematical expressions involving compositions of +, *, ^, and possibly fractional powers, with every mathematical function call for which FunctionAdvisor knows the branch cuts, with no restrictions to the level of nesting in the expression. This new feature includes the ability to generate 2-D and 3-D plots of the cuts, so as to view where the cuts are located and how the function evolves from one cut to another one.
The segments of discontinuity are therefore located in the imaginary part of expression, ℑ⁡ln⁡z32.
You can rotate these plots with the mouse and use any of the options of plot, plot3d and plotcompare to observe the cuts in different ways.
A 2-D more abstract visualization of the same cuts:
A classic example in the theory of branch cut calculation: Kahan's teardrop
This expression is equal to zero for all values of z in the complex plane except for a small teardrop shaped region over the negative real axis, as shown in the following 3-D plot on the right (you can rotate it with the mouse). To see just the plot, without displaying the complicated algebraic description of the cuts, end the input with colon ':'
A new class of ordinary differential equations of Abel type, with non-constant invariants and depending on two arbitrary parameters, is now fully solvable in Maple 17. Additionally, a large number of changes were added to the routines for tackling ordinary and partial differential equations.
Ordinary differential equations
For 1st order ODEs, the simplest problem beyond the reach of complete solving algorithms is known as Abel equations. These are equations of the form
where y⁢≡yx is the unknown and the fi⁢≡fix and gj⁢≡gjx are arbitrary functions of x. The biggest subclass of Abel equations known to be solvable was discovered by our research team and is the AIR 4-parameter class. New in Maple 17, another 2-parameter class of Abel equations, beyond the AIR class, is now known and solvable.
The related class of Abel equations that is now entirely solvable consists of the set of equations that can be obtained from equation (3.1.1) by changing variables
where Fx and the four Pi⁡x,Qj⁡x are arbitrary rational functions of x; this is the most general rational transformation that preserves the form of Abel equations and thus generates Abel ODE classes.
Several changes were performed in the existing algorithms to optimize their functioning, resulting in new solutions for problems that were out of reach in previous releases.
Example: Second order linear equations
Example: Nonlinear ODE problems with initial values
Example: Third order nonlinear ODE depending on arbitrary function, a reduction to a Riccati equation
Partial differential equations
Changes were done in the existing algorithms for linear and nonlinear PDEs and systems of them, resulting in new solutions for more PDE problems.
Examples: Linear PDEs
Results can be verified with pdetest
Examples: PDE problems with boundary conditions
The verification with pdetest also verifies that the solution satisfies the boundary conditions given
Nonlinear PDE systems
Maple 17 has significant improvements to several GraphTheory commands, including:
TuttePolynomial, ChromaticPolynomial, FlowPolynomial, AcyclicPolynomial and RankPolynomial
In addition, two new commands were added to the package:
Improvements to TuttePolynomial, ChromaticPolynomial, FlowPolynomial, AcyclicPolynomial and RankPolynomial commands
The TuttePolynomial command uses a new algorithm that is faster and consumes less memory.
For example, computation of the Tutte polynomial of the 12 vertex complete graph (CompleteGraph(12)) now requires 1/3 the memory, and completes in 1/3 the time.
For the 9,3 generalized Petersen graph (PetersenGraph(9,3)) the memory usage has dropped to 1/6, and the time to 1/8 of the time needed in Maple 16.
memory used=106.98MiB, alloc change=0 bytes, cpu time=2.67s, real time=2.83s
memory used=3.21MiB, alloc change=0 bytes, cpu time=125.00ms, real time=149.00ms
These improvements propagate to the commands ChromaticPolynomial, FlowPolynomial, AcyclicPolynomial and RankPolynomial as well.
Improvements to IsIsomorphic command
The IsIsomorphic command now utilizes a new algorithm that scales better to larger problems. As an example, two isomorphic soccer ball graphs (SpecialGraphs[SoccerBallGraph]) with 60 vertices and 90 edges can be tested for isomorphism in less than one second in Maple 17, while in Maple 16 and earlier, this same computation did not complete in under 10 minutes.
memory used=448.29KiB, alloc change=0 bytes, cpu time=47.00ms, real time=50.00ms
The LaplacianMatrix command
The new LaplacianMatrix command can be used to compute the Laplacian matrix representation of a graph:
The ReliabilityPolynomial command
The new ReliabilityPolynomial command can be used to compute the reliability polynomial of a graph:
For Maple17, a new command, intersectcurves, has been added to the algcurves package.
Given two plane curves expressed as polynomials in two variables:
The intersectcurves command computes the points of intersection along with their multiplicities. Each set of intersection points is expressed as a list containing three values. The first two are irreducible polynomials, the second of which is in only one of the variables. The third value is either 0 or 1. When 1, the point is affine; when 0 it is a point in the projective plane (at infinity).
This is to be interpreted as follows. There are two intersection points of multiplicity 2, namely, (-1,0) and (1,0), indicating that they are points where the curves intersect tangentially. In addition, there are two intersection points of multiplicity 1, namely, 2,3 and 2,−3. We can see all intersection points graphically with a simple implicit plot.
The following example illustrates the case when there are intersection points at infinity.
There is one affine intersection point (0,-1) of multiplicity 1, plus one intersection point at infinity, of multiplicity 5. The tangent at this point is the line x=0. Each of the two blue vertical lines intersects each of the two asymptotes of the red curve at the infinite point 0,1,0. All but one of these intersections have multiplicity 1, and the exceptional one, between the blue line and the asymptote to the red curve at x=1, comes from a tangential intersection, of multiplicity 2.
We can perform a change of coordinates in order to plot this in the affine plane. First, we homogenize the equations, introducing a third variable z, and then we substitute y=1 in order to move the intersection point that was previously at infinity to the origin.
After the coordinate transformation, all intersection points (of h1 and h2) are visible in the plot and there are no intersection points at infinity.
The LinearSolve command in the RegularChains package, whose purpose is to solve systems of linear equations and inequalities, has been enhanced in several ways:
A more efficient algorithm based on Fourier-Motzkin elimination, has been implemented.
Two new options, canonical and projection, for controlling the form of the output have been added.
The examples below illustrate the use of this command and the two new options for computations with polyhedra.
Change of representation for polyhedra
There are at least two ways to mathematically describe a polyhedron, either by specifying its corners, or by specifying its bounding hyperplanes. We start by illustrating this using a cube of side length 1 with one corner at the origin and its three adjacent edges parallel to the three coordinate axes.
Plot the cube:
Define this cube by bounding planes:
Alternatively, define the vertices of the same cube:
Suppose now that we are given the vertex representation and want to automatically derive the bounding planes representation. The cube is defined as the convex hull of all its vertices:
We can now use the LinearSolve command to eliminate all λi from this system of equations and inequalities. We use the projection option to specify that elimination is required, and the canonical option to eliminate redundant equations and inequalities.
This agrees with the representation c1 above.
For every convex 3-D polyhedron, there is a dual polyhedron with the roles of corners and faces swapped. Let us compute the dual polyhedron of the cube. We start with a representation of the cube with the origin as the center.
Now we rewrite this in matrix form.
In general, if a bounded convex polyhedron is given by a set of inequalities of the form B.v≤1, then the vertices of its dual are exactly the columns of the matrix B. The convex hull of these six vertices defines an octahedron. Using the same method as before, we compute the bounding planes for this octahedron.
The first two inequalities represent that projection of the octahedron onto the x axis:
Together with the following four inequalities, which involve only x and y but not z, this defines the projection of the octahedron onto the x,y-plane:
The following plot shows this projection (blue) together with the four boundary lines.
Finally, the last 8 inequalities, i.e., the ones containing z, define the bounding planes of the octahedron.
The following 3-D plot displays the tetrahedron as well as the last of these 8 bounding planes. Rotate the plot with the mouse in order to see that the plane actually touches one of the faces.
The SolveTools[SemiAlgebraic] command has been integrated directly into the solve command, such that many systems involving non-linear polynomial inequalities that could not be solved previously, are solved.
In Maple 16, no solutions were found for the following system, but in Maple 17 it is easily solved:
A solution to such a system of inequalities is a decomposition of the feasible region of the inequalities into bands as can be seen in the inequality plot:
Additionally, the SemiAlgebraic command now can build case discussions for systems with real-valued parameters.
New functionality has been added to the solve command to account for branch cuts in the input equations and build piecewise expressions that are correct for substitution of parameters. This functionality is controlled with the new option symbolic=false. The default behavior in Maple 17 and previous versions of Maple, is the same as specifying symbolic=true.
While both sol1 and sol2 are valid for some values of the parameter a:
Only the solution using the symbolic=false option are valid for other values of the parameter:
Important Note: The default of the symbolic option is expected to change to false in a future version of Maple. Applications that rely on the current branch cut behavior should add symbolic=true to their calls to solve.
dsolve command, pdsolve command, Graph Theory package, algcurves[intersectcurves] command, solve command, SolveTools[SemiAlgebraic] command, limit command
Download Help Document