.png){kind=icon}
返回
Non-intrusive Sparse Subspace Learning for Parametrized Problems
.png){kind=icon}
OA
AI
DOI：10.1007/s11831-017-9241-4.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We discuss the use of hierarchical collocation to approximate the numerical solution of parametric models. With respect to traditional projection-based reduced order modeling, the use of a collocation enables non-intrusive approach based on sparse adaptive sampling of the parametric space. This allows to recover the low-dimensional structure of the parametric solution subspace while also learning the functional dependency from the parameters in explicit form. A sparse low-rank approximate tensor representation of the parametric solution can be built through an incremental strategy that only needs to have access to the output of a deterministic solver. Non-intrusiveness makes this approach straightforwardly applicable to challenging problems characterized by nonlinearity or non affine weak forms. As we show in the various examples presented in the paper, the method can be interfaced with no particular effort to existing third party simulation software making the proposed approach particularly appealing and adapted to practical engineering problems of industrial interest.
Keyword:
PARTIAL-DIFFERENTIAL-EQUATIONS
STOCHASTIC COLLOCATION METHOD
EMPIRICAL INTERPOLATION
HYPER-REDUCTION
DECOMPOSITION
OPTIMIZATION
MODEL
STABILITY
SELECTION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.1
论文数:
1.8K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
Discovering governing equations from data by sparse identification of nonlinear dynamical systems通过非线性动力系统的稀疏识别从数据中发现控制方程OAAI
OAAI分享收藏分享收藏
查看更多内容