Taylor Series Expansion on error propagation.












0












$begingroup$


I am reading through Stoer and Bulirsch's Introduction to Numerical Analysis. In their section on error propagation they are describing a derivation of the Jacobian as it related to a problems condition number.



We suppose the that $tilde{x}$ is an approximation for the some $xinmathbb{R}^n$ and that $phi:mathbb{R}^n rightarrow mathbb{R}$ has continuous first derivatives everywhere. The textbook then expands $phi$ by its Taylor series and ignores the higher order terms to write that



$$phi(tilde{x})- phi(x) =sum_{j= 1}^n (tilde{x_j} - x_j)frac{partial phi(x)}{partial x_J} $$
I don't understand how we would be able to only evaluate $phi$ at $x$ and not also at $tilde{x}$. I would think that the first order approximation should appear as
$$phi(tilde{x})- phi(x) =sum_{j= 1}^n tilde{x_j}frac{partial phi(tilde{x})}{partial x_J} - x_jfrac{partial phi(x)}{partial x_J} $$
Am I missing a minor detail somewhere? The only other informationis that $tilde{x}$ is the closest machine number to $x$, but there must be something more to this statement.



Thanks!










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I am reading through Stoer and Bulirsch's Introduction to Numerical Analysis. In their section on error propagation they are describing a derivation of the Jacobian as it related to a problems condition number.



    We suppose the that $tilde{x}$ is an approximation for the some $xinmathbb{R}^n$ and that $phi:mathbb{R}^n rightarrow mathbb{R}$ has continuous first derivatives everywhere. The textbook then expands $phi$ by its Taylor series and ignores the higher order terms to write that



    $$phi(tilde{x})- phi(x) =sum_{j= 1}^n (tilde{x_j} - x_j)frac{partial phi(x)}{partial x_J} $$
    I don't understand how we would be able to only evaluate $phi$ at $x$ and not also at $tilde{x}$. I would think that the first order approximation should appear as
    $$phi(tilde{x})- phi(x) =sum_{j= 1}^n tilde{x_j}frac{partial phi(tilde{x})}{partial x_J} - x_jfrac{partial phi(x)}{partial x_J} $$
    Am I missing a minor detail somewhere? The only other informationis that $tilde{x}$ is the closest machine number to $x$, but there must be something more to this statement.



    Thanks!










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I am reading through Stoer and Bulirsch's Introduction to Numerical Analysis. In their section on error propagation they are describing a derivation of the Jacobian as it related to a problems condition number.



      We suppose the that $tilde{x}$ is an approximation for the some $xinmathbb{R}^n$ and that $phi:mathbb{R}^n rightarrow mathbb{R}$ has continuous first derivatives everywhere. The textbook then expands $phi$ by its Taylor series and ignores the higher order terms to write that



      $$phi(tilde{x})- phi(x) =sum_{j= 1}^n (tilde{x_j} - x_j)frac{partial phi(x)}{partial x_J} $$
      I don't understand how we would be able to only evaluate $phi$ at $x$ and not also at $tilde{x}$. I would think that the first order approximation should appear as
      $$phi(tilde{x})- phi(x) =sum_{j= 1}^n tilde{x_j}frac{partial phi(tilde{x})}{partial x_J} - x_jfrac{partial phi(x)}{partial x_J} $$
      Am I missing a minor detail somewhere? The only other informationis that $tilde{x}$ is the closest machine number to $x$, but there must be something more to this statement.



      Thanks!










      share|cite|improve this question









      $endgroup$




      I am reading through Stoer and Bulirsch's Introduction to Numerical Analysis. In their section on error propagation they are describing a derivation of the Jacobian as it related to a problems condition number.



      We suppose the that $tilde{x}$ is an approximation for the some $xinmathbb{R}^n$ and that $phi:mathbb{R}^n rightarrow mathbb{R}$ has continuous first derivatives everywhere. The textbook then expands $phi$ by its Taylor series and ignores the higher order terms to write that



      $$phi(tilde{x})- phi(x) =sum_{j= 1}^n (tilde{x_j} - x_j)frac{partial phi(x)}{partial x_J} $$
      I don't understand how we would be able to only evaluate $phi$ at $x$ and not also at $tilde{x}$. I would think that the first order approximation should appear as
      $$phi(tilde{x})- phi(x) =sum_{j= 1}^n tilde{x_j}frac{partial phi(tilde{x})}{partial x_J} - x_jfrac{partial phi(x)}{partial x_J} $$
      Am I missing a minor detail somewhere? The only other informationis that $tilde{x}$ is the closest machine number to $x$, but there must be something more to this statement.



      Thanks!







      taylor-expansion approximation-theory error-propagation






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 2 at 6:53









      Andrew ShedlockAndrew Shedlock

      1688




      1688






















          0






          active

          oldest

          votes












          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%2f3059191%2ftaylor-series-expansion-on-error-propagation%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3059191%2ftaylor-series-expansion-on-error-propagation%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

          mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

          How to change which sound is reproduced for terminal bell?

          Can I use Tabulator js library in my java Spring + Thymeleaf project?