TY - JOUR
T1 - Non-intrusive low-rank separated approximation of high-dimensional stochastic models
AU - Doostan, Alireza
AU - Validi, AbdoulAhad
AU - Iaccarino, Gianluca
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): AEA 48803
Acknowledgements: The work of AD and AV was partially supported by the Department of Energy under Advanced Scientific Computing Research Early Career Research Award DE-SC0006402, the National Science Foundation grant DMS-1228359, and the Predictive Science Academic Alliance Program (PSAAP) at Stanford University. GI gratefully acknowledges financial support from KAUST under award AEA 48803.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2013/8
Y1 - 2013/8
N2 - This work proposes a sampling-based (non-intrusive) approach within the context of low-. rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs. © 2013 Elsevier B.V.
AB - This work proposes a sampling-based (non-intrusive) approach within the context of low-. rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs. © 2013 Elsevier B.V.
UR - http://hdl.handle.net/10754/598981
UR - https://linkinghub.elsevier.com/retrieve/pii/S0045782513000935
UR - http://www.scopus.com/inward/record.url?scp=84878994105&partnerID=8YFLogxK
U2 - 10.1016/j.cma.2013.04.003
DO - 10.1016/j.cma.2013.04.003
M3 - Article
SN - 0045-7825
VL - 263
SP - 42
EP - 55
JO - Computer Methods in Applied Mechanics and Engineering
JF - Computer Methods in Applied Mechanics and Engineering
ER -