Topics of Wilfried Gansterer (wilfried.gansterer(at)univie.ac.at) focus on various aspects of numerical algorithms. For these topics, interest in numerical algorithms and (large-scale) matrix computations as well as in high performance computing and parallel computing is usually required. You find a list of currently open topics below, but you can also contact me and suggest your own project idea!

  • Efficient check-pointing for achieving fault tolerance in large-scale computations
  • Fault tolerant iterative linear solvers
    • Interpolation-based fault tolerance for the GMRES algorithm
    • Exact state reconstruction for the GMRES algorithm
  • Robustness and fault tolerance in (deep) neural networks
  • Spectral divide-and-conquer algorithms for solving large-scale eigenvalue problems
  • Crime prediction challenge: designing, implementing and evaluating a method for predicting time and location of criminal incidents based on historical data
  •