Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Compressive sensing adaptation for polynomial chaos expansions
 
research article

Compressive sensing adaptation for polynomial chaos expansions

Tsilifis, Panagiotis  
•
Huan, Xun
•
Safta, Cosmin
Show more
March 1, 2019
Journal Of Computational Physics

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorithms, resulting in a reduced polynomial chaos approximation with optimal sparsity. The developed adaptation algorithm consists of a two-step optimization procedure that computes the optimal coefficients and the input projection matrix of a low dimensional chaos expansion with respect to an optimally rotated basis. We demonstrate the attractive features of our algorithm through several numerical examples including the application on Large-Eddy Simulation (LES) calculations of turbulent combustion in a HIFiRE scramjet engine. (C) 2018 Elsevier Inc. All rights reserved.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.jcp.2018.12.010
Web of Science ID

WOS:000458145900002

Author(s)
Tsilifis, Panagiotis  
Huan, Xun
Safta, Cosmin
Sargsyan, Khachik
Lacaze, Guilhem
Oefelein, Joseph C.
Najm, Habib N.
Ghanem, Roger G.
Date Issued

2019-03-01

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE

Published in
Journal Of Computational Physics
Volume

380

Start page

29

End page

47

Subjects

Computer Science, Interdisciplinary Applications

•

Physics, Mathematical

•

Computer Science

•

Physics

•

polynomial chaos

•

basis adaptation

•

compressive sensing

•

l(1)-minimization

•

dimensionality reduction

•

uncertainty propagation

•

uncertainty quantification

•

flow simulations

•

optimization

•

propagation

•

reduction

•

systems

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
CSQI  
Available on Infoscience
June 18, 2019
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/157849
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés