Mohammed is a Mathematician with a solid background in scientific programming. Mohammed’s mathematical interests are in the analysis of partial differential equations and the discretization thereof. Mohammed thrives in environments that empower him to make decisions about project planning and execution. Mohammed is also a great asset in most team combinations.


  • Numerical Analysis of PDEs
  • Numerical Linear Algebra
  • Numerical Optimization
  • Evolutionary PDEs
  • Mathematics for Sustainability


  • PhD in Applied Mathematics, 2022

    King Abdullah Universty of Science and Technology

  • MSc in Applied Mathematics, 2018

    King Abdullah Universty of Science and Technology

  • BSc in Computer Science with a minor in Mathematics, 2016

    Kansas State University



Porous Media

Turbulent flow simulations and properties in porous media and multi-phase applications


Physically relevant modeling of physics-informed separated neural networks (PISNN)

The alternative Navier–Stokes equations

A comprehensive study of the alternative Navier–Stokes equations (Eulerian model)



Postdoc Research Assistant

Lehrstuhl für Thermische Turbomaschinen und Flugtriebwerke, Ruhr-Universität Bochum

Aug 2022 – Jul 2024 Germany

Role includes:

  • Scalability of CFD solver libraries
  • Supervising students
  • Lecturing on CFD in practice

Graduate Teaching Assistant

King Abdullah University of Science and Technology

Jan 2018 – Dec 2020 Saudi Arabia

Classes are:

  • Numerical analysis of PDEs
  • Numerical linear algebra
  • Numerical optimization


Kansas State University

Sep 2015 – May 2016 Kansas

Classes are:

  • General physics II
  • Calculus I and II
  • Discrete Mathematics


i-Center Undergraduate Scholar Award

Two well known problems in combinatorics are ”circle cut by chords” and ”circle cut by line. The first has two simple rules, each dot is a distance one away from any other dot on the circle, and any three edges cannot intersect at one point. It is a count of the number of regions as the number of dots increase. The second has one rule, any three edges, cuts in this context, cannot intersect at one point. It is a count of the number of regions as the number of cuts increase. Now, the interesting part is that we noticed that the second problem is part of a family of problems, Balls in any dimension n cut by hyperspaces in n −1. Then, we noted that in dimension n = 4, the number of regions per cut c matches, to some number of cuts, that of the number of regions per one less dot in the first problem. Our goal is to find a bijection between the two problems.
See certificate


  • 49 234 32 23028
  • Universitätsstraße 150, IC-2/67, Bochum, NRW 44801
  • Enter Building IC and go to floor E2 (NOT E02). Follow the signs to Lehrstuhl für Thermische Turbomaschinen und Flugtriebwerke