What numerical method does Matlab's bvp4c use?












0












$begingroup$


Can anyone shed some light on how matlab's bvp4c function works? I've looked online but I haven't found any specifics on the method it uses.



With that question asked, what are some different ways on solving bvp problems. I am aware of the shooting method, but for my problem I know exactly what my initial and end conditions are, I'm more interested in what happens in between. And unless I understand the method wrong, the goal is to figure out what your initial conditions are with the shooting method.



For my particular problem "4th order, non-linear, variable coefficient, homogeneous ODE. And by 4th order, I'm referring to the highest derivative" I'm having trouble figuring out a way to solve this problem.



Any help useful information would be greatly appreciated.






ordinary-differential-equations numerical-methods matlab boundary-value-problem







share|cite|improve this question











$endgroup$












  • $begingroup$
    What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
    $endgroup$
    – LutzL
    Jan 2 at 21:36










  • $begingroup$
    What numerical method does it use.
    $endgroup$
    – tenichols
    Jan 2 at 21:40






  • 1




    $begingroup$
    Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
    $endgroup$
    – LutzL
    Jan 2 at 21:52












  • $begingroup$
    What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
    $endgroup$
    – LutzL
    Jan 2 at 21:55
















0












$begingroup$


Can anyone shed some light on how matlab's bvp4c function works? I've looked online but I haven't found any specifics on the method it uses.



With that question asked, what are some different ways on solving bvp problems. I am aware of the shooting method, but for my problem I know exactly what my initial and end conditions are, I'm more interested in what happens in between. And unless I understand the method wrong, the goal is to figure out what your initial conditions are with the shooting method.



For my particular problem "4th order, non-linear, variable coefficient, homogeneous ODE. And by 4th order, I'm referring to the highest derivative" I'm having trouble figuring out a way to solve this problem.



Any help useful information would be greatly appreciated.






ordinary-differential-equations numerical-methods matlab boundary-value-problem







share|cite|improve this question











$endgroup$












  • $begingroup$
    What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
    $endgroup$
    – LutzL
    Jan 2 at 21:36










  • $begingroup$
    What numerical method does it use.
    $endgroup$
    – tenichols
    Jan 2 at 21:40






  • 1




    $begingroup$
    Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
    $endgroup$
    – LutzL
    Jan 2 at 21:52












  • $begingroup$
    What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
    $endgroup$
    – LutzL
    Jan 2 at 21:55














0












0








0





$begingroup$


Can anyone shed some light on how matlab's bvp4c function works? I've looked online but I haven't found any specifics on the method it uses.



With that question asked, what are some different ways on solving bvp problems. I am aware of the shooting method, but for my problem I know exactly what my initial and end conditions are, I'm more interested in what happens in between. And unless I understand the method wrong, the goal is to figure out what your initial conditions are with the shooting method.



For my particular problem "4th order, non-linear, variable coefficient, homogeneous ODE. And by 4th order, I'm referring to the highest derivative" I'm having trouble figuring out a way to solve this problem.



Any help useful information would be greatly appreciated.






ordinary-differential-equations numerical-methods matlab boundary-value-problem







share|cite|improve this question











$endgroup$




Can anyone shed some light on how matlab's bvp4c function works? I've looked online but I haven't found any specifics on the method it uses.



With that question asked, what are some different ways on solving bvp problems. I am aware of the shooting method, but for my problem I know exactly what my initial and end conditions are, I'm more interested in what happens in between. And unless I understand the method wrong, the goal is to figure out what your initial conditions are with the shooting method.



For my particular problem "4th order, non-linear, variable coefficient, homogeneous ODE. And by 4th order, I'm referring to the highest derivative" I'm having trouble figuring out a way to solve this problem.



Any help useful information would be greatly appreciated.






ordinary-differential-equations numerical-methods matlab boundary-value-problem




ordinary-differential-equations numerical-methods matlab boundary-value-problem






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 2 at 21:39







tenichols

















asked Jan 2 at 20:48









tenicholstenichols

83




83












  • $begingroup$
    What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
    $endgroup$
    – LutzL
    Jan 2 at 21:36










  • $begingroup$
    What numerical method does it use.
    $endgroup$
    – tenichols
    Jan 2 at 21:40






  • 1




    $begingroup$
    Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
    $endgroup$
    – LutzL
    Jan 2 at 21:52












  • $begingroup$
    What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
    $endgroup$
    – LutzL
    Jan 2 at 21:55


















  • $begingroup$
    What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
    $endgroup$
    – LutzL
    Jan 2 at 21:36










  • $begingroup$
    What numerical method does it use.
    $endgroup$
    – tenichols
    Jan 2 at 21:40






  • 1




    $begingroup$
    Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
    $endgroup$
    – LutzL
    Jan 2 at 21:52












  • $begingroup$
    What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
    $endgroup$
    – LutzL
    Jan 2 at 21:55
















$begingroup$
What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
$endgroup$
– LutzL
Jan 2 at 21:36




$begingroup$
What do you mean "how it works"? How to use it and interpret the results you get or how to try to code your own method giving similar results? For the use of the python equivalent with a 4th order ODE see math.stackexchange.com/q/2971225/115115
$endgroup$
– LutzL
Jan 2 at 21:36












$begingroup$
What numerical method does it use.
$endgroup$
– tenichols
Jan 2 at 21:40




$begingroup$
What numerical method does it use.
$endgroup$
– tenichols
Jan 2 at 21:40




1




1




$begingroup$
Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
$endgroup$
– LutzL
Jan 2 at 21:52






$begingroup$
Directly from the documentation page: Algorithms -- bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a $C^1$-continuous solution that is fourth-order accurate uniformly in $[a,b]$. Mesh selection and error control are based on the residual of the continuous solution.
$endgroup$
– LutzL
Jan 2 at 21:52














$begingroup$
What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
$endgroup$
– LutzL
Jan 2 at 21:55




$begingroup$
What is a "non-linear ... homogeneous ODE"? Do you mean that it has a zero solution, or that there is a certain scaling invariance or ...?
$endgroup$
– LutzL
Jan 2 at 21:55










1 Answer
1






active

oldest

votes


















3












$begingroup$

You ask how the algorithm works, see here, especially




bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a C1-continuous solution that is fourth-order accurate uniformly in [a,b]. Mesh selection and error control are based on the residual of the continuous solution.




You also say that you don't want to use the shooting method since this is for 'finding the initial conditions'. This is partially correct, but misses the point. The approach is to have parameterized initial conditions at $a$, in addition to the boundary conditions there, use a standard ODE solver to solve across the domain, and then use root finding to find the appropriate parameter values to enforce the boundary conditions at $b$. These can then be used to find the solution across the domain. The result of this is that a solver for IVPs can be turned into a solver for BVPs by combining with a root finder. This isn't necessary the most efficient or accurate way to solve the problem, but all the components are well understood.






share|cite|improve this answer









$endgroup$














    Your Answer





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

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

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

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3059957%2fwhat-numerical-method-does-matlabs-bvp4c-use%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$

    You ask how the algorithm works, see here, especially




    bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a C1-continuous solution that is fourth-order accurate uniformly in [a,b]. Mesh selection and error control are based on the residual of the continuous solution.




    You also say that you don't want to use the shooting method since this is for 'finding the initial conditions'. This is partially correct, but misses the point. The approach is to have parameterized initial conditions at $a$, in addition to the boundary conditions there, use a standard ODE solver to solve across the domain, and then use root finding to find the appropriate parameter values to enforce the boundary conditions at $b$. These can then be used to find the solution across the domain. The result of this is that a solver for IVPs can be turned into a solver for BVPs by combining with a root finder. This isn't necessary the most efficient or accurate way to solve the problem, but all the components are well understood.






    share|cite|improve this answer









    $endgroup$


















      3












      $begingroup$

      You ask how the algorithm works, see here, especially




      bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a C1-continuous solution that is fourth-order accurate uniformly in [a,b]. Mesh selection and error control are based on the residual of the continuous solution.




      You also say that you don't want to use the shooting method since this is for 'finding the initial conditions'. This is partially correct, but misses the point. The approach is to have parameterized initial conditions at $a$, in addition to the boundary conditions there, use a standard ODE solver to solve across the domain, and then use root finding to find the appropriate parameter values to enforce the boundary conditions at $b$. These can then be used to find the solution across the domain. The result of this is that a solver for IVPs can be turned into a solver for BVPs by combining with a root finder. This isn't necessary the most efficient or accurate way to solve the problem, but all the components are well understood.






      share|cite|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        You ask how the algorithm works, see here, especially




        bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a C1-continuous solution that is fourth-order accurate uniformly in [a,b]. Mesh selection and error control are based on the residual of the continuous solution.




        You also say that you don't want to use the shooting method since this is for 'finding the initial conditions'. This is partially correct, but misses the point. The approach is to have parameterized initial conditions at $a$, in addition to the boundary conditions there, use a standard ODE solver to solve across the domain, and then use root finding to find the appropriate parameter values to enforce the boundary conditions at $b$. These can then be used to find the solution across the domain. The result of this is that a solver for IVPs can be turned into a solver for BVPs by combining with a root finder. This isn't necessary the most efficient or accurate way to solve the problem, but all the components are well understood.






        share|cite|improve this answer









        $endgroup$



        You ask how the algorithm works, see here, especially




        bvp4c is a finite difference code that implements the three-stage Lobatto IIIa formula. This is a collocation formula and the collocation polynomial provides a C1-continuous solution that is fourth-order accurate uniformly in [a,b]. Mesh selection and error control are based on the residual of the continuous solution.




        You also say that you don't want to use the shooting method since this is for 'finding the initial conditions'. This is partially correct, but misses the point. The approach is to have parameterized initial conditions at $a$, in addition to the boundary conditions there, use a standard ODE solver to solve across the domain, and then use root finding to find the appropriate parameter values to enforce the boundary conditions at $b$. These can then be used to find the solution across the domain. The result of this is that a solver for IVPs can be turned into a solver for BVPs by combining with a root finder. This isn't necessary the most efficient or accurate way to solve the problem, but all the components are well understood.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 2 at 21:56









        EddyEddy

        959612




        959612






























            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%2f3059957%2fwhat-numerical-method-does-matlabs-bvp4c-use%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

            Wiesbaden

            Image
            Wappen Deutschlandkarte 50.0825 8.24 117 Koordinaten: 50° 5′  N , 8° 14′  O Basisdaten Bundesland: Hessen Regierungsbezirk: Darmstadt Höhe: 117 m ü. NHN Fläche: 203,93 km 2 Einwohner: 278.654 (31. Dez. 2017) [1] Bevölkerungsdichte: 1366 Einwohner je km 2 Postleitzahlen: 65183–65207, 55246, 55252 Vorlage:Infobox Gemeinde in Deutschland/Wartung/PLZ enthält Text Vorwahlen: 0611, 06122, 06127, 06134 Kfz-Kennzeichen: WI Gemeindeschlüssel: 06 4 14 000 LOCODE: DE WIB NUTS: DE714 Stadtgliederung: 26 Ortsbezirke Adresse der Stadtverwaltung: Schlossplatz 6 65183 Wiesbaden Webpräsenz: www.wiesbaden.de Oberbürgermeister: Sven Gerich (SPD) Lage der Landeshauptstadt Wiesbaden in Hessen und im Regierungsbezirk Darmstadt Offizielles Logo der Landeshauptstadt Wiesbaden Flagge der Landeshauptstadt Wiesbaden Wiesbaden is
            Read more

            Marschland

            Image
            Kilometerweite Marsch in den Vier- und Marschlanden am Elbdeich Die Wedeler Marschlandschaft in Schleswig-Holstein Der Hadelner Kanal zur Entwässerung der Marsch Die tief gelegene Marsch und ein Entwässerungskanal Das Schöpfwerk Otterndorf im Land Hadeln zur Entwässerung der Medem verfügte damals bereits über die größte Kreiselpumpe Europas. Das Schöpfwerk in Neuhaus für die Aue und des Neuhaus-Bülkauer Kanals Als Marsch(land) (v. niederdt., altsächs. mersc ) – auch Masch , Mersch oder Schwemmland genannt – bezeichnet man eine nacheiszeitlich entstandene geomorphologische Landform im Gebiet der nordwestdeutschen Küsten und Flüsse sowie vergleichbare Landformen weltweit. Inhaltsverzeichnis 1 Landschaft 2 Entstehung 3 Marschböden 4 Nutzung 5 Marschgebiete in Deutschland 6 Siehe auch 7 Literatur 8 Weblinks 9 Einzelnachweise Landschaft | Marschen sind generell flache Landstriche ohne natürliche Erhebungen. Si
            Read more

            Dieringhausen

            Image
            Dieringhausen Stadt Gummersbach 50.982777777778 7.5316666666667 165 Koordinaten: 50° 58′ 58″  N , 7° 31′ 54″  O Höhe: 165  (160–245)  m Einwohner: 5055  (30. Jun. 2016) Postleitzahl: 51645 Vorwahl: 02261 Lage von Dieringhausen in Gummersbach Im Hohl ca. 1927–1930 Ansicht von Südwesten bei Bünghausen Dieringhausen (im örtlichen Dialekt Dierkesen ) ist ein Ortsteil von Gummersbach im Oberbergischen Kreis, Regierungsbezirk Köln, Nordrhein-Westfalen (Deutschland). Inhaltsverzeichnis 1 Geographie 2 Geschichte 3 Kultur 3.1 Sehenswürdigkeiten 3.2 Regelmäßige Veranstaltungen 4 Infrastruktur und Wirtschaft 4.1 Verkehr 4.1.1 Schienen- und Busverkehr 4.1.2 Straßen 4.2 Öffentliche Einrichtungen 4.2.1 Schulen und Bildungseinrichtungen 4.2.2 Kirchliche Einrichtungen 5 Persönlichkeiten 5.1 In Dieringhausen geboren 5.2 In Dieringhausen gelebt 6 Einzelnachweise 7
            Read more