Numerical methods

Inajengwa juu ya

Masharti ya awali ya lazima 38 (hadi chini kabisa)

Utajifunza

• Explain floating-point representation, machine epsilon and catastrophic cancellation.
• Implement bisection and Newton's method and compare their rates of convergence.
• Implement the trapezoidal and Simpson's rules and estimate their errors.

Fasili

• Machine epsilon is the gap between 1 and the next larger floating-point number.
• An iterative method converges with order p if its errors satisfy eₙ₊₁ ≈ C eₙᵖ for some constant C.

Nadharia

• Newton's method converges quadratically to a simple root of a twice continuously differentiable function when started close enough to the root.
• Bisection halves the error bound at each step and always converges for a continuous function with a sign change.
• For smooth integrands, the composite trapezoidal rule has error O(h²) and the composite Simpson's rule O(h⁴).

Mawazo potofu ya kawaida

• Assuming that printing more digits means more accuracy.
• Expecting Newton's method to converge from every starting point.

Inaelekea kwa

Ugunduzi wa hiari

• Optimisation Gradient descent and Newton's method for minimisation are close relatives of root-finding methods.
• ← Estimation and rounding
• ← Polynomials
• ← Introductory calculus

Njia za kujifunza

• Applied mathematics

Usomaji zaidi

• Richard L. Burden and J. Douglas Faires, Numerical Analysis
• Endre Süli and David F. Mayers, An Introduction to Numerical Analysis (2003)
• Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms (1996)