Hi Guys,

I was wondering if there is a way to get data from an array solution.

The system of odes, I am trying to solve is 

eq2:= diff(f(eta),`$`(eta,3))+f(eta)*diff(f(eta),`$`(eta,2))+beta*(1-diff(f(eta),eta)^2) = 0;

eq2 := diff(theta(eta),`$`(eta,2))+pr(f(eta)+(beta-1)*

eta*diff(f(eta),eta))*diff(theta(eta),eta) = 0;

bcs:=f(0)=gama,D(f)(0)=lambda,D(f)(N)=1,theta(0)=0,theta(N)=1:

gama:=2;lambda:=1:pr:=10:N:=10:beta:=3:

I would like to draw some areas between curves. I tried to use ?plots/implicitplot but I often need to use gridrefine option which consumes so much memory. When I want to draw e.g. the area between f and g:

f := x-> piecewise(x < 5, 2, x-3):
g := x-> piecewise(x < 4, x, 4):

I can do:

p:=plot({f, g}, color...

I am making a 2D plot and need to mark certain irregular points on the x-axis, so I managed to put tickmarks (and gridlines) at those points, and somehow Maple even labels each tickmark, which is what I want. 

Except, there is no room along the x-axis for all the labels, so I need the labels to appear vertically at each tickmark.

Is  there any way to do this? The only instructions I can find for vertical labelling just apply to axis labels, not tickmark or gridline labels.

Hola,
How can leave a trail/trace of black point in the yellow and purple screens? Something very similar to the option "animate / trace."

SVD-filtering.mw

Make it possible to take the numerical data of each screen from the "plottools [getdata]"

Gracias

seriestoratpoly(series(simplify(LaguerreL(5, x)),x,6),['egf']);

seriestoratpoly(series(simplify(LaguerreL(5, a, x)),x,6),['egf']);

inverse z transform of sqrt(1-a^2)/(1-a/z)

restart;
alpha := 0;
s := x;
tau := alpha + 1 - x;
source := s*Diff(y(x),x$2)+tau*Diff(y(x),x)+n*y(x)=0;
sol := dsolve(source,y(x),method=laplace);
zsol := ztrans(sol,x,z);
convert(zsol, ratpoly);

sol := y(x) = _C1*invlaplace((_s1-1)^n*_s1^(-1-n), _s1, x)
zsol := ztrans(y(x), x, z) = _C1*invlaplace((_s1-1)^n*_s1^(-1-n)*z/(z-1), _s1, x)
Error, (in convert/ratpoly) expecting a Laurent series or a Chebyshev series

what are _C1 and _s1?

Maple 16:

Given Matrix A of size nRow,nCol, and a vector b of size nCol, I wanted to divide each value in column 
K by b(K) where k=1..nCol and the result will be a matrix B also of size nRow,nCol ofcourse.

For example, I want to do A[..,1]/b[1],  A[..,2]/b[2], etc.. for each column of A

The way I do it now is by using seq(), then convert the result to matrix, like this:

nCol := LinearAlgebra:-ColumnDimension(A):
B    := convert([seq(A[..,i]/b[i],i=1..nCol)],Matrix);

And it works.  But was wondering if there is a better way to do this. I tried to use apply map but did 
not know how to

Here is below the complete Maple 16 code I have:

------------------------
A := LinearAlgebra:-RandomMatrix(3,4);
b := MTM:-sum(A,1);
nCol := LinearAlgebra:-ColumnDimension(A):
B := convert([seq(A[..,i]/b[i],i=1..nCol)],Matrix);
MTM:-sum(B,1);  #verify the sum is 1

When I execute several times my maple code the program completely freezes, even though in the beginning of the code teh command "restart" is inserted. I work with matrices, perform integrations and derivations for their components and calculate eigenvalue problems. The freeze happens at no particulat block of execution.

Any thoughts?

which iterative method does maple use in fsolve command to solve nonlinear slgebraic systems?

When I type
                    printf(cat("Answer: ", sqrt(4)));

The result is Answer: 2. So, everything is OK.

However, if I type
                            printf(cat("Answer: ", sqrt(5)));

I got an error message: (in fprintf) format string expected....

So, I have a list of vectors v1,...v8 - and I want to consider all {0,1}v1 + {0,1}v2+ ... + {0,1}v8 (I need a list of all 2^8 possible combinations). 

I can run 8 simple for loops and use the mod command, but that's inconvenient. Is there a nice way to do what I'm trying to get done? 

Hello everyone,

I am coding the assumed modes method for vibration analysis on maple and I don't know why but the code takes veeery long time to execute and give results and I think it should not. There is also anoter very annoying thing. every 3 or 4 executions maple freezes completely and I am not able to find the cause...

I would be gratefull if someone could explain me if in my case it's better to working in floating point or rational values,...

Hello,

I have created a for loop in which I call often the same function let's say w(x).

Is it processed faster if I call each time the function, or if I apply the function to another variable, let's say W and call W each time?

Thanks

I need program of multiple shooting method with maple or algorithm?

Thanks alot.

Hello,

I am experiencing wrong results using the PolynomialIdeals package in Maple 16 (see radical_error.mw). Creating the same ideal with different generators, the radicals computed differ which of course is wrong:

with(PolynomialIdeals);
J := <t*(a+A), A*(b+B+t), b*(a+A), B*a-A*(b+t), (variables = {A, B, a, b, t})>:
J2 := <t*(a+A), A*(b+B+t), b*(a+A), B*(a+A...