Checking to see if is correctHigh iteration Newton's MethodGlobally Convergent Methods for Nonlinear Systems of EquationsHow to correctly apply Newton-Raphson method to Backward Euler method?Optimizing trigonometric and nonlinear functionsbisection method, Numerical AnalysisCan someone explain Newton's method to me?Relating convergence theorem for Newton-Raphson method to Newton fractalHow to solve for the interval of convergence in Newton's Method?Newton's Method for nonlinear systemsNewton Raphson method initial guessRecommendations for Numerical Analysis book covering specific requirements?

Western buddy movie with a supernatural twist where a woman turns into an eagle at the end

Is Lorentz symmetry broken if SUSY is broken?

Should I tell management that I intend to leave due to bad software development practices?

Can a rocket refuel on Mars from water?

Watching something be written to a file live with tail

Can one be a co-translator of a book, if he does not know the language that the book is translated into?

What does it mean to describe someone as a butt steak?

How do I write bicross product symbols in latex?

Can I use a neutral wire from another outlet to repair a broken neutral?

What's the difference between 'rename' and 'mv'?

Is it legal for company to use my work email to pretend I still work there?

Brothers & sisters

Facing a paradox: Earnshaw's theorem in one dimension

Took a trip to a parallel universe, need help deciphering

What is the intuition behind short exact sequences of groups; in particular, what is the intuition behind group extensions?

Can a virus destroy the BIOS of a modern computer?

Is there a hemisphere-neutral way of specifying a season?

Can I ask the recruiters in my resume to put the reason why I am rejected?

Why is Collection not simply treated as Collection<?>

How to say in German "enjoying home comforts"

How could indestructible materials be used in power generation?

If a Gelatinous Cube takes up the entire space of a Pit Trap, what happens when a creature falls into the trap but succeeds on the saving throw?

What mechanic is there to disable a threat instead of killing it?

Theorems that impeded progress



Checking to see if is correct


High iteration Newton's MethodGlobally Convergent Methods for Nonlinear Systems of EquationsHow to correctly apply Newton-Raphson method to Backward Euler method?Optimizing trigonometric and nonlinear functionsbisection method, Numerical AnalysisCan someone explain Newton's method to me?Relating convergence theorem for Newton-Raphson method to Newton fractalHow to solve for the interval of convergence in Newton's Method?Newton's Method for nonlinear systemsNewton Raphson method initial guessRecommendations for Numerical Analysis book covering specific requirements?













0












$begingroup$


Suppose Newton’s method is applied to the function f(x) = 1/x. If the initial guess is
x0 = 1, find x50.



Solution
F(x) =1/x x0=1 where n=1,2,3,...
F'(x) =-1/(x^2)
Xn+1=xn-(f(xn))/(f'(xn))
And I had x50=1125899907*10^6










share|cite|improve this question









New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
    $endgroup$
    – D.B.
    Mar 29 at 2:38










  • $begingroup$
    Boy... this is the worst posting title I have ever seen.
    $endgroup$
    – David G. Stork
    Mar 29 at 5:17






  • 1




    $begingroup$
    Possible duplicate of High iteration Newton's Method
    $endgroup$
    – Carl Christian
    Mar 29 at 18:53










  • $begingroup$
    You may find this answer to your question instructive.
    $endgroup$
    – Carl Christian
    Mar 29 at 22:21















0












$begingroup$


Suppose Newton’s method is applied to the function f(x) = 1/x. If the initial guess is
x0 = 1, find x50.



Solution
F(x) =1/x x0=1 where n=1,2,3,...
F'(x) =-1/(x^2)
Xn+1=xn-(f(xn))/(f'(xn))
And I had x50=1125899907*10^6










share|cite|improve this question









New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$











  • $begingroup$
    Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
    $endgroup$
    – D.B.
    Mar 29 at 2:38










  • $begingroup$
    Boy... this is the worst posting title I have ever seen.
    $endgroup$
    – David G. Stork
    Mar 29 at 5:17






  • 1




    $begingroup$
    Possible duplicate of High iteration Newton's Method
    $endgroup$
    – Carl Christian
    Mar 29 at 18:53










  • $begingroup$
    You may find this answer to your question instructive.
    $endgroup$
    – Carl Christian
    Mar 29 at 22:21













0












0








0





$begingroup$


Suppose Newton’s method is applied to the function f(x) = 1/x. If the initial guess is
x0 = 1, find x50.



Solution
F(x) =1/x x0=1 where n=1,2,3,...
F'(x) =-1/(x^2)
Xn+1=xn-(f(xn))/(f'(xn))
And I had x50=1125899907*10^6










share|cite|improve this question









New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




Suppose Newton’s method is applied to the function f(x) = 1/x. If the initial guess is
x0 = 1, find x50.



Solution
F(x) =1/x x0=1 where n=1,2,3,...
F'(x) =-1/(x^2)
Xn+1=xn-(f(xn))/(f'(xn))
And I had x50=1125899907*10^6







numerical-methods






share|cite|improve this question









New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited Mar 29 at 2:38







Andrew Odonkor













New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Mar 29 at 2:32









Andrew OdonkorAndrew Odonkor

61




61




New contributor




Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Andrew Odonkor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











  • $begingroup$
    Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
    $endgroup$
    – D.B.
    Mar 29 at 2:38










  • $begingroup$
    Boy... this is the worst posting title I have ever seen.
    $endgroup$
    – David G. Stork
    Mar 29 at 5:17






  • 1




    $begingroup$
    Possible duplicate of High iteration Newton's Method
    $endgroup$
    – Carl Christian
    Mar 29 at 18:53










  • $begingroup$
    You may find this answer to your question instructive.
    $endgroup$
    – Carl Christian
    Mar 29 at 22:21
















  • $begingroup$
    Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
    $endgroup$
    – D.B.
    Mar 29 at 2:38










  • $begingroup$
    Boy... this is the worst posting title I have ever seen.
    $endgroup$
    – David G. Stork
    Mar 29 at 5:17






  • 1




    $begingroup$
    Possible duplicate of High iteration Newton's Method
    $endgroup$
    – Carl Christian
    Mar 29 at 18:53










  • $begingroup$
    You may find this answer to your question instructive.
    $endgroup$
    – Carl Christian
    Mar 29 at 22:21















$begingroup$
Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
$endgroup$
– D.B.
Mar 29 at 2:38




$begingroup$
Your answer makes sense, considering that $f(x) = 1/x$ has no zeros.
$endgroup$
– D.B.
Mar 29 at 2:38












$begingroup$
Boy... this is the worst posting title I have ever seen.
$endgroup$
– David G. Stork
Mar 29 at 5:17




$begingroup$
Boy... this is the worst posting title I have ever seen.
$endgroup$
– David G. Stork
Mar 29 at 5:17




1




1




$begingroup$
Possible duplicate of High iteration Newton's Method
$endgroup$
– Carl Christian
Mar 29 at 18:53




$begingroup$
Possible duplicate of High iteration Newton's Method
$endgroup$
– Carl Christian
Mar 29 at 18:53












$begingroup$
You may find this answer to your question instructive.
$endgroup$
– Carl Christian
Mar 29 at 22:21




$begingroup$
You may find this answer to your question instructive.
$endgroup$
– Carl Christian
Mar 29 at 22:21










1 Answer
1






active

oldest

votes


















0












$begingroup$

I get that
$$x_n+1 = x_n - fracf(x_n)f'(x_n) = x_n - fracfrac1x_n-frac1x_n^2 = x_n + x_n = 2x_n,$$
thus $x_n = 2^n$, given $x_0 = 1$. According to Google, we have
$$x_50 = 2^50 approx 1.1258999 cdot 10^15,$$
which appears roughly the same as what you've got.






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
    );



    );






    Andrew Odonkor is a new contributor. Be nice, and check out our Code of Conduct.









    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3166662%2fchecking-to-see-if-is-correct%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    I get that
    $$x_n+1 = x_n - fracf(x_n)f'(x_n) = x_n - fracfrac1x_n-frac1x_n^2 = x_n + x_n = 2x_n,$$
    thus $x_n = 2^n$, given $x_0 = 1$. According to Google, we have
    $$x_50 = 2^50 approx 1.1258999 cdot 10^15,$$
    which appears roughly the same as what you've got.






    share|cite|improve this answer









    $endgroup$

















      0












      $begingroup$

      I get that
      $$x_n+1 = x_n - fracf(x_n)f'(x_n) = x_n - fracfrac1x_n-frac1x_n^2 = x_n + x_n = 2x_n,$$
      thus $x_n = 2^n$, given $x_0 = 1$. According to Google, we have
      $$x_50 = 2^50 approx 1.1258999 cdot 10^15,$$
      which appears roughly the same as what you've got.






      share|cite|improve this answer









      $endgroup$















        0












        0








        0





        $begingroup$

        I get that
        $$x_n+1 = x_n - fracf(x_n)f'(x_n) = x_n - fracfrac1x_n-frac1x_n^2 = x_n + x_n = 2x_n,$$
        thus $x_n = 2^n$, given $x_0 = 1$. According to Google, we have
        $$x_50 = 2^50 approx 1.1258999 cdot 10^15,$$
        which appears roughly the same as what you've got.






        share|cite|improve this answer









        $endgroup$



        I get that
        $$x_n+1 = x_n - fracf(x_n)f'(x_n) = x_n - fracfrac1x_n-frac1x_n^2 = x_n + x_n = 2x_n,$$
        thus $x_n = 2^n$, given $x_0 = 1$. According to Google, we have
        $$x_50 = 2^50 approx 1.1258999 cdot 10^15,$$
        which appears roughly the same as what you've got.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 29 at 2:42









        Theo BenditTheo Bendit

        20.2k12353




        20.2k12353




















            Andrew Odonkor is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            Andrew Odonkor is a new contributor. Be nice, and check out our Code of Conduct.












            Andrew Odonkor is a new contributor. Be nice, and check out our Code of Conduct.











            Andrew Odonkor is a new contributor. Be nice, and check out our Code of Conduct.














            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%2f3166662%2fchecking-to-see-if-is-correct%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ