algorithm%20topics

algorithm%20topics - Secant method o Two initial...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COMP 208 Topics on Algorithms Searching Finding maximum and minimum – O(n) Linear search – O(n) Binary search for sorted data – O(log n) Sorting Bubble sort – O(n 2 ) o Optimized version Selection sort – O(n 2 ) Insertion sort – O(n 2 ) Recursive versions vs non-recursive versions Merging sorted lists – O(n) Mergesort -- O(n log n) Linear Algebra Vector operations o Addition, scaling, dot product, norm Matrix representation and operations o Add, transpose o Multiply – O(n 3 ) Solving linear systems o Gausian elimination without pivoting o Gaussian elimination with partial pivoting o Backsubstitution Root Finding Bisection algorithm o Two initial approximations that bracket a root o Guaranteed but slow convergence
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Secant method o Two initial approximations, not necessarily bracketing a root o Not guaranteed to converge but faster False Position method o Two initial approximations that bracket a root o Might not converge but likely to, fast Newton-Raphson method o Uses derivative of function o Fast convergence (not guaranteed) o Derivation might be analytical (exact) or numerically extimated Numerical Integration Midpoint method error O(h 2 ) Trapezoidal method error O(h 2 ) Simpsons method error O(h 5 ) Monte Carlo methods Initial Value Problems (ODEs) Eulers method for growing function Runge-Kutta method Applications in two variables...
View Full Document

This note was uploaded on 01/15/2010 for the course COMP COMP 206 taught by Professor Vybihal during the Spring '04 term at McGill.

Page1 / 2

algorithm%20topics - Secant method o Two initial...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online