## 294 Reputation

14 years, 251 days

## how to use the worksheet...

Now I have known what you mean, and how to use the link?

I open the web you have mentioned, and then copy all of it(I am not sure is it right, what I did) into Maple, but the procedure will stop there and do nothing, even though I cannot close it.

I am realy ashamed of asking you so many Qs.

Thank you very much.

## how to use the worksheet...

Now I have known what you mean, and how to use the link?

I open the web you have mentioned, and then copy all of it(I am not sure is it right, what I did) into Maple, but the procedure will stop there and do nothing, even though I cannot close it.

I am realy ashamed of asking you so many Qs.

Thank you very much.

## error...

I did the sample in muller.pdf, as follows

p := proc (x) options operator, arrow; x^5+11*x^4-21*x^3-10*x^2-21*x-5 end proc

r1 := muller(p, -13, -12, -11, 0.1e-2, 100, r1)

Error, recursive assignment

## error...

I did the sample in muller.pdf, as follows

p := proc (x) options operator, arrow; x^5+11*x^4-21*x^3-10*x^2-21*x-5 end proc

r1 := muller(p, -13, -12, -11, 0.1e-2, 100, r1)

Error, recursive assignment

## sample...

Yes,it is the same sample as I mentioned before.

But if you use it, there is error.

How to solve it?

Thank you

## sample...

Yes,it is the same sample as I mentioned before.

But if you use it, there is error.

How to solve it?

Thank you

## Maple 12-muller...

I am using Maple 12, in the help pages I can find as follows,Muller's method

Muller's method for finding a root of the equation
f(x) = 0
generalizes Newton's method by replacing
f(x)
by a quadratic polynomial (a parabola) through the three points
(x[k - 2], f(x[k - 2]))
,
(x[k - 1], f(x[k - 1]))
and
(x[k], f(x[k]))
, then taking as
x[k + 1]
the zero (there are two) that is closest to
x[k]
. An advantage of this method is that it can converge to a real root through a sequence of complex iterates.

*****************************************************************************************

But there is no detail of it.

## Maple 12-muller...

I am using Maple 12, in the help pages I can find as follows,Muller's method

Muller's method for finding a root of the equation
f(x) = 0
generalizes Newton's method by replacing
f(x)
by a quadratic polynomial (a parabola) through the three points
(x[k - 2], f(x[k - 2]))
,
(x[k - 1], f(x[k - 1]))
and
(x[k], f(x[k]))
, then taking as
x[k + 1]
the zero (there are two) that is closest to
x[k]
. An advantage of this method is that it can converge to a real root through a sequence of complex iterates.

*****************************************************************************************

But there is no detail of it.

## another way...

Thank you very much.

Befor I saw your anwser I tried to find another way to solve the problem,I use the order as following

ffff := bb-bbbb; divide(S[dd], ffff, 'sdd');sdd;S[DD] := (bb-bbbb)*sdd

PS:(bb-bbbb)is the common divisor    S[dd] is a multinomial  S[DD] is the multinomial after getting the common divisor

## another way...

Thank you very much.

Befor I saw your anwser I tried to find another way to solve the problem,I use the order as following

ffff := bb-bbbb; divide(S[dd], ffff, 'sdd');sdd;S[DD] := (bb-bbbb)*sdd

PS:(bb-bbbb)is the common divisor    S[dd] is a multinomial  S[DD] is the multinomial after getting the common divisor

## square brackers...

thank you   PatrickT, under your help I found my mistakes in my expression.I correted misused square brackers into round brackers the last expression can get a result.

## square brackers...

thank you   PatrickT, under your help I found my mistakes in my expression.I correted misused square brackers into round brackers the last expression can get a result.

## collect...

what I relly want to collect is the following formula

I donot want to collect [ ] list

the [ ] is the direct result of a formula

## collect...

what I relly want to collect is the following formula

I donot want to collect [ ] list

the [ ] is the direct result of a formula

 Page 1 of 1
﻿