MHB Find the Conditions on A for Convergence of f(x) Root

  • Thread starter Thread starter house2012
  • Start date Start date
  • Tags Tags
    Convergence
Click For Summary
The discussion focuses on determining the conditions on A for the iteration \(x_{n+1}=x_n-Af(x_n)\) to converge to a root of the function f when starting near that root. It is established that convergence occurs if the initial estimate is sufficiently close to the solution, specifically when \(|1-Af'(x_0)|<1\). Additional conditions include A being positive and the function f crossing the x-axis with a positive slope. The convergence behavior can be categorized as monotonic or oscillating based on the relationship between \(A f(x)\) and the distance from the root. These insights are crucial for ensuring the effectiveness of the iterative method in finding roots.
house2012
Messages
2
Reaction score
0
Hey guys, I can't get his question dealing with orders of convergence at all so any help would be nice.

Q: Find the conditions on A so that the iteration $$x_{n+1}=x_n-Af(x_n)$$ will converge to a root of f if stared near the root.

I know I should look at the taylor series expansion of f about its root but I am stuck with working out.

Thanks for your help!
 
Mathematics news on Phys.org
house2012 said:
Hey guys, I can't get his question dealing with orders of convergence at all so any help would be nice.

Q: Find the conditions on A so that the iteration $$x_{n+1}=x_n-Af(x_n)$$ will converge to a root of f if stared near the root.

I know I should look at the taylor series expansion of f about its root but I am stuck with working out.

Thanks for your help!

Write \(x_n=x_0+\varepsilon_n\), where \(x_0\) is the root of \(f(x)\)

Then:

\[
x_{n+1}=x_0+\varepsilon_{n+1}=x_0+\varepsilon_n - A\{f(x_0)+\varepsilon_n f'(x_0)+...\}
\]

Ignoring terms or order 2 and higher in \(\varepsilon_n\) we find:

\[\varepsilon_{n+1}=\varepsilon_n(1-Af'(x_0)) \]

So convergence occurs when the initial estimate is close enough to the solution when:

\[|1-Af'(x_0)|<1\]

CB
 
Last edited:
house2012 said:
Hey guys, I can't get his question dealing with orders of convergence at all so any help would be nice.

Q: Find the conditions on A so that the iteration $$x_{n+1}=x_n-Af(x_n)$$ will converge to a root of f if stared near the root.

I know I should look at the taylor series expansion of f about its root but I am stuck with working out.

Thanks for your help!

In order to avoid confusion we indicate with $x^{*}$ the root of $f(*)$ and with $x_{0}$ the starting point of iterations. Other hypotheses are...

a) $A>0$...

b) $f(*)$ crosses the x axes with positive slope...

If a) and b) are satisfied, then, as explained in...

http://www.mathhelpboards.com/showthread.php?426-Difference-equation-tutorial-draft-of-part-I

... the sequence $x_{n}$ will converge to $x^{*}$ if it exists an interval $a<x<b$ which contains $x^{*}$ and $x_{0}$ ad where for any $x \ne x^{*}$ is...$\displaystyle |A\ f(x)|<2\ |x-x^{*}|$ (1)

More precisely if is...

$\displaystyle |A\ f(x)|\le |x-x^{*}|$ (2)

... the convergence will be 'monotonic' and if is...

$\displaystyle |x-x^{*}|<|A\ f(x)|<2\ |x-x^{*}|$ (3)

... the convergence will be 'oscillating'...

Kind regards

$\chi$ $\sigma$
 
Thread 'Erroneously  finding discrepancy in transpose rule'
Obviously, there is something elementary I am missing here. To form the transpose of a matrix, one exchanges rows and columns, so the transpose of a scalar, considered as (or isomorphic to) a one-entry matrix, should stay the same, including if the scalar is a complex number. On the other hand, in the isomorphism between the complex plane and the real plane, a complex number a+bi corresponds to a matrix in the real plane; taking the transpose we get which then corresponds to a-bi...

Similar threads

Replies
16
Views
854
  • · Replies 9 ·
Replies
9
Views
2K
Replies
10
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 1 ·
Replies
1
Views
10K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 21 ·
Replies
21
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K