Hello everyone, i've a problem working with Maple because i have a really big system of equations and for everything that i have to do with them, for example, collect terms, coefficients, take a lot of time from me. The problem it is when, for example, i wait 30 minutes to take the coefficients from a equation and in the next command Maple might stop, then i have to close and start all over again... My question it is if have anyway to save my file in a way that if i close and re open i dont have to compile all again. Maybe this is pretty obvious but i really dont know how to do it, because if i close my work and open again, i have to compile everything again.

Following creates a list of 10 numbers 1..10:

  L := []; for i from 1 to 10 do L := [op(L), i] end do;

Now suppose I have equations labelled (1) ... (10). Can I place these equations into a list by some analogy of the above code using the label references?

Y = (-2*k^3+6*k^2+sqrt(k^8-12*k^7+64*k^6-198*k^5+448*k^4-636*k^3+369*k^2)-7*k-15)/((k^3-3*k^2+5*k-15)*(1+k))

I am in the process fo creating 2 sets of multivariable expressions and I need to create pairwise equations from these sets.

L={L1(a_1 .. a_n), L2(a1, .., an) .... }

R={R1(a_1 .. a_n), R2(a1, .., an) .... }

I need to create the array:

M=Array(1..(2c)!, 1..2^c) where the elements are:

L[1] = R[1],   L[1] = R[2],   L[1] = R[3] ...
L[2] = R[1],   L[2] = R[2],   L[2] = R[3] ...
L[3] = R[1], ...


I then need to pull out particular elements (equtions M[1,1], M[7,2], etc) from the array and plug in a lot of values for the variables of that equation

for a[1] from 1 to 10 do
   for a[2] from 1 to a[1] do
       for a[3] from 1 to a[2] do
if Equation holds (store the inputs somewhere)
end do
end do
end do


I last used Maple about 5 years and have since forgotten a lot, so any and all help is greatly appreciated.
Thanks, Ben

Hello,

I have created my own costume package inspired from an already existing one but this package relies and uses many functions from the original package which I used to create mine. The question: is there an easy way to automatically import all the needed functions and commands from the original package without having to write the name of the original package followed by the name of each function or command ( which is really laborious and hard to complete) ?

Thank you

I have a eigenvalue problem like:

[FF1]* {w}=N^2 *[FF2] *{w}

[FF1] and [FF2] are a*b matrices (non square matrix) , {w} are vectors(eigenvectors) and the values of N are eigenvalues.

I want to obtain eigenvalues and eigenvectors by computing Moore-Penrose pseudo-inverse of [FF2] and do the procedures below :

[FF2]^-1 * [FF1] *{w} =N^2 *{w}            ,        (assume  [FF2]^-1   is Moore-Penrose pseudo-inverse of [FF2]   )

[FF2]^-1 * [FF1] = [FF3]  ,  ( [FF3] is a b*b matrix- squre matrix) 

so  [FF3] *{w}=N^2 *{w}

then I can use LinearAlgebra[Eigenvectors](FF3) to get eigenvalues and eigenvectors. 

I know that Moore-Penrose pseudo-inverse of [FF2] * [FF1] isn't equal to Identity matrix. [FF2]^-1 * [FF1] <> [ I ] . But assume it can be. ( I have a solution for this problem) . 

My biggest problem is [FF2] and [FF1] are large-scale sparse matrix and it takes hours or several days that maple can compute Moore-Penrose pseudo-inverse of [FF2]  and also LinearAlgebra[Eigenvectors](FF3). 

Main question : can I compute Moore-Penrose pseudo-inverse and LinearAlgebra[Eigenvectors]  by using Parallel Programming?  if the answer is yes , how? give me an example please.

if the answer is No , is there any way (any algorithm) to find the inverse of a large non-sqaure matrix or eigenvalues of a large matrix faster?

please introduce some books for parallel programming in maple or general.

Thanks.

1.mw

Copied this from a webpage but it gives an error.

Grateful for all suggestions

PrintfError.mw

Download doubt_case.mw

I am creating a randomised dataset in a workbook, I want the students to use this data but I also want to save the matrix within the same workbook as a csv file so that when I come to look at their work I will see the exact dataset they were supplied with. Can anyone advise on how I might do this:

The code is:

x := convert([seq(1..100)], Vector[column]):

y := 0.1*~x:

with(SignalProcessing):

tmp := GenerateGaussian(100, 2, .6):

tmp2 := convert(tmp*~y, Vector[column]):

ad1 := <<x>|<tmp2>>:

I tried - Export("this:///DataFiles/exdat.csv",ad1):

but get the Error message - Error, (in FileTools:-OpenURI) entry with path '/DataFiles/exdat.csv' is not found

Is what I'm trying to achieve even possible?

Thanks in advance

Jo (p.s. pretty new to Maple)

Please tell me how to calculate the derivative of a matrix function?

how to find the maximum value of the column of the table?  for making the table i have used table command.

in this problem i used slip coundary condition.

the plot want to starts in 0.2, but the plot starts in 0

bc := f(0) = 0, (D(f))(0) = ak*((D^2)(f))(0), (D(f))(N) = 1, g(0) = -de*((D^2)(f))(0), g(N) = 0, T(0) = 1+be*(D(T))(0), T(N) = 0:

How to type double drivative in BC.

In my diagram the horizontal axis cross the vertical axis at -1. How do  I combine location = origin to have to run through y=0?

Many thanks

How to sort the following equation

exp(B)+1)*B^5) = 1

into the following expression

Swanson_and_Turkel_To_Fortran.mwHello,

From the attached code, you can see that I have a Matrix, A, that I am trying to output into Fortran code so that I can simply copy and paste this long matrix into fortran. The output does not look correct. Doesa anyone have an idea on how to put this matrix A into a form that can be easily copy and pasted into Fortran? You can see that I tried to do each line individually in the attatched code but I am really looking for a way to do the entire Matrix. Thanks for any help or suggestions.