9. Appendix

Computational engineering, especially linear algebra, has an abundance of material beyond what is reasonable to cover in this short and applied introduction. Included here are some material including explanations of useful algorithms, definitions, properties of certain matrices, and proofs that beg for some coverage.

Students are not accountable to know the material in the appendix for exams.

• 9.1. Norms
  • 9.1.1. Cardinality
  • 9.1.2. Vector Norms
  • 9.1.3. General Vector Norm, p-Norm
  • 9.1.4. Taxicab Norm, Manhattan Distance, or City Block Distance
  • 9.1.5. Euclidean Norm
  • 9.1.6. Infinity Norm
  • 9.1.7. Column or Row Norms
  • 9.1.8. Matrix Norms
  • 9.1.9. Maximum Absolute Column Sum
  • 9.1.10. 2-Norm of a Matrix
  • 9.1.11. Frobenius Norm
  • 9.1.12. Maximum Absolute Row Sum
  • 9.1.13. Nuclear Norm
• 9.2. Vector Spaces
• 9.3. Finding Orthogonal Basis Vectors
  • 9.3.1. Gram–Schmidt
  • 9.3.2. Implementation of Classic Gram–Schmidt
  • 9.3.3. Implementation of Modified Gram–Schmidt
• 9.4. Linearly Independent Eigenvectors Theorem
• 9.5. History of the Eigenvalue Problem
  • 9.5.1. Early Explorations
  • 9.5.2. Schur’s Insight
  • 9.5.3. Anticipation of Unitary Matrices
  • 9.5.4. Oak Ridge and Unitary Matrices
  • 9.5.5. The LR Algorithm
  • 9.5.6. John Francis
  • 9.5.7. Vera Kublanovskaya
• 9.6. All About the Number e
  • 9.6.1. Definition and Derivative
  • 9.6.2. Euler’s Complex Exponential Equation
  • 9.6.3. Numerical Verification of Euler’s Formula
  • 9.6.4. Compound Interest