arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.01294math.NAcs.NAmath.OCmath.STstat.MLstat.TH
收藏

基于高斯过程求解非线性偏微分方程的稀疏Cholesky分解

Sparse Cholesky Factorization for Solving Nonlinear PDEs via Gaussian Processes

Yifan Chen, Houman Owhadi, Florian Schäfer

AI总结:

针对基于高斯过程的非线性PDE求解中稠密核矩阵计算复杂度高的问题,提出一种近线性复杂度的稀疏Cholesky分解算法,结合Vecchia近似实现快速求解,并在多类非线性PDE上验证了其近线性时空复杂度。

摘要:

近年来,基于机器学习的方法被广泛用于自动化求解偏微分方程(PDEs)。在这些方法中,高斯过程(GPs)与核方法凭借其灵活性、可靠的理论保障以及与传统方法的紧密联系,受到了广泛关注。这类方法可将一般非线性PDEs的求解转化为求解带有由PDE诱导的非线性约束的二次优化问题。然而,其复杂度瓶颈在于对稠密核矩阵的计算,这类矩阵由协方差核的逐点评估及其偏导数生成,而偏导数是PDE约束的产物,目前针对这类矩阵的快速算法十分稀缺。\n本文的主要目标是提出一种可处理此类核矩阵的近线性复杂度算法。我们提出了一种适用于这类矩阵的稀疏Cholesky分解算法,该算法基于在一种全新的逐点测量与导数测量排序下Cholesky因子的近稀疏性。我们通过将该因子直接与GP回归以及数值均匀化中基函数的指数衰减性相关联,严格证明了这种近稀疏性。随后,我们采用在Kullback-Leibler散度意义下最优的GP的Vecchia近似,来计算近似因子。这使得我们能够以$O(N\log^d(N/ε))$的空间复杂度和$O(N\log^{2d}(N/ε))$的时间复杂度,计算核矩阵的$ε$-近似逆Cholesky因子。我们将稀疏Cholesky分解整合到优化算法中,得到了非线性PDE的快速求解器。我们通过数值实验验证了该算法在一大类非线性PDEs(如非线性椭圆方程、Burgers方程和Monge-Ampère方程)上的近线性空间/时间复杂度。

英文摘要:

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its \textit{partial derivatives}, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute $ε$-approximate inverse Cholesky factors of the kernel matrices with complexity $O(N\log^d(N/ε))$ in space and $O(N\log^{2d}(N/ε))$ in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm's near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations.

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

↑