About

Our Team

Tomáš Oberhuber

is an associate professor at the Department of Mathematics, Faculty of Nuclear Science and Physical Engineering at Czech Technical University in Prague, former head of the CUDA research center at CTU in Prague. His domains of interest are numerical mathematics, image processing, HPC and programming in C++. He started development of TNL in 2004 and he is responsible for the overall design of TNL.

Jakub Klinkovský

is Ph.D. graduate from the Department of Mathematics and a researcher at the Department of Software Engineering, Faculty of Nuclear Science and Physical Engineering at Czech Technical University in Prague. His domains of interest are numerical mathematics, multiphase porous media flow, HPC and programming in C++ and Python. In TNL, he has implemented many data structures such as unstructured meshes and algorithms such as CWYGMRES.

Tomáš Halada

is a Ph.D. student at the Department of Technical Mathematics, Faculty of Mechanical Engineering at Czech Technical University in Prague. His domains of interest are numerical mathematics and particle methods with applications to problems in continuum mechanics. In TNL, he focuses on development of module for Smoothed Particle Hydrodynamics method.

Aleš Wodecki

is a researcher at the Faculty of Electrical Engineering and Faculty of Nuclear Science and Physical Engineering at Czech Technical University in Prague. His domains of interest are optimization methods, materials science and quantum computing.

Current developers

  • Radek Cichra (FNSPE, CTU in Prague) – parallel graph algorithms.
  • Vít Novotný (FNSPE, CTU in Prague) – operations with sparse matrices.
  • Alexandr Krastenov (FNSPE, CTU in Prague) – operations with dense matrices.
  • Tadeáš Urban (FNSPE, CTU in Prague) – parallel sorting algorithms.
  • Kirill Tiuliusin (FNSPE, CTU in Prague) – hashing algorithms.
  • Samuel Križan (FNSPE, CTU in Prague) – algorithms for machine learning.
  • Ilya Vorobyev (FNSPE, CTU in Prague) – algorithms for multidimensional arrays.
  • Marek Salaba (FNSPE, CTU in Prague) – algorithms for calculating matrix eigenvalues.
  • Ilja Kolesnik (FIT, CTU in Prague) – GPU kernels for CSR format for sparse matrices, adaptive grids.

Former developers

  • Lukáš Čejka (FNSPE, CTU in Prague) – sparse matrix formats and LU decomposition.
  • Yury Hayeu (FIT, CTU in Prague) – orthogonal grids and convolutions.
  • Jan Groschaft (FIT, CTU in Prague) – hashing algorithms for GPUs.
  • Ján Bobot (FIT, CTU in Prague) – polyhedral numerical meshes.
  • Tat Dat Duong (FIT, CTU in Prague) – B-trees for GPUs.
  • Xuan Thang Nguyen (FIT, CTU in Prague) – sorting algorithms (quicksort and bitnoic sort) for GPUs.
  • Askar Kolushev (FIT, CTU in Prague) – hashing algorithms for GPUs.
  • Matouš Fencl (FNSPE, CTU in Prague) – sparse matrices and solvers for Hamilton-Jacobi equation.
  • Jan Schafer (FNSPE, CTU in Prague) – solvers for compressible Navier-Stokes equations.
  • Vít Hanousek (FNSPE, CTU in Prague) – distributed numerical grids.
  • Vítězslav Žabka (FNSPE, CTU in Prague) – unstructured numerical meshes.
  • Tomáš Sobotík (FNSPE, CTU in Prague) – solvers for Hamilton-Jacobi equation.
  • Libor Bakajsa (FNSPE, CTU in Prague) – sparse matrix formats.
  • Ondřej Székely (FNSPE, CTU in Prague) – solvers for parabolic problems.
  • Jan Vacata (FNSPE, CTU in Prague) – sparse matrix formats.
  • Martin Heller (FNSPE, CTU in Prague) – sparse matrix formats.
  • Matěj Novotný (FNSPE, CTU in Prague) – high precision arithmetics.

Graphic design

The TNL logo was designed by DesignHUB.

TNL logo