This paper proposes the use of a sparse polynomial chaos expansion method, whose set of basis functions is sparsified using the hyperbolic truncation scheme. This allows the reduction of the computational cost needed to generate a polynomial chaos model that can predict statistical properties of a high-dimensional uncertainty quantification problem of crosstalk in braided shielded cables. By comparing the results of the sparse polynomial chaos expansion with those of a standard polynomial chaos expansion and a Monte Carlo method, we verify that sparse polynomial chaos expansion using the hyperbolic truncation scheme can effectively reduce the curse of dimensionality issues in high-dimensional uncertainty quantification problems for braided shielded cables.
Sparse polynomial chaos expansion for high-dimensional uncertainty quantification of braided shielded cables
Jiang H.
;Antonini G.
2024-01-01
Abstract
This paper proposes the use of a sparse polynomial chaos expansion method, whose set of basis functions is sparsified using the hyperbolic truncation scheme. This allows the reduction of the computational cost needed to generate a polynomial chaos model that can predict statistical properties of a high-dimensional uncertainty quantification problem of crosstalk in braided shielded cables. By comparing the results of the sparse polynomial chaos expansion with those of a standard polynomial chaos expansion and a Monte Carlo method, we verify that sparse polynomial chaos expansion using the hyperbolic truncation scheme can effectively reduce the curse of dimensionality issues in high-dimensional uncertainty quantification problems for braided shielded cables.File | Dimensione | Formato | |
---|---|---|---|
Sparse_polynomial_chaos_expansion_for_high-dimensional_uncertainty_quantification.pdf
solo utenti autorizzati
Tipologia:
Documento in Versione Editoriale
Licenza:
Copyright dell'editore
Dimensione
4.36 MB
Formato
Adobe PDF
|
4.36 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.