Why does this iterative way of solving of equation work? The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Solving a Recurrence Relation/Equation, is there more than 1 way to solve this?Iterative method for matrix differential equationHow does this simplification work?Solution of $x^2(y')^2-2(xy-4)y'+y^2=0$For which values does this series converge?Why does changing variables work?Why does this method for solving recurrence relations work in some cases and not in others?What's wrong in this method of solving a difference equation?Solving a non-linear recurrence equationWhy variation of constant work to solve first order ODE?

What was the last x86 CPU that did not have the x87 floating-point unit built in?

I'm thinking of a number

Sort a list of pairs representing an acyclic, partial automorphism

I could not break this equation. Please help me

Is above average number of years spent on PhD considered a red flag in future academia or industry positions?

Keeping a retro style to sci-fi spaceships?

Working through the single responsibility principle (SRP) in Python when calls are expensive

Segmentation fault output is suppressed when piping stdin into a function. Why?

Simulating Exploding Dice

How did the audience guess the pentatonic scale in Bobby McFerrin's presentation?

Is this wall load bearing? Blueprints and photos attached

University's motivation for having tenure-track positions

Can a novice safely splice in wire to lengthen 5V charging cable?

How to test the equality of two Pearson correlation coefficients computed from the same sample?

Is there a writing software that you can sort scenes like slides in PowerPoint?

Am I ethically obligated to go into work on an off day if the reason is sudden?

Format single node in tikzcd

Difference between "generating set" and free product?

How long does the line of fire that you can create as an action using the Investiture of Flame spell last?

Can the prologue be the backstory of your main character?

how can a perfect fourth interval be considered either consonant or dissonant?

Is every episode of "Where are my Pants?" identical?

does high air pressure throw off wheel balance?

Semisimplicity of the category of coherent sheaves?



Why does this iterative way of solving of equation work?



The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Solving a Recurrence Relation/Equation, is there more than 1 way to solve this?Iterative method for matrix differential equationHow does this simplification work?Solution of $x^2(y')^2-2(xy-4)y'+y^2=0$For which values does this series converge?Why does changing variables work?Why does this method for solving recurrence relations work in some cases and not in others?What's wrong in this method of solving a difference equation?Solving a non-linear recurrence equationWhy variation of constant work to solve first order ODE?










2












$begingroup$


I was solving some semiconductor physics problem and in order to get the temperature I got this nasty equation:



$$ T = dfrac7020dfrac32ln(T)+12.$$



I was thougt that I can solve this kind of equation simply by guessing solution for $T$ and then substituting that answer back into equation and then again substituting answer back into equation and so on until I am satisfied by precision of result. Somehow this method works.



Concretly for my example, my first guess was $T=1$ and I got this sequance of numbers $(585.0, 325.6419704169386, 339.4797907885183, 338.4580701961562, 338.53186591337385,338.52652733834424, ...)$ and they really seem to solve equation better and better.



Questions.



1) What is intuitive way to see why this method works?



2) How can I show rigoursly that this method actualy converges to solution of equation?



3) Obvious generalization for which the method will works seems to be:
$$ x = dfracabln(x)+c. $$ For which $a,b,c$ will this method work? Is this equation special case of some natural generalization of this equation? What are some similar equations which I can solve via this described method?



4) When will sequance of numbers in iteratiton process be finite to exacly solve equatiton? Does that case exist? Is solution to equation:
$$ x = dfracabln(x)+c $$
always (for every $a,b,c$) irational? Is it transcendental? If not, for which $a,b,c$ will that be the case?



Thank you for any help.










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    Looks like the solution happens to be an attractive fixed point.
    $endgroup$
    – Brevan Ellefsen
    4 hours ago







  • 4




    $begingroup$
    It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
    $endgroup$
    – Ian
    4 hours ago







  • 1




    $begingroup$
    There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
    $endgroup$
    – hardmath
    4 hours ago















2












$begingroup$


I was solving some semiconductor physics problem and in order to get the temperature I got this nasty equation:



$$ T = dfrac7020dfrac32ln(T)+12.$$



I was thougt that I can solve this kind of equation simply by guessing solution for $T$ and then substituting that answer back into equation and then again substituting answer back into equation and so on until I am satisfied by precision of result. Somehow this method works.



Concretly for my example, my first guess was $T=1$ and I got this sequance of numbers $(585.0, 325.6419704169386, 339.4797907885183, 338.4580701961562, 338.53186591337385,338.52652733834424, ...)$ and they really seem to solve equation better and better.



Questions.



1) What is intuitive way to see why this method works?



2) How can I show rigoursly that this method actualy converges to solution of equation?



3) Obvious generalization for which the method will works seems to be:
$$ x = dfracabln(x)+c. $$ For which $a,b,c$ will this method work? Is this equation special case of some natural generalization of this equation? What are some similar equations which I can solve via this described method?



4) When will sequance of numbers in iteratiton process be finite to exacly solve equatiton? Does that case exist? Is solution to equation:
$$ x = dfracabln(x)+c $$
always (for every $a,b,c$) irational? Is it transcendental? If not, for which $a,b,c$ will that be the case?



Thank you for any help.










share|cite|improve this question









$endgroup$







  • 2




    $begingroup$
    Looks like the solution happens to be an attractive fixed point.
    $endgroup$
    – Brevan Ellefsen
    4 hours ago







  • 4




    $begingroup$
    It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
    $endgroup$
    – Ian
    4 hours ago







  • 1




    $begingroup$
    There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
    $endgroup$
    – hardmath
    4 hours ago













2












2








2





$begingroup$


I was solving some semiconductor physics problem and in order to get the temperature I got this nasty equation:



$$ T = dfrac7020dfrac32ln(T)+12.$$



I was thougt that I can solve this kind of equation simply by guessing solution for $T$ and then substituting that answer back into equation and then again substituting answer back into equation and so on until I am satisfied by precision of result. Somehow this method works.



Concretly for my example, my first guess was $T=1$ and I got this sequance of numbers $(585.0, 325.6419704169386, 339.4797907885183, 338.4580701961562, 338.53186591337385,338.52652733834424, ...)$ and they really seem to solve equation better and better.



Questions.



1) What is intuitive way to see why this method works?



2) How can I show rigoursly that this method actualy converges to solution of equation?



3) Obvious generalization for which the method will works seems to be:
$$ x = dfracabln(x)+c. $$ For which $a,b,c$ will this method work? Is this equation special case of some natural generalization of this equation? What are some similar equations which I can solve via this described method?



4) When will sequance of numbers in iteratiton process be finite to exacly solve equatiton? Does that case exist? Is solution to equation:
$$ x = dfracabln(x)+c $$
always (for every $a,b,c$) irational? Is it transcendental? If not, for which $a,b,c$ will that be the case?



Thank you for any help.










share|cite|improve this question









$endgroup$




I was solving some semiconductor physics problem and in order to get the temperature I got this nasty equation:



$$ T = dfrac7020dfrac32ln(T)+12.$$



I was thougt that I can solve this kind of equation simply by guessing solution for $T$ and then substituting that answer back into equation and then again substituting answer back into equation and so on until I am satisfied by precision of result. Somehow this method works.



Concretly for my example, my first guess was $T=1$ and I got this sequance of numbers $(585.0, 325.6419704169386, 339.4797907885183, 338.4580701961562, 338.53186591337385,338.52652733834424, ...)$ and they really seem to solve equation better and better.



Questions.



1) What is intuitive way to see why this method works?



2) How can I show rigoursly that this method actualy converges to solution of equation?



3) Obvious generalization for which the method will works seems to be:
$$ x = dfracabln(x)+c. $$ For which $a,b,c$ will this method work? Is this equation special case of some natural generalization of this equation? What are some similar equations which I can solve via this described method?



4) When will sequance of numbers in iteratiton process be finite to exacly solve equatiton? Does that case exist? Is solution to equation:
$$ x = dfracabln(x)+c $$
always (for every $a,b,c$) irational? Is it transcendental? If not, for which $a,b,c$ will that be the case?



Thank you for any help.







real-analysis sequences-and-series recurrence-relations irrational-numbers






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 4 hours ago









ThomThom

386111




386111







  • 2




    $begingroup$
    Looks like the solution happens to be an attractive fixed point.
    $endgroup$
    – Brevan Ellefsen
    4 hours ago







  • 4




    $begingroup$
    It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
    $endgroup$
    – Ian
    4 hours ago







  • 1




    $begingroup$
    There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
    $endgroup$
    – hardmath
    4 hours ago












  • 2




    $begingroup$
    Looks like the solution happens to be an attractive fixed point.
    $endgroup$
    – Brevan Ellefsen
    4 hours ago







  • 4




    $begingroup$
    It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
    $endgroup$
    – Ian
    4 hours ago







  • 1




    $begingroup$
    There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
    $endgroup$
    – hardmath
    4 hours ago







2




2




$begingroup$
Looks like the solution happens to be an attractive fixed point.
$endgroup$
– Brevan Ellefsen
4 hours ago





$begingroup$
Looks like the solution happens to be an attractive fixed point.
$endgroup$
– Brevan Ellefsen
4 hours ago





4




4




$begingroup$
It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
$endgroup$
– Ian
4 hours ago





$begingroup$
It's called fixed point iteration; it is one of the classical topics of numerical analysis. When the method works there is some geometric intuition in terms of a "web plot"; the geometric intuition shown there essentially captures the main idea of the proof, which is called the contraction mapping principle or the Banach fixed point theorem. You can use the statement of the fixed point theorem to answer your question 3, although resolving the dependence on the initial guess is usually intractable in practice. Your question 4 is also usually intractable to answer in practice.
$endgroup$
– Ian
4 hours ago





1




1




$begingroup$
There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
$endgroup$
– hardmath
4 hours ago




$begingroup$
There is a proof for existence and uniqueness of fixed points for contraction mappings on certain domains using iteration. I'll find you some links to previous Questions here.
$endgroup$
– hardmath
4 hours ago










3 Answers
3






active

oldest

votes


















2












$begingroup$

This method works because you are looking at a discrete dynamical of the form



$$x_n+1 = f(x_n)$$



where $f$ is a contraction. The rigorous proof is the Banach fixed point theorem.






share|cite|improve this answer









$endgroup$




















    2












    $begingroup$

    In general, a fixed point $p$ of a function $f(x)$ is an attractor for the iteration $x_n+1 = f(x_n)$ if $|f'(p)| < 1$. Then, if your initial guess is close enough to the fixed point, the iterations will eventually converge to it.
    If $|f'(p)| > 1$, the fixed point is a repeller, and the only way to converge to the fixed point is to start exactly there (or happen to land there after a finite
    number of iterations).



    You have three parameters $a,b,c$, but there are really just two because you can multiply numerator and denominator by the same constant. So let's suppose $b=1$. As Claude remarked, the fixed point is
    $$ p = fracaW(a e^c)$$
    and this is the only real fixed point if $a,c>0$ (this is easy to see because $f(x)$ is decreasing where it is positive). The curve $f'(p) = -1$ in the $a,c$ plane looks like this:



    enter image description here



    Above the curve, the fixed point is an attractor. In particular that is always true for $a > e$. However, $a=c=1$ is right on the curve, and it's not clear whether the fixed point would be an attractor in that case (it turns out that it isn't, by taking higher derivatives into account). If $(a,c)$ is below the curve, the fixed point is a repeller.






    share|cite|improve this answer









    $endgroup$




















      0












      $begingroup$

      The equation $$T=fracab log (T)+c$$ has explicit solution(s) in terms of Lambert function.



      The result is given by
      $$T=fracab, Wleft(fraca be^fraccbright)$$



      In the linked page, you will see the different steps.



      Applied to your case, this will immeditely give
      $$T=frac4680Wleft(4680 e^8right)=338.526887451390053458527935852$$ If you do not access this function, for large values of the argument, use the expansion given in the linked page
      $$W(x)=L_1-L_2+fracL_2L_1+frac(L_2-2) L_22 L_1^2+frac(2 L_2^2-9L_2+6) L_26 L_1^3+ ...$$ with $L_1=log (x)$ and $L_2=log (L_1)$






      share|cite|improve this answer









      $endgroup$












      • $begingroup$
        That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
        $endgroup$
        – marty cohen
        2 hours ago










      • $begingroup$
        @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
        $endgroup$
        – Claude Leibovici
        1 hour ago










      • $begingroup$
        Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
        $endgroup$
        – Brondahl
        9 mins ago











      Your Answer








      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%2f3186915%2fwhy-does-this-iterative-way-of-solving-of-equation-work%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$

      This method works because you are looking at a discrete dynamical of the form



      $$x_n+1 = f(x_n)$$



      where $f$ is a contraction. The rigorous proof is the Banach fixed point theorem.






      share|cite|improve this answer









      $endgroup$

















        2












        $begingroup$

        This method works because you are looking at a discrete dynamical of the form



        $$x_n+1 = f(x_n)$$



        where $f$ is a contraction. The rigorous proof is the Banach fixed point theorem.






        share|cite|improve this answer









        $endgroup$















          2












          2








          2





          $begingroup$

          This method works because you are looking at a discrete dynamical of the form



          $$x_n+1 = f(x_n)$$



          where $f$ is a contraction. The rigorous proof is the Banach fixed point theorem.






          share|cite|improve this answer









          $endgroup$



          This method works because you are looking at a discrete dynamical of the form



          $$x_n+1 = f(x_n)$$



          where $f$ is a contraction. The rigorous proof is the Banach fixed point theorem.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 4 hours ago









          Tony S.F.Tony S.F.

          3,51421030




          3,51421030





















              2












              $begingroup$

              In general, a fixed point $p$ of a function $f(x)$ is an attractor for the iteration $x_n+1 = f(x_n)$ if $|f'(p)| < 1$. Then, if your initial guess is close enough to the fixed point, the iterations will eventually converge to it.
              If $|f'(p)| > 1$, the fixed point is a repeller, and the only way to converge to the fixed point is to start exactly there (or happen to land there after a finite
              number of iterations).



              You have three parameters $a,b,c$, but there are really just two because you can multiply numerator and denominator by the same constant. So let's suppose $b=1$. As Claude remarked, the fixed point is
              $$ p = fracaW(a e^c)$$
              and this is the only real fixed point if $a,c>0$ (this is easy to see because $f(x)$ is decreasing where it is positive). The curve $f'(p) = -1$ in the $a,c$ plane looks like this:



              enter image description here



              Above the curve, the fixed point is an attractor. In particular that is always true for $a > e$. However, $a=c=1$ is right on the curve, and it's not clear whether the fixed point would be an attractor in that case (it turns out that it isn't, by taking higher derivatives into account). If $(a,c)$ is below the curve, the fixed point is a repeller.






              share|cite|improve this answer









              $endgroup$

















                2












                $begingroup$

                In general, a fixed point $p$ of a function $f(x)$ is an attractor for the iteration $x_n+1 = f(x_n)$ if $|f'(p)| < 1$. Then, if your initial guess is close enough to the fixed point, the iterations will eventually converge to it.
                If $|f'(p)| > 1$, the fixed point is a repeller, and the only way to converge to the fixed point is to start exactly there (or happen to land there after a finite
                number of iterations).



                You have three parameters $a,b,c$, but there are really just two because you can multiply numerator and denominator by the same constant. So let's suppose $b=1$. As Claude remarked, the fixed point is
                $$ p = fracaW(a e^c)$$
                and this is the only real fixed point if $a,c>0$ (this is easy to see because $f(x)$ is decreasing where it is positive). The curve $f'(p) = -1$ in the $a,c$ plane looks like this:



                enter image description here



                Above the curve, the fixed point is an attractor. In particular that is always true for $a > e$. However, $a=c=1$ is right on the curve, and it's not clear whether the fixed point would be an attractor in that case (it turns out that it isn't, by taking higher derivatives into account). If $(a,c)$ is below the curve, the fixed point is a repeller.






                share|cite|improve this answer









                $endgroup$















                  2












                  2








                  2





                  $begingroup$

                  In general, a fixed point $p$ of a function $f(x)$ is an attractor for the iteration $x_n+1 = f(x_n)$ if $|f'(p)| < 1$. Then, if your initial guess is close enough to the fixed point, the iterations will eventually converge to it.
                  If $|f'(p)| > 1$, the fixed point is a repeller, and the only way to converge to the fixed point is to start exactly there (or happen to land there after a finite
                  number of iterations).



                  You have three parameters $a,b,c$, but there are really just two because you can multiply numerator and denominator by the same constant. So let's suppose $b=1$. As Claude remarked, the fixed point is
                  $$ p = fracaW(a e^c)$$
                  and this is the only real fixed point if $a,c>0$ (this is easy to see because $f(x)$ is decreasing where it is positive). The curve $f'(p) = -1$ in the $a,c$ plane looks like this:



                  enter image description here



                  Above the curve, the fixed point is an attractor. In particular that is always true for $a > e$. However, $a=c=1$ is right on the curve, and it's not clear whether the fixed point would be an attractor in that case (it turns out that it isn't, by taking higher derivatives into account). If $(a,c)$ is below the curve, the fixed point is a repeller.






                  share|cite|improve this answer









                  $endgroup$



                  In general, a fixed point $p$ of a function $f(x)$ is an attractor for the iteration $x_n+1 = f(x_n)$ if $|f'(p)| < 1$. Then, if your initial guess is close enough to the fixed point, the iterations will eventually converge to it.
                  If $|f'(p)| > 1$, the fixed point is a repeller, and the only way to converge to the fixed point is to start exactly there (or happen to land there after a finite
                  number of iterations).



                  You have three parameters $a,b,c$, but there are really just two because you can multiply numerator and denominator by the same constant. So let's suppose $b=1$. As Claude remarked, the fixed point is
                  $$ p = fracaW(a e^c)$$
                  and this is the only real fixed point if $a,c>0$ (this is easy to see because $f(x)$ is decreasing where it is positive). The curve $f'(p) = -1$ in the $a,c$ plane looks like this:



                  enter image description here



                  Above the curve, the fixed point is an attractor. In particular that is always true for $a > e$. However, $a=c=1$ is right on the curve, and it's not clear whether the fixed point would be an attractor in that case (it turns out that it isn't, by taking higher derivatives into account). If $(a,c)$ is below the curve, the fixed point is a repeller.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 2 hours ago









                  Robert IsraelRobert Israel

                  331k23221477




                  331k23221477





















                      0












                      $begingroup$

                      The equation $$T=fracab log (T)+c$$ has explicit solution(s) in terms of Lambert function.



                      The result is given by
                      $$T=fracab, Wleft(fraca be^fraccbright)$$



                      In the linked page, you will see the different steps.



                      Applied to your case, this will immeditely give
                      $$T=frac4680Wleft(4680 e^8right)=338.526887451390053458527935852$$ If you do not access this function, for large values of the argument, use the expansion given in the linked page
                      $$W(x)=L_1-L_2+fracL_2L_1+frac(L_2-2) L_22 L_1^2+frac(2 L_2^2-9L_2+6) L_26 L_1^3+ ...$$ with $L_1=log (x)$ and $L_2=log (L_1)$






                      share|cite|improve this answer









                      $endgroup$












                      • $begingroup$
                        That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                        $endgroup$
                        – marty cohen
                        2 hours ago










                      • $begingroup$
                        @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                        $endgroup$
                        – Claude Leibovici
                        1 hour ago










                      • $begingroup$
                        Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                        $endgroup$
                        – Brondahl
                        9 mins ago















                      0












                      $begingroup$

                      The equation $$T=fracab log (T)+c$$ has explicit solution(s) in terms of Lambert function.



                      The result is given by
                      $$T=fracab, Wleft(fraca be^fraccbright)$$



                      In the linked page, you will see the different steps.



                      Applied to your case, this will immeditely give
                      $$T=frac4680Wleft(4680 e^8right)=338.526887451390053458527935852$$ If you do not access this function, for large values of the argument, use the expansion given in the linked page
                      $$W(x)=L_1-L_2+fracL_2L_1+frac(L_2-2) L_22 L_1^2+frac(2 L_2^2-9L_2+6) L_26 L_1^3+ ...$$ with $L_1=log (x)$ and $L_2=log (L_1)$






                      share|cite|improve this answer









                      $endgroup$












                      • $begingroup$
                        That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                        $endgroup$
                        – marty cohen
                        2 hours ago










                      • $begingroup$
                        @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                        $endgroup$
                        – Claude Leibovici
                        1 hour ago










                      • $begingroup$
                        Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                        $endgroup$
                        – Brondahl
                        9 mins ago













                      0












                      0








                      0





                      $begingroup$

                      The equation $$T=fracab log (T)+c$$ has explicit solution(s) in terms of Lambert function.



                      The result is given by
                      $$T=fracab, Wleft(fraca be^fraccbright)$$



                      In the linked page, you will see the different steps.



                      Applied to your case, this will immeditely give
                      $$T=frac4680Wleft(4680 e^8right)=338.526887451390053458527935852$$ If you do not access this function, for large values of the argument, use the expansion given in the linked page
                      $$W(x)=L_1-L_2+fracL_2L_1+frac(L_2-2) L_22 L_1^2+frac(2 L_2^2-9L_2+6) L_26 L_1^3+ ...$$ with $L_1=log (x)$ and $L_2=log (L_1)$






                      share|cite|improve this answer









                      $endgroup$



                      The equation $$T=fracab log (T)+c$$ has explicit solution(s) in terms of Lambert function.



                      The result is given by
                      $$T=fracab, Wleft(fraca be^fraccbright)$$



                      In the linked page, you will see the different steps.



                      Applied to your case, this will immeditely give
                      $$T=frac4680Wleft(4680 e^8right)=338.526887451390053458527935852$$ If you do not access this function, for large values of the argument, use the expansion given in the linked page
                      $$W(x)=L_1-L_2+fracL_2L_1+frac(L_2-2) L_22 L_1^2+frac(2 L_2^2-9L_2+6) L_26 L_1^3+ ...$$ with $L_1=log (x)$ and $L_2=log (L_1)$







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered 3 hours ago









                      Claude LeiboviciClaude Leibovici

                      125k1158135




                      125k1158135











                      • $begingroup$
                        That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                        $endgroup$
                        – marty cohen
                        2 hours ago










                      • $begingroup$
                        @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                        $endgroup$
                        – Claude Leibovici
                        1 hour ago










                      • $begingroup$
                        Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                        $endgroup$
                        – Brondahl
                        9 mins ago
















                      • $begingroup$
                        That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                        $endgroup$
                        – marty cohen
                        2 hours ago










                      • $begingroup$
                        @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                        $endgroup$
                        – Claude Leibovici
                        1 hour ago










                      • $begingroup$
                        Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                        $endgroup$
                        – Brondahl
                        9 mins ago















                      $begingroup$
                      That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                      $endgroup$
                      – marty cohen
                      2 hours ago




                      $begingroup$
                      That's equation (2.4.4) from Asymptotic Methods in Analysis by N. G. de Bruijn. A most excellent book.
                      $endgroup$
                      – marty cohen
                      2 hours ago












                      $begingroup$
                      @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                      $endgroup$
                      – Claude Leibovici
                      1 hour ago




                      $begingroup$
                      @martycohen. Thanks for the information ! Fortunately, we can find it in many places. A few years ago, one of my PhD students extended it to very high orders. Cheers :-)
                      $endgroup$
                      – Claude Leibovici
                      1 hour ago












                      $begingroup$
                      Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                      $endgroup$
                      – Brondahl
                      9 mins ago




                      $begingroup$
                      Whilst I'm sure this is accurate, and interesting contextual information. It isn't actually an answer to the question asked.
                      $endgroup$
                      – Brondahl
                      9 mins ago

















                      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%2f3186915%2fwhy-does-this-iterative-way-of-solving-of-equation-work%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

                      What does “fit” mean in this sentence? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)How does 'jealousy' mean 'suspicion'?What does “not so say” mean?Does “somebody of my caliber” mean the speaker themselves?“accounting for high fasting blood glucose”- help about the meaningWhat does “cloaked by NDA” mean in this context?What does it mean by 'community ownership' in this context?What does “human corroborators” mean in this context?What does “everything but a fire” mean in this context?What does “run” mean here?What does “rabbited” mean/imply in this sentence?

                      History of India Contents Prehistoric era (until c. 3300 BCE) Bronze Age – "First urbanisation" (c. 3300 – c. 1800 BCE) Climate change, de-urbanisation, and Indo-Aryan migrations (c.1800 – 1500 BCE) Iron Age - Vedic period (c. 1500 – c. 600 BCE) "Second urbanisation" (c. 600 – c. 200 BCE) Classical to early medieval periods (c. 200 BCE – c. 1200 CE) Late medieval period (c. 1200 – 1526 CE) Early modern period (c. 1526–1858 CE) Modern period and independence (after c. 1850 CE) Historiography See also References Further reading External links Navigation menureviewedee[update]The crisisThe Evolution and History of Human Populations in South Asia: Inter-disciplinary Studies in Archaeology, Biological Anthropology, Linguistics and GeneticsThe Ancient Indus: Urbanism, Economy, and Society"Indus River Valley Civilizations"The Ancient Indus: Urbanism, Economy, and Society"India before the British: The Mughal Empire and its Rivals, 1526–1857"Why Europe Grew Rich and Asia Did Not: Global Economic Divergence, 1600–1850Development Centre Studies The World Economy Historical Statistics: Historical StatisticsDeveloping cultures: case studiesEthnic Groups of South Asia and the Pacific: An Encyclopedia: An Encyclopedia"Indian Economy During British Rule""Economic Impact of the British Rule in India | Indian History"The Bone Readers: Science and Politics in Human Origins Research"Out of Africa: new hypotheses and evidence for the dispersal of Homo sapiens along the Indian Ocean rim"10.3109/0301446100363924920334598"Genetic and archaeological perspectives on the initial modern human colonization of southern Asia"2013PNAS..11010699M10.1073/pnas.1306043110369678523754394"Edakkal Caves|Places Around in Wayanad"Protecting megaliths to keep history alive The Hindu daily"Archaeologists rock solid behind Edakkal Cave"The Global Prehistory of Human Migration"Indus Valley 2,000 years older than thought"the original"Stepwells -Cosmology of Subterranean Architecture as seen in Adalaj"A History of Ancient and Early medieval India : from the Stone Age to the 12th century"Stone celts in Harappa"the original"Peoples and languages in pre-islamic Indus valley"the original"The Sindhi language"the originalThe Aryan chromosome"Fluvial landscapes of the Harappan Civilization"2012PNAS..109E1688G10.1073/pnas.1112743109338705422645375"Is River Ghaggar, Saraswati? Geochemical Constraints""An Ancient Civilization, Upended by Climate Change""Huge Ancient Civilization's Collapse Explained"2003GeoRL..30.1425S10.1029/2002GL0168222006QSRv...25.1283M10.1016/j.quascirev.2005.10.0122011QuInt.229..140M10.1016/j.quaint.2009.11.012Climate Change and the Course of Global History: A Rough JourneyA History of Ancient and Early Medieval India: From the Stone Age to the 12th CenturyA History of Ancient and Mediaeval India: From the Stone Age to the 12th CenturyAntennae SwordA History of IndiaA History of IndiaAn Introduction to Hinduism"India: The Late 2nd Millennium and the Reemergence of Urbanism"The Coinage of Ancient IndiaA Sanskrit reader: with vocabulary and notesPedigree: the origins of words from nature"Early Sanskritization. Origins and Development of the Kuru State"10.11588/ejvs.1995.4.823The Sanskrit epics, Part 2The City in South AsiaThe UpanishadsAn Introduction to HinduismReligions of the World, Second Edition: A Comprehensive Encyclopedia of Beliefs and PracticesA History of Ancient and Early Medieval India: From the Stone Age to the 12th CenturyEarly India: From the Origins to AD 1300Republics in ancient Indiapp. 83ff"Magadha Empire""Lumbini Development Trust: Restoring the Lumbini Garden"the originalThe great armies of antiquityarchived"The Achaemenid Persian Empire (550–330 B.C.)""East–West Orientation of Historical Empires"1076-156X"Dinner on the Grand Trunk Road"10.2307/32502263250226"Silappathikaram Tamil Literature"the originalManimekalai – English transliteration of Tamil originalIndian Temple Architecture: Form and Transformation : the Karṇāṭa Drāviḍa Tradition, 7th to 13th CenturiesBuddhist ArchitectureA History of India"The World Economy (GDP) : Historical Statistics by Professor Angus Maddison"The World Economy – Volume 1: A Millennial Perspective and Volume 2: Historical Statistics10.2307/32502140004-36483250214A Comprehensive History of India: Volume 2Between the Empires: Society in India, 300 to 400Emergence of Viṣṇu and Śiva Images in India: Numismatic and Sculptural Evidence"Parthian Pair of Earrings"the originalThe Medical Times and Gazette, Volume 1Greatest emporium in the worldThe Cambridge History of Ancient China: From the Origins of Civilization to 221 BCBuddhist Records of the Western WorldArchaeology in Soviet Central AsiaThe Grandeur of Gandhara: The Ancient Buddhist Civilization of the Swat, Peshawar, Kabul and Indus ValleysIndian Sculpture: Circa 500 B.C.-A.D. 700"The History of Pakistan: The Kushans"Gupta Dynasty – MSN Encartathe original"India – Historical Setting – The Classical Age – Gupta and Harsha""Gupta Dynasty, Golden Age Of India"the original"The Age of the Guptas and After"the originalNumber Theory and Its History"Gupta dynasty (Indian dynasty)""Gupta dynasty: empire in 4th century"the original"The Story of India – Photo Gallery"The ASI say499315420"Pallava script"p. 145"CNG: eAuction 329. INDIA, Post-Gupta (Ganges Valley). Vardhanas of Thanesar and Kanauj. Harshavardhana. Circa AD 606–647. AR Drachm (13mm, 2.28 g, 1h)""Harsha""Sthanvishvara (historical region, India)""Harsha (Indian emperor)"Shyama Kumar Chattopadhyaya (2000) The Philosophy of Sankar's Advaita VedantaShankara's IntroductionShankara's Introduction19373677Shankara's IntroductionIs The Buddhist 'No-Self' Doctrine Compatible With Pursuing Nirvana?The Seven Spiritual Laws Of YogaIndia: The Ancient Past. A History of the Indian-Subcontinent from 7000 BC to AD 1200The Kashmir Series: Glimpses of Kashmiri Culture – Vivekananda Kendra, Kanyakumari (p. 57).Al-Hind: Early Medieval India and the Expansion of Islam, 7th–11th CenturiesHistory of GopāchalaLand of Two Rivers: A History of Bengal from the Mahabharata to MujibEuropean Trade and Colonial ConquestA History of IndiaA Comprehensive History Of Ancient India (3 Vol. Set)"The Last Years of Cholas: The decline and fall of a dynasty"the originalFascinating Hindutva: Saffron Politics and Dalit MobilisationGazetteer of the province of OudhAl- Hind: The slave kings and the Islamic conquest. 2"Shahi Family"The Cambridge history of Islam"Ameer Nasir-ood-deen Subooktugeen"Gazetteer of the Attock District, 1930, Part 1Land of seven rivers: History of India's GeographyTemple Desecration and Indo-Muslim StatesIslam in South Asia: A Short HistoryBeyond Orientalism: The Work of Wilhelm Halbfass and Its Impact on Indian and Cross-cultural StudiesThe Making of Terrorism in Pakistan: Historical and Social Roots of ExtremismOrnament in Indian ArchitectureA historical review of Hindu India: 300 B.C. to 1200 A.D."Indian States and Union Territories"Islam in South Asia: A Short HistoryA Brief History of the Indian PeoplesThe Modern ReviewDelhi Sultanate"Battuta's Travels: Delhi, capital of Muslim India"the original"Timur – conquest of India"the originalIndia HandbookBhaktiThe Four Denomination of Hinduism10.1007/s11407-008-9049-925691067"Vijayanagara Research Project::Elephant Stables"10.2307/26465262646526Historical Dictionary of the TamilsBihar General Knowledge DigestMapping Bihar: From Medieval to Modern TimesPopular Literature and Pre-modern Societies in South AsiaA manual of the Kistna district in the presidency of MadrasAncient Indian History and CivilizationFragmented Memories: Struggling to be Tai-Ahom in India"The Islamic World to 1600: Rise of the Great Islamic Empires (The Mughal Empire)"the originalDynasties: A Global History of Power, 1300–1800, p. 105"Whose fort is it anyway"10.1111/0020-8833.000532600793Development Centre Studies The World Economy Historical Statistics: Historical Statistics"India's Deindustrialization in the 18th and 19th Centuries"The Mughal Empire, p. 190"The Long Globalization and Textile Producers in India"The Mughal World: Life in India's Last Golden AgeAurangzeb: The Life and Legacy of India's Most Controversial KingIn the Shadow of the Taj: A Portrait of Agra"Iran in the Age of the Raj"p. 8610.2307/20539802053980Delhi, the Capital of IndiaAn Advanced History of Modern India"Journal of the Tanjore Maharaja Serfoji's Sarasvati Mahal Library"The Rediscovery of India: A New SubcontinentIslamic Renaissance In South Asia (1707–1867) : The Role Of Shah Waliallah & His SuccessorsAn Advanced History of Modern IndiaThe Great Maratha Mahadaji Scindia"Full text of "Selections from the papers of Lord Metcalfe; late governor-general of India, governor of Jamaica, and governor-general of Canada""The Discovery Of IndiaThe Sacred City of the Hindus: An Account of Benares in Ancient and Modern TimesResurrecting Banaras: Urban Space, Architecture and Religious BoundariesFaith & Philosophy of Sikhism"Missiles mainstay of Pak's N-arsenal"History Modern India By S.N. Sen"Sirajuddaula"ArchivedLongman History & Civics (Dual Government in Bengal)Madhya Pradesh National Means-Cum-Merit Scholarship Exam (Warren Hasting's system of Dual Government)A Military History of Britain: from 1775 to the PresentIndian Cultural Heritage Perspective For TourismHindu Rulers, Muslim Subjects: Islam, Rights, and the History of KashmirIndian HistoryAn Atlas and Survey of South Asian HistoryAn Historical Account of the British Trade Over the Caspian SeaIndian Merchants and Eurasian Trade, 1600–1750The Indian diaspora in Central Asia and its trade, 1550–1900From Constantinople to the home of Omar Khayyam: travels in Transcaucasia and northern Persia for historic and literary researchA journey from Bengal to England: through the northern part of India, Kashmire, Afghanistan, and Persia, and into Russia, by the Caspian-SeaA Second Journey through Persia, Armenia, and Asia Minor, to Constantinople, between the Years 1810 and 1816Reports from the consuls of the United States, 1887Portugal and its Empire, 1250–1800 (Collected Essays in Memory of Glenn J. Ames).: Portuguese Studies Review, Vol. 17, No. 1The Dutch Power in Kerala, 1729–1758http://mod.nic.inArchivedDossier Goa – A Recusa do Sacrifício InútilAn Imperial Crisis in British India: The Manipur Uprising of 1891The Truth of Babri Mosque"Kolkata (Calcutta) : History"the original"Robert Clive, Baron Clive, 'Clive of India', 1725–1774""The Transformation from a Pre-Colonial to a Colonial Order: The Case of India"10.2307/25955872595587A versatile geniusArchived10.1109/MWSYM.1997.602854"Rabindranath Tagore on Education"the original"Essay on 'Derozio and the Young Bengal Movement'"Poverty and Famines: An Essay on Entitlement and Deprivation"Plague"the originalPopulation Growth and Land Use"Reintegrating India with the World Economy""Census Of India 1931"A history of modern India, 1480–1950"'India's well-timed diversification of army helped democracy' | Business Standard News"Bal Gangadhar Tilak: Struggle for Swaraj"Participants from the Indian subcontinent in the First World War""Commonwealth War Graves Commission Annual Report 2007–2008 Online"the original1462689197110.1017/s0010417500016534178920Eurocentrism: a marxian critical realist critique"Ranjit Guha, "On Some Aspects of Historiography of Colonial India""10.2307/2168385216838510.7202/016593ar"Harvard scholar says the idea of India dates to a much earlier time than the British or the Mughals""In The Footsteps of Pilgrims""India's spiritual landscape: The heavens and the earth""India: A Sacred Geography by Diana L Eck – review"Modern India: The Origins of an Asian Democracy10.2307/21694222169422964322464"The Indian Subcontinent and 'Out of Africa 1'"254043308Encyclopedia of World ReligionsThe Evolution and History of Human Populations in South Asia: Inter-disciplinary Studies in Archaeology, Biological Anthropology, Linguistics and Genetics"The Early Paleolithic of the Indian Subcontinent: Hominin Colonization, Dispersals and Occupation History"Ancient Indian History and CivilizationAncient Indian Social History: Some Interpretationsthe originalIndia Before EuropeA Concise History of Modern India"The beginning of the historical period, c. 500–150 BCE"full textA History of Indiathe originalexcerpt and text searchexcerptexcerptAn Economic History of India: From Pre-Colonial Times to 1991excerpt and text searchexcerpt and text searchIndia as known to the ancient world10.1111/j.1468-0289.1985.tb00391.x2597191onlineThe History of India, as told by its own historians. The Muhammadan Periodonline editionHans William Brown research collection on 19th-century missionary work in India, 1882–1932, Ms. Coll. 1033, Kislak Center for Special Collections, Rare Books and Manuscripts, University of Pennsylvaniaee

                      Isurus Índice Especies | Notas | Véxase tamén | Menú de navegación"A compendium of fossil marine animal genera (Chondrichthyes entry)"o orixinal"A review of the Tertiary fossil Cetacea (Mammalia) localities in wales port taf Museum Victoria"o orixinalThe Vertebrate Fauna of the Selma Formation of Alabama. Part VII. Part VIII. The Mosasaurs The Fishes50419737IDsh85068767Isurus2548834613242066569678159923NHMSYS00210535017845105743