suppose we want to find a curve

a * x * y + y + b * x + c = 0

given the following conditions:

y(x) = f(x)  and y'(x) = f'(x) and y(m)= f(m)

how to find a , b and c in terms of f, f'...

 

 

x := `<,>`(`<|>`(x[1]), `<|>`(x[2]), `<|>`(x[3]))

x := `<,>`(`<|>`(x1), `<|>`(x2), `<|>`(x3))

when input a matrix like this,the subscript seems be not embodied in the results

 

with this tool you can draw shapes and plots by ascii characters www.jave.de/

I interested to know is there any technique in maple for doing similar jobs like this ...

I want to solve the problem as follows,

What's the deal here? When I load Tools>Load Package>Units I get those brackets on the left side of the document along with a red >. I never got them before and now they show up on every new document. Not a big deal, I suppose, but when I hit the !!! the brackets and red >s start to proliferate. A couple more clicks of !!! and my worksheet is covered in them. I can't help but suspect, also, that this is related to the error message I get at the end of this worksheet.

Hi I will appreciate some help

I am trying to find the algebraic solution of the equation and want to express z in terms of c

z1 := 819*z^6+(-396+396*c)*z^4+306*z^3*c+(63*c^2-126*c+63)*z^2+(90*c^2-90*c)*z+6*c^3-9*c^2+18*c-6;

i use solve(z1=0,z) but i got

[z=RootOf(273 _Z^6+(-132+132 c) _Z^4+102 _Z^3 c+(-42 c+21+21 c^2) _Z^2+(-30 c+30 c^2) _Z-2+2 c^3-3 c^2+6 c).

Can anyone help?

can anyone help me with code to convert a matrix that is not diagonally dominant to the one that is diagonally dominant

Hi,

check out this deq:

y=2*x*y''

Maple says it's an Emden/Fowler deq with the following form:

Emden_Fowler_ode := x^p*p*(diff(y(x), x))/x+x^p*(diff(y(x), x, x))+x^sigma*y(x)^n = 0;

I tried to change the parameters p,n,sigma so that it describes my deq, but it does not completely fit.
I use n=1,p=0,sigma=-1 and i get

y=x*y''

How do i get in the missing constant 2 ?

 

Maple solves it correctly by the way.

Hi all I see it is very easy to define a simple function in Maple using -> But what if more than a single expression is needed and if local variables are needed ? Is there a way to put several statements and use local variables in a function definition ? For example to define a function that takes a list as it's argument and returns the arithmetic mean or the simple sum. Must such things be done with a procedure ? Thanks !

after differentiating a function that contains a product and summation using a counter i=1,2,...,n and j=1,2,...m    i got a result that contains things like these :-

sum from i1~=1  to  i-1    and  i1~=i+1  to  n

and i had in the function a variable z[i][j]  and in the result it became  z[i1~][j]

what does 1~ means ?

thankx in advance

Hello,

I have a lie algebra, e.g. sl2 or sl3. Elements of these algebra may look like  Q_s, where x indicates a Generator of the lie algebra and 's' is a further index. On this latter index there are conditions, for example:

For all x and s with s>1: Q_s = 0.

In addition, under the lie algebra commutation relations, 's' behaves for example as:

[ Q_s, Q_r] = Q_s+r.

 

Consider the identity 4*cos(theta)^3-3*cos(theta) = cos(3*theta). Does maple know about it, or how to prove the identity, which is true by deMoivre's formula, with maple? The trig option for simplify seems not enough. Thanks.

How can I assign all diagonal elements to 1 for a matrix ?

Hi all I have > tst:=-(1-cos(p))/p^2+1/2*cos(1/4*p)^2*cos(1/8*p)^2*cos(1/16*p)^2: >plot(tst); which seems to work OK. However, this generates an error plot(tst,Pi..2*Pi); Warning, unable to evaluate the function to numeric values in the region; see the plotting command's help page to ensure the calling sequence is correct Plotting error, empty plot ...as does any other range I have tried. I guess it's something very simple, but if someone can point me in the right direction I would appreciate it !

I want to find a way that which results in that all variables in a procedure becomes local

ie  X:=proc() local All

I find it tedious having to specify all the local variables individually 

ie  X:=proc() local A,B,C,w,e,r,t,y,u,ui,io,w,,u,i,o.....eternity