MaplePrimes Questions

Hello.

When I click to start simulation button maple start counting but after that don't open visualization. When I open visualization manually, there aren't results of simulation. Program don´t show any error. It does not work with my models and examples to. Thanks for your help.

I read research paper about elasticity, and I don't not how can get the results for displacment ant shaer stress,, could you help me please.

please help me

Kind Regards

 

 

I have a matrix A and a matrix B defined as B:=A. When an entry of B is changed in my Maple code, the matrix A is also changed. 

restart:
A := Matrix([1, 1]):
B := A:
B[1, 1] := 2:
print(A):

The result is

[2,1] but as you see, I did not change the entries of A during the code.  

This never happen for numbers. 

Please help me.

confused in matrix substitution

http://tinypic.com/r/5a048l/9

I have a multivariate polynomial in x and y. How can I firstly collect the terms with respect to the powers of x and y and then simplifying their coefficients.

restart

with(RealDomain):

with(LinearAlgebra):

A := Matrix(5, 5, {(1, 1) = 0, (1, 2) = 1, (1, 3) = 1, (1, 4) = 1, (1, 5) = 1, (2, 1) = 1, (2, 2) = 0, (2, 3) = c__1, (2, 4) = y, (2, 5) = c__2, (3, 1) = 1, (3, 2) = c__1, (3, 3) = 0, (3, 4) = c__3, (3, 5) = x, (4, 1) = 1, (4, 2) = y, (4, 3) = c__3, (4, 4) = 0, (4, 5) = c__4, (5, 1) = 1, (5, 2) = c__2, (5, 3) = x, (5, 4) = c__4, (5, 5) = 0})

Matrix(%id = 4510803138)

(1)

B := Determinant(A)

-2*c__1^2*c__4+2*c__1*c__2*c__3+2*c__1*c__2*c__4-2*c__1*c__2*x+2*c__1*c__3*c__4-2*c__1*c__3*y-2*c__1*c__4^2+2*c__1*c__4*x+2*c__1*c__4*y+2*c__1*x*y-2*c__2^2*c__3-2*c__2*c__3^2+2*c__2*c__3*c__4+2*c__2*c__3*x+2*c__2*c__3*y-2*c__2*c__4*y+2*c__2*x*y-2*c__3*c__4*x+2*c__3*x*y+2*c__4*x*y-2*x^2*y-2*x*y^2

(2)

``

 

Download A.mw

hi.i encounter error in pdsole equations with unknown parameter(N)??

please help me for solve it....thanks alotmaple_prime.mw

Dear friend! Hope every thing going fine with you. I need the solution of the following inqulity (for what values of a[1], a[2] and a[3] the equity hold) and it simplist form. 

 

3*a[1]*a[2]*a[3]-2*a[1]*a[2]-2*a[1]*a[3]-2*a[2]*a[3]+2*a[1]+2*a[2]+2*a[3]-1 <= 3*a[2]*a[1]*a[3]-((a[1]*a[2]*a[3]+1)/(a[2]*a[3]-a[3]+1)-1)*((a[1]*a[2]*a[3]+1)/(a[1]*a[3]-a[1]+1)-1)-((a[1]*a[2]*a[3]+1)/(a[2]*a[3]-a[3]+1)-1)*((a[1]*a[2]*a[3]+1)/(a[1]*a[2]-a[2]+1)-1)-((a[1]*a[2]*a[3]+1)/(a[1]*a[3]-a[1]+1)-1)*((a[1]*a[2]*a[3]+1)/(a[1]*a[2]-a[2]+1)-1)

 

I am waiting your quick response

Mob #: 0086-13001903838

Is it possible to assign both a value of zero to a variable and a unit? Maple seems to be ignoring the units when I do that.

For example:

a := 0atm

Becomes simply a := 0. My workaround so far is to declare a very small value, e.g.:

a := 1E-6atm

This keeps the units for the variable a. Note that 0 pressure isn't relevant here (the same happens for 0m).

Running Maple15 on a five year old lap top, complicated animations are taking up to 30 seconds as shown by debugopt(traceproc) followed by showstat.

Would a discrete video card e.g. Nvidia as opposed to an integrated video card significantly reduce these times or are such times primarily dependent on processor speed?

Hello

I have such problem:

I calculated rather complicated function, and i want to obtain the array or list of data with definite step.

For this purpose I used next expression:

Out:=[seq(t,F(t),t=0..tmax,step]

I need minimum 1000 points, but calculation for the 100 points requires about 300 second, for 1000 - it will be about 3000 seconds. It's too long for me.

 

How could I accelerate this process?

 

P.S.

Plotting of my function requires about 90 seconds for the entire range. So, this is very strange, thad converting to data list requres so much time.

Is there any webpage like Wolfram Library Archive but with Maple related resources? I've missed something or everything goes to mapleprimes? 

I need to complete the definition of bcount so that bcount(n) returns the total number
of odd coefficients 
n
k , 0 ≤ k ≤ n. For instance, the values of 
n
k for n = 6, with odd values highlighted, are:
1, 6, 15, 20, 15, 6, 1,

bcount:=
proc(n::TYPE)
description "Count odd binomial coefficients.";
---MORE STUFF HERE---
end proc; # bcount

Any help appreciated

Hi everybody i've to minimize a function of about 5-6 variables so i tried some of maple functions like: 'Minimize', 'minimize', 'NLPSolve' but with 'minimize' my pc goes in loop and it eats a lot of ram without giving some results, while with the Optimization package i got the error :'

Error, (in Optimization:-NLPSolve) abs is not differentiable at non-real arguments

'

code :

 

restart;
L := 1:
b := 1.1:
p := 1.8:
xa := 0:
xd := -b/2:
ya := -p+z:
yd := 0:


quadrilatero := proc(q,xa,ya,xd,yd,l1,l2,l3,modo,alpha0,alpha1)
local xb,yb,l5,c,alpha,theta5,theta2,xc,yc,theta3,xm,ym:

xb := xa+l1*cos(q + alpha0 + pi/2):
yb := ya+l1*sin(q + alpha0 + pi/2):
l5 := sqrt((xd-xb)^2+(yd-yb)^2):
c := (l2^2+l5^2-l3^2)/(2*l2*l5):
if modo = 1 then alpha := arccos(c) else alpha := -arccos(c) end if:
theta5 := arctan(yd-yb,xd-xb):
theta2 := theta5 + alpha:
xc := xb + l2*cos(theta2 + pi):
yc := yb + l2*sin(theta2 + pi):
theta3 := arctan(yd-yc,xd-xc):
return (theta3 - pi - alpha1):
end proc:
#funione sterzo
f := proc(q,ya,l1,l2,l3,yd,alpha0,alpha1)
local theta;
theta := quadrilatero(q, 0, ya,-b/2,0, l1, l2, l3, -1,alpha0,alpha1) - pi/2;
if theta < Pi and Im(theta) = 0 then theta := theta + 2*pi end if;
return theta;
end proc:
#funzione desiderata
Yd(q) := arctan(tan(q),(1 - b*tan(q)/2/p));
arctan(tan(q), 1 - 0.3055555556 tan(q))

#Definisco procedura dei minimi quadrati:
n := 1: i := 0:
q := Vector[n]: rms := 0:
for i from 0 by 1 to (n-1) do
q[i] := Pi*(i/(4*n)):
rms := rms + abs(f(q[i],ya,l1,l2,l3,yd,alpha0,alpha1) - yd(q[i])^2):
end do:
rms := sqrt(rms / n):
#MIN := (minimize(rms, z = -0.4..0,alpha0 = 0..Pi/3,alpha1 = Pi/2..5*Pi/4,l1 = 0.3..1,l2 = 0.001..0.3,l3 = 0.01..0.3,iterationlimit = 100));
with(Optimization):
Optimization[NLPSolve](((rms)));
Error, (in Optimization:-NLPSolve) abs is not differentiable at non-real arguments

 

thanks in advance for your help !

 

How to realize the Cantor staircase function in Maple? Mathematica has it.

I'd like to stress the three desired properties:

(i) The virtual Cantor function can be evaluated to arbitrary numerical precision.

(ii) For certain arguments, this function automatically evaluates to exact values.

(iii) Mathematical function, suitable for both symbolic and numeric manipulation.

It is given 

   xn (n x - n - x) / (x-1)2 + x / (x-1)2  , n is a (symbolic) positive integer.

I want to transform it into

n xn+1 / (x-1) - x (xn-1) / (x-1)2

How is it possible?

I tried the  simplify, convert (parfrac), collect, combine, expand,  with/without assuming.

Thanks in advance.

Hi everybody,

Ever since i updated to maple 2015, the output of calculations display a disproportionate amount of zeros. For instance:

If i write:

2.3*10^(-4)

i get:

0.000230000000000

Is there anyway to make maple NOT display the last 10 zeros? I've tried Tools ->Options ->Precision -> Round screen display to X. But then it rounds all results to that X amount of digits, wich is also anoying. Like, if i set X to be 10, it'll write 3.000000000 instead of just 3.

Hope someone can help me :-)


Anton

First 1187 1188 1189 1190 1191 1192 1193 Last Page 1189 of 2429