Home Publications Research Grants Inventions & Patents Awards Additional Research Activities Faculties & Institutions Research Areas

Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems

Hong Q, Jia J, Lee YJ, Li Z (2024)

---

Publication Language: English

Publication Status: Submitted

Publication Type: Unpublished / Preprint

Future Publication Type: Journal article

Publication year: 2024

Open Access Link: https://arxiv.org/pdf/2410.19122

Abstract

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.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Hong, Q., Jia, J., Lee, Y.J., & Li, Z. (2024). Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems. (Unpublished, Submitted).

MLA:

Hong, Qingguo, et al. Greedy Algorithm for Neural Networks for Indefinite Elliptic Problems. Unpublished, Submitted. 2024.

BibTeX: Download