Algebraic Starscapes Using Complex Eigenvalues of Bohemian Matrices
The fundamental theorem of algebra states that every polynomial equation with complex coefficients has complex roots. These roots can be mapped on the complex plane, resulting in beautiful, geometric patterns called algebraic starscapes. I developed python code to compute and graph the complex eigenvalues of specific families of matrices, utilizing St. Lawrence's supercomputer for the millions of computations this required. I experimented with matrix size and integer inputs, as well as a multitude of variables in the graphic generation phase.