Numerical Methods Course Notes Version 0.1 (UCSD Math 174, Fall ...

More documents

Recommendations

Info

$Fractional and operational calculus with generalized fractional ...$

iv CONTENTS 3.4.6 Gauss Seidel Iteration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 3.4.7 Error Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 3.4.8 A Free Lunch? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 4 Finding Roots 47 4.1 Bisection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 4.1.1 Modifications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 4.1.2 Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 4.2 Newton’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 4.2.1 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 4.2.2 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.2.3 Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 4.2.4 Using Newton’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.3 Secant Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.3.1 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 4.3.2 Convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 5 Interpolation 61 5.1 Polynomial Interpolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 5.1.1 Lagranges Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 5.1.2 Newton’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 5.1.3 Newton’s Nested Form . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 5.1.4 Divided Differences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 5.2 Errors in Polynomial Interpolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 5.2.1 Interpolation Error Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 5.2.2 Interpolation Error for Equally Spaced Nodes . . . . . . . . . . . . . . . . . . 71 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 6 Spline Interpolation 77 6.1 First and Second Degree Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77 6.1.1 First Degree Spline Accuracy . . . . . . . . . . . . . . . . . . . . . . . . . . . 78 6.1.2 Second Degree Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 6.1.3 Computing Second Degree Splines . . . . . . . . . . . . . . . . . . . . . . . . 80 6.2 (Natural) Cubic Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 6.2.1 Why Natural Cubic Splines? . . . . . . . . . . . . . . . . . . . . . . . . . . . 81 6.2.2 Computing Cubic Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 6.3 B Splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 7 Approximating Derivatives 87 7.1 Finite Differences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 7.1.1 Approximating the Second Derivative . . . . . . . . . . . . . . . . . . . . . . 89 7.2 Richardson Extrapolation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 7.2.1 Abstracting Richardson’s Method . . . . . . . . . . . . . . . . . . . . . . . . . 90 7.2.2 Using Richardson Extrapolation . . . . . . . . . . . . . . . . . . . . . . . . . 91 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
CONTENTS v 8 Integrals and Quadrature 95 8.1 The Definite Integral . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 8.1.1 Upper and Lower Sums . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 8.1.2 Approximating the Integral . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 8.1.3 Simple and Composite Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 8.2 Trapezoidal Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 8.2.1 How Good is the Composite Trapezoidal Rule? . . . . . . . . . . . . . . . . . 99 8.2.2 Using the Error Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 8.3 Romberg Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 8.3.1 Recursive Trapezoidal Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104 8.4 Gaussian Quadrature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 8.4.1 Determining Weights (Lagrange Polynomial Method) . . . . . . . . . . . . . . 105 8.4.2 Determining Weights (Method of Undetermined Coefficients) . . . . . . . . . 106 8.4.3 Gaussian Nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 8.4.4 Determining Gaussian Nodes . . . . . . . . . . . . . . . . . . . . . . . . . . . 108 8.4.5 Reinventing the Wheel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 9 Least Squares 115 9.1 Least Squares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 9.1.1 The Definition of Least Squares . . . . . . . . . . . . . . . . . . . . . . . . . . 115 9.1.2 Linear Least Squares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 9.1.3 Least Squares from Basis Functions . . . . . . . . . . . . . . . . . . . . . . . 117 9.2 Orthonormal Bases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 9.2.1 Alternatives to Normal Equations . . . . . . . . . . . . . . . . . . . . . . . . 120 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 10 Ordinary Differential Equations 123 10.1 Elementary Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 10.1.1 Integration and ‘Stepping’ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124 10.1.2 Taylor’s Series Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 124 10.1.3 Euler’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 10.1.4 Higher Order Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 10.1.5 Errors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 10.1.6 Stability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 10.1.7 Backwards Euler’s Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129 10.2 Runge-Kutta Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 10.2.1 Taylor’s Series Redux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 10.2.2 Deriving the Runge-Kutta Methods . . . . . . . . . . . . . . . . . . . . . . . 132 10.2.3 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 10.3 Systems of ODEs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 10.3.1 Larger Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135 10.3.2 Recasting Single ODE Methods . . . . . . . . . . . . . . . . . . . . . . . . . . 135 10.3.3 It’s Only Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137 10.3.4 It’s Only Autonomous Systems . . . . . . . . . . . . . . . . . . . . . . . . . . 138 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142
Page 1: Numerical Methods Course Notes Vers
Page 5: Contents Acknowledgments i 1 Introd
Page 9 and 10: Chapter 1 Introduction 1.1 Taylor
Page 11 and 12: 1.1. TAYLOR’S THEOREM 3 with the
Page 13 and 14: 1.3. EIGENVALUES 5 To correct this
Page 15 and 16: 1.3. EIGENVALUES 7 Example Problem
Page 17 and 18: 1.3. EIGENVALUES 9 for all vectors
Page 19 and 20: Chapter 2 A “Crash” Course in o
Page 21 and 22: 2.1. GETTING STARTED 13 77 22 333 o
Page 23 and 24: 2.2. USEFUL COMMANDS 15 octave:22>
Page 25 and 26: 2.3. PROGRAMMING AND CONTROL 17 x1
Page 27 and 28: 2.4. PLOTTING 19 %just plot Y plot(
Page 29 and 30: 2.4. PLOTTING 21 Exercises (2.1) Wh
Page 31 and 32: Chapter 3 Solving Linear Systems A
Page 33 and 34: 3.1. GAUSSIAN ELIMINATION WITH NAÏ
Page 35 and 36: 3.2. PIVOTING STRATEGIES FOR GAUSSI
Page 37 and 38: 3.2. PIVOTING STRATEGIES FOR GAUSSI
Page 39 and 40: 3.3. LU FACTORIZATION 31 appropriat
Page 41 and 42: 3.3. LU FACTORIZATION 33 We pivot o
Page 43 and 44: 3.4. ITERATIVE SOLUTIONS 35 3.3.3 S
Page 45 and 46: 3.4. ITERATIVE SOLUTIONS 37 3.4.2 D
Page 47 and 48: 3.4. ITERATIVE SOLUTIONS 39 We star
Page 49 and 50: 3.4. ITERATIVE SOLUTIONS 41 Now not
Page 51 and 52: 3.4. ITERATIVE SOLUTIONS 43 Remembe
Page 53 and 54: 3.4. ITERATIVE SOLUTIONS 45 is the
Page 55 and 56: Chapter 4 Finding Roots 4.1 Bisecti
Page 57 and 58:
4.2. NEWTON’S METHOD 49 Algorithm
Page 59 and 60:
4.2. NEWTON’S METHOD 51 4.2.2 Pro
Page 61 and 62:
4.3. SECANT METHOD 53 The following
Page 63 and 64:
4.3. SECANT METHOD 55 Since the roo
Page 65 and 66:
4.3. SECANT METHOD 57 relation betw
Page 67 and 68:
4.3. SECANT METHOD 59 (b) f(x) = x
Page 69 and 70:
Chapter 5 Interpolation 5.1 Polynom
Page 71 and 72:
5.1. POLYNOMIAL INTERPOLATION 63 2
Page 73 and 74:
5.1. POLYNOMIAL INTERPOLATION 65 Su
Page 75 and 76:
5.2. ERRORS IN POLYNOMIAL INTERPOLA
Page 77 and 78:
frag replacements 5.2. ERRORS IN PO
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Chapter 6 Spline Interpolation Spli
Page 87 and 88:
frag replacements 6.1. FIRST AND SE
Page 89 and 90:
6.2. (NATURAL) CUBIC SPLINES 81 pro
Page 91 and 92:
6.3. B SPLINES 83 The zero degree B
Page 93 and 94:
6.3. B SPLINES 85 Exercises (6.1) I
Page 95 and 96:
Chapter 7 Approximating Derivatives
Page 97 and 98:
7.2. RICHARDSON EXTRAPOLATION 89 7.
Page 99 and 100:
7.2. RICHARDSON EXTRAPOLATION 91 7.
Page 101 and 102:
7.2. RICHARDSON EXTRAPOLATION 93 Ex
Page 103 and 104:
Chapter 8 Integrals and Quadrature
Page 105 and 106:
8.1. THE DEFINITE INTEGRAL 97 Examp
Page 107 and 108:
8.2. TRAPEZOIDAL RULE 99 The compos
Page 109 and 110:
frag replacements 8.2. TRAPEZOIDAL
Page 111 and 112:
8.3. ROMBERG ALGORITHM 103 then def
Page 113 and 114:
8.4. GAUSSIAN QUADRATURE 105 8.4 Ga
Page 115 and 116:
8.4. GAUSSIAN QUADRATURE 107 Exampl
Page 117 and 118:
8.4. GAUSSIAN QUADRATURE 109 Simple
Page 119 and 120:
8.4. GAUSSIAN QUADRATURE 111 Exerci
Page 121 and 122:
8.4. GAUSSIAN QUADRATURE 113 functi
Page 123 and 124:
Chapter 9 Least Squares 9.1 Least S
Page 125 and 126:
9.1. LEAST SQUARES 117 The answer i
Page 127 and 128:
9.2. ORTHONORMAL BASES 119 g 0 (x 0
Page 129 and 130:
frag replacements 9.2. ORTHONORMAL
Page 131 and 132:
Chapter 10 Ordinary Differential Eq
Page 133 and 134:
10.1. ELEMENTARY METHODS 125 value
Page 135 and 136:
frag replacements 10.1. ELEMENTARY
Page 137 and 138:
10.1. ELEMENTARY METHODS 129 It tur
Page 139 and 140:
10.2. RUNGE-KUTTA METHODS 131 Examp
Page 141 and 142:
10.2. RUNGE-KUTTA METHODS 133 We no
Page 143 and 144:
10.3. SYSTEMS OF ODES 135 Example 1
Page 145 and 146:
10.3. SYSTEMS OF ODES 137 Euler’s
Page 147 and 148:
10.3. SYSTEMS OF ODES 139 have to b
Page 149 and 150:
10.3. SYSTEMS OF ODES 141 4.5 4 3.5
Page 151 and 152:
10.3. SYSTEMS OF ODES 143 (10.9) Im
Page 153 and 154:
Appendix A Old Exams A.1 First Midt
Page 155 and 156:
A.3. FINAL EXAM, FALL 2003 147 •
Page 157 and 158:
A.4. FIRST MIDTERM, FALL 2004 149
Page 159 and 160:
A.5. SECOND MIDTERM, FALL 2004 151
Page 161 and 162:
A.6. FINAL EXAM, FALL 2004 153 P5 (
Page 163 and 164:
Appendix B GNU Free Documentation L
Page 165 and 166:
157 F. Include, immediately after t
Page 167 and 168:
Bibliography [1] Guillaume Bal. Lec
show all

Numerical Methods Course Notes Version 0.1 (UCSD Math 174, Fall ...

Create successful ePaper yourself

Delete template?

Save as template?