1. Trang chủ
  2. » Giáo án - Bài giảng

126_MATH 685 CSI 700 OR 682 Lecture Notes

53 169 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 53
Dung lượng 2,08 MB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

Example: bisection iteration... Convergence of FPI... Convergence of Newton’s method... Inverse quadratic interpolation... Safeguarded methods Rapidly convergent methods for solving non

Trang 1

MATH 685/ CSI 700/ OR 682

Lecture Notes

Lecture 8 Nonlinear equations

Trang 3

Example

Trang 4

Existence/uniqueness

Trang 5

Examples in 1d

Trang 6

Example of a system in 2d

Trang 7

Multiplicity

Trang 8

Sensitivity and conditioning

Trang 9

Sensitivity and conditioning

Trang 10

Sensitivity and conditioning

Trang 11

Convergence rate

Trang 12

Convergence rate

Trang 13

Bisection method

Trang 14

Example: bisection iteration

Trang 15

Bisection method

Trang 16

Fixed-point iterations

Trang 17

Examples

Trang 18

Example: fixed point problems

Trang 19

Examples: FPI

Trang 20

Example: FPI

Trang 21

Convergence of FPI

Trang 22

Newton’s method

Trang 23

Newton’s method

Trang 24

Newton’s method

Trang 25

Convergence of Newton’s method

Trang 26

Newton’s method

Trang 27

Secant method

Trang 28

Secant method

Trang 29

Example

Trang 30

Higher-degree interpolation

Trang 31

Inverse interpolation

Trang 32

Inverse quadratic interpolation

Trang 33

Example

Trang 34

Linear fractional interpolation

Trang 35

Example

Trang 36

Safeguarded methods

 Rapidly convergent methods for solving nonlinear equations may not converge unless started close to solution, but safe methods are slow

 Hybrid methods combine features of both types of methods to achieve both speed and reliability

 Use rapidly convergent method, but maintain bracket around

solution

 If next approximate solution given by fast method falls outside bracketing interval, perform one iteration of safe method, such as bisection

 Fast method can then be tried again on smaller interval with

greater chance of success

 Ultimately, convergence rate of fast method should prevail

 Hybrid approach seldom does worse than safe method, and

usually does much better

 Popular combination is bisection and inverse quadratic

interpolation, for which no derivatives required

Trang 37

Zeros of polynomials

Trang 38

Systems of nonlinear

equations

Solving systems of nonlinear equations is much more difficult than scalar case because:

existence and number of solutions or good starting guess is much more complex

convergence to desired solution or to bracket

solution to produce absolutely safe method

dimension of problem

Trang 39

Fixed-point iteration (FPI)

Trang 40

Newton’s method

Trang 41

Example

Trang 42

Example

Trang 43

Convergence of Newton’s method

Trang 44

Cost of Newton’s method

Trang 45

Secant updating methods

Trang 46

Broyden’s method

Trang 47

Broyden’s method

Trang 48

Example

Trang 49

Example

Trang 50

Example

Trang 51

Example (cont)

Trang 52

Robust Newton-like methods

Trang 53

Trust-region methods

Ngày đăng: 18/08/2017, 22:24

TỪ KHÓA LIÊN QUAN