Subspace Decomposition based DNN algorithm for elliptic type multi-scale PDEs
Abstract
While deep learning algorithms demonstrate a great potential in scientific computing, its application to multi-scale problems remains to be a big challenge. This is manifested by the "frequency principle" that neural networks tend to learn low frequency components first. Novel architectures such as multi-scale deep neural network (MscaleDNN) were proposed to alleviate this problem to some extent. In this paper, we construct a subspace decomposition based DNN (dubbed SDNN) architecture for a class of multi-scale problems by combining traditional numerical analysis ideas and MscaleDNN algorithms. The proposed architecture includes one low frequency normal DNN submodule, and one (or a few) high frequency MscaleDNN submodule(s), which are designed to capture the smooth part and the oscillatory part of the multi-scale solutions, respectively. In addition, a novel trigonometric activation function is incorporated in the SDNN model. We demonstrate the performance of the SDNN architecture through several benchmark multi-scale problems in regular or irregular geometric domains. Numerical results show that the SDNN model is superior to existing models such as MscaleDNN.
Cite
@article{arxiv.2112.06660,
title = {Subspace Decomposition based DNN algorithm for elliptic type multi-scale PDEs},
author = {Xi-An Li and Zhi-Qin John Xu and Lei Zhang},
journal= {arXiv preprint arXiv:2112.06660},
year = {2021}
}
Comments
19pages,11 figures