子空间拓扑
残余物
人工神经网络
偏微分方程
规范(哲学)
数学
计算机科学
微分方程
平均加权残差法
搭配(遥感)
应用数学
算法
边值问题
数学优化
人工智能
有限元法
数学分析
机器学习
伽辽金法
法学
物理
热力学
政治学
作者
Zhao‐Dong Xu,Zhiqiang Sheng
标识
DOI:10.48550/arxiv.2404.08223
摘要
We present a subspace method based on neural networks (SNN) for solving the partial differential equation with high accuracy. The basic idea of our method is to use some functions based on neural networks as base functions to span a subspace, then find an approximate solution in this subspace. We design two special algorithms in the strong form of partial differential equation. One algorithm enforces the equation and initial boundary conditions to hold on some collocation points, and another algorithm enforces $L^2$-norm of the residual of the equation and initial boundary conditions to be $0$. Our method can achieve high accuracy with low cost of training. Moreover, our method is free of parameters that need to be artificially adjusted. Numerical examples show that the cost of training these base functions of subspace is low, and only one hundred to two thousand epochs are needed for most tests. The error of our method can even fall below the level of $10^{-10}$ for some tests. The performance of our method significantly surpasses the performance of PINN and DGM in terms of the accuracy and computational cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI