GMRES vs Newton-GMRES for Solving nonlinear PDE'sNewton-Raphson method for nonlinear partial differential equationsSolving a nonlinear algebraic system that includes a linear termIs it possible to solve nonlinear PDEs without using Newton-Raphson iteration?Solving a system of nonlinear equations with an ODE solver is faster than with the Newton method?Newton iteration applied to nonlinear PDESolving this nonlinear system of equationsNumerically solving a system of stiff nonlinear PDEsNewton method for a nonlinear system of time-independent PDEsNonlinear system with diagonal nonlinearityResidual value goes to NaN while solving a system of nonlinear equations

Can a black dragonborn's acid breath weapon destroy objects?

What makes Ada the language of choice for the ISS's safety-critical systems?

What makes an item an artifact?

Should I give professor gift at the beginning of my PhD?

Taxi Services at Didcot

An average heaven where everyone has sexless golden bodies and is bored

Do simulator games use a realistic trajectory to get into orbit?

What language is the software written in on the ISS?

What is the `some` keyword in SwiftUI

Preventing Employees from either switching to Competitors or Opening Their Own Business

Frame failure sudden death?

How Can I Tell The Difference Between Unmarked Sugar and Stevia?

Can someone help me to understand this sentence? "Apple Inc. tumbled as the companies appear set to undergo U.S. antitrust probes"

"You've got another thing coming" - translation into French

Is it a problem if <h4>, <h5> and <h6> are smaller than regular text?

How would a aircraft visually signal "in distress"?

Is it possible to 'live off the sea'

Should an arbiter claim draw at a K+R vs K+R endgame?

How can drunken, homicidal elves successfully conduct a wild hunt?

At what point in time did Dumbledore ask Snape for this favor?

What are the peak hours for public transportation in Paris?

Implement Homestuck's Catenative Doomsday Dice Cascader

What's the largest optical telescope mirror ever put in space?

Watts vs. Volt Amps



GMRES vs Newton-GMRES for Solving nonlinear PDE's


Newton-Raphson method for nonlinear partial differential equationsSolving a nonlinear algebraic system that includes a linear termIs it possible to solve nonlinear PDEs without using Newton-Raphson iteration?Solving a system of nonlinear equations with an ODE solver is faster than with the Newton method?Newton iteration applied to nonlinear PDESolving this nonlinear system of equationsNumerically solving a system of stiff nonlinear PDEsNewton method for a nonlinear system of time-independent PDEsNonlinear system with diagonal nonlinearityResidual value goes to NaN while solving a system of nonlinear equations













1












$begingroup$


Often when numerically solving nonlinear PDE's using method of lines approach with an implicit integrator a system of nonlinear equations have to be solved.
To be more specific, let's say we have simple backward Euler method:
beginalign
y^n=y^n+1-h f(y^n+1,t)= G(y^n+1,t)
endalign

From the available literature, it seems the most common approach is using an Newton-GMRES method to solve the nonlinear system, especially if it is stiff.
As far as I can understand GMRES is used because it is a matrix-free method and so also works with vector functions which is good when approximating the Jacobian with finite differences.



My question is then, why not just use the GMRES to solve the initial problem?
I see no reason why GMRES couldn't solve this for $y^n+1$ when for the Newton-GMRES we solve the system:
beginalign
H(y^n+1_k) &= y^n+1_k-y^n-h f(y^n+1_k,t)rightarrow 0 text for krightarrow infty\
Jv &simeq fracH(y^n+1_k+epsilon v)-H(y^n+1_k))epsilon simeq -H(y^n+1_k)\
y^n+1_k+1&=y^n+1_k+v
endalign

where the GMRES is used for the second part to find $v$. I don't see why solving for $v$ with GMRES followed by the Newton step should be easier/better than solving the general system in the top for $y^n+1$ using GMRES? Does the finite difference approximation to the Jacobian have better properties compared the the general system $y^n=G(y^n+1,t)$?










share|cite|improve this question











$endgroup$
















    1












    $begingroup$


    Often when numerically solving nonlinear PDE's using method of lines approach with an implicit integrator a system of nonlinear equations have to be solved.
    To be more specific, let's say we have simple backward Euler method:
    beginalign
    y^n=y^n+1-h f(y^n+1,t)= G(y^n+1,t)
    endalign

    From the available literature, it seems the most common approach is using an Newton-GMRES method to solve the nonlinear system, especially if it is stiff.
    As far as I can understand GMRES is used because it is a matrix-free method and so also works with vector functions which is good when approximating the Jacobian with finite differences.



    My question is then, why not just use the GMRES to solve the initial problem?
    I see no reason why GMRES couldn't solve this for $y^n+1$ when for the Newton-GMRES we solve the system:
    beginalign
    H(y^n+1_k) &= y^n+1_k-y^n-h f(y^n+1_k,t)rightarrow 0 text for krightarrow infty\
    Jv &simeq fracH(y^n+1_k+epsilon v)-H(y^n+1_k))epsilon simeq -H(y^n+1_k)\
    y^n+1_k+1&=y^n+1_k+v
    endalign

    where the GMRES is used for the second part to find $v$. I don't see why solving for $v$ with GMRES followed by the Newton step should be easier/better than solving the general system in the top for $y^n+1$ using GMRES? Does the finite difference approximation to the Jacobian have better properties compared the the general system $y^n=G(y^n+1,t)$?










    share|cite|improve this question











    $endgroup$














      1












      1








      1





      $begingroup$


      Often when numerically solving nonlinear PDE's using method of lines approach with an implicit integrator a system of nonlinear equations have to be solved.
      To be more specific, let's say we have simple backward Euler method:
      beginalign
      y^n=y^n+1-h f(y^n+1,t)= G(y^n+1,t)
      endalign

      From the available literature, it seems the most common approach is using an Newton-GMRES method to solve the nonlinear system, especially if it is stiff.
      As far as I can understand GMRES is used because it is a matrix-free method and so also works with vector functions which is good when approximating the Jacobian with finite differences.



      My question is then, why not just use the GMRES to solve the initial problem?
      I see no reason why GMRES couldn't solve this for $y^n+1$ when for the Newton-GMRES we solve the system:
      beginalign
      H(y^n+1_k) &= y^n+1_k-y^n-h f(y^n+1_k,t)rightarrow 0 text for krightarrow infty\
      Jv &simeq fracH(y^n+1_k+epsilon v)-H(y^n+1_k))epsilon simeq -H(y^n+1_k)\
      y^n+1_k+1&=y^n+1_k+v
      endalign

      where the GMRES is used for the second part to find $v$. I don't see why solving for $v$ with GMRES followed by the Newton step should be easier/better than solving the general system in the top for $y^n+1$ using GMRES? Does the finite difference approximation to the Jacobian have better properties compared the the general system $y^n=G(y^n+1,t)$?










      share|cite|improve this question











      $endgroup$




      Often when numerically solving nonlinear PDE's using method of lines approach with an implicit integrator a system of nonlinear equations have to be solved.
      To be more specific, let's say we have simple backward Euler method:
      beginalign
      y^n=y^n+1-h f(y^n+1,t)= G(y^n+1,t)
      endalign

      From the available literature, it seems the most common approach is using an Newton-GMRES method to solve the nonlinear system, especially if it is stiff.
      As far as I can understand GMRES is used because it is a matrix-free method and so also works with vector functions which is good when approximating the Jacobian with finite differences.



      My question is then, why not just use the GMRES to solve the initial problem?
      I see no reason why GMRES couldn't solve this for $y^n+1$ when for the Newton-GMRES we solve the system:
      beginalign
      H(y^n+1_k) &= y^n+1_k-y^n-h f(y^n+1_k,t)rightarrow 0 text for krightarrow infty\
      Jv &simeq fracH(y^n+1_k+epsilon v)-H(y^n+1_k))epsilon simeq -H(y^n+1_k)\
      y^n+1_k+1&=y^n+1_k+v
      endalign

      where the GMRES is used for the second part to find $v$. I don't see why solving for $v$ with GMRES followed by the Newton step should be easier/better than solving the general system in the top for $y^n+1$ using GMRES? Does the finite difference approximation to the Jacobian have better properties compared the the general system $y^n=G(y^n+1,t)$?







      pde nonlinear-equations newton-method implicit-methods gmres






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 8 hours ago









      Anton Menshov

      4,62121872




      4,62121872










      asked 8 hours ago









      RasmusRasmus

      432




      432




















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          The reason is that GMRES can only be used for solving linear equations, i.e. equations of the form $Ax=b$, where $A$ is some matrix and $x,b$ are vectors. What GMRES does, essentially, is it approximates multiplication by the matrix $A^-1$ using a matrix polynomial of $A$.



          In this case (I assume) $f(y^n+1,t)$ is not necessarily linear in the vector $y^n+1$, and so $y^n=G(y^n+1,t)$ can't be written in the form $y^n=A(t)y^n+1$, where $A(t)$ is a matrix-valued function of time. So you can't use GMRES directly.



          The "Newton step" is actually the formation of the linear system of equations with the Jacobian; the point of Newton's method is that it approximates the solution of a nonlinear equation with the solution of a sequence of linear equations. GMRES is just a tool that is used to implement Newton's method.






          share|cite|improve this answer








          New contributor



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





          $endgroup$













            Your Answer








            StackExchange.ready(function()
            var channelOptions =
            tags: "".split(" "),
            id: "363"
            ;
            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: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            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
            ,
            onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            );



            );













            draft saved

            draft discarded


















            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fscicomp.stackexchange.com%2fquestions%2f32788%2fgmres-vs-newton-gmres-for-solving-nonlinear-pdes%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









            3












            $begingroup$

            The reason is that GMRES can only be used for solving linear equations, i.e. equations of the form $Ax=b$, where $A$ is some matrix and $x,b$ are vectors. What GMRES does, essentially, is it approximates multiplication by the matrix $A^-1$ using a matrix polynomial of $A$.



            In this case (I assume) $f(y^n+1,t)$ is not necessarily linear in the vector $y^n+1$, and so $y^n=G(y^n+1,t)$ can't be written in the form $y^n=A(t)y^n+1$, where $A(t)$ is a matrix-valued function of time. So you can't use GMRES directly.



            The "Newton step" is actually the formation of the linear system of equations with the Jacobian; the point of Newton's method is that it approximates the solution of a nonlinear equation with the solution of a sequence of linear equations. GMRES is just a tool that is used to implement Newton's method.






            share|cite|improve this answer








            New contributor



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





            $endgroup$

















              3












              $begingroup$

              The reason is that GMRES can only be used for solving linear equations, i.e. equations of the form $Ax=b$, where $A$ is some matrix and $x,b$ are vectors. What GMRES does, essentially, is it approximates multiplication by the matrix $A^-1$ using a matrix polynomial of $A$.



              In this case (I assume) $f(y^n+1,t)$ is not necessarily linear in the vector $y^n+1$, and so $y^n=G(y^n+1,t)$ can't be written in the form $y^n=A(t)y^n+1$, where $A(t)$ is a matrix-valued function of time. So you can't use GMRES directly.



              The "Newton step" is actually the formation of the linear system of equations with the Jacobian; the point of Newton's method is that it approximates the solution of a nonlinear equation with the solution of a sequence of linear equations. GMRES is just a tool that is used to implement Newton's method.






              share|cite|improve this answer








              New contributor



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





              $endgroup$















                3












                3








                3





                $begingroup$

                The reason is that GMRES can only be used for solving linear equations, i.e. equations of the form $Ax=b$, where $A$ is some matrix and $x,b$ are vectors. What GMRES does, essentially, is it approximates multiplication by the matrix $A^-1$ using a matrix polynomial of $A$.



                In this case (I assume) $f(y^n+1,t)$ is not necessarily linear in the vector $y^n+1$, and so $y^n=G(y^n+1,t)$ can't be written in the form $y^n=A(t)y^n+1$, where $A(t)$ is a matrix-valued function of time. So you can't use GMRES directly.



                The "Newton step" is actually the formation of the linear system of equations with the Jacobian; the point of Newton's method is that it approximates the solution of a nonlinear equation with the solution of a sequence of linear equations. GMRES is just a tool that is used to implement Newton's method.






                share|cite|improve this answer








                New contributor



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





                $endgroup$



                The reason is that GMRES can only be used for solving linear equations, i.e. equations of the form $Ax=b$, where $A$ is some matrix and $x,b$ are vectors. What GMRES does, essentially, is it approximates multiplication by the matrix $A^-1$ using a matrix polynomial of $A$.



                In this case (I assume) $f(y^n+1,t)$ is not necessarily linear in the vector $y^n+1$, and so $y^n=G(y^n+1,t)$ can't be written in the form $y^n=A(t)y^n+1$, where $A(t)$ is a matrix-valued function of time. So you can't use GMRES directly.



                The "Newton step" is actually the formation of the linear system of equations with the Jacobian; the point of Newton's method is that it approximates the solution of a nonlinear equation with the solution of a sequence of linear equations. GMRES is just a tool that is used to implement Newton's method.







                share|cite|improve this answer








                New contributor



                bgav 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 answer



                share|cite|improve this answer






                New contributor



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








                answered 7 hours ago









                bgavbgav

                311




                311




                New contributor



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




                New contributor




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





























                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to Computational Science 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%2fscicomp.stackexchange.com%2fquestions%2f32788%2fgmres-vs-newton-gmres-for-solving-nonlinear-pdes%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

                    Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

                    Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

                    Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її