The probability density function (PDF) of a random variable associated with the solution of a partial differential equation (PDE) with random parameters is approximated using a truncated series expansion. The random PDE is solved using two stochastic finite element methods, Monte Carlo sampling and the stochastic Galerkin method with global polynomials. The random variable is a functional of the solution of the random PDE, such as the average over the physical domain. The truncated series are obtained considering a finite number of terms in the Gram-Charlier or Edgeworth series expansions. These expansions approximate the PDF of a random variable in terms of another PDF, and involve coefficients that are functions of the known cumulants of the random variable. To the best of our knowledge, their use in the framework of PDEs with random parameters has not yet been explored.
Overcoming the curse of dimensionality in the numerical approximation of Allen-Cahn partial differential equations via truncated full-history recursive multilevel Picard approximations
Deep Truncated FBSDE Method for High-Dimensional Nonlinear PDEs and Fully Coupled FBSDEs
Research Institute of Intelligent Complex Systems, Fudan University(复旦大学智能复杂系统研究院);Department of Mathematics, Friedrich-Alexander-Universität Erlangen–Nürnberg(埃尔朗根-纽伦堡大学数学系)
On Expansions and Nodes for Sparse Grid Collocation of Lognormal Elliptic PDEs
这项工作是一个后续行动,我们以前的贡献(“收敛的稀疏配置函数可数许多高斯随机变量(与应用椭圆偏微分方程)",SIAM J。肛门,2018),并包含使用稀疏网格求解对数正态扩散系数的椭圆偏微分方程的某些方面的进一步见解。具体地,我们首先关注单变量插值规则的选择,提倡使用由Narayan和Jakeman引入的高斯Leja点(“Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation”,SIAM J. Sci.计算:2014),然后讨论用Lévy-Ciesielski展开代替扩散系数的标准Karhunen-Loève展开的可能的计算优势,其动机是Bachmayr、Cohen、DeVore和Migliorati的理论工作(“参数椭圆偏微分方程的稀疏多项式逼近.第二部分:对数正态系数”,ESAIM:M2 AN,2016)。我们的数值结果表明,对于所考虑的问题,高斯Leja配置点优于高斯-埃尔米特和Genz-Keister节点的稀疏网格近似和对数扩散系数的Karhunen-Loève展开比其Lévy-Ciesielski展开的稀疏网格配置的目的更合适。
Nonlocal modeling of spatial fractional diffusion with truncated interaction domains and truncated kernel function singularity
Michigan State University(密歇根州立大学);Missouri University of Science and Technology(密苏里科技大学);Florida State University(佛罗里达州立大学);University of Texas, Austin(德克萨斯大学奥斯汀分校)
Parametric PDEs: Sparse or Low-Rank Approximations?
Hausdorff Center for Mathematics(豪斯多夫数学中心);Institute for Numerical Simulation(数值模拟研究所);Sorbonne Universités, UPMC Univ Paris 06, CNRS, UMR 7598, Laboratoire Jacques-Louis Lions(索邦大学,巴黎第六大学,法国国家科学研究中心,UMR 7598,雅克-路易·利翁斯实验室);Institut für Geometrie und Praktische Mathematik, RWTH Aachen(亚琛工业大学几何与应用数学研究所)
Automatic Differentiation is Essential in Training Neural Networks for Solving Differential Equations
Department One(第一部门);Department Two(第二部门);Department of Mathematics(数学系);The Hong Kong University of Science and Technology(香港科技大学);The Pennsylvania State University(宾夕法尼亚州立大学);Algorithms of Machine Learning and Autonomous Driving Research Lab(机器学习与自动驾驶算法研究实验室);HKUST Shenzhen-Hong Kong Collaborative Innovation Research Institute(香港科技大学深港协同创新研究院)
本文研究神经网络求解 PDE 时 AD 相对 FD 的训练优势,提出截断熵指标,并通过随机特征模型与两层网络的实验和理论分析证明 AD 训练更快、更可靠。
Pseudospectral method for solving PDEs using Matrix Product States
Institute of Fundamental Physics IFF-CSIC(基础物理研究所);Millennium Institute for Research in Optics(光学研究千年研究所);Facultad de Ciencias Físicas y Matemáticas, Universidad de Concepción(康塞普西翁大学物理与数学科学学院)
Sampling recovery in Bochner spaces and applications to parametric PDEs
Mathematisch-Geographische Fakultät, KU Eichstätt-Ingolstadt(凯泽大学艾希施泰特-因戈尔施塔特数学地理学院);Information Technology Institute, Vietnam National University, Hanoi(越南国家大学河内信息技术研究所)
Sparse polynomial approximation for optimal control problems constrained by elliptic PDEs with lognormal random coefficients
Oden Institute for Computational Engineering & Sciences, The University of Texas at Austin(德克萨斯大学奥斯汀分校奥登计算工程与科学学院);Department of Mechanical Engineering, and Department of Geological Sciences, The University of Texas at Austin(德克萨斯大学奥斯汀分校机械工程系和地质科学系)
Optimal control under uncertainty with joint chance state constraints: almost-everywhere bounds, variance reduction, and application to (bi-)linear elliptic PDEs
Split Bregman Isotropic and Anisotropic Image Deblurring with Kronecker Product Sum Approximations using Single Precision Enlarged-GKB or RSVD Algorithms to provide low rank truncated SVDs