Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916453888819200 |
|---|---|
| author | Hong, Qingguo Jia, Jiwei Lee, Young Ju Li, Ziqian |
| author_facet | Hong, Qingguo Jia, Jiwei Lee, Young Ju Li, Ziqian |
| contents | The paper presents a priori error analysis of the shallow neural network approximation to the solution to the indefinite elliptic equation and and cutting-edge implementation of the Orthogonal Greedy Algorithm (OGA) tailored to overcome the challenges of indefinite elliptic problems, which is a domain where conventional approaches often struggle due to nontraditional difficulties due to the lack of coerciveness. A rigorous a priori error analysis that shows the neural networks ability to approximate indefinite problems is confirmed numerically by OGA methods. We also present a discretization error analysis of the relevant numerical quadrature. In particular, massive numerical implementations are conducted to justify the theory, some of which showcase the OGAs superior performance in comparison to the traditional finite element method. This advancement illustrates the potential of neural networks enhanced by OGA to solve intricate computational problems more efficiently, thereby marking a significant leap forward in the application of machine learning techniques to mathematical problem-solving. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_19122 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems Hong, Qingguo Jia, Jiwei Lee, Young Ju Li, Ziqian Numerical Analysis The paper presents a priori error analysis of the shallow neural network approximation to the solution to the indefinite elliptic equation and and cutting-edge implementation of the Orthogonal Greedy Algorithm (OGA) tailored to overcome the challenges of indefinite elliptic problems, which is a domain where conventional approaches often struggle due to nontraditional difficulties due to the lack of coerciveness. A rigorous a priori error analysis that shows the neural networks ability to approximate indefinite problems is confirmed numerically by OGA methods. We also present a discretization error analysis of the relevant numerical quadrature. In particular, massive numerical implementations are conducted to justify the theory, some of which showcase the OGAs superior performance in comparison to the traditional finite element method. This advancement illustrates the potential of neural networks enhanced by OGA to solve intricate computational problems more efficiently, thereby marking a significant leap forward in the application of machine learning techniques to mathematical problem-solving. |
| title | Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2410.19122 |