arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.0875math.NAcs.NA
收藏

本应还是不应侵入?参数和随机方程的解——恰当广义分解

To be or not to be intrusive? The solution of parametric and stochastic equations --- Proper Generalized Decomposition

École Centrale de Nantes(南特中央理工学院);Institute of Aerodynamics and Flow Control, German Aerospace Center (DLR)(德国航空航天中心空气动力学与流动控制研究所);Institute of Scientific Computing, Technische Universität Braunschweig(布伦瑞克工业大学科学计算研究所)

Loïc Giraldi, Dishi Liu, Hermann G. Matthies, Anthony Nouy

AI总结:

本文提出一种非侵入性数值方法,用于计算参数或随机方程的低秩Galerkin近似解,通过交替最小化方案和准牛顿法实现非侵入性计算。

摘要:

本文提出了一种数值方法,用于计算参数或随机方程的低秩Galerkin近似解,非侵入性地。考虑的非线性问题与参数化可微凸函数的最小化相关。我们首先引入固定秩张量的双线性参数化,并采用交替最小化方案来计算低秩近似。遵循非侵入性的理念,在算法每一步中,通过准牛顿法进行最小化,以避免计算Hessian。通过数值积分使算法非侵入性,仅需在特定参数值处评估残差。该算法随后应用于两个数值示例。

英文摘要:

A numerical method is proposed to compute a low-rank Galerkin approximation to the solution of a parametric or stochastic equation in a non-intrusive fashion. The considered nonlinear problems are associated with the minimization of a parameterized differentiable convex functional. We first introduce a bilinear parameterization of fixed-rank tensors and employ an alternating minimization scheme for computing the low-rank approximation. In keeping with the idea of non-intrusiveness, at each step of the algorithm the minimizations are carried out with a quasi-Newton method to avoid the computation of the Hessian. The algorithm is made non-intrusive through the use of numerical integration. It only requires the evaluation of residuals at specific parameter values. The algorithm is then applied to two numerical examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑