Tag gossip algorithms

Hana’s PhD Defense

Rich is back from the University of Vienna, where he had the great fortune to serve as an external referee on Hana Strakova’s PhD dissertation committee. Hana was a Fall 2011 intern in our lab; her primary thesis advisor is Wilfried Gansterer. Her thesis breaks new ground in the development of  resilient and asynchronous numerical linear algebra algorithms for highly unreliable systems, using so-called “gossiping” techniques: “Truly distributed approaches to orthogonalization and orthogonal iteration on the basis of gossip algorithms.” Naturally, she passed with flying colors. Congratulations!

Rich, Hana, and Wilfried

Left-to-right: Rich, Dr. Hana Strakova, and her advisor, Wilfried Gansterer (University of Vienna).