Items tagged with rootfinding rootfinding Tagged Items Feed

I want to set the determinant of the coefficient matrix equal to zero and then solving for the roots. But I could not achieve it via Maple. Can you help me please? 

You can reach two examples in the following file.  Yeni_Microsoft_Word_Belgesi_(2).docx

 

Besides. how can i compute the following transcental equations via maple 

 

sinh(beta*L)*sin(beta*L)=0

 

cosh(beta*L)*cos(beta*L)-1=0

 

cosh(beta*L)*cos(beta*L)+1=0

 

regards

mehmet

How do I write a procedure to find a root of f(x)=0 in the vicinity of a given value x0. The procedure should initially use the rearrangement method to produce a linearly convergent sequence of values, and should, when appropriate, switch to Aitkin's Method. The input for the procedure should be the re-arranged function and the velue for x0. The output should be the root and the number of iteration taken. The procedure should check that re-arrangement will converge. This program should do in Maple V Release5.

Thank you for your help.

 

I have the following function

where A,B,Ψ, K1,K2,K3,α,β are all constants.

How to find the value of m for which the above expression is 0 or approximate to 0 for different values fo the constants.

e.g., Fixing all the parameters except A, I want to find the values of m for different values of A. How to do that in maple?

 

hi every one..

how i solve numerically  couple equations which attached below .in solve this equation we must  starting from a very small value of V(voltage) with initial guesses for x1 and x3

near zero and using find root method.it is noted that  the solution at this voltage step are used as initial guesses

for the next voltage step, and the process is repeated..

thanks

2DOF.mw

Hello,

Today I've playied a bit with CellDecomposition from the RootFinding package and for one of the systems with which I've playied I got an error which seems to me to be a bug related.

In particular, 

with(RootFinding[Parametric]):

m := CellDecomposition([x^3-y^2 = 0, x^2+y^2-1 < 0], [x, y])

Error, (in RootFinding:-Parametric:-CellDecomposition) Segmentation Violation occurred in external routine

 

Did I make a mistake somewhere or Maple 2015.1 faild?

If there is  an equation or are several equations, I need to obtain all the roots, how can I do???

 

fsolve ? rootfindings? or what?

 

If an examples of actual is given,  That will be perfect  !!!

 

Thanks 

Hi All,

I want to solve for G, but cant seem to figure it out. Can anyone tell me what am I missing or doing wrong?

 

SSD:= ((155/9)*2.5)+((155/9)^2/(2*9.807*0.346));
Lc:= 2*SSD-(2*(sqrt(1.08)+sqrt(0.6))^2)/(G+0.04);
Ls:= 2*SSD-(2*(0.6+SSD*tan(Pi/180)))/(G);
Lcon:= 202-Lc-Ls;
Eq:= (G-0.043)(Lc/2)+(-G)(Ls/2)+G*Lcon-0.043*Lc=14;


fsolve(Eq);

 

thank you

The issue I am currently having is that, while analyticity (and physics) indicates a certain function must have roots, fsolve is having trouble finding them. In fact, I have even found roots manually in a certain region myself, simply inputting into the function various values until I found them. However, fsolve does not seem to want to find these roots, and I believe it is a numerics issue: when I changed the digits around, for extremely low values of Digits, it would find a root (even though it was incorrect). Further, this problem arose elsewhere in the domain of interest for other values of Digits (in particular, for Digits:=5, fsolve failed in a region it had not failed before).

The region of interest is the "peak" of the output of poleR(M0, 0.935, mK), which should be somewhere around M0 = 0.95 or so. However, because fsolve cannot find the roots, the plot cannot be made.

Anyone have any ideas as to why fsolve cannot find the roots? I was also experiencing issues with some of these functions having multiple roots, which itself is weird as well (note that I am working over the complex plane).

Attached is the document.

pole-dragging-mapleprimes.mw

Any ideas?

The algorithm that I need to replicate is as follows:

real function f(x,y)

integer n; real a,b,c,x,y

f<-max(|x|,|y|)

a<-min(|x|,|y|)

for n=1 to 3 do

b<-(a/f)^2

c<-b/(4+b)

f<-f+2*c*f

a<-ca

end for

end function f

How can I define f,a as  functions that I am later using as variables(in f=f+2cf,b=(a/f)^2)? also, is n just a variable for iteration? 

 

I've got a function f(x_n) = (x_n-1)^3

and need to show that for the iterative method

x_(n+1)= x_n - f(x_n)/(sqrt(f'(x_n)^2-f(x_n)*f''(x_n), at a simple root we have cubic convergence while at a multiple root, it converges linearly.

I understand that the approach is to write either a recursive function or a sequence, but i'm confused about the structure since both x and n are being incremented

 

I have a rather complex expression that I want to find the zero for as a function of two other parameters, i.e. I have a function

Denom := (s,M,g) -> stuff

that I want to find the zero of for a variety of values of M and g. In some cases the solution will be complex, which is entirely acceptable. However, the real part of the solution should never be negative, and yet that is the kind of result I am getting.

As an example (illustrated in the worksheet, when attempting to find the zero for M = 3 and g = 0.2, fsolve gives me s = -6.1 -1.4i. However, when I plot the function with the parameters input already, I can clearly see a zero at s = 9 with no imaginary component. Why won't fsolve find this zero? How can I make it do so?

See the bottom of the attached worksheet for the main problem.

 pole-dragging-mapleprimes.mw

Hi, I am using Maple 18 and struggling with plotting Newton's Method.

I am wanting use the function f(x)=x^3 +cx + 1 where c is a parameter and uses 100 parameter values between -2 and 0, with 100 iterations of each parameter.

Any help would be brilliant.

Thanks in advance,

Neil

I am numerically solving a nonlinear system of nine equations. How long can I expect it to take?

I have run it for 30 minutes and it has not solved yet.

Here is the system of equations:

0=Lambda-mu.*S-beta.*(H+C+C1+C2).*(S./N)-tau.*(T+C).*(S./N);

0=tau.*(T+C).*(S./N)-beta.*(H+C+C1+C2).*(T./N)-(mu+mu_T).*T;

0=beta.*(H+C+C1+C2).*(S./N)-tau.*(T+C).*(H./N)-(mu+mu_A).*H;

0=beta.*(H+C+C1+C2).*(T./N)+tau.*(T+C).*(H./N)-(mu+psi.*mu_A+mu_T+lambda_T).*C;

0=lambda_T.*C-(mu+mu_A+rho_1+eta_1).*C1;

0=rho_1.*C1-(mu+mu_A+rho_2+eta_2).*C2;

0=eta_1.*C1-(mu+rho_1+gamma).*CT1;

0=eta_2.*C2-(mu+rho_2+gamma.*(rho_1)./(rho_1+rho_2)).*CT2+(rho_1).*CT1;

0 = N - S - T - H - C - C1 - C2 - CT1 - CT2;

and I have numeric values for Lambda, beta, tau, mu, mu_T, mu_A, rho_1, rho_2, psi, gamma. The only parameters left are eta_1, eta_2.

Thank you.

Let's say I have 2 functions, the first being y=sin^2(x) and the second one is y=e^(-x)cos(x). When I try to solve on Maple, it only gives me one intersecting point, while I would like to see ALL intersections between the 2 functions. How would I go about doing this?

1 2 3 Page 1 of 3