For Maple 2021, the map command and some other built-in commands related to it (such as element-wise operators and zip) have been sped up significantly for common operations. In particular, there is a facility that recognizes some operations that are frequently mapped, and uses a faster implementation for these operations in cases where that is applicable. Here are some examples. We ran these on one particular machine in Maple 2020 and 2021. To be precise, we ran each call to CodeTools:-Usage in a new session, defining L each time, rather than in a single session as you see in this worksheet. The numbers shown after each command give the factor of reduction in memory used, the speedup in CPU time, and the speedup in real time.

The following were computed for L := [seq(-10^6..10^6)]

The following were computed for L := [seq(true, 1..10^6), false]

Note: The result (*) in the preceding table occurs because Maple manages to do this with almost no memory used in the current implementation.

The following were computed for L := [seq([i,i+1], i = -10^6..10^6)]

The following were computed for L := [seq(i = i+1, i = -10^6..10^6)]

The following were computed for L := [seq({i, 42}, i = -10^6..10^6)]

The following were computed for L := [seq("abc", 1..10^6)]

The differences in speedup between CPU time and real time, where present, are almost entirely caused by a reduction in garbage collection. Garbage collection is parallelized, so it takes more CPU time than real time; a reduction in garbage collection therefore benefits the CPU time more than the real time.

The version of the GMP library used for large integer arithmetic by Maple has been upgraded to version 6.2.0.  This adds improved support for new hardware, leading to small performance improvements for various integer operations.  Micro benchmarks for the basic integer operations (addition, multiplication, gcd, etc) show speedups in the range 5-10%.

The underlying algorithm to compute $\left(\genfrac{}{}{0ex}{}{a}{b}\right)$ for integer values of $a$ and $b$ in the binomial command has been improved in Maple 2021. Previously a recurrence formula was used that minimized the size of intermediate calculations, but could be very slow for large values of $b$.  Now the result is either computed more directly, or computed using the GMP implementation of binomial. The following computation is about 100 times faster in Maple 2021 than in Maple 2020.

CodeTools:-Usage( binomial( 200001, 50001 ) ):

memory used=0.53MiB, alloc change=0 bytes, cpu time=7.00ms, real time=6.00ms, gc time=0ns

The old binomial algorithm was highly optimized for computing, in order, sequences of binomial coefficients where the value of $a$ is fixed. That remains about the same speed in the new implementation.

CodeTools:-Usage( seq( binomial( 100000, i ), i = 1 .. 100000) ):

memory used=2.06GiB, alloc change=0.88GiB, cpu time=21.91s, real time=10.30s, gc time=15.96s

But now, it is also fast for sequences that are out of order or with fixed values of $b$. The following sequences are extremely slow to compute in previous versions of Maple.

a := 10^5-4; the_bs := Statistics:-Shuffle( [seq(i, i=1..a, 10^4)] ):

$a≔99996$

CodeTools:-Usage( seq( binomial( a, b),  b in the_bs) ):

memory used=398.33KiB, alloc change=0 bytes, cpu time=14.00ms, real time=13.00ms, gc time=0ns

Computing a 10000 element sequence is only about 100 times the cost of computing the first element.

CodeTools:-Usage( seq( binomial( 10000+i, 5000 ), i = 1 .. 9999) ):

memory used=65.28MiB, alloc change=0 bytes, cpu time=393.00ms, real time=393.00ms, gc time=0ns

The algorithm for computing multinomial coefficients in the command combinat:-multinomial has been improved so that it is computed using the binomial command and thus is now much faster than the previous algorithm which used a formula in terms of factorials. Examples like the following are now at least three times faster than in Maple 2020.

CodeTools:-Usage(combinat:-multinomial(104000, 11000, 21000, 31000, 41000)):

memory used=77.34KiB, alloc change=0 bytes, cpu time=1000.00us, real time=2.00ms, gc time=0ns

The following example is 10 times faster in Maple 2021 than in Maple 2020.

CodeTools:-Usage( combinat:-multinomial(1501500, seq(2000 .. 1000, -1)) ):

memory used=94.74MiB, alloc change=-1.11MiB, cpu time=707.00ms, real time=600.00ms, gc time=149.13ms

And special cases are now identified and computed almost instantly, avoiding the large factorial and integer division computations that result from a computation directly from the factorial formula.

combinat:-multinomial(10^10+2, 10^10, 1, 1);

$100000000030000000002$

Operations on numeric expressions (or more precisely, complex extended numeric expressions) in the Simple Units environment, provided by the Units[Simple] package, are much faster in Maple 2021. Here is an example.

with(Units):

Automatically loading the Units[Simple] subpackage

CodeTools:-Usage(Vector(10^4,i->sin(1.0*i),datatype=float[8])):

memory used=0.96MiB, alloc change=0 bytes, cpu time=15.00ms, real time=15.00ms, gc time=0ns

This example is 15 to 20 times faster and uses 15 to 20 times less memory than in Maple 2020.

A number of commands in the GraphTheory package perform faster in Maple 2021 compared to previous versions of Maple.  These performance improvements are noted in the What's New in Graph Theory? help page.

The Project command in the PolyhedralSets package now uses a faster algorithm that checks for redundant constraints.  For more information, see What's New in Polyhedral Sets?