计算物理第二讲-JIAYU课件.ppt

Numerical Differentiation Numerical Integration;Numerical differentiation;Numerical differentiation;Numerical differentiation;Errors of this approximations;Errors of this approximations;Errors of this approximations;Errors of this approximations;Errors of this approximations;More accurate formula;Second-order derivatives (3 and 5 points) ;Second-order derivatives (3 and 5 points) ;Second-order derivatives (3 and 5 points) ;Second-order derivatives (3 and 5 points) ;Other formula ?? (four and more points?????) ;The three-point formula for the second-order derivative;Summary 1: Forward Formulas;Summary 2: Backward Formulas;Summary 3: Centered Formulas;Examples;What we do ?;We can divide the region [a,b] into n slices with an evenly spaced interval h. If we take the lattice points as with , we can write the integral as a summation of integrals over all the slices:;We can obtain a quadrature with a higher accuracy by Working on two slices together. If we apply the Lagrange interpolation to the function f(x) in the region of , we have,;In order to pair up all the slices, we have to have an even Number of slices. If we have an odd number of slices, or an even number of points between [a,b], the last slice can be separated by;Numerical intergation under uniform data points ;Numerical intergation under uniform data points ;Examples 1;2.3 Root for an equation;跳雾俩窝茸压戒吊垄尿是路谰辜甫握它憎呸渠老小媚效砚瘪孺到乱垃彝贾计算物理第二讲-JIAYU课件计算物理第二讲-JIAYU课件;where x can be viewed as a trial value for the root of at the nth step and the approximate value of the next step can be derived from;Newton Raphson method is better than Bisection method ;Newton Raphson method is better than Bisection method ;In many cases, especially in the case of with an implicit dependence on x, an analytic expression for the first-order derivative needed in the Newton method may not exist or may be very difficult to obtain. One has to find an alternative s