Kyriakos Dimitrios Kantarakias

Mr. Kyriakos Dimitrios Kantarakias

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2019 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
MCM. Chatzimanolakis
M. Chatzimanolakis
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
VAVarvara G. Asouti
Varvara G. Asouti
KGK.C. Giannakoglou
K.C. Giannakoglou

28 February 2020 in Physical Review E
Verified
Journal Article
Open access
PDF file
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
KSKarim Shawki
Karim Shawki
GPGeorge Papadakis
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).

12 April 2024 in Physical Review E
Verified
Journal Article
Open access
PDF file
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
GPGeorge Papadakis
George Papadakis
We consider the effect of multiple stochastic parameters on the time-average quantities of chaotic systems. We employ the recently proposed sensitivity-enhanced generalized polynomial chaos expansion, se-gPC, to quantify efficiently this effect. se-gPC is an extension of gPC expansion, enriched with the sensitivity of the time-averaged quantities with respect to the stochastic variables. To compute these sensitivities, the adjoint of the shadowing operator is derived in the frequency domain. Coupling the adjoint operator with gPC provides an efficient uncertainty quantification algorithm, which, in its simplest form, has computational cost that is independent of the number of random variables. The method is applied to the Kuramoto-Sivashinsky equation and is found to produce results that match very well with Monte Carlo simulations. The efficiency of the proposed method significantly outperforms sparse-grid approaches, such as Smolyak quadrature. These properties make the method suitable for application to other dynamical systems with many stochastic parameters. Published by the American Physical Society 2024

13 April 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
GPGeorge Papadakis
George Papadakis
In this paper, we consider the effect of stochastic uncertainties on non-linear systems with chaotic behavior. More specifically, we quantify the effect of parametric uncertainties to time-averaged quantities and their sensitivities. Sampling methods for Uncertainty Quantification (UQ), such as the Monte–Carlo (MC), are very costly, while traditional methods for sensitivity analysis, such as the adjoint, fail in chaotic systems. In this work, we employ the non-intrusive generalized Polynomial Chaos (gPC) for UQ, coupled with the Multiple-Shooting Shadowing (MSS) algorithm for sensitivity analysis of chaotic systems. It is shown that the gPC, coupled with MSS, is an appropriate method for conducting UQ in chaotic systems and produces results that match well with those from MC and Finite-Differences (FD).

1 January 2017
Verified
Conference Paper
Closed access
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
MCMichalis Chatzimanolakis
Michalis Chatzimanolakis
VAVarvara G. Asouti
Varvara G. Asouti
KGKyriakos C. Giannakoglou
Kyriakos C. Giannakoglou

1 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
GPGeorge Papadakis
George Papadakis
KKKyriakos Dimitrios Kantarakias
Kyriakos Dimitrios Kantarakias
We consider the effect of multiple stochastic parameters on the time-average quantities of chaotic systems. We employ the recently proposed \cite{Kantarakias_Papadakis_2023} sensitivity-enhanced generalized polynomial chaos expansion, se-gPC, to compute efficiently this effect. se-gPC is an extension of gPC expansion, enriched with the sensitivity of the time-averaged quantities with respect to the stochastic variables. To compute these sensitivities, the adjoint of the shadowing operator is derived in the frequency domain. Coupling the adjoint operator with gPC provides an efficient uncertainty quantification (UQ) algorithm which, in its simplest form, has computational cost that is independent of the number of random variables. The method is applied to the Kuramoto-Sivashinsky equation and is found to produce results that match very well with Monte-Carlo simulations. The efficiency of the proposed method significantly outperforms sparse-grid approaches, like Smolyak Quadrature. These properties make the method suitable for application to other dynamical systems with many stochastic parameters.