Hello, I have a set of equations, and I want to solve it over the integers (mod 13). But msolve command fails. Here is my code:eq:={a4*a1-11, a4*a2-12, a4*a3-6, a5*a1-3, a5*a2-8, a5*a3-4, a6*a1-2, a6*a2-1, a6*a3-7};msolve(eq,13);It fails, but I can solve it manually. Here is a solution:a4*a1 = 11 => a4:=1 and a1:=11a4*a2 = 12 => a2:=12a4*a3 = 6 => a3:=6a5*a1 = 3 => a5:=3/11 mod 13 = 5a5*a2 = 8 => a2:=8/5 mod 13 = 12

Hello all,

I have the following generalised algebraic Riccati Equations of type:

A^{T}Y + Y^{T}A + C^{T}C - Y^{T}BB^{T}Y = 0;

E^{T}Y - Y^{T}E = 0;

where A is 12x12 matrix, C is a 16x12 matrix, B is a 12x2 matrix.

However, the "CARE" function solves the different Riccati equation (http://www.maplesoft.com/support/help/Maple/view.aspx?path=LinearAlgebra/CARE)

Would you please...

Hi, experts,

I have an equations:

How to solve a, and b? It's easy to know that a = 2, b =5 though.

Many thanks!

I have an initial value problem B(Y,t)(dY/dt)=C(Y,t), where Y= sought vector function, B matrix of the vector function and the independant varaible t, C is a column of function of Y and t.

In my case, B is a 21x21 matrix, but if I can increase the size of the matrix, it could be better.

I tried to solve the problem by creating a system of diffferential equations and using the dsvolve command. It didn't work.

How to efficiently solve this problem?

Thanks

Hi everyone.

Does anyone know what engine is behind the fsolve command? As we know fsolve can solve the sets of equations even without any initial guesses. Is it working based on GA or another global optimization techniques?

Appreciate any help.

MJ

How can I see the steps of solving a PDE ( partial differential equation ) in maple . for example see the sepration variables and other equations that lead to final Eq .

Hi all,

I have this small code as example:

> restart:with(LinearAlgebra):> e1:=5*x1-x2+6*x3+10*x4-10; e1 := 5 x1 - x2 + 6 x3 + 10 x4 - 10> e2:=x1-x2+x3-10*x4; e2 := x1 - x2 + x3 - 10 x4> e3:=2*x1+3*x2-8*x3-x4+20;

I'm trying to solve nine non-linear equations for various input. I am using a for loop to vary the input, and for few input combinations there is no solution. I am trying to exclude these and print the values only if there is a solution. After looking at some of the forms I used if (not type(sol[7], numeric) then print("no solution") else print(sol[7]) end if but this is the output I am getting for all the input.

Attached is the maple...

Hello,

I'm really new in Maple so the problem I have may look somewhat trivial. I have to solve a system of equations for two variables (V and alpha). All the expressions shall be reduced at the end in three (Assuming that 2 of them will be dependent). The code I've written is:

> Vax := proc (V, alpha) options operator, arrow; V*cos*alpha-w*cos*(phiW-phi) end proc;> Vay := proc (V, alpha) options operator, arrow; V*sin*alpha-w*sin*(phiW-phi) end proc;

Dear Mapleprimes,

I have two equations:

x-lambda*p=0

and

y-lambda=0

I would like to divide them such that I have:

(x/y)=p

Is there any way of doing that without doing it manually?

Many thanks,

Christian

I was using "eliminate" to combine a set of equations removing some variables and getting a clearly wrong result. So I looked at the docs and the first example, and I find I don't understand its result either. Here is the example:

sol:=eliminate( {x^2+y^2-1=0, x^3-y^2*x+x*y-3=0}, x); # eliminate x from this set & leave one eqn of y

This returns:

Hi !

I am in desperate need of help to solve a system of non-linear equations. I guess it cant be solved analytically, so maybe numerically? The system is

EQ1 := u*alpha+u*s*A*Ӫ^k = alpha

EQ2: c*s^(c-1) + A*Ӫ^k*[(w-b+s^c)/(beta+alpha+s*A*Ӫ^k)]=0

EQ3 := Ӫ = [(1-u)/u]*[T/(1-T)]

I would like to solve for Ӫ, u and s. All other parameters are constant.

Help pleaseeee!

I am trying to determine if a particular system of 15 polynomial equations in 9 variables has a real solution using Maple's RegularChains library. I am using the IsEmpty command which returns true if there are no solutions and false otherwise. In Maple 16, this can be done using the command:

IsEmpty( sys, R ) ;

where "sys" is a list of equations and "R" is a polynomial ring, both of which I define in the worksheet. But this syntax only works...

I want solve this inequations > solve((1/4*(beta^2-6))*(-beta^2+2*alpha) > 0); After running, maple gives an answer in four lines alpha < (1/2)*beta^2 0 < -(1/2)*beta^2+3 (1/2)*beta^2 < alpha -(1/2)*beta^2 < -3 [] beta = -sqrt(6) [] beta = sqrt(6) now I have questions: 1) In spite of knowing range of beta in thhe second parts of first two lines of answer, why maple...

I need to solve some transcendental equations, using Maple 16 which i need to transform or bind with java later. My problem is I cant evaluate. Equation I would like to evaluate is offcourse I defined m and M, prior to c.Both eval(k) and evalf (k) only return k, I need value for further calculations.

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.