Adaptive multi-fidelity sparse polynomial chaos-Kriging metamodeling for global approximation of aerodynamic data
Sign Up to like & getrecommendations! Published in 2021 at "Structural and Multidisciplinary Optimization"
DOI: 10.1007/s00158-021-02895-2
Abstract: The multi-fidelity metamodeling method can dramatically improve the efficiency of metamodeling for computationally expensive engineering problems when multiple levels of fidelity data are available. In this paper, an efficient and novel adaptive multi-fidelity sparse polynomial… read more here.
Keywords: global approximation; multi fidelity; fidelity; sparse polynomial ... See more keywords
Sparse Polynomial Chaos expansion for advanced nuclear fuel cycle sensitivity analysis
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Nuclear Energy"
DOI: 10.1016/j.anucene.2020.107430
Abstract: Abstract Uncertainty and sensitivity analyses are required in fuel cycle analyses for studying the viability of electronuclear scenarios by means of their response to variations in the input parameters. This implies that nuclear fuel cycle… read more here.
Keywords: nuclear fuel; cycle; sensitivity; fuel cycle ... See more keywords
A preconditioning approach for improved estimation of sparse polynomial chaos expansions
Sign Up to like & getrecommendations! Published in 2018 at "Computer Methods in Applied Mechanics and Engineering"
DOI: 10.1016/j.cma.2018.08.005
Abstract: Abstract Compressive sampling has been widely used for sparse polynomial chaos (PC) approximation of stochastic functions. The recovery accuracy of compressive sampling highly depends on the incoherence properties of the measurement matrix. In this paper,… read more here.
Keywords: accuracy; chaos expansions; chaos; sparse polynomial ... See more keywords
LEAP: Lightweight and Efficient Accelerator for Sparse Polynomial Multiplication of HQC
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Very Large Scale Integration (VLSI) Systems"
DOI: 10.1109/tvlsi.2023.3246923
Abstract: The Hamming quasi-cyclic (HQC) code-based encryption scheme is one of the fourth-round algorithms selected by the National Institute of Standards and Technology (NIST) postquantum cryptography (PQC) standardization process. However, very few hardware implementations have been… read more here.
Keywords: lightweight efficient; sparse polynomial; hqc; polynomial multiplication ... See more keywords
Multi-Fidelity Sparse Polynomial Chaos and Kriging Surrogate Models Applied to Analytical Benchmark Problems
Sign Up to like & getrecommendations! Published in 2022 at "Algorithms"
DOI: 10.3390/a15030101
Abstract: In this article, multi-fidelity kriging and sparse polynomial chaos expansion (SPCE) surrogate models are constructed. In addition, a novel combination of the two surrogate approaches into a multi-fidelity SPCE-Kriging model will be presented. Accurate surrogate… read more here.
Keywords: analytical benchmark; polynomial chaos; sparse polynomial; surrogate models ... See more keywords