In this PhD, we will focus on the solution of moderately sized, dense, generalized matrix eigenvalue problems. In some ways, these problems can be considered 'solved'. The implicit QZ algorithm, implemented in many commonly available software libraries can solve most of these problems in a matter of minutes. However, because these eigenvalue problems are so ubiquitous, improvements to these algorithms are still relevant.