Algorithms
Abstract
This chapter defines an algorithm and develops pseudocode for expressing an algorithm. As examples, pseudocode is presented for the inner product, the Frobenius matrix norm, and matrix multiplication. Block matrices are briefly discussed using 2 × 2 block matrices. Algorithm efficiency is defined in terms of flop count, and Big-O notation is intuitively developed for expressing flop count. It is made clear that a larger flop count does not guarantee a faster algorithm. Higher memory requirements, poor coding, the ability parallelize one algorithm and not another are factors that must be considered. Truncation error occurs when only a finite number of terms of an infinite series are used; for instance, one could ...
Get Numerical Linear Algebra with Applications now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
