KSKarim Shawki

Karim Shawki

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Karim Shawki has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Uncertainty quantification of sensitivities of time-average quantities in chaotic systems

    by Kyriakos D. Kantarakias, Karim Shawki, George Papadakis

    We consider time-average quantities of chaotic systems and their sensitivity to system parameters. When the parameters are random variables with a prescribed probability density function, the sensitivities are also random. The central aim of the paper is to study and quantify the uncertainty of the sensitivities; this is useful to know in robust design applications. To this end, we couple the nonintrusive polynomial chaos expansion (PCE) with the multiple shooting shadowing (MSS) method, and apply the coupled method to two standard chaotic systems, the Lorenz system and the Kuramoto-Sivashinsky equation. The method leads to accurate results that match well with Monte Carlo simulations (even for low chaos orders, at least for the two systems examined), but it is costly. However, if we apply the concept of shadowing to the system trajectories evaluated at the quadrature integration points of PCE, then the resulting regularization can lead to significant computational savings. We call the new method shadowed PCE (sPCE).


  • Open Access

    A Preconditioned Multiple Shooting Shadowing Algorithm for the Sensitivity Analysis of Chaotic Systems

    by Karim Shawki, George Papadakis

    We propose a preconditioner that can accelerate the rate of convergence of the Multiple Shooting Shadowing (MSS) method. This recently proposed method can be used to compute derivatives of time-averaged objectives (also known as sensitivities) to system parameter(s) for chaotic systems. We propose a block diagonal preconditioner, which is based on a partial singular value decomposition of the MSS constraint matrix. The preconditioner can be computed using matrix-vector products only (i.e. it is matrix-free) and is fully parallelised in the time domain. Two chaotic systems are considered, the Lorenz system and the 1D Kuramoto Sivashinsky equation. Combination of the preconditioner with a regularisation method leads to tight bracketing of the eigenvalues to a narrow range. This combination results in a significant reduction in the number of iterations, and renders the convergence rate almost independent of the number of degrees of freedom of the system, and the length of the trajectory that is used to compute the time-averaged objective. This can potentially allow the method to be used for large chaotic systems (such as turbulent flows) and optimal control applications. The singular value decomposition of the constraint matrix can also be used to quantify the effect of the system condition on the accuracy of the sensitivities. In fact, neglecting the singular modes affected by noise, we recover the correct values of sensitivity that match closely with those obtained with finite differences for the Kuramoto Sivashinsky equation in the light turbulent regime.