Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

Hello,

how to write a^tilde , a^check on maple

thank,

Gerard.

Greetings to all!

Recently I encouter the following issue:

Maple (version 17) coudn't recognize that 20.0 equals with 20 and with 20.00. Believe me, this is very annoying!

Do I miss something? Is there any command that do the trick?

 

Thank you!

Giorgos K.

 

 

Hi,

 

   I have a set of linear equations in terms of Ax+B=0, where A and B are matrices.

  I used linsolve or LinearSolve to solve the equations.

   Is there any simple way to run linsolve/LinearSolve parallelly? suppose I already have matrices A and B.

 

Thank you very much

  

 

Hi,

I was wondering how I could assign small angel assumptions so that I could simplify an equation of motion to solve for theta double dot. Thank you for your help.


Download small_angle_assumption.mw

Equation Manipulation

-assumptions- small angel

"sin(`ϑ`):=`ϑ`"

`ϑ`

(1)

"cos(`ϑ`):=1"

1

(2)

diff(`ϑ`(t), t) := 0

NULL

diff(x(t), t, t) := (H+u)/M


I*(diff(`ϑ`(t), t, t)) = [m*(-l*(diff(`ϑ`(t), t))^2*cos(`ϑ`)-l*(diff(`ϑ`(t), t, t))*sin(diff(`ϑ`(t), t)))-m*g]*l*sin(`ϑ`)+[m*(l*(diff(`ϑ`(t), t))^2*sin(`ϑ`)-l*(diff(`ϑ`(t), t, t))*cos(diff(`ϑ`(t), t))+diff(x(t), t, t))]*l*cos(`ϑ`)

"(->)"

Error, (in isolate) unable to isolate diff(diff(`ϑ`(t), t), t)

 

NULL

``


Download small_angle_assumption.mw

Hello,

How can I pde with maple?please explain completely,and other question :How can I solve pde with plot in maple because some questions dont have exact answer?

with(PolynomialIdeals):

quotientlist := Quotient(GB, varj[j]);
finallist2 := [];
for z from 1 to nops(quotientlist) do
if
finallist2 := [op(finallist2), op(z,quotientlist)];
od:

there are only 3 monomials in quotientlist, but nops return 6

 

Let a finite set of closed intervals in the plane be given.
How to find all the intersections of these, outputing the intersection points together with the intersecting intervals?
This is a problem of computational geometry
(see http://en.wikipedia.org/wiki/Line_segment_intersection).
In other words, how to realize the sweep line algorithm in Maple?

PS. I'd like to note that computational geometry has serious applications, in particular, in robotics.

Good afternoon.

 

I request your kind suggestion to my above cited query.

 

 

With thanks & Regards

 

M.Anand

Assistant Professor in Mathematics

SR International Institute of Technology,

Hyderabad, Andhra Pradesh, INDIA.

 

I want to solve system of equation but it has unknow parameter.

Then I test system of equation. It hasn't unknowparameter.

eq1 := x^2+y^2 = 4

eq2 := y-x^2 = 0

fsolve({eq1, eq2}, {x, y})

{x = -1.249621068, y = 1.561552813}

So I get answer by using fsolve.

 

Then I try to put unknow parameter in system of equation.

eq3 := x^2+ky^2 = 4

eq4 := ay-hx^2 = 0

fsolve({eq3, eq4}, {x, y})

Error, (in fsolve) {ay, hx, ky} are in the equation, and are not solved for

I don't get answer and open link. The link hasn't similar this problem.

To motivate some ideas in my research, I've been looking at the expected number of real roots of random polynomials (and their derivatives).  In doing so I have noticed an issue/bug with fsolve and RootFinding[Isolate].  One of the polynomials I came upon was

f(x) = -32829/50000-(9277/50000)*x-(37251/20000)*x^2-(6101/6250)*x^3-(47777/20000)*x^4+(291213/50000)*x^5.

We know that f(x) has at least 1 real root and, in fact, graphing shows that f(x) has exactly 1 real root (~1.018).  However, fsolve(f) and Isolate(f) both return no real roots.  On the other hand, Isolate(f,method=RC) correctly returns the root near 1.018.  I know that fsolve's details page says "It may not return all roots for exceptionally ill-conditioned polynomials", though this system does not seem especially ill-conditioned.  Moreover, Isolate's help page says confidently "All significant digits returned by the program are correct, and unlike purely numerical methods no roots are ever lost, although repeated roots are discarded" which is clearly not the case here.  It also seems interesting that the RealSolving package used by Isolate(f,method=RS) (default method) misses the root while the RegularChains package used by Isolate(f,method=RC) correctly finds the root.

 All-in-all, I am not sure what to make of this.  Is this an issue which has been fixed in more recent incarnations of fsolve or Isolate?  Is this a persistent problem?  Is there a theoretical reason why the root is being missed, particularly for Isolate?

Any help or insight would be greatly appreciated.

How do I calculate run of 0s or run of 1s using maple?


Q[1] := (e^(-n*T*s)-e^(-(n+1)*T*s)+(-exp(-Z[1]*n*T)*(s-Z[1])*exp(-n*T*(s-Z[1]))+exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2])))/(Z[1]-Z[2])+2*exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+Z[1]*Z[2]*exp(-n*T*(s-Z[1]))/((s-Z[1])*exp(Z[1]*n*T)*(Z[1]-Z[2])*c)-Z[2]*Z[1]*exp(-n*T*(s-Z[2]))/((s-Z[2])*exp(Z[2]*n*T)*(Z[1]-Z[2])*c); 1; Q[2] := ((s-Z[1])*exp(-n*T*(s-Z[1]))*exp(-Z[1]*n*T)/(Z[2]-Z[1])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+Z[1]*Z[2]*exp(-n*T*(s-Z[1]))/((s-Z[1])*exp(Z[1]*n*T)*(Z[1]-Z[2])*c)+(exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2]))/(Z[1]-Z[2])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c-Z[2]*Z[1]*exp(-n*T*(s-Z[2]))/((s-Z[2])*exp(Z[2]*n*T)*(Z[1]-Z[2])*c)+(e^(-n*T*s)-e^(-(n+1)*T*s))/c

((s-Z[1])*exp(-n*T*(s-Z[1]))*exp(-Z[1]*n*T)/(Z[2]-Z[1])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+Z[1]*Z[2]*exp(-n*T*(s-Z[1]))/((s-Z[1])*exp(Z[1]*n*T)*(Z[1]-Z[2])*c)+(exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2]))/(Z[1]-Z[2])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c-Z[2]*Z[1]*exp(-n*T*(s-Z[2]))/((s-Z[2])*exp(Z[2]*n*T)*(Z[1]-Z[2])*c)+(e^(-n*T*s)-e^(-(n+1)*T*s))/c

(1)

Q[1] = Q[2]"(->)"true"(->)"true"(->)"true"(->)"true

Q[2] = ((s-Z[1])*exp(-n*T*(s-Z[1]))*exp(-Z[1]*n*T)/(Z[2]-Z[1])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+Z[1]*Z[2]*exp(-n*T*s)/((s-Z[1])*(Z[1]-Z[2])*c)+(exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2]))/(Z[1]-Z[2])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c-Z[2]*Z[1]*exp(-n*T*s)/((s-Z[2])*(Z[1]-Z[2])*c)+(e^(-n*T*s)-e^(-T*s)*e^(-n*T*s))/c
"(->)"true
Q[2] = ((s-Z[1])*exp(-n*T*(s-Z[1]))*exp(-Z[1]*n*T)/(Z[2]-Z[1])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+(exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2]))/(Z[1]-Z[2])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+Z[1]*Z[2]*exp(-n*T*s)/((s-Z[1])*(Z[1]-Z[2])*c)-Z[2]*Z[1]*exp(-n*T*s)/((s-Z[2])*(Z[1]-Z[2])*c)+(e^(-n*T*s)-e^(-T*s)*e^(-n*T*s))/c
"(->)"true"(->)"true``

((s-Z[1])*exp(-n*T*(s-Z[1]))*exp(-Z[1]*n*T)/(Z[2]-Z[1])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c+(exp(-Z[2]*n*T)*(s-Z[2])*exp(-n*T*(s-Z[2]))/(Z[1]-Z[2])+exp(-n*T*s)*(-1+Heaviside(-n*T)))/c = (2*Heaviside(-n*T)-1)*exp(-n*T*s)/c
"(->)"true"(->)"true"(->)"true

Q[2] = (2*Heaviside(-n*T)-1)*exp(-n*T*s)/c+Z[1]*Z[2]*exp(-n*T*s)/((s-Z[1])*(Z[1]-Z[2])*c)-Z[2]*Z[1]*exp(-n*T*s)/((s-Z[2])*(Z[1]-Z[2])*c)+(e^(-n*T*s)-e^(-T*s)*e^(-n*T*s))/c
"(->)"false"(->)"false"(->)"false

``


Download inexplicable.mw

Can anyone explain the false return on the last line?  MAPLE seems to recognize the simplified expression on the next to last line, but when substituted into the expression for Q2 MAPLE does not seem to recognize the simplification.

How can I plot a volume (many surfaces) in X,Y, Z axis where X,Y,Z are functions in 4 variables (a,b,c,d), and the domain for the 4 variables are 

-90<=a>=90, -10<=b>=10, -12<=c>=12, -90<=d>=0,

 

X := proc (a, b, c, d) options operator, arrow; 324.*cos(b)*sin(c)*cos(d)+324.*sin(b)*sin(d)+323.5*cos(b)*sin(c) end procX := proc (a, b, c, d) options operator, arrow; 324.*cos(b)*sin(c)*cos(d)+324.*sin(b)*sin(d)+323.5*cos(b)*sin(c) end proc

Y := proc (a, b, c, d) options operator, arrow; (324*1.*sin(a)*sin(b)*sin(c)+324*1.*cos(a)*cos(c))*cos(d)+(-1)*324.*sin(a)*cos(b)*sin(d)+323.5*sin(a)*sin(b)*sin(c)+323.5*cos(a)*cos(c)-100 end proc

Y := proc (a, b, c, d) options operator, arrow; (324*1.*sin(a)*sin(b)*sin(c)+324*1.*cos(a)*cos(c))*cos(d)+(-1)*324.*sin(a)*cos(b)*sin(d)+323.5*sin(a)*sin(b)*sin(c)+323.5*cos(a)*cos(c)-100 end proc

Z := proc (a, b, c, d) options operator, arrow; (324*cos(a)*sin(b)*sin(c)-324*sin(a)*cos(c))*cos(d)-324*cos(a)*cos(b)*sin(d)+323.5*cos(a)*sin(b)*sin(c)+(-1)*323.5*sin(a)*cos(c)+150 end proc

Z := proc (a, b, c, d) options operator, arrow; (324*cos(a)*sin(b)*sin(c)-324*sin(a)*cos(c))*cos(d)-324*cos(a)*cos(b)*sin(d)+323.5*cos(a)*sin(b)*sin(c)+(-1)*323.5*sin(a)*cos(c)+150 end proc

Let Poly2 denote the vector space of polynomials

(with real coefficients) of degree less than 3.

Poly2 = {a1t^2+ a2 t+ a3 |a1; a2; a3 €R}

You may assume that {1,t; t^2}is a basis for Poly2.

(1) Show that L1 = {t^2 + 1; t-2 ; t + 3}and L2 = {2 t^2 + t; t^2 + 3; t}

are bases for Poly2.

(2) Let = 8t^2- 4+ 6 and = 7t^2- t + 9. Find the coordinates for

and with respect to the basis L1 and with respect to the basis L2

(3) find the coordinate change matrix P from the basis L1 to the basis L2.find P^-1

Just I answer part (1) can you help me to answer 2 and 3 

I'm working on a complex problem in Composite Materials. I've gotten to a near-result 6x6 matrix, with several cells containing polynomial denominators. I have an equation for simplifying these, which boils the polynomials down to a single variable, but I can't seem to get it to substitute in. Can anyone help me solve this? The problem is also time-sensitive.

 

First 1339 1340 1341 1342 1343 1344 1345 Last Page 1341 of 2248