1 code implementation • 16 Dec 2019 • Dimitrios Loukrezis, Armin Galetzka, Herbert De Gersem
We present an algorithm for computing sparse, least squares-based polynomial chaos expansions, incorporating both adaptive polynomial bases and sequential experimental designs.
Computational Engineering, Finance, and Science
