Hello, I use embedded components a lot, but I would like to create them dynamically from my own procedure, e.g. as an output. The reason is, that in new Mathematica 6 is possible to create a plot with slider to show an influence of variable to the plot. I would like to create the similar output in Maple. Thank you. Vladimir

While numerically testing a solution for the February 2007 IBM Ponder This challenge I had to generate a large n×2 Array of random floats uniformly distributed in [0,1).

Yet another Fourier series package? This package provides new data structure for the representation of trigonometric series and few procedures to work with trigonometric series and to compute Fourier series. Some procedures and data structure are similar to OrthogonalSeries package (but not the same).

I am trying to discover what the error of the FFT implementation within Maple is. Here is the problem: f=some array of values f2=iFFT( FFT( f)) Error = Absolute value (f-f2) point by point. For example, within the IDL programming environment, Error tends to lie between 10^-14 and 10^-16 for double precision calculations, independent of array size. Normally I would just calculate the array, then plot the results. I am having trouble getting Maple to plot an array of values, since data analysis seems not to be one of the functions that this program was designed for. I have also been unable to find any sort of general discussion on the errors inherent with the standard algorithms, though it appears that these errors should be within factors of 10 of the minimum number on the machine.

There was a discussion on comp.soft-sys.maths.maple about how well Maple obtains the Jordan Normal Form of a (square) matrix. LinearAlgebra[JordanForm] is limited to matrices of integers, so it can make severe demands on computer memory; furthermore, in practice, one is often confronted with floating point data. However, linalg[jordan] operates on matrices of both integer and floating point data.

Wonder is someone can help I need to Minimize the non-linear objective function: Obj:=(1/4*a[1]+3/4*a[2]+7/8*a[3]+15/8*a[5]+2*a[6]+19/8*a[7]+21/8*a[8]+1/4*b[1]+ 3/4*b[2]+7/8*b[3]+15/8*b[5]+2*b[6]+19/8*b[7]+21/8*b[8])^2 subject to the following constraints: CON1:=add(a[n],n=1..8)=4 CON2:=add(b[n],n=1..8)=4 CON3:=seq(a[n]+b[n]=1,n=1..8) CON4:=seq(or(a[n]=0,b[n]=1),n=1..8) With(Optimization): NLPSolve(Obj,{CON1,CON2,CON3,CON4},assume = nonnegative); produces this: Error, (in Optimization:-NLPSolve) constraints must be specified as a set or list of equalities and inequalities

Is there a Maple reader I could download free of charge? I want to open a Maple document on a different computer. Thanks in advance !!

This blog is the second extension of MRB Constant. On May 8, 2012 I replaced some missing parts of this blog.

Some Numerical Qualities Part 1 Please, do not expect me to rehash what I have learned from books, at school or anything from the external links (or refferences to books) that have already been posted in this blog. I intend to write only that which comes from personal investigation,...

This blog is an extension of MRB Constant post (at that time called a blog). It was written in December of 2006 as a part of the MRB constant post. I seperateded it and MRB constant B to try to make the original post easier to read.

On May 5 and 6, 2012 I added some old content that was once lost. However, some of...

What is the command gc() used for? Thanks in advance !!

Hi,

I have posted the topic once, but as recieved no reply, I am trying a little force, hope it ain't forbidden:-)

Ok, basing on Carl-Rubin theorem, it is easy to determine UMP test for testing H0: p<p1 or p2<p vs H1: p1<p<p2 where p1 and p2 are given probabilities. To test this at some significance level alpha, we repeat a Bernoulli scheme B(p) n times. In fact, for us to obtain a UMP test for H0 at the level alpha, we have to construct a randomized test, based on a statistic S being the number of successes. If S falls between x_a and x_b we decide to reject the Null Hypothesis. If S happens to be x_a or x_b, then we run another experiment and basing on its result we reject or accept H0.

Iam a Student in the faculty of engineering Petroleum department. Iam Studying Oil Reservoir Simulation which havs many models. Iam Studying the mathematical modeling of those reservoirs. In this modeling we use PDEs to model that reservoir behaviour for years we devide the reservoir into grid blocks each of its special dimensions and parameters so for each grid block there are 3 phases which are oil, water, and gas equation (one for each phase of them)(Matrix Dimension = No. of phases * No. of grid blocks) in addition to the other parameters there are some elements of the PDEs which is function in more than one parameter

Dear All, I am enquiring as to how the "Eigenvectors" function in Maple (I am using version 10) orders the eigenvalues that it returns (and hence the eigenvectors). That is to say, if I input it with a matrix of complex floats, does it just return the eigenvalues it happens to find randomly, or is there some ordering in the vector of eigenvalues it returns? I ask this because if I input it with say a diagonal matrix that is symmetric about it's centre, then the vector of eignevalues returned is also symmetric. Is this just a coincidence in that maple happens to find the eigenvalues in that order, or does it choose to return them in that order? Otherwise, if there is no symmetry in the input matrix then there appears to be no symmetry in the returned vector of eigenvalues.

Steve Forrest and I are building a static analyzer for Maple code. What we would like is some kernel bound self-contained Maple code. In other words, we want code that does not depend on any Library functions, just the Maple language (and itself). Static analysis is already quite difficult, we have to start "small" and build up. Later, we will allow certain library functions -- essentially kernel-bound library functions first (call these 1-functions), then functions that only depend on those (ie 2-functions), and so on, until we can deal with n-functions for n large enough. Right now, kernel-bound code only, please!

I just found this. It's not quite Math or Maple related, but I'm sure most of you will appreciate it.