MaplePrimes Announcement

Every engineer knows the part of the job that never makes it into the design review highlights. It’s the worst-case check you redo because a part changed. It’s the sizing calculation rebuilt for the third project in a row. It’s the report that has to record every step, so someone else can follow your work and sign it off.

Today we’re launching Maple Loop, an AI engineering agent from Maplesoft built to take on exactly that work. Here’s what it does.

Give it a problem, not a formula

Working with Maple Loop starts the way you’d brief a colleague. You describe the problem and point it to your files: schematics, datasheets, requirements, test data. Here’s a prompt from one of our worst-case circuit analysis runs:

“Our 3.3 V rail monitor resets the processor when the rail drops. The reset has to happen between 3.00 V and 3.20 V. Will that work with the parts we chose?"

From there, Maple Loop plans the work and moves through it the way an engineering team would: requirements, design, analysis, verification. It checks each phase before moving on. When it’s done, it comes back with the tolerance build-up for each part, the part costing the most margin, and a ranked list of fixes with what each one buys you.

You can start from a blank prompt like this one, or from a template for common jobs such as worst-case circuit analysis or PID control design. See it in action. 

Why the math runs in Maple

This is the part we care about most. General AI tools are good at producing answers, but in engineering an answer you can’t verify isn’t worth much. A plausible number from a language model can be wrong in ways that are hard to spot, and it gives your reviewers nothing to check.

So, Maple Loop splits the job.

 

You get the engineering, not just the answer

What comes back isn’t a chat transcript. It’s working files in tools you already know, with the full calculation inside.

Calculations arrive as Maple Flow documents, laid out like a clean hand calc with units carried through every step, ready for review. Full derivations come as Maple worksheets. And when a problem calls for system behavior, Maple Loop builds a MapleSim model you can simulate and tune.

The rest of the team doesn’t need Maple to benefit. From the same checked calculation, Maple Loop can produce Word reports, PDFs, Excel workbooks, PowerPoint decks, generated code and shareable dashboards.

Because everything is built on live Maple documents, the work doesn’t go stale. When a part changes, you change the input and rerun, and the analysis and documents update together. The next design revision starts from a working calculation instead of a blank page.

A new way to put Maple to work

Maple has always been about getting the math right. With Maple Loop, we’re putting the same engine to work in a new way, at the center of an AI agent that carries engineering projects from the first prompt to a reviewed result. It’s a natural next step for Maple: the same math you already rely on, now doing the work inside an engineering workflow.

Get access to Maple Loop

We’ve been testing Maple Loop with engineering teams on real problems across electrical and mechanical work, and many more.

Join the waitlist for access to Maple Loop.

What routine analysis would you hand off first? Which workflows should we focus on next?

Tell us in the comments.

Featured Post

In my third year as a computer science undergraduate at a university in Hong Kong, I began studying the mathematics department’s ordinary differential equations courses on my own. I was already comfortable programming in C and Java, and I had long enjoyed mathematics and physics. ODEs gave me a question that brought those interests together. Working through examples in Kamke’s handbook, I kept encountering substitutions and rearrangements that were easy to verify once someone showed them to me, but hard to discover in the first place. Could a systematic theory explain when those tricks work and how to find them?

Discovering Maple changed how I thought about that question. Through its documentation and the work of E. S. Cheb-Terrab and others, I learned how Lie symmetries, differential invariants, and first integrals can make parts of ODE solving systematic. I also began studying Liouvillian integrability, invariant algebraic curves, and differential Galois theory. I found myself asking what structure an equation reveals, even when its solutions resist a familiar closed form.

Abel equations became a natural place to look. Their solution structure is rich, and differential invariants under changes of the independent variable and affine changes of the dependent variable give a way to compare equations that look quite different. The classification of integrable Abel equations by Cheb-Terrab and A. D. Roche made that idea concrete: equations scattered across different sources could be recognized as members of the same class. I began to wonder how far we could take this if the substitution itself were allowed to be nonlinear.

I started working systematically on this inverse problem around the first year of graduate school. Given a rational first-order equation y' = M(x,y)/N(x,y), can we recover a nonconstant rational substitution u = A(x,y)/B(x,y) that leaves x unchanged and makes u' a polynomial in u? If the reduced equation belongs to a known integrable class, the substitution gives us a route to solving the original equation. Even when it does not, a successful reduction exposes structure that is hard to see in the original coefficients.

My first paper in Maple Transactions treated the nondegenerate case, where the relevant factors survive when the rational equation is put in lowest terms. The software from that work was subsequently licensed to Maplesoft. My second paper studied what happens when factors cancel. It develops a practical bounded search as well as a full algorithm that does not require the user to supply a degree bound for the transformation.

The insight I found most rewarding was that cancellation can point to an invariant algebraic curve of the original system. In the cancellation setting treated in the paper, a factor that disappears from the reduced fraction can encode an algebraic solution curve. Recovering it can therefore give us two things at once: a substitution that simplifies the ODE and geometric information about the original vector field. Invariant algebraic curves can be difficult to find directly. Obtaining one as part of a reduction is a good example of what I value in Maple’s approach to ODEs: a symbolic computation can tell us something about the equation even before we ask for its general solution.

The cancellation case is also the more expensive one. When the initial constraints leave several possibilities, the algorithm may have to fall back on nonlinear algebra. In discussions with GPT, one suggestion gave me a particularly useful way to approach that bottleneck: expand the reduction identity locally at a pole, then use the first few terms—the jet—to derive linear constraints on the unknown numerator.

Those constraints can be tested at a regular rational value of x, using exact arithmetic. A branch whose necessary conditions are inconsistent can be discarded before costly symbolic elimination. For a surviving branch, the symbolic calculation still takes place over the rational function field. If the linear constraints determine a unique normalized numerator, the implementation can recover the target coefficients and verify the substitution directly. Otherwise, it retains the nonlinear fallback. The main gain is that expensive computations are reserved for branches that survive cheaper tests; the speedup depends on how much those tests narrow the search.

Maple source (.mpl):GeneralizedAbel_Maple.txt

For inputs over the rational numbers, ReduceHigher is sound and complete for target equations of actual degree n > 2, with the independent variable unchanged and no user-supplied bound on the transformation degrees. Every reported reduction satisfies the exact differential identity, and a completed search can rule out reductions in this class. That guarantee does not extend to the general Riccati case n = 2.

Load the source with read and pass the numerator and denominator of the original slope:

restart:
read "GeneralizedAbel.mpl":

M := (y+x)^5 + (x*(y+x)-2)*(y-1)^2:
N := (y-1)*(y-x-2):

t0 := time():
R := GeneralizedAbel:-ReduceHigher(M, N, x, y, u):
elapsed := time()-t0:

R["status"];
R["transformation"];
R["equation"];
R["residual"];
elapsed;

In one Maple 2026 run, the search returned FOUND in 0.171 seconds of CPU time, excluding source loading. The transformation and reduced equation were:

u = (x^2 + y^2 + 2*x)/(y - 1)
u' = (u + 2*x)^3 + x*(u + 2*x) - 2

The exact residual was 0. The returned substitution is a normalized form of v = (y+x)^2/(y-1), with v = u + 2*x. In this form, the cancelled factor y+x also has a geometric interpretation: the line y = -x is an invariant algebraic solution curve of the original equation.

I plan to attend ISSAC 2027 in Tsukuba, Japan, July 12–15. If you work on ODEs, symbolic computation, or invariant curves, I would love to meet you there and hear what examples or questions you would bring to this problem. I would also like to share some of the projects related to Maple that I am currently working on.

I hope the Maple community will see rational reduction as a symbolic computation problem in its own right. Finding a change of variables, deciding whether one exists in a specified class, and understanding what it reveals about a vector field are worthwhile goals—even when the next step is not a call to dsolve.

— Shaoxuan Huang

Featured Post

Did you know that November 23rd is Fibonacci Day? Writing the date as 11/23 gives us the first four nonzero numbers of the famous Fibonacci sequence:

1, 1, 2, 3, 5, 8, 13, 21...

Each number is the sum of the two numbers before it, creating a simple pattern with some surprisingly interesting properties!

From spirals and sunflowers to the golden ratio, the Fibonacci sequence appears in all sorts of unexpected places. Over the years, our Maple community has explored some fascinating ways of visualizing and understanding this famous sequence.

To celebrate Fibonacci Day, I thought we could revisit some of these posts and see just how much can come from such a simple pattern!

One of the most interesting things about the Fibonacci sequence is its connection to the golden ratio.

If you divide one Fibonacci number by the number before it, you'll notice that the ratio gets closer and closer to approximately 1.618 as you move further along the sequence. This number is known as the golden ratio, often represented by the Greek letter φ (phi). 

You can explore this relationship in the Maple Learn document Fibonacci Sequence & the Golden Ratio.

The golden ratio has some pretty interesting mathematical properties of its own! For a deeper look, check out the Maple Learn document The Most Irrational Number.

One of the most recognizable visualizations associated with the Fibonacci sequence is the Fibonacci spiral. By arranging squares with side lengths corresponding to Fibonacci numbers and drawing arcs through them, we can create a beautiful spiral pattern. Seen below is the spiral created from side lengths 1, 1, 2, 3, 5, 8, 13.

You can explore this further in this Maple Learn document.

Spiral patterns can also be found throughout nature, from seashells to the arrangements of seeds in sunflowers. Although not every spiral in nature follows the Fibonacci sequence exactly, the mathematical connections are still fascinating!

The MaplePrimes post Math in Nature explores some of these connections, including the golden angle, which helps us understand the arrangement of seeds in a sunflower. You can investigate this pattern yourself using the Golden Angle document in Maple Learn!

Here's a fun one: did you know that the Fibonacci sequence is hidden inside Pascal's Triangle?

Pascal's Triangle is constructed by adding the two numbers directly above each entry. But if you add the numbers along its shallow diagonals instead, something interesting happens. The sums form the Fibonacci sequence!

The Maple Learn document Pascal's Triangle and the Fibonacci Sequence provides a great way to explore this connection.

You can also check out the MaplePrimes post Pascal's Triangle Collection for even more surprising patterns hidden within this familiar triangle.

If you're a Maple user, check out the FibonacciNumbers and GoldenAngle Math Apps! These interactive applications offer another way to explore Fibonacci numbers and visualize the mathematical patterns associated with the golden angle.

You can also use the combinat:-fibonacci command to compute Fibonacci numbers and Fibonacci polynomials directly in Maple.

From a simple sequence of numbers to spirals, geometry, and patterns in nature, the Fibonacci sequence reminds us that some of the most interesting mathematical ideas can come from surprisingly simple beginnings!

Do you have a favourite Fibonacci identity, application, or unexpected place you've encountered the sequence? Let us know in the comments, and happy Fibonacci Day!



Naming of frontend

Maple asked by C_R 4089 November 20