Power Module Heat Sink Design Optimization with Ensembles of Data-Driven Polynomial Chaos Surrogate Models
arXiv:2205.08746 · doi:10.1016/j.prime.2022.100059
Abstract
We consider the problem of optimizing the design of a heat sink used for cooling an insulated gate bipolar transistor (IGBT) power module. The thermal behavior of the heat sink is originally estimated using a high-fidelity computational fluid dynamics (CFD) simulation, which renders numerical optimization too computationally demanding. To enable optimization studies, we substitute the CFD simulation model with an inexpensive polynomial surrogate model that approximates the relation between the device's design features and a relevant thermal quantity of interest. The surrogate model of choice is a data-driven polynomial chaos expansion (DD-PCE), which learns the aforementioned relation by means of polynomial regression. Advantages of the DD-PCE include its applicability in small-data regimes and its easily adaptable model structure. To address the issue of model-form uncertainty and model robustness in view of limited training and test data, ensembles of DD-PCEs are generated based on data re-shuffling. Then, using the full ensemble of surrogate models, the surrogate-based predictions are accompanied by uncertainty metrics such as mean value and variance. Once trained and tested in terms of accuracy and robustness, the ensemble of DD-PCE surrogates replaces the high-fidelity simulation model in optimization algorithms aiming to identify heat sink designs that optimize the thermal behavior of the IGBT under geometrical and operational constraints. Optimized heat sink designs are obtained for a computational cost much smaller than utilizing the original model in the optimization procedure. Due to ensemble modeling, the optimization results can also be assessed in terms of uncertainty and robustness. Comparisons against alternative surrogate modeling techniques illustrate why the DD-PCE should be preferred in the considered setting.
arXiv comment20 pages, 4 figures, 7 tables
References in corpus (28)
- Discussion of "Least angle regression" by Efron et al
- Rejoinder to "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Least Angle Regression
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- pymoo: Multi-objective Optimization in Python
- Physics-Constrained Deep Learning for High-dimensional Surrogate Modeling and Uncertainty Quantification without Labeled Data
- NESTA: A Fast and Accurate First-order Method for Sparse Recovery
- Deep UQ: Learning deep neural network surrogate models for high dimensional uncertainty quantification
- A non-adapted sparse approximation of PDEs with stochastic inputs
- An active-learning algorithm that combines sparse polynomial chaos expansions and bootstrap for structural reliability analysis
- Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
- Sparse Pseudospectral Approximation Method
- A weighted L1-minimization approach for sparse polynomial chaos expansions
- Least Squares Polynomial Chaos Expansion: A Review of Sampling Strategies
- Data-driven polynomial chaos expansion for machine learning regression
- Coherence Motivated Sampling and Convergence Analysis of Least-Squares Polynomial Chaos Regression
- Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design
- Compressive sensing adaptation for polynomial chaos expansions
- Basis Adaptive Sample Efficient Polynomial Chaos (BASE-PC)
- Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
- Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications
- Robust Shape Optimization of Electric Devices Based on Deterministic Optimization Methods and Finite Element Analysis With Affine Decomposition and Design Elements