Fixed point iteration-finding $g(x)$












2












$begingroup$


I have an equation $f(x)= x^4 +2x^3 -5x^2 -7x-5=0 $ and I want to solve it (numerically) at [1.5,3] using the fixed point iteration-method, so I want to find a function g(x) such that $f(x)=0$ is equivalent to $g(x)=x$. However I've tried many different $g(x)$'s but can't seem to find one that converges to the solution (which is about 2.19).
First of all, anyone has any idea which $g(x)$ I could use?
Second is there a trick to finding it?

Thanks in advance :)






numerical-methods fixed-point-theorems fixed-point-iteration







share|cite|improve this question











$endgroup$

















    2












    $begingroup$


    I have an equation $f(x)= x^4 +2x^3 -5x^2 -7x-5=0 $ and I want to solve it (numerically) at [1.5,3] using the fixed point iteration-method, so I want to find a function g(x) such that $f(x)=0$ is equivalent to $g(x)=x$. However I've tried many different $g(x)$'s but can't seem to find one that converges to the solution (which is about 2.19).
    First of all, anyone has any idea which $g(x)$ I could use?
    Second is there a trick to finding it?

    Thanks in advance :)






    numerical-methods fixed-point-theorems fixed-point-iteration







    share|cite|improve this question











    $endgroup$















      2












      2








      2





      $begingroup$


      I have an equation $f(x)= x^4 +2x^3 -5x^2 -7x-5=0 $ and I want to solve it (numerically) at [1.5,3] using the fixed point iteration-method, so I want to find a function g(x) such that $f(x)=0$ is equivalent to $g(x)=x$. However I've tried many different $g(x)$'s but can't seem to find one that converges to the solution (which is about 2.19).
      First of all, anyone has any idea which $g(x)$ I could use?
      Second is there a trick to finding it?

      Thanks in advance :)






      numerical-methods fixed-point-theorems fixed-point-iteration







      share|cite|improve this question











      $endgroup$




      I have an equation $f(x)= x^4 +2x^3 -5x^2 -7x-5=0 $ and I want to solve it (numerically) at [1.5,3] using the fixed point iteration-method, so I want to find a function g(x) such that $f(x)=0$ is equivalent to $g(x)=x$. However I've tried many different $g(x)$'s but can't seem to find one that converges to the solution (which is about 2.19).
      First of all, anyone has any idea which $g(x)$ I could use?
      Second is there a trick to finding it?

      Thanks in advance :)






      numerical-methods fixed-point-theorems fixed-point-iteration




      numerical-methods fixed-point-theorems fixed-point-iteration






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 11 '16 at 15:10









      InsideOut

      4,94131033




      4,94131033










      asked Dec 11 '16 at 15:08









      DimitrisDimitris

      6121719




      6121719






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          To get the solution to converge, besides $g(x)=x$ you need $|g'(x)| lt 1$ at the root. The distance from the root is multiplied by about $|g'(x)|$ every iteration, so if that is less than $1$ it will converge. Powers change quickly and roots slowly, so a natural try is to write
          $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
          x=sqrt[4]{-2x^3+5x^2+7x+5}$$
          It converges nicely starting at $0, 1$ and $3.5$ but fails starting from $4$ because the piece under the root goes negative. Another try, which I have not tested, would be to write $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
          x=(-2x^3+5x^2+7x+5)/x^3$$ It is a bit of an art. If you don't know the root, you can't evaluate the derivative of your proposed $g(x)$ at it.






          share|cite|improve this answer











          $endgroup$





















            1












            $begingroup$

            The scholars of old had a philosophy of avoiding differences if manually computing roots of equations. That way a treatment of quadratic or cubic equations could fill multiple pages considering the various cases, but avoided the discussion of roots of negative numbers.



            In your equation one would separate by this philosophy
            $$
            x^4+2x^3=5x^2+7x+5
            $$
            and solve the higher degree side, for instance as
            $$
            x=g(x)=sqrt[Large3,!]{frac{5x^2+7x+5}{x+2}}=sqrt[Large3,!]{5x-3+frac{11}{x+2}}
            $$
            This as fixed-point iteration maps the interval $[2,3]$ into itself an has thus a fixed point. The derivative of $g$ is smaller than $frac{5}{12}<frac12$ providing sufficient speed of convergence. A numerical series confirms this result.



             k         x[k]        x[k]-x[k-1]     1.4*0.3^k
            

            
 0      2.0
            
 1      2.1363293408   0.1363293408     0.138
            
 2      2.1786508930   0.04232155218    0.0414
            
 3      2.1915435027   0.0128926097     0.01242
            
 4      2.1954485170   0.003905014239   0.003726
            
 5      2.1966292396   0.001180722584   0.0011178
            
 6      2.1969860556   0.0003568160362  0.00033534
            
 7      2.1970938687   0.0001078131484  0.000100602
            
 8      2.1971264433   3.25745335e-05   3.01806e-05
            
 9      2.1971362852   9.841886902e-06  9.05418e-06
            
10      2.1971392587   2.973559468e-06  2.716254e-06
            
11      2.1971401571   8.984094482e-07  8.148762e-07
            
12      2.1971404286   2.714387324e-07  2.4446286e-07





            share|cite|improve this answer









            $endgroup$













              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',
              autoActivateHeartbeat: false,
              convertImagesToLinks: true,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: 10,
              bindNavPrevention: true,
              postfix: "",
              imageUploader: {
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              },
              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%2f2053965%2ffixed-point-iteration-finding-gx%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              3












              $begingroup$

              To get the solution to converge, besides $g(x)=x$ you need $|g'(x)| lt 1$ at the root. The distance from the root is multiplied by about $|g'(x)|$ every iteration, so if that is less than $1$ it will converge. Powers change quickly and roots slowly, so a natural try is to write
              $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
              x=sqrt[4]{-2x^3+5x^2+7x+5}$$
              It converges nicely starting at $0, 1$ and $3.5$ but fails starting from $4$ because the piece under the root goes negative. Another try, which I have not tested, would be to write $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
              x=(-2x^3+5x^2+7x+5)/x^3$$ It is a bit of an art. If you don't know the root, you can't evaluate the derivative of your proposed $g(x)$ at it.






              share|cite|improve this answer











              $endgroup$


















                3












                $begingroup$

                To get the solution to converge, besides $g(x)=x$ you need $|g'(x)| lt 1$ at the root. The distance from the root is multiplied by about $|g'(x)|$ every iteration, so if that is less than $1$ it will converge. Powers change quickly and roots slowly, so a natural try is to write
                $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                x=sqrt[4]{-2x^3+5x^2+7x+5}$$
                It converges nicely starting at $0, 1$ and $3.5$ but fails starting from $4$ because the piece under the root goes negative. Another try, which I have not tested, would be to write $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                x=(-2x^3+5x^2+7x+5)/x^3$$ It is a bit of an art. If you don't know the root, you can't evaluate the derivative of your proposed $g(x)$ at it.






                share|cite|improve this answer











                $endgroup$
















                  3












                  3








                  3





                  $begingroup$

                  To get the solution to converge, besides $g(x)=x$ you need $|g'(x)| lt 1$ at the root. The distance from the root is multiplied by about $|g'(x)|$ every iteration, so if that is less than $1$ it will converge. Powers change quickly and roots slowly, so a natural try is to write
                  $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                  x=sqrt[4]{-2x^3+5x^2+7x+5}$$
                  It converges nicely starting at $0, 1$ and $3.5$ but fails starting from $4$ because the piece under the root goes negative. Another try, which I have not tested, would be to write $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                  x=(-2x^3+5x^2+7x+5)/x^3$$ It is a bit of an art. If you don't know the root, you can't evaluate the derivative of your proposed $g(x)$ at it.






                  share|cite|improve this answer











                  $endgroup$



                  To get the solution to converge, besides $g(x)=x$ you need $|g'(x)| lt 1$ at the root. The distance from the root is multiplied by about $|g'(x)|$ every iteration, so if that is less than $1$ it will converge. Powers change quickly and roots slowly, so a natural try is to write
                  $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                  x=sqrt[4]{-2x^3+5x^2+7x+5}$$
                  It converges nicely starting at $0, 1$ and $3.5$ but fails starting from $4$ because the piece under the root goes negative. Another try, which I have not tested, would be to write $$x^4 +2x^3 -5x^2 -7x-5=0\x^4=-2x^3+5x^2+7x+5\
                  x=(-2x^3+5x^2+7x+5)/x^3$$ It is a bit of an art. If you don't know the root, you can't evaluate the derivative of your proposed $g(x)$ at it.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 11 '16 at 16:31

























                  answered Dec 11 '16 at 15:21









                  Ross MillikanRoss Millikan

                  293k23197371




                  293k23197371























                      1












                      $begingroup$

                      The scholars of old had a philosophy of avoiding differences if manually computing roots of equations. That way a treatment of quadratic or cubic equations could fill multiple pages considering the various cases, but avoided the discussion of roots of negative numbers.



                      In your equation one would separate by this philosophy
                      $$
                      x^4+2x^3=5x^2+7x+5
                      $$
                      and solve the higher degree side, for instance as
                      $$
                      x=g(x)=sqrt[Large3,!]{frac{5x^2+7x+5}{x+2}}=sqrt[Large3,!]{5x-3+frac{11}{x+2}}
                      $$
                      This as fixed-point iteration maps the interval $[2,3]$ into itself an has thus a fixed point. The derivative of $g$ is smaller than $frac{5}{12}<frac12$ providing sufficient speed of convergence. A numerical series confirms this result.



                       k         x[k]        x[k]-x[k-1]     1.4*0.3^k
                      

                      
 0      2.0
                      
 1      2.1363293408   0.1363293408     0.138
                      
 2      2.1786508930   0.04232155218    0.0414
                      
 3      2.1915435027   0.0128926097     0.01242
                      
 4      2.1954485170   0.003905014239   0.003726
                      
 5      2.1966292396   0.001180722584   0.0011178
                      
 6      2.1969860556   0.0003568160362  0.00033534
                      
 7      2.1970938687   0.0001078131484  0.000100602
                      
 8      2.1971264433   3.25745335e-05   3.01806e-05
                      
 9      2.1971362852   9.841886902e-06  9.05418e-06
                      
10      2.1971392587   2.973559468e-06  2.716254e-06
                      
11      2.1971401571   8.984094482e-07  8.148762e-07
                      
12      2.1971404286   2.714387324e-07  2.4446286e-07





                      share|cite|improve this answer









                      $endgroup$


















                        1












                        $begingroup$

                        The scholars of old had a philosophy of avoiding differences if manually computing roots of equations. That way a treatment of quadratic or cubic equations could fill multiple pages considering the various cases, but avoided the discussion of roots of negative numbers.



                        In your equation one would separate by this philosophy
                        $$
                        x^4+2x^3=5x^2+7x+5
                        $$
                        and solve the higher degree side, for instance as
                        $$
                        x=g(x)=sqrt[Large3,!]{frac{5x^2+7x+5}{x+2}}=sqrt[Large3,!]{5x-3+frac{11}{x+2}}
                        $$
                        This as fixed-point iteration maps the interval $[2,3]$ into itself an has thus a fixed point. The derivative of $g$ is smaller than $frac{5}{12}<frac12$ providing sufficient speed of convergence. A numerical series confirms this result.



                         k         x[k]        x[k]-x[k-1]     1.4*0.3^k
                        

                        
 0      2.0
                        
 1      2.1363293408   0.1363293408     0.138
                        
 2      2.1786508930   0.04232155218    0.0414
                        
 3      2.1915435027   0.0128926097     0.01242
                        
 4      2.1954485170   0.003905014239   0.003726
                        
 5      2.1966292396   0.001180722584   0.0011178
                        
 6      2.1969860556   0.0003568160362  0.00033534
                        
 7      2.1970938687   0.0001078131484  0.000100602
                        
 8      2.1971264433   3.25745335e-05   3.01806e-05
                        
 9      2.1971362852   9.841886902e-06  9.05418e-06
                        
10      2.1971392587   2.973559468e-06  2.716254e-06
                        
11      2.1971401571   8.984094482e-07  8.148762e-07
                        
12      2.1971404286   2.714387324e-07  2.4446286e-07





                        share|cite|improve this answer









                        $endgroup$
















                          1












                          1








                          1





                          $begingroup$

                          The scholars of old had a philosophy of avoiding differences if manually computing roots of equations. That way a treatment of quadratic or cubic equations could fill multiple pages considering the various cases, but avoided the discussion of roots of negative numbers.



                          In your equation one would separate by this philosophy
                          $$
                          x^4+2x^3=5x^2+7x+5
                          $$
                          and solve the higher degree side, for instance as
                          $$
                          x=g(x)=sqrt[Large3,!]{frac{5x^2+7x+5}{x+2}}=sqrt[Large3,!]{5x-3+frac{11}{x+2}}
                          $$
                          This as fixed-point iteration maps the interval $[2,3]$ into itself an has thus a fixed point. The derivative of $g$ is smaller than $frac{5}{12}<frac12$ providing sufficient speed of convergence. A numerical series confirms this result.



                           k         x[k]        x[k]-x[k-1]     1.4*0.3^k
                          

                          
 0      2.0
                          
 1      2.1363293408   0.1363293408     0.138
                          
 2      2.1786508930   0.04232155218    0.0414
                          
 3      2.1915435027   0.0128926097     0.01242
                          
 4      2.1954485170   0.003905014239   0.003726
                          
 5      2.1966292396   0.001180722584   0.0011178
                          
 6      2.1969860556   0.0003568160362  0.00033534
                          
 7      2.1970938687   0.0001078131484  0.000100602
                          
 8      2.1971264433   3.25745335e-05   3.01806e-05
                          
 9      2.1971362852   9.841886902e-06  9.05418e-06
                          
10      2.1971392587   2.973559468e-06  2.716254e-06
                          
11      2.1971401571   8.984094482e-07  8.148762e-07
                          
12      2.1971404286   2.714387324e-07  2.4446286e-07





                          share|cite|improve this answer









                          $endgroup$



                          The scholars of old had a philosophy of avoiding differences if manually computing roots of equations. That way a treatment of quadratic or cubic equations could fill multiple pages considering the various cases, but avoided the discussion of roots of negative numbers.



                          In your equation one would separate by this philosophy
                          $$
                          x^4+2x^3=5x^2+7x+5
                          $$
                          and solve the higher degree side, for instance as
                          $$
                          x=g(x)=sqrt[Large3,!]{frac{5x^2+7x+5}{x+2}}=sqrt[Large3,!]{5x-3+frac{11}{x+2}}
                          $$
                          This as fixed-point iteration maps the interval $[2,3]$ into itself an has thus a fixed point. The derivative of $g$ is smaller than $frac{5}{12}<frac12$ providing sufficient speed of convergence. A numerical series confirms this result.



                           k         x[k]        x[k]-x[k-1]     1.4*0.3^k
                          

                          
 0      2.0
                          
 1      2.1363293408   0.1363293408     0.138
                          
 2      2.1786508930   0.04232155218    0.0414
                          
 3      2.1915435027   0.0128926097     0.01242
                          
 4      2.1954485170   0.003905014239   0.003726
                          
 5      2.1966292396   0.001180722584   0.0011178
                          
 6      2.1969860556   0.0003568160362  0.00033534
                          
 7      2.1970938687   0.0001078131484  0.000100602
                          
 8      2.1971264433   3.25745335e-05   3.01806e-05
                          
 9      2.1971362852   9.841886902e-06  9.05418e-06
                          
10      2.1971392587   2.973559468e-06  2.716254e-06
                          
11      2.1971401571   8.984094482e-07  8.148762e-07
                          
12      2.1971404286   2.714387324e-07  2.4446286e-07






                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Jan 4 at 15:11









                          LutzLLutzL

                          57.2k42054




                          57.2k42054






























                              draft saved

                              draft discarded




















































                              Thanks for contributing an answer to Mathematics Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid …



                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.


                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2053965%2ffixed-point-iteration-finding-gx%23new-answer', 'question_page');
                              }
                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              'app-layout' is not a known element: how to share Component with different Modules

                              Image
                              0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule ...
                              Read more

                              android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

                              Image
                              .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d ...
                              Read more

                              WPF add header to Image with URL pettitions [duplicate]

                              Image
                              up vote 0 down vote favorite This question already has an answer here: Image source URI requiring authorization 3 answers Add header to all* HTTP requests on a machine 1 answer first of all sorry for my english. Recently I added some security in the backend of my project, and now I need to send a validation code(apiKey) inside the headers to retrieve the images. I have a problem with ALL images in my project that I had attached in my UI. For example, before I had: <Image Height="90" Source="{Binding Video.Thumbnail}"/> Now I need to change my code to create a CUSTOM petition add the apiKey in the header:...
                              Read more