On general regular simplicial partitions of bounded polytopal
domains , , we construct \emph{exact
neural network (NN) emulations} of all lowest order finite element spaces in
the discrete de Rham complex. These include the spaces of piecewise constant
functions, continuous piecewise linear (CPwL) functions, the classical
Raviart-Thomas element'', and the N'{e}d'{e}lec edge element’‘. For all
but the CPwL case, our network architectures employ both ReLU (rectified linear
unit) and BiSU (binary step unit) activations to capture discontinuities. In
the important case of CPwL functions, we prove that it suffices to work with
pure ReLU nets. Our construction and DNN architecture generalizes previous
results in that no geometric restrictions on the regular simplicial partitions
of are required for DNN emulation. In addition, for CPwL
functions our DNN construction is valid in any dimension . Our
FE-Nets'' are required in the variationally correct, structure-preserving approximation of boundary value problems of electromagnetism in nonconvex polyhedra $\Omega \subset \mathbb{R}^3$. They are thus an essential ingredient in the application of e.g., the methodology of physics-informed NNs’’ or
deep Ritz methods'' to electromagnetic field simulation via deep learning techniques. We indicate generalizations of our constructions to higher-order compatible spaces and other, non-compatible classes of discretizations, in particular the Crouzeix-Raviart’’ elements and Hybridized, Higher Order (HHO)
methods.

生成讲解博客的中文版本

生成AI智能校验的中文版本