Biography

h-index: 5 | i10-index: 3 | citations: 259 (updated 2026-10)

My name is Mohammed Sayyari; I work on entropy-stable high-order discretizations using the summation-by-parts (SBP) and simultaneous-approximation-terms (SAT) framework. My main model of interest is the compressible Navier–Stokes equations. Currently, I am focusing on a regularization approach for the Navier–Stokes equations for high-speed flows. This lead to the development of novel enropy-stable high-order isothermal wall boundary conditions necessary to verify the new regularization approach. Recently, I worked on extending the positivity-preserving framework for this model to implicit dual time-stepping schemes overcoming some of the stiffness issues (Sayyari and Yamaleev 2026).

The goals of my scientific endeavor is to apply my math and methods towards sustainabilty effors. This focus is mainly of developing efficient and robust schemes for relevant models via the SBP-SAT approach. To realize this aim, I plan to develop schemes for relevant applications to understanding new weather patterns in the context of climate change and extreme weather events. Two cases come to mind, the first is hurricane simulation, and the second is wild fires. The current High-Performance Computing (HPC) capabilities will be essential, and, thus, are at the center of current research efforts.

I love teaching, and I am passionate about pedagogical innovations that engage my students and drive them to think critically. My teaching experience spans undergraduate general education courses to graduate courses in Computational Fluid Dynamics (CFD) and numerical methods. In Numerical Methods for Internal Aerodynamics (link), I had the pleasure to develop a course from the bottom up, deciding a curriculum, writing slides, python homework assignments, and an oral exam typical of a graduate course in Ruhr-Universität Bochum. Currently, I am enjoying teaching PreCalcI for the second semester at Old Dominion University (link). While the general course is coordinated by the department, I implemented some teaching stratigies that students loved, such as the problem sprints (example 1), and one that only a few brave students attempted, the explain and reflect activity (link). I remain fully prepared to develop courses from my current research, and I can’t wait to take up typical courses such as Calculus, ODEs, and PDEs, or more enjoyably, numerical analysis!

Interests

  • Numerical Analysis
  • High-order Methods
  • Entropy stability
  • Boundary conditions
  • HPC

Education

  • 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

Experience

 
 
 
 
 

Adjunct Assistant Professor

Department of Mathematics and Statistics

Aug 2025 – Present Virginia

Role includes:

  • Teaching college algebra
  • Teaching precalculus I
 
 
 
 
 

Postdoc Research Associate

Department of Mathematics and Statistics

Feb 2024 – Present Virginia

Role includes:

  • Research on implicit dual time-stepping entropy stable schemes for the 3D Navier–Stokes equations
  • Research on entropy-stable high-order isothermal boundary conditions for the compressible Navier–Stokes equations
  • Research on the regularization of the Navier-Stokes
  • Research on fully implicit positivity Preserving Numerical Schemes
  • Maintain an in-house entropy-stable high-order fluid dynamics code
 
 
 
 
 

Postdoc Research Assistant

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

Aug 2022 – Dec 2023 Germany

Role includes:

  • Optimization and scalability of discrete-element-method (DEM)/computational fluid dynamics (CFD) simulation platform
  • Research and implementation of a seamless interface fluid/porous model
  • Supervising students
  • Lecturing on CFD in practice and numerical methods

Skills

Programming

C, C++, Fortran, Python

Scientific Computing

LaTeX, PETSc, OpenFOAM, MPI

Academic Writing

Academic papers (9), Proposals (2)

Teaching

Full courses (6), Student supervision (2)

Version Control & Tools

GitHub, GitLab, BitBucket, Docker

Peer Review

Peer reviewer (4 journals)

Funding

Contributor to CRC/TRR287 Renewal Proposal

Contributed to the successful renewal proposal for the Collaborative Research Center/Transregio 287 (CRC/TRR287) funded by the German Research Foundation (DFG) for 2024-2028.

HPC Computing Grant (13 Million Core-Hours)

Served as primary contact for a successful grant application receiving 13 million core-hours of high-performance computing resources. Co-authored the proposal and resource justification for computational research.

Awards

USACM Travel Award for WCCM/ECCOMAS 2026

Travel Award for lodging and registration to speak at the WCCM/ECCOMAS 2026 conference.

Research Excellence Award

Awarded by the Computer, Electrical and Mathematical Sciences and Engineering division at King Abdullah University of Science and Technology for outstanding research contributions.

Student Travel Award for SIAM CSE21

Travel award from the Society for Industrial and Applied Mathematics to attend the Computational Science and Engineering conference.

KAUST Fellowship for Graduate Studies

Full tuition and monthly stipend for M.Sc. and Ph.D. studies in Applied Mathematics at King Abdullah University of Science and Technology.

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

King Abdullah Scholarship for Undergraduate Studies in the USA

Full tuition and monthly stipend for English as a Second Language (ESL) studies followed by undergraduate studies in Computer Science with a Minor in Mathematics at Kansas State University. Full government scholarship provided by the Kingdom of Saudi Arabia.

Contact