Kyriakos Dimitrios Kantarakias
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Kyriakos Dimitrios Kantarakias has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- George Papadakis
Imperial College London
4 shared publications - Karim Shawki
Department of Aeronautics, Imperial College, London SW7 2AZ, United Kingdom
1 shared publication Kyriakos C. Giannakoglou
1 shared publication- Kyriakos C. Giannakoglou
National Technical University of Athens (NTUA)
1 shared publication - Michail Chatzimanolakis
ETH Zurich
1 shared publication Michalis Chatzimanolakis
1 shared publication
Latest Publications
- Open Access
- 12 April 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (4) , 044208
Uncertainty quantification of time-average quantities of chaotic systems using sensitivity-enhanced polynomial chaos expansion
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
- 12 April 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 109 (4) , 044208
Open AccessUncertainty quantification of time-average quantities of chaotic systems using sensitivity-enhanced polynomial chaos expansion
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
- Open Access
Uncertainty quantification of time-average quantities of chaotic systems using sensitivity-enhanced polynomial chaos expansion
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.
Open AccessUncertainty quantification of time-average quantities of chaotic systems using sensitivity-enhanced polynomial chaos expansion
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.
- Open Access
- 13 April 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (4) , 90
Application of Generalized Polynomial Chaos for Quantification of Uncertainties of Time Averages and Their Sensitivities in Chaotic Systems
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).
- 13 April 2020
- Published by MDPI AG in Algorithms
- Vol. 13 (4) , 90
Open AccessApplication of Generalized Polynomial Chaos for Quantification of Uncertainties of Time Averages and Their Sensitivities in Chaotic Systems
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).
- Open Access
- 28 February 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 101 (2) , 022223
Uncertainty quantification of sensitivities of time-average quantities in chaotic systems
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).
- 28 February 2020
- Published by American Physical Society (APS) in Physical Review E
- Vol. 101 (2) , 022223
Open AccessUncertainty quantification of sensitivities of time-average quantities in chaotic systems
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).
- 29 January 2019
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 348, 207-221
A painless intrusive polynomial chaos method with RANS-based applications
- 29 January 2019
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 348, 207-221
A painless intrusive polynomial chaos method with RANS-based applications
- 1 January 2017
- Published by ECCOMAS
- p. 588-597
ON THE DEVELOPMENT OF THE 3D EULER EQUATIONS USING INTRUSIVE PCE FOR UNCERTAINTY QUANTIFICATION
- 1 January 2017
- Published by ECCOMAS
- p. 588-597
ON THE DEVELOPMENT OF THE 3D EULER EQUATIONS USING INTRUSIVE PCE FOR UNCERTAINTY QUANTIFICATION