Difference between initial state problem and boundary-value problem












2












$begingroup$


I would like to check the aspect that is not covered in the the original question.



They both seem to have the same nature, yet, I feel like the difference lies in that the initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically (I mean simulation in a single run, not trial and error until your solution is found). That is, known initial value means that you can find next value in your recursion, next value and so you can find the whole sequence by simulation. The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence. Is it right?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Do you mean a BVP in one dimension, or in at least two?
    $endgroup$
    – Semiclassical
    Jul 26 '14 at 17:28










  • $begingroup$
    @Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
    $endgroup$
    – Val
    Jul 26 '14 at 17:39
















2












$begingroup$


I would like to check the aspect that is not covered in the the original question.



They both seem to have the same nature, yet, I feel like the difference lies in that the initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically (I mean simulation in a single run, not trial and error until your solution is found). That is, known initial value means that you can find next value in your recursion, next value and so you can find the whole sequence by simulation. The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence. Is it right?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Do you mean a BVP in one dimension, or in at least two?
    $endgroup$
    – Semiclassical
    Jul 26 '14 at 17:28










  • $begingroup$
    @Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
    $endgroup$
    – Val
    Jul 26 '14 at 17:39














2












2








2





$begingroup$


I would like to check the aspect that is not covered in the the original question.



They both seem to have the same nature, yet, I feel like the difference lies in that the initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically (I mean simulation in a single run, not trial and error until your solution is found). That is, known initial value means that you can find next value in your recursion, next value and so you can find the whole sequence by simulation. The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence. Is it right?










share|cite|improve this question











$endgroup$




I would like to check the aspect that is not covered in the the original question.



They both seem to have the same nature, yet, I feel like the difference lies in that the initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically (I mean simulation in a single run, not trial and error until your solution is found). That is, known initial value means that you can find next value in your recursion, next value and so you can find the whole sequence by simulation. The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence. Is it right?







boundary-value-problem






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 13 '18 at 9:58









dmtri

1,5082521




1,5082521










asked Jul 26 '14 at 17:23









ValVal

1




1












  • $begingroup$
    Do you mean a BVP in one dimension, or in at least two?
    $endgroup$
    – Semiclassical
    Jul 26 '14 at 17:28










  • $begingroup$
    @Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
    $endgroup$
    – Val
    Jul 26 '14 at 17:39


















  • $begingroup$
    Do you mean a BVP in one dimension, or in at least two?
    $endgroup$
    – Semiclassical
    Jul 26 '14 at 17:28










  • $begingroup$
    @Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
    $endgroup$
    – Val
    Jul 26 '14 at 17:39
















$begingroup$
Do you mean a BVP in one dimension, or in at least two?
$endgroup$
– Semiclassical
Jul 26 '14 at 17:28




$begingroup$
Do you mean a BVP in one dimension, or in at least two?
$endgroup$
– Semiclassical
Jul 26 '14 at 17:28












$begingroup$
@Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
$endgroup$
– Val
Jul 26 '14 at 17:39




$begingroup$
@Semiclassical I do not care. The answer may tell how this aspect is important. It may change all the answer.
$endgroup$
– Val
Jul 26 '14 at 17:39










1 Answer
1






active

oldest

votes


















2












$begingroup$


initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically




Not true as stated. There are lots of numerical boundary value problem solvers out there, one of better known is in Matlab PDE toolbox. The whole industry of Finite Element Method begs to disagree with your "needs to solved analytically" statement.



But you are right to say that




The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence.




Initial value problems (for ODE and PDE) can be solved by marching forward in time. For example, a simple solver for the diffusion equation would take three consecutive values of $u$ at time step $k$, say $u^{k}_{i-1}$, $u^k_i$, $u^k_{i+1}$, and calculate
$$u^{k+1}_i = bu^k_{i-1}+(1-2b)u^k_i+bu^k_{i+1}$$
where $0<b<1/2$ comes from the diffusion coefficient and the sizes of time step and space step.



Not so for boundary value problems. As you remarked, for ODE there is the shooting method, which attempts to solve a BVP by means of several IVPs. But the more systematic way, which works for both ODE and PDE, is to express the discrete form of PDE as a large (but sparse) linear system, and hit it with a specialized linear solver. For example, if I'm solving a boundary value problem for the Laplace equation, my linear system might consist of equations
$$u_{i j}=frac14(u_{i-1 j}+u_{i+1 j} + u_{i j-1}+u_{i j+1})$$
which together with boundary conditions form a linear system with unique solution.



One practical consequence of this difference is that solution of initial value problems for PDE can be adapted to parallel computing easier than solution of boundary value problems.






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%2f878873%2fdifference-between-initial-state-problem-and-boundary-value-problem%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









    2












    $begingroup$


    initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically




    Not true as stated. There are lots of numerical boundary value problem solvers out there, one of better known is in Matlab PDE toolbox. The whole industry of Finite Element Method begs to disagree with your "needs to solved analytically" statement.



    But you are right to say that




    The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence.




    Initial value problems (for ODE and PDE) can be solved by marching forward in time. For example, a simple solver for the diffusion equation would take three consecutive values of $u$ at time step $k$, say $u^{k}_{i-1}$, $u^k_i$, $u^k_{i+1}$, and calculate
    $$u^{k+1}_i = bu^k_{i-1}+(1-2b)u^k_i+bu^k_{i+1}$$
    where $0<b<1/2$ comes from the diffusion coefficient and the sizes of time step and space step.



    Not so for boundary value problems. As you remarked, for ODE there is the shooting method, which attempts to solve a BVP by means of several IVPs. But the more systematic way, which works for both ODE and PDE, is to express the discrete form of PDE as a large (but sparse) linear system, and hit it with a specialized linear solver. For example, if I'm solving a boundary value problem for the Laplace equation, my linear system might consist of equations
    $$u_{i j}=frac14(u_{i-1 j}+u_{i+1 j} + u_{i j-1}+u_{i j+1})$$
    which together with boundary conditions form a linear system with unique solution.



    One practical consequence of this difference is that solution of initial value problems for PDE can be adapted to parallel computing easier than solution of boundary value problems.






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$


      initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically




      Not true as stated. There are lots of numerical boundary value problem solvers out there, one of better known is in Matlab PDE toolbox. The whole industry of Finite Element Method begs to disagree with your "needs to solved analytically" statement.



      But you are right to say that




      The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence.




      Initial value problems (for ODE and PDE) can be solved by marching forward in time. For example, a simple solver for the diffusion equation would take three consecutive values of $u$ at time step $k$, say $u^{k}_{i-1}$, $u^k_i$, $u^k_{i+1}$, and calculate
      $$u^{k+1}_i = bu^k_{i-1}+(1-2b)u^k_i+bu^k_{i+1}$$
      where $0<b<1/2$ comes from the diffusion coefficient and the sizes of time step and space step.



      Not so for boundary value problems. As you remarked, for ODE there is the shooting method, which attempts to solve a BVP by means of several IVPs. But the more systematic way, which works for both ODE and PDE, is to express the discrete form of PDE as a large (but sparse) linear system, and hit it with a specialized linear solver. For example, if I'm solving a boundary value problem for the Laplace equation, my linear system might consist of equations
      $$u_{i j}=frac14(u_{i-1 j}+u_{i+1 j} + u_{i j-1}+u_{i j+1})$$
      which together with boundary conditions form a linear system with unique solution.



      One practical consequence of this difference is that solution of initial value problems for PDE can be adapted to parallel computing easier than solution of boundary value problems.






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$


        initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically




        Not true as stated. There are lots of numerical boundary value problem solvers out there, one of better known is in Matlab PDE toolbox. The whole industry of Finite Element Method begs to disagree with your "needs to solved analytically" statement.



        But you are right to say that




        The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence.




        Initial value problems (for ODE and PDE) can be solved by marching forward in time. For example, a simple solver for the diffusion equation would take three consecutive values of $u$ at time step $k$, say $u^{k}_{i-1}$, $u^k_i$, $u^k_{i+1}$, and calculate
        $$u^{k+1}_i = bu^k_{i-1}+(1-2b)u^k_i+bu^k_{i+1}$$
        where $0<b<1/2$ comes from the diffusion coefficient and the sizes of time step and space step.



        Not so for boundary value problems. As you remarked, for ODE there is the shooting method, which attempts to solve a BVP by means of several IVPs. But the more systematic way, which works for both ODE and PDE, is to express the discrete form of PDE as a large (but sparse) linear system, and hit it with a specialized linear solver. For example, if I'm solving a boundary value problem for the Laplace equation, my linear system might consist of equations
        $$u_{i j}=frac14(u_{i-1 j}+u_{i+1 j} + u_{i j-1}+u_{i j+1})$$
        which together with boundary conditions form a linear system with unique solution.



        One practical consequence of this difference is that solution of initial value problems for PDE can be adapted to parallel computing easier than solution of boundary value problems.






        share|cite|improve this answer









        $endgroup$




        initial value problem can be solved by simulation whereas boundary value problem needs to be solved analytically




        Not true as stated. There are lots of numerical boundary value problem solvers out there, one of better known is in Matlab PDE toolbox. The whole industry of Finite Element Method begs to disagree with your "needs to solved analytically" statement.



        But you are right to say that




        The boundary value, in contrast, means that you cannot find the next value in the sequence without finding the whole sequence.




        Initial value problems (for ODE and PDE) can be solved by marching forward in time. For example, a simple solver for the diffusion equation would take three consecutive values of $u$ at time step $k$, say $u^{k}_{i-1}$, $u^k_i$, $u^k_{i+1}$, and calculate
        $$u^{k+1}_i = bu^k_{i-1}+(1-2b)u^k_i+bu^k_{i+1}$$
        where $0<b<1/2$ comes from the diffusion coefficient and the sizes of time step and space step.



        Not so for boundary value problems. As you remarked, for ODE there is the shooting method, which attempts to solve a BVP by means of several IVPs. But the more systematic way, which works for both ODE and PDE, is to express the discrete form of PDE as a large (but sparse) linear system, and hit it with a specialized linear solver. For example, if I'm solving a boundary value problem for the Laplace equation, my linear system might consist of equations
        $$u_{i j}=frac14(u_{i-1 j}+u_{i+1 j} + u_{i j-1}+u_{i j+1})$$
        which together with boundary conditions form a linear system with unique solution.



        One practical consequence of this difference is that solution of initial value problems for PDE can be adapted to parallel computing easier than solution of boundary value problems.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jul 27 '14 at 5:00







        user147263





































            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%2f878873%2fdifference-between-initial-state-problem-and-boundary-value-problem%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

            Le Mesnil-Réaume

            Ida-Boy-Ed-Garten

            web3.py web3.isConnected() returns false always