Deep Neural Networks and Finite Elements of Any Order on Arbitrary Dimensions

In this study, we establish that deep neural networks employing ReLU and ReLU 2 activation functions can rigorously represent Lagrange finite element functions of any order on arbitrary simplicial meshes in any dimension. We introduce two novel formulations for globally expressing the basis functions of Lagrange elements, tailored for both specific and arbitrary meshes. These formulations are based on a geometric decomposition of the elements, incorporating several insightful and essential properties of high-dimensional simplicial meshes, barycentric coordinate functions, and global basis functions of linear elements. This representation theory facilitates a natural approximation result for such deep neural networks. Our findings present the first demonstration of how deep neural networks can systematically generate general continuous piecewise polynomial functions on both specific and arbitrary simplicial meshes.

Authors

Publication Details

Journal
Mathematical Models and Methods in Applied Sciences
Published
2026-09-18
DOI
https://doi.org/10.1142/s0218202527500047
Citations
2
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Deep Neural Networks and Finite Elements of Any Order on Arbitrary Dimensions

Juncai He, Jinchao Xu
2 citations
Mathematical Models and Methods in Applied Sciences
Advanced Numerical Analysis Techniques
article

Deep Neural Networks and Finite Elements of Any Order on Arbitrary Dimensions

Juncai He, Jinchao Xu
article en
2 citations

Abstract

In this study, we establish that deep neural networks employing ReLU and ReLU 2 activation functions can rigorously represent Lagrange finite element functions of any order on arbitrary simplicial meshes in any dimension. We introduce two novel formulations for globally expressing the basis functions of Lagrange elements, tailored for both specific and arbitrary meshes. These formulations are based on a geometric decomposition of the elements, incorporating several insightful and essential properties of high-dimensional simplicial meshes, barycentric coordinate functions, and global basis functions of linear elements. This representation theory facilitates a natural approximation result for such deep neural networks. Our findings present the first demonstration of how deep neural networks can systematically generate general continuous piecewise polynomial functions on both specific and arbitrary simplicial meshes.

Mathematical Models and Methods in Applied Sciences
Openalex Percentile: Top 100%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.