Topics of Wilfried Gansterer (wilfried.gansterer (at) univie.ac.at) focus on various aspects of numerical algorithms (Version 24.10.2023). 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!
- Mixed-Precision linear solver for FPGAs:
- https://ieeexplore.ieee.org/document/4531732/authors#authors
- https://www.sciencedirect.com/science/article/abs/pii/S0167819120300569
- State-of-the-art 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 training and inference of (deep) neural networks
- Gaussian process regression for moving sensors
- (Spectral) divide-and-conquer algorithms for solving large-scale eigenvalue problems
- Efficient sparse tensor decomposition (look here)
- Communication Avoiding ILU0 Preconditioner (look here)
- Mixed Precision Low Rank Approximations and their Application to Block Low Rank LU Factorization
- Randomized Low Rank Matrix Approximation: Rounding Error Analysis and a Mixed Precision Algorithm. (look here)
- Replacing Pivoting in Distributed Gaussian Elimination with Random Techniques
- Quantization of rank-one matrices
- Solving systems with multiple right-hand sides.
Literature:
"Block Conjugate Gradient algorithms for least squares problems"
"A breakdown-free block conjugate gradient method"
"Product Hybrid Block GMRES for Nonsymmetrical Linear Systems with Multiple Right-hand Sides"
"A block minimum residual norm subspace solver with partial convergence management for sequences of linear systems"
"Solving multiple linear systems with multiple RHS with GMRES" - Block Gram-Schmidt methods
Literature: "An overview of block Gram-Schmidt methods and their stability properties" - Krylov methods for inverse problems
Literature: "Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches" - Discrete Representation Learning for Variational Graph Auto-Encoder: Variational graph auto-encoder (VGAE) [1] is a framework for unsupervised learning on graph-structured data. This model employs latent variables and is capable of learning interpretable latent graph representations. The project's main aim is to propose a simple generative model that learns such discrete representations by applying Vector Quantised-Variational AutoEncoder (VQ-VAE) [2] to the VGAE.
Literature:
[1] T.Kipf, and M.Welling, Variational Graph Auto-Encoders, published at NIPS Workshop on Bayesian Deep Learning 2016.
[2] A.Oord, O.Vinyals, k.Kavukcuoglu, Neural Discrete Representation Learning, published at NIPS 2017.