This document summarizes several numerical methods for finding roots of nonlinear equations or eigenvalues of matrices:
1) Bisection method, false position method, and secant method are iterative root-finding algorithms for nonlinear equations. They rely on checking the sign of the function at interval endpoints and successively narrowing the interval containing a root.
2) Newton's method and the power method are algorithms for finding roots or eigenvalues by using derivatives or matrix multiplication. Newton's method finds roots by iteratively computing the x-intercept of the tangent line. The power method finds the dominant eigenvalue by repeatedly multiplying a matrix by a vector.
3) Gerschgorin's circle theorem provides bounds on the locations of a