Mathematical foundations for algorithm analysis

The theoretical analyses of any algorithm and its iteration behavior require rigorous mathematics. This chapter introduces some foundations for algorithm analysis, including norms, eigenvalues, convergence, computational complexity, and convexity.