Lập Trình C# all Chap "NUMERICAL RECIPES IN C" part 17

Tham khảo tài liệu 'lập trình c# all chap "numerical recipes in c" part 17', công nghệ thông tin phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | 362 Chapter 9. Root Finding and Nonlinear Sets ofEquations a b Move last best guess to a. fa fb if fabs d toll Evaluate new trial root. b d else b SIGN tol1 xm fb func b nrerror Maximum number of iterations exceeded in zbrent return Never get here. CITED REFERENCES AND FURTHER READING Brent . 1973 AlgorithmsforMinimizationwithoutDerivatives Englewood Cliffs NJ PrenticeHall Chapters 3 4. 1 Forsythe . Malcolm . and Moler . 1977 Computer Methods for Mathematical Computations Englewood Cliffs NJ Prentice-Hall . Newton-Raphson Method Using Derivative Perhaps the most celebrated of all one-dimensional root-finding routines is Newton s method also called the Newton-Raphson method. This method is distinguished from the methods of previous sections by the fact that it requires the evaluation of both the function f x and the derivative f x at arbitrary points x. The Newton-Raphson formula consists geometrically of extending the tangent line at a current point x until it crosses zero then setting the next guess xi 1 to the abscissa of that zero-crossing see Figure . Algebraically the method derives from the familiar Taylor series expansion of a function in the neighborhood of a point f x 5 f x f x S ff x62 . For small enough values of S and for well-behaved functions the terms beyond linear are unimportant hence f x S 0 implies S _ f x 9 4 2 S f x . Newton-Raphson is not restricted to one dimension. The method readily generalizes to multiple dimensions as we shall see in and below. Far from a root where the higher-order terms in the series are important the Newton-Raphson formula can give grossly inaccurate meaningless corrections. For instance the initial guess for the root might be so far from the true root as to let the search interval include a local maximum or minimum of the function. This can be death to the method see Figure . If an iteration places a trial guess near such a local extremum so that the first .

Không thể tạo bản xem trước, hãy bấm tải xuống
TÀI LIỆU LIÊN QUAN
5    176    1
5    255    1
5    106    0
5    121    1
6    103    1
6    107    1
6    121    1
6    103    0
6    140    0
TÀI LIỆU MỚI ĐĂNG
101    522    2    13-06-2024
50    119    5    13-06-2024
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.