Publicaties
Fast Algorithms for Generalized Eigenvalue Problems KU Leuven
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.
The seriation problem in the presence of a double Fiedler value KU Leuven
Seriation is a problem consisting of seeking the best enumeration order of a set of units whose interrelationship is described by a bipartite graph, that is, a graph whose nodes are partitioned in two sets and arcs only connect nodes in different groups. An algorithm for spectral seriation based on the use of the Fiedler vector of the Laplacian matrix associated to the problem was developed by Atkins et al., under the assumption that the Fiedler ...