Hello people in mapleprimes,

I want to draw a graph of a procedure.

filter:=x->if x<10 then 1-x/10 else 0 fi;

plot('filter(x)',x=0..20);

works well. But, I don't know why it is needed for filter(x) is wrapped with foward quotte ' .

I changed that quote to back quote ` but, in this case the result hadn't appeared.

And, without the foward quote ', error appears.

And, even if I wrapped x with ' as in plot('filter(x)','x' =0..20),

a graph appeared properly, though I cannot understand why wrapped x, 'x' is right.

Please teach me the logic of the above code.

Best wishes.

taro yamada

AoA. How are you hope you will be fine. Sir the following matrix have been given

A := Matrix(2, 2, {(1, 1) = 1, (1, 2) = 2, (2, 1) = -1, (2, 2) = 2});

B := Matrix(2, 2, {(1, 1) = 1, (1, 2) = 0, (2, 1) = -2, (2, 2) = 3});

C := Matrix(2, 2, {(1, 1) = 0, (1, 2) = 0, (2, 1) = 0, (2, 2) = 0});

I want to write M by M matrix using the above matrices like this

P:=[[[A,B,B,...,B],[C,A,B,...,B],[C,C,A,...,B],[.,.,.,...,B],[C,C,C,...,A]]]

PhD (Scholar)
Department of Mathematics

AoA... I want to plot the following functions

f(x)=sin(x)

g(x)=sin(x)-x+x^2

h(x)=cos(x)-sin(x)

I(x)=exp(x)-x

J(x)=sin(x)+exp(x)

in one coordinate having the line style and legend like attached file.

1-s2.0-S0377042714003331-main.pdf

PhD (Scholar)
Department of Mathematics

I want to get the result of multi-matrix multiply like followed below,

but error "final value in for loop must be numeric or character"

(*n is arbitrary and B[1],B[2],...,B[n] have been obtained*)

A:=LinearAlgebra:-IdentityMatrix(n);
#using the multiplication operation of matrix
for i from 1 to n do
   A:=LinearAlgebra:-Multiply(A,B[i]);
od:

return A

help me 

thanks

Hello

I have a loop with the do structure but there is an error in the loop .

how can I continue the loop by error or disregard it?

What is Groebner? That was asked in different forms several times in MaplePrimes and MathStackExchange (for example, see http://math.stackexchange.com/questions/3550/using-gr?bner-bases-for-solving-polynomial-equations ). In view of this I think the presented post on Groebner basis will be useful. This post consists of two parts: its mathematical background and examples of solutions of polynomial systems by hand and with Maple.

Let us start. Up to Wiki http://en.wikipedia.org/wiki/Gr%C3%B6bner_basis ,Groebner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, and Gaussian elimination for linear systems. This is implemented in Maple trough the Groebner package.
The simplest introduction to the topic I know is a well-written book of Ivan Arzhantsev (https://zbmath.org/?q=an:05864974) which includes the proofs of all the claimed theorems and the solutions of all the exercises. Here is its digest groebner.pdf done by me (The reader is assumed to be familiar with the ideal notion and ring notion (one may refresh her/his knowledge, looking in http://en.wikipedia.org/wiki/Ideal_%28ring_theory%29)). It should be noted that there is no easy reading about this serious matter.
Referring to the digest as appropriate, we solve the system
S:={a*b = c^2+c, a^2 =a+ b*c, a*c = b^2+b} by hand and with the Groebner package.
For the order a > b > c we construct its ideal
J(S):=<f1 = a*b-c^2-c,f2 = a^2-a-b*c, f3 = a*c-b^2-b>.
The link between f1 and f2 gives
f1*a-f2*b = (-c^2-c)*a + (a + b*c)*b = a*b -a*c + b^2*c -
a*c^2 =f4.
The reduction with f1 produces
f4 ->-a*c^2- a*c + b^2*c + c^2 +c =: f4.
Now the reduction with f3 produces
f4 -> -b^2- b - b*c +c^2 + c =:f4.
The link between f2 and f3 gives:
f2*c - f3*a = a*b +a*b^2 -a*c -b*c^2 = f5.
The reduction with f1 produces
f5 -> -a*c + c*b +c^2 +c =:f5.
The reduction with f3 produces
f5 -> -b^2 -b + c*b +c^2 +c =:f5.
The reduction with f4 produces
f5 -> 2b*c =: f5.
The link between f1 and f3
f1*c - f3*b = b^3 + b^2 -c^3 -c^2=:f6.
The reduction with f4 produces
f6 -> 2b*c + 2b*c^2 -2c^3 -2c^2=:f6.
At last, we reduce f6 by f5, obtaining f6:= -2c^3 -2c^2.
We see the minimal reduced Groebner basis of S consists of
a^2 -a -b*c, -b^2 -b- b*c +c^2 +c, -2c^3 - 2c^2.
Now we find the solution set of the system under consideration. The equation -2c^3 - 2c^2 = 0 implies
c=0, c=0, c=-1. The the equation -b^2 - b - b*c +c^2 + c = 0 gives
b = 0 , b = -1, b = 0, b = -1, b = 0, b = 0 respectively.
At last, knowing b and c, we find a from a^2 -a -b*c = 0.
Hence,
[{a = 0, b = 0, c = 0}, {a = 1, b = 0, c = 0}, {a = 0, b = -1, c = 0}], [{a = 0, b = 0, c = 0}, {a = 1, b = 0, c = 0}, {a = 0, b = -1, c = 0}], [{a = 0, b = 0, c = -1}].
The solution of the system under consideration by the Groebner package is somewhat different because Maple does not find the minimal reduced Groebner basis directly.

Download groebner.mw

Hello, Im trying to do a jocobian

http://www.maplesoft.com/support/help/Maple/view.aspx?path=VectorCalculus/Jacobian

but when I try the example code

jacobian([rcos(t), rsin(t), r^2*t], [r, t])

i only get the output as 

jacobian([rcos(t), rsin(t), RandomMatrix(4, 4*density = .75, outputoptions = [shape = tringular*lowe])^2*t], [RandomMatrix(4, 4*density = .75, outputoptions = [shape = tringular*lowe]), t])

I want the output as a matrix as in the example url.

Thanks

I have the following system of non-linear equations and want to find their solutions experimenting with my parameters. I also want to restrict the solutions to be non-negative. I have done the following, but i am sure it exist a more efficient way. Can somone help on this? 

eqns := [A = (gr_c+delta)*kh^(1-alpha)/sav_rate, theta = Rk*(Rh-Rk)/(gamma*((Rh-Rk)^2+sigma^2)), theta = 1*1+kh, Rk = 1+rk-delta, Rh = 1+rh-delta, rk = A*alpha*kh^(alpha-1), rh = A*(1-alpha)*kh^alpha, sigma = sigmay/theta, varrho = Rap^((eps-1)*eps/(1-gamma)), Rap = Rk^(1-gamma)+(1-gamma)*Rk^(-gamma)*theta*(Rh-Rk)-.5*Rk^(-gamma-1)*gamma*(1-gamma)*theta^2*((Rh-Rk)^2+sigma^2), R = Rk+theta*(Rh-Rk), beta = ((1+gr_c)/R)^(1/eps)/varrho];
print(`output redirected...`); # input placeholder
[
[
[
[
[ (1 - alpha)
[ (gr_c + delta) kh
[A = ----------------------------,
[ sav_rate
[

Rk (Rh - Rk)
theta = ---------------------------, theta = 1 + kh,
/ 2 2\
gamma \(Rh - Rk) + sigma /

Rk = 1 + rk - delta, Rh = 1 + rh - delta,

(alpha - 1) alpha
rk = A alpha kh , rh = A (1 - alpha) kh ,

/(eps - 1) eps\
|-------------|
sigmay \ 1 - gamma /
sigma = ------, varrho = Rap , Rap =
theta

(1 - gamma) (-gamma)
Rk + (1 - gamma) Rk theta (Rh - Rk) - 0.5

(-gamma - 1) 2 / 2 2\
Rk gamma (1 - gamma) theta \(Rh - Rk) + sigma /,

/ 1 \]
|---|]
\eps/]
/1 + gr_c\ ]
|--------| ]
\ R / ]
R = Rk + theta (Rh - Rk), beta = ---------------]
varrho ]
]
vals := [alpha = .36, delta = 0.6e-1, sigmay = sqrt(0.313e-1), gamma = 3, eps = .5, gr_c = 0.2e-1, sav_rate = .23];
eval(eqns, vals);
print(`output redirected...`); # input placeholder
[
[
[
[ 0.64 Rk (Rh - Rk)
[A = 0.3478260870 kh , theta = -----------------------,
[ / 2 2\
[ 3 \(Rh - Rk) + sigma /

0.36 A
theta = 1 + kh, Rk = 0.94 + rk, Rh = 0.94 + rh, rk = ------,
0.64
kh

0.36 0.1769180601
rh = 0.64 A kh , sigma = ------------,
theta

0.1250000000
varrho = Rap ,

1 2 theta (Rh - Rk)
Rap = --- - -----------------
2 3
Rk Rk

2 / 2 2\
3.0 theta \(Rh - Rk) + sigma /
+ --------------------------------, R = Rk + theta (Rh - Rk),
4
Rk

2.000000000]
/1\ ]
1.0404 |-| ]
\R/ ]
beta = ---------------------]
varrho ]
]
eqns := [A = .3478260870*kh^.64, theta = (1/3)*Rk*(Rh-Rk)/((Rh-Rk)^2+sigma^2), theta = 1+kh, Rk = .94+rk, Rh = .94+rh, rk = .36*A/kh^.64, rh = .64*A*kh^.36, sigma = .1769180601/theta, varrho = Rap^.1250000000, Rap = 1/Rk^2-2*theta*(Rh-Rk)/Rk^3+3.0*theta^2*((Rh-Rk)^2+sigma^2)/Rk^4, R = Rk+theta*(Rh-Rk), beta = 1.0404*(1/R)^2.000000000/varrho];
print(`output redirected...`); # input placeholder
[
[
[
[ 0.64 Rk (Rh - Rk)
[A = 0.3478260870 kh , theta = -----------------------,
[ / 2 2\
[ 3 \(Rh - Rk) + sigma /

0.36 A
theta = 1 + kh, Rk = 0.94 + rk, Rh = 0.94 + rh, rk = ------,
0.64
kh

0.36 0.1769180601
rh = 0.64 A kh , sigma = ------------,
theta

0.1250000000
varrho = Rap ,

1 2 theta (Rh - Rk)
Rap = --- - -----------------
2 3
Rk Rk

2 / 2 2\
3.0 theta \(Rh - Rk) + sigma /
+ --------------------------------, R = Rk + theta (Rh - Rk),
4
Rk

2.000000000]
/1\ ]
1.0404 |-| ]
\R/ ]
beta = ---------------------]
varrho ]
]

solve(eqns, [Rk, Rh, varrho, Rap, beta, R, A, sigma, theta, rk, rh, kh]);

hello . i have a Partial differential equation i need some help with 

This is how it goes 

AoA. How are you? Sir want to generate the attached square matrix for any value of M. Please help.

PhD (Scholar)
Department of Mathematics

AoA. How are you? I want to solve the following equation in one step and convenient way please help

psi(x):=Matrix(1,3,[x,x-1,x^(2)-x-1])

P := Matrix(3, 3, [1, 2, 1, 0, 1, 1, -1, 2, 3])

U := Matrix(3, 3, [a[1, 1], a[1, 2], a[1, 3], a[2, 1], a[2, 2], a[2, 3], a[3, 1], a[3, 2], a[3, 3]])

u := psi(x)^T*(P^2)^T*U*P^2*psi(t)-t*psi(x)^T*(P^2)^T*U*P^2*psi(1)-x*psi(1)^T*(P^2)^T*U*P^2*psi(t)+t*x*psi(1)^T*(P^2)^T*U*P^2*psi(1)

If you reduce my computational work or have any suggestion to solve please give.

PhD (Scholar)
Department of Mathematics

AoA. How are you? Hope you will be fine. I want write the following in Loop for any M

F[r,s]:=2^(k+2) m sqrt((c[r-1])/(c[s-1])) for r=2...(M+1), s=1..r-1 and (r+s)=odd;

F[r,s]:=0  otherwise

Novice question

I have two sets of inequalties:

s1:= (0<x, x<100)

s2:= (5<x, x<95)

I want each set to define a "range", so I can do set operations on the ranges. For example I want to determine that S2 is a subset of S1, S1 - S2 would give me (0<x, x<=5, 95<=x, x<100), S1 Union S2 = (0<x, x<100), etc

I assume these are simple things that can be done with Maple - but I am not sure how! Any suggestions?

Suppose I have installed maple on a directory in Windows 7 64 Bit. Now I use the command mode in windows, by typing maplew "D:\xx.mw" > xx.txt, it doesn't work. 

Excuse me, how to run maplew on command mode?

Hi,

I have two all 1.-1  square matrices and want to test whether they are equivalent or not. Can anyone help me with details?Thanks in advance