Anybody know how to put this in coding for Jacobian Matrix? 

     Hi,

i want to solve equation system u0(x,t),u1(x,t),v1(x,t),v0(x,t)v2(x,t) dependent on f(x,t).

I attached file. 

Thanks in advance.

worksheet.mwworksheet.mw

Maple gives me a null output for an equation that has a real solution.

solve(4/x^(1/3)+1=0)

The following command seems to work

solve(4/surd(x,3)+1=0)

-64

Why doesn't this have a solution over the complex numbers, when real numbers are a subset of the complex numbers. Mathematica has the same result too.

Converting a VectorCalculus vector to a PhysicsVectors vector and reconverting it back
to VectorCalculus vector do not return the same result !
is this a bug ? Any clue ?

Download BugConversion.mw

I have two .stl solid (and their equations).I need equation of intersection solid. How do you do?I don't want work with 3integral but mayby by system,thanks!

So I needed a CAS, and I spent a couple of months trying to get a basic understanding of SymPy and various applications starting with "M". We have Maple version 2016.

My "prototype problem" can be solved by hand, and is a system of quadratic Bellman equations, for i=1,2.  I'll return to it below, as I am obviously too clumsy to get even the second-to-simplest max/min working.  Oh, and I can't even insert Maple Math here in the forum, it does not like maximize or minimize.

Let's start easy. I enter
maximize((b-x)x,x) 
which works as I expect. Then already at
maximize((abs(b)-x)x,x>=0) 
I am stuck. Please, sweet Maple, you know that the answer is the same as before, don't you? (In the meantime I have tried to feed it maximize((b-x)x,x=0..1)... )

I was hoping my "proper" problem should be doable. What I really need is a sequence of quadratic optimization problems, where I have a vector x maximizing b'x-x'Ax subject to linear constraints, so it should not be too hard.  The "prototype problem" I needed for starters, is a system where for i=1,2 I have 

v_i(0,y)=0 and inductively v_i(t+1,y)=max{x_i*(b_i-x_1-x_2)+ r_i v_i(t,y-x)}

where b_i and r_i are constants, x=(x_1,x_2), y=(y_1,y_2), and everything is nonnegative - including, the choice variables x_i must be between 0 and min{y_i, b_i-x_1-x_2}. And I want to plot both functions and the x with time as a slider, but ... I don't think I'll ever get that far? 

Sorry for whining. (I know why I dropped out of computer science.)

Dear Maple users,

need your help to resolve the error in attach file.
thanks

code_for_eigen_value.mw

Hi!,

Assume that we hace a set points in the plane, put X:=[a1,a2,...,aN] where each ai is given by its coordinates [x,y]. The commnad "convexhull(X)" give us the points of the convex hull of X, but how I can find to "lower-right" of these points? Please, see the attached image. I need to findo the points A,C,E and F, marked with a solid circle.

Many thanks in advances for your comments.

I am working on a model in MapleSim which is giving me the error "DSN/RunSimulation: internal error: condition iteration failure: unable to solve Tarjan form at initial point."

Are there any general tips on what in a model could cause this error?

Hello,

I am so happy that this is my first time to ask a quension here.

Like the graph pasted down, i can get a graph of a ode with the odeplot in time domain.

Furthermore, i just want to get a envelope plot based on the time domain graph, just like showed in

the example graph here,

i have no way to plot it in maple,

Does anyone know a method to plot it in maple? 

Daer maple useres,

I am solving around 170 linear algebraic equations (symbolic) using linearalgebra " solve" command. I see the cpu usage is only 15%; as I the cpu is  i-7, octacore ,15% means around 1 core is in use. With time (12 hours)  cpu usage goes down to 0% showing free memory approx 0.

Why  is it happening? Is it due to high memory usage in storing large symobic expressions? Is there a way to engage all the cores( 100% Cpu)?

Thanks and regards.

Hello People in mapleprimes,

a^k*k/(a*a__0^k)

would not be simplifyed to k*a^(k-1)/a__0^k

with

symplify(a^k*k/(a*a__0^k)) assuming(k>1);

or other commands including expand.

Is there any way other than simplify(numer(..)/a)/simplify(denom(..)/a); ?

Thanks in advance.

Hi!

I am trying to solve a large system using solve(). Fortunately, my system is linear and it does have solutions. Actually, the system has free variables that gives multiple solutions.

However, I have hundreds of variables with different names and subscripts, and I only need one solution of the system. I noticed that solve() actually output the solution with the free variables on the right. So, is there a way that I can find all the free variables and give them 0, to get only one set of solution?

Thanks!

William

Using Insert->Table... and inserting information in the cells. 

So I've created Table1 but I can't seem to call any row/column cell information using that name.  How do we do that?  Also, what is the best way to search for information in those cells and return information in adjacent cells? 

Lets say I want to find the intersection point between the line l in parametric form and plane p, both mentioned in the Maple code below. Is there smarter way than using the solve method that I use the two final lines? 

with(geom3d);
plane(p, 2*x+y-3*z-3 = 0, [x, y, z]);
                               p
line(l, [-1+3*t, 1+t, 2-t], t);
                               l
intersection(I, p, l);
                               I
solve({x = -1+3*t, y = 1+t, z = 2-t, 2*x+y-3*z-3 = 0}, {t, x, y, z});
                  {t = 1, x = 2, y = 2, z = 1}