A few more questions about fixed point iteration ....?

In summary, the conversation discusses the individual's interest in learning numerical methods, particularly the fixed point iteration method, and their struggle with understanding it without a strong foundation in trigonometry and calculus. They also mention their aim to learn these methods without touching calculus and ask for book recommendations. The conversation then delves into the different types of equations that can be solved using numerical methods, such as linear equations, simultaneous equations, and non-linear equations, and provides links to resources for learning these methods. The individual also expresses confusion about terms used in these methods, such as the starting value for x and the different iterations.
  • #1
awholenumber
200
10
first of all i simply don't want to give up learning numerical methods ...

i am trying to follow fixed point iteration method from this link ...

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_1_FixedPoint.pdf fixed point iteration can be used to solve transcendental functions ...

if i am not wrong ,transcendental functions are functions containing trigonometric equations ...

i need a bit of help with trigonometry too .. as i am a bit weak in trigonometry ...

this is a great book to begin maths .. if you are out of touch like myself... i am going to follow this book too ...

Peter Selby, Steve Slavin-Practical Algebra_ A Self-Teaching Guide-John Wiley & Sons (1991)

after that i have plans to move to learn some trigonometry ...

my understanding of trigonometry looks a bit like this only ... unfortunately ...

syw1so.jpg


2pydxkw.jpg
solving transcendental functions with the help of numerical methods such as fixed point iteration isn't exactly an easy task for me ...

so i would like to start somewhere ...

please help ...

can somebody suggest me a good book to learn trigonometry ...?
 
Mathematics news on Phys.org
  • #2
rosekidcute said:
first of all i simply don't want to give up learning numerical methods ...

i am trying to follow fixed point iteration method from this link ...

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_1_FixedPoint.pdffixed point iteration can be used to solve transcendental functions ...

if i am not wrong ,transcendental functions are functions containing trigonometric equations ...
trig functions are transcendental functions but so are exponential functions, logarithms, Bessel functions, etc.

i need a bit of help with trigonometry too .. as i am a bit weak in trigonometry ...

this is a great book to begin maths .. if you are out of touch like myself... i am going to follow this book too ...
What book?

after that i have plans to move to learn some trigonometry ...

my understanding of trigonometry looks a bit like this only ... unfortunately ...

syw1so.jpg


2pydxkw.jpg
I have no idea what those pictures have to do with trigonometry!

solving transcendental functions with the help of numerical methods such as fixed point iteration isn't exactly an easy task for me ...

so i would like to start somewhere ...

please help ...

can somebody suggest me a good book to learn trigonometry ...?
Here are some you can download for free:
http://www.freebookcentre.net/Mathematics/Trigonometry-Books-Download.html
 
  • #3
ok thanks ...

I somehow have to learn this fixed point iteration method properly ...

Geometry and Trigonometry for Calculus: A Self-Teaching Guide
Peter H. Selby

learning it has become the aim of my life ...

I am not going to touch calculus for a very long time too ... I made a path for myself to follow ...
which would be to follow these links ...

When we know the degree we can also give the polynomial a name:
0 Constant 7
1 Linear 4x+3
2 Quadratic x^2−3x+2
3 Cubic 2x^3−5x^2
4 Quartic x^4+3x−2
x+2y-3z=10
2x-3y-4z=1
y-3x+z=-8
http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/12-LinEqs_Direct.pdf

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/13-LinEqs_Indirect.pdf

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_1_FixedPoint.pdf
in this way I can learn some important numerical methods without touching calculus ...

its like my new aim in life ...
 
  • #4
rosekidcute said:
in this way I can learn some important numerical methods without touching calculus ...
In my opinion learning numerical methods without even "touching" calculus is almost impossible, particularly when these methods concern fixed point iteration. Maybe you can learn some numerical linear algebra without calculus, but then I still have my sincere doubts. Actually, my doubts are so serious that I take the liberty to offer you this link: https://www.physicsforums.com/insights/self-study-calculus/

The author of that text offers good advice on learning mathematics, so you might find other texts by him useful, too.
rosekidcute said:
its like my new aim in life ...
I don't know... Learning numerical methods is maybe not the best thing to adopt as your "aim of life". Why don't you aim to be happy and content, alone or together with others, whichever you prefer? Numerical methods will come along the way, if you make a well-planned effort.
 
  • #5
thanks for the advice ... and the link for calculus ..

actually i was having plans to buy this book too this year for some reference ...

How to Ace Calculus The Streetwise Guide
i found this nice link .. its about numerical methods and it has some examples of fixed point iteration method for different types of equations ...

it was a bit hard to get some sort of flow for this subject .. which is why learning this was a bit depressive ... there are always more pre requisites to fullfill to understand these methods properly ...http://www.universityofcalicut.info/SDE/BSc_maths_numerical_methods.pdf

from page 11 , of that pdf ... they describe the fixed point iteration method ...

Fixed Point Iteration Method

d1e4fb0.png


5cc216e.png




i need to understand all those somehow ... it feels better because it has some simple looking equations where this fixed point iteration method can be applied ... even though i don't completely understand the definition .. or why the phi is used ... or what it actually mean by "take an arbitrary x0...anyone has time for a rough explanation ?
 
  • #6
i managed to narrow it down to few methods ...

linear equations ...

When we know the degree we can also give the polynomial a name:
0 Constant 7
1 Linear 4x+3
2 Quadratic x^2−3x+2
3 Cubic 2x^3−5x^2
4 Quartic x^4+3x−2
simultaneous equations ...

x+2y-3z=10
2x-3y-4z=1
y-3x+z=-8
i have a doubt if i am confusing simultaneous equations with systems of linear equations ??
or all these three things .. the linear equation , the systems of linear equations and simultaneous equations different ?and i think the methods described in these two links below , could be used to solve ... the linear equation , the systems of linear equations and simultaneous equations ...

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/12-LinEqs_Direct.pdf

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/13-LinEqs_Indirect.pdfnon linear equations ...
When we know the degree we can also give the polynomial a name:
0 Constant 7
1 Linear 4x+3
2 Quadratic x^2−3x+2
3 Cubic 2x^3−5x^2
4 Quartic x^4+3x−2
fixed point iteration
the bisection method
the Newton raphson method
the secant method
http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_1_FixedPoint.pdf

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_2_Bisection.pdf re

http://www.ce.utexas.edu/prof/mckinney/ce311k/Overheads/14-NonlinearEquations_3_Newton.pdf

http://www.maths.dit.ie/~dmackey/lectures/Roots.pdf

these fixed point iteration type methods always involve re arranging equations ... to fit certain formulas ... right ??

do we call the first re arranged form of the equation [tex] x_n[/tex]
because i don't understand the terms

[tex]x_0[/tex]
[tex]x_1 [/tex]
[tex]x_2[/tex]
[tex]x_3 [/tex]
[tex]x_{n+1} [/tex]

how do i choose this starting value [tex] x_n[/tex]
is it a common procedure for most of the iteration type numerical methods ??

fixed point iteration
the bisection method
the Newton raphson method
the secant method
is it something we get when the equations are re arranged to fit certain formulas ?o_O
 
  • #7
can somebody help me with the graph of this ones answer ... ??


i am not sure how the graph of the answer looks like ...??
 
Last edited by a moderator:
  • #8
rosekidcute said:
how do i choose this starting value
You can start with a wild guess, or with a more reasoned guess, or with a rough estimate after trying a few values on your calculator or after sketching a graph.

As a general rule, for a given rearrangement the closer your initial value is to the exact solution, the fewer the required number of iterations to achieve the accuracy desired.

I suggest that you set yourself some exercises using equations for which you already know the exact solution, so you can see how iteration converges towards the solution (or not, as the case may be). For example, you can see in advance the solutions to this quadratic: (x-7)(x+3)=0
which can be written x2 - 4x - 21 = 0
 
  • Like
Likes S.G. Janssens
  • #9
the things i were following were these numerical methods ...

fixed point iteration
the bisection method
the Newton raphson method
the secant method

then i found a simple example to work with ...

2ec01a2.png


2ab997c.png


2e49ce0.png


then i was trying to figure out a way to solve it ...

i have a little bit of confusions here ...i think i figured it out that the initial guess ,(the initial root )... the answer of the question ... is like f(1.618) ... which makes the equation close to zero ... ??

this positive root is called a golden ratio ... right ??

is this like an answer to the question already ?

should i be looking for more values which makes the equation closer to zero ?

is that why we use numerical methods such as fixed point iteration ... ??

anyway then you put the values to fit the formulas of iteration methods ...

to get more approximate values which makes the equation closer to zero ?
 
Last edited by a moderator:
  • #10
What are these photos of a cricket match??
 
  • #11
yea..lol ... i was just trying to figure out the steps .. the syllabus wants me to put the numerical methods to a computer program in c ...so i was just confused about the steps involved ...

sorry about putting too much pictures ...
 

FAQ: A few more questions about fixed point iteration ....?

1. What is fixed point iteration?

Fixed point iteration is a numerical method used to approximate the solution to an equation. It involves repeatedly applying a function to a starting value until the resulting values converge to a fixed point, which is a value that does not change with further iterations.

2. How does fixed point iteration work?

Fixed point iteration works by taking a starting value, plugging it into a function, and using the resulting value as the new input for the function. This process is repeated until the values converge to a fixed point, which is the solution to the equation.

3. What types of equations can be solved using fixed point iteration?

Fixed point iteration can be used to solve a variety of equations, including polynomial equations, exponential equations, and transcendental equations. However, the equation must be written in a specific form to ensure convergence to a unique solution.

4. What is the difference between fixed point iteration and other numerical methods?

Unlike other numerical methods, such as Newton's method or the bisection method, fixed point iteration does not require the evaluation of derivatives. It only requires the use of a function to iteratively approach the solution to an equation.

5. How is the convergence of fixed point iteration determined?

The convergence of fixed point iteration is determined by calculating the absolute value of the difference between consecutive iterations. If this value approaches zero as the number of iterations increases, then the method is considered to have converged to a fixed point. The rate of convergence can also be determined by evaluating the ratio of the differences between consecutive iterations.

Similar threads

Back
Top