Rearranging to get an iterative function (fixed point)

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












I don't quite get why things are rearranged the way they are when trying to get an equation to be used in fixed point iteration. For example,



$x^3+2x+5=0$



could be rearranged to give



$:x=-frac5x^2+2:or:x=-sqrt[3]2x+5$



But apparently not



$x=-fracx^3+52$.



Why so?







share|cite|improve this question























    up vote
    1
    down vote

    favorite












    I don't quite get why things are rearranged the way they are when trying to get an equation to be used in fixed point iteration. For example,



    $x^3+2x+5=0$



    could be rearranged to give



    $:x=-frac5x^2+2:or:x=-sqrt[3]2x+5$



    But apparently not



    $x=-fracx^3+52$.



    Why so?







    share|cite|improve this question





















      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      I don't quite get why things are rearranged the way they are when trying to get an equation to be used in fixed point iteration. For example,



      $x^3+2x+5=0$



      could be rearranged to give



      $:x=-frac5x^2+2:or:x=-sqrt[3]2x+5$



      But apparently not



      $x=-fracx^3+52$.



      Why so?







      share|cite|improve this question











      I don't quite get why things are rearranged the way they are when trying to get an equation to be used in fixed point iteration. For example,



      $x^3+2x+5=0$



      could be rearranged to give



      $:x=-frac5x^2+2:or:x=-sqrt[3]2x+5$



      But apparently not



      $x=-fracx^3+52$.



      Why so?









      share|cite|improve this question










      share|cite|improve this question




      share|cite|improve this question









      asked Aug 6 at 0:32









      Cheks Nweze

      697




      697




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          3
          down vote



          accepted










          The problem is that you generally want the fixed point iteration mapping to be contractive, at least in a neighborhood of the fixed point. Otherwise you start with a small error and end up with a larger error.



          The situation is easier to see in a case where the exact solution of the equation is easily constructed. Look at something like $x^2-x-12=0$, and you're trying to find the root $x=4$. If you use $x=x^2-12$, the problem is that although indeed $4=4^2-12$ (i.e. the desired solution is a fixed point of the mapping), if you have an $x$ close to $4$ instead, $x^2-12$ is generally further away from $4$ than $x$ was. For example $3.9^2-12=3.21$.



          The standard way to check this is to compute the absolute value of the derivative of the fixed point function at the fixed point, which in this example is $8$. If it is larger than $1$, then the mapping is not contractive near the fixed point, so the iteration (usually) does not converge.






          share|cite|improve this answer





















          • So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
            – Cheks Nweze
            Aug 6 at 0:50






          • 1




            @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
            – Ian
            Aug 6 at 0:59


















          up vote
          1
          down vote













          The key idea is to rewrite $f(x)=0$ in the form $x=phi(x)$ such that $vert phi'(x)vert <1$ for some $x$ in the vicinity of the root.



          enter image description here



          The picture above depicts the iteration process $x_n+1=phi(x_n)$ for $n=0,1,2,...$ which guarantees the convergence as $vert phi'(x)vert <1$ as the movement along the cobweb cycle indeed takes you towards the point of intersection of the curves.



          You can easily see by drawing the graph that the iteration may diverge (this time the cobweb cycle will take you away from the point of intersection of the curves) rather if we relax the condition $vert phi'(x)vert <1$.






          share|cite|improve this answer























            Your Answer




            StackExchange.ifUsing("editor", function ()
            return StackExchange.using("mathjaxEditing", function ()
            StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
            StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
            );
            );
            , "mathjax-editing");

            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "69"
            ;
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function()
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled)
            StackExchange.using("snippets", function()
            createEditor();
            );

            else
            createEditor();

            );

            function createEditor()
            StackExchange.prepareEditor(
            heartbeatType: 'answer',
            convertImagesToLinks: true,
            noModals: false,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );








             

            draft saved


            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2873465%2frearranging-to-get-an-iterative-function-fixed-point%23new-answer', 'question_page');

            );

            Post as a guest






























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            3
            down vote



            accepted










            The problem is that you generally want the fixed point iteration mapping to be contractive, at least in a neighborhood of the fixed point. Otherwise you start with a small error and end up with a larger error.



            The situation is easier to see in a case where the exact solution of the equation is easily constructed. Look at something like $x^2-x-12=0$, and you're trying to find the root $x=4$. If you use $x=x^2-12$, the problem is that although indeed $4=4^2-12$ (i.e. the desired solution is a fixed point of the mapping), if you have an $x$ close to $4$ instead, $x^2-12$ is generally further away from $4$ than $x$ was. For example $3.9^2-12=3.21$.



            The standard way to check this is to compute the absolute value of the derivative of the fixed point function at the fixed point, which in this example is $8$. If it is larger than $1$, then the mapping is not contractive near the fixed point, so the iteration (usually) does not converge.






            share|cite|improve this answer





















            • So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
              – Cheks Nweze
              Aug 6 at 0:50






            • 1




              @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
              – Ian
              Aug 6 at 0:59















            up vote
            3
            down vote



            accepted










            The problem is that you generally want the fixed point iteration mapping to be contractive, at least in a neighborhood of the fixed point. Otherwise you start with a small error and end up with a larger error.



            The situation is easier to see in a case where the exact solution of the equation is easily constructed. Look at something like $x^2-x-12=0$, and you're trying to find the root $x=4$. If you use $x=x^2-12$, the problem is that although indeed $4=4^2-12$ (i.e. the desired solution is a fixed point of the mapping), if you have an $x$ close to $4$ instead, $x^2-12$ is generally further away from $4$ than $x$ was. For example $3.9^2-12=3.21$.



            The standard way to check this is to compute the absolute value of the derivative of the fixed point function at the fixed point, which in this example is $8$. If it is larger than $1$, then the mapping is not contractive near the fixed point, so the iteration (usually) does not converge.






            share|cite|improve this answer





















            • So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
              – Cheks Nweze
              Aug 6 at 0:50






            • 1




              @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
              – Ian
              Aug 6 at 0:59













            up vote
            3
            down vote



            accepted







            up vote
            3
            down vote



            accepted






            The problem is that you generally want the fixed point iteration mapping to be contractive, at least in a neighborhood of the fixed point. Otherwise you start with a small error and end up with a larger error.



            The situation is easier to see in a case where the exact solution of the equation is easily constructed. Look at something like $x^2-x-12=0$, and you're trying to find the root $x=4$. If you use $x=x^2-12$, the problem is that although indeed $4=4^2-12$ (i.e. the desired solution is a fixed point of the mapping), if you have an $x$ close to $4$ instead, $x^2-12$ is generally further away from $4$ than $x$ was. For example $3.9^2-12=3.21$.



            The standard way to check this is to compute the absolute value of the derivative of the fixed point function at the fixed point, which in this example is $8$. If it is larger than $1$, then the mapping is not contractive near the fixed point, so the iteration (usually) does not converge.






            share|cite|improve this answer













            The problem is that you generally want the fixed point iteration mapping to be contractive, at least in a neighborhood of the fixed point. Otherwise you start with a small error and end up with a larger error.



            The situation is easier to see in a case where the exact solution of the equation is easily constructed. Look at something like $x^2-x-12=0$, and you're trying to find the root $x=4$. If you use $x=x^2-12$, the problem is that although indeed $4=4^2-12$ (i.e. the desired solution is a fixed point of the mapping), if you have an $x$ close to $4$ instead, $x^2-12$ is generally further away from $4$ than $x$ was. For example $3.9^2-12=3.21$.



            The standard way to check this is to compute the absolute value of the derivative of the fixed point function at the fixed point, which in this example is $8$. If it is larger than $1$, then the mapping is not contractive near the fixed point, so the iteration (usually) does not converge.







            share|cite|improve this answer













            share|cite|improve this answer



            share|cite|improve this answer











            answered Aug 6 at 0:37









            Ian

            65.2k24681




            65.2k24681











            • So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
              – Cheks Nweze
              Aug 6 at 0:50






            • 1




              @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
              – Ian
              Aug 6 at 0:59

















            • So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
              – Cheks Nweze
              Aug 6 at 0:50






            • 1




              @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
              – Ian
              Aug 6 at 0:59
















            So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
            – Cheks Nweze
            Aug 6 at 0:50




            So does this mean that I can just move the $x$ term to one side, isolate $x$ and use that as a function as long as the derivative of the function at the fixed point is $-1<x<1$? Because in textbooks they seem to never just get the $x$ term on its own immediately, they usually just factorise $x$ out then rearrange or take a cube root.
            – Cheks Nweze
            Aug 6 at 0:50




            1




            1




            @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
            – Ian
            Aug 6 at 0:59





            @CheksNweze Yes, that's right. There is nothing mathematically incorrect about isolating $x$ from the linear term rather than, say, the leading order term of a polynomial equation. It just often leads to non-contractive mappings in practice.
            – Ian
            Aug 6 at 0:59











            up vote
            1
            down vote













            The key idea is to rewrite $f(x)=0$ in the form $x=phi(x)$ such that $vert phi'(x)vert <1$ for some $x$ in the vicinity of the root.



            enter image description here



            The picture above depicts the iteration process $x_n+1=phi(x_n)$ for $n=0,1,2,...$ which guarantees the convergence as $vert phi'(x)vert <1$ as the movement along the cobweb cycle indeed takes you towards the point of intersection of the curves.



            You can easily see by drawing the graph that the iteration may diverge (this time the cobweb cycle will take you away from the point of intersection of the curves) rather if we relax the condition $vert phi'(x)vert <1$.






            share|cite|improve this answer



























              up vote
              1
              down vote













              The key idea is to rewrite $f(x)=0$ in the form $x=phi(x)$ such that $vert phi'(x)vert <1$ for some $x$ in the vicinity of the root.



              enter image description here



              The picture above depicts the iteration process $x_n+1=phi(x_n)$ for $n=0,1,2,...$ which guarantees the convergence as $vert phi'(x)vert <1$ as the movement along the cobweb cycle indeed takes you towards the point of intersection of the curves.



              You can easily see by drawing the graph that the iteration may diverge (this time the cobweb cycle will take you away from the point of intersection of the curves) rather if we relax the condition $vert phi'(x)vert <1$.






              share|cite|improve this answer

























                up vote
                1
                down vote










                up vote
                1
                down vote









                The key idea is to rewrite $f(x)=0$ in the form $x=phi(x)$ such that $vert phi'(x)vert <1$ for some $x$ in the vicinity of the root.



                enter image description here



                The picture above depicts the iteration process $x_n+1=phi(x_n)$ for $n=0,1,2,...$ which guarantees the convergence as $vert phi'(x)vert <1$ as the movement along the cobweb cycle indeed takes you towards the point of intersection of the curves.



                You can easily see by drawing the graph that the iteration may diverge (this time the cobweb cycle will take you away from the point of intersection of the curves) rather if we relax the condition $vert phi'(x)vert <1$.






                share|cite|improve this answer















                The key idea is to rewrite $f(x)=0$ in the form $x=phi(x)$ such that $vert phi'(x)vert <1$ for some $x$ in the vicinity of the root.



                enter image description here



                The picture above depicts the iteration process $x_n+1=phi(x_n)$ for $n=0,1,2,...$ which guarantees the convergence as $vert phi'(x)vert <1$ as the movement along the cobweb cycle indeed takes you towards the point of intersection of the curves.



                You can easily see by drawing the graph that the iteration may diverge (this time the cobweb cycle will take you away from the point of intersection of the curves) rather if we relax the condition $vert phi'(x)vert <1$.







                share|cite|improve this answer















                share|cite|improve this answer



                share|cite|improve this answer








                edited Aug 6 at 8:24


























                answered Aug 6 at 7:18









                Mathlover

                3,5831021




                3,5831021






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2873465%2frearranging-to-get-an-iterative-function-fixed-point%23new-answer', 'question_page');

                    );

                    Post as a guest













































































                    Comments

                    Popular posts from this blog

                    Color the edges and diagonals of a regular polygon

                    Relationship between determinant of matrix and determinant of adjoint?

                    What is the equation of a 3D cone with generalised tilt?