When working with large sparse linear systems you often want to look at their non-zero structure, however Maple's existing tools are all designed for dense matrices. I wrote a little tool to produce images like this in reasonable time. You can download the code here, and the rest of this post is a quick tutorial on how to use the included command. Maple 11 is required.

The MapleReader has been the source of a bit of confusion on MaplePrimes lately. Hopefully with this post, we can help clear up some of the questions that have come up about it. The MapleReader is, as Scott03 mentioned in his response during a separate thread, an extension of Maple 11 that allows an eBook file format called an 'mbook' to be read. A number of authors are currently in the process of converting their content to an mbook file format, to be distributed independently of Maple. The reason why it was included in Maple 11.01 is to allow our authors access to it and it's updates for authoring purposes.

This is to inform you that we are now shipping the newest version of Maple T.A. – Maple T.A. 3.0. Maple T.A. is an easy-to-use web-based system for creating tests and assignments, automatically assessing student responses and performance. It supports complex, free-form entry of mathematical equations and intelligent evaluation of responses, making it ideal for mathematics, science, or any course that requires mathematics. The new edition – Maple T.A. 3.0 – comes with increased flexibility in content creation, an enhanced user interface and improved grading and assessment capabilities

Maplesoft has now posted the 11.01 update for users running Maple 11. You can download the update here . As the website mentions, this update includes improvements in the following areas:

• Differential Equations
• Maplets
• Physics Package updates
• Plot legends
• Vector Calculus

Who is entitled to Maple 11.01? Maple 11.01 is available to all users running Maple 11. If your Help>About Maple 11 dialog from the Standard Interface reads Maple 11.01, then you already have the update and no further action is required.

What is the largest linear system that Maple can solve? You might be surprised to find out. In this article we present strategies for solving sparse linear systems over the rationals. An example implementation is provided, but first we present a bit of background. Sparse linear systems arise naturally from problems in mathematics, science, and engineering. Typically many quantities are related, but because of an underlying structure only a small subset of the elements appear in most equations. Consider networks, finite element models, structural analysis problems, and linear programming problems.

Hello, I have been using MAPLE 10 for a long time, now I switched to MAPLE 11. With both versions I have been using the standard worksheet. The programs which I wrote for MAPLE 10 work for MAPLE 11 also. However, in MAPLE 11 the graphs that are produced by the programs seem to have a worse resolution. What could be the reason for that? More precisely, I solve an ODE numerically and then plot the solution with the odeplot-command. Then, I save the graph as an eps-file (by right-clicking on it, selecting export and choosing eps). Using MAPLE 10 the eps-graph has an excellent reolution, not so when I use MAPLE 11.

Maple 11 has been out for a while now so hopefully people have it. I thought I would write a short post detailing some of what was done in the area of Groebner bases. If you run the examples in Maple 10 and Maple 11, I would appreciate it if you could post the times and the specifications of your computer.

Here is another great comic from XKCD, I hope you like it:

Recently I was skimming on the Internet for algorithms for alignment of biological sequences (e.g. DNA sequences, protein sequences). The usual purpose of such comparisons is to determine the evolutionary genetic history of two sequences, which in the case of DNA you can think of as strings over the alphabet {A,G,C,T} (the nucleobases). Differences between sequences can arise though substitutions (A → G, G → A, C → T, or T → C), insertions, or deletions. In the last two cases, the resulting string differs in length from the original, and dealing with these size differences is the chief problem that alignment algorithms face. The Needleman-Wunsch algorithm is a very straightforward global sequence alignment algorithm, first proposed in 1970. It's a good example of the applicability of dynamic programming towards biological problems. Following is a Maple implementation based on this Ruby implementation. The algorithm depends on a similarity matrix which measures the "mutational distance" between two nucleobases. It takes two input strings, and returns two strings with dashes ("-") inserted to indicate insertion or deletion events between the sequences.

Free Examples in MM Free Library on mechofmat.com.

Free Examples in MM Free Library on mechofmat.com.

The Cartesian product of a sequence of m lists L₁, ..., L_n, with list i having n_i elements, is given by the sequence of Π_i n_i lists [L₁₁,...,L_m1], ..., [L_1n1,...,L_mnm], where L_jk is the k-th element of the j-th list.

The audience for this video of a blind date between exp(1) and Pi is not huge, but to the right one it is quite funny!

> f:=x->x*sqrt(1-cos(Pi/x));

> limit(f(x),x=infinity);

> L:=n->limit(f(x^n),x=infinity);

I did that for matrix inversion:

Here is some stuff for doing that by calling Maple from Excel. The reason is that one could care for extreme cases, where a really good precision is needed. I included an example how to switch to rationals, where the inversion can even be done exactly (do not use it for dimensions to high and then it would be better to do it solely in Maple + cut&paste).

To use it one must have Maple installed (I think at least version 8...