Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

An Efficient Approximate Method for Solving Bratu’s Boundary Value Problem

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 14 No. 5 (2024)

DOI
10.11591/ijece.v14i5.pp5738-5743
ISSN
2722-2578, 2088-8708
Published
2024-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

We compute the numerical solution of Bratu’s boundary value problem (BVP). To achieve this, we apply a new and useful approach to solve Bratu’s boundary value problem by using Green’s function and a new integral operator, along with a modified version of the Adomian decomposition method. This process produces solutions that call for the boundary conditions to be applied explicitly. Statistical results demonstrating the robustness and efficiency of the proposed scheme are included. An exact and approximate solution comparison is made with known results. The quantitative outcomes showcase our novel approach’s high numerical precision and consistency across a range of parameter configurations.

Collaboration network of the authors

7 authors · 10 co-authorship links · 2 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Jordan University of Science and Technology
  • Western Michigan University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Maha YousefJordan University of Science and Technology1
Amer DarweeshJordan University of Science and Technology1
Adel AlmalkiAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>An Efficient Approximate Method for Solving Bratu’s Boundary Value Problem</dc:title><dc:creator>Al-Khaled, Kamel</dc:creator><dc:creator>Ajeel, Mahmood Shareef</dc:creator><dc:creator>Abu-Irwaq, Issam</dc:creator><dc:creator>Al-Khalid, Hala</dc:creator><dc:description>&lt;jats:p&gt;We compute the numerical solution of Bratu’s boundary value problem (BVP). To achieve this, we apply a new and useful approach to solve Bratu’s boundary value problem by using Green’s function and a new integral operator, along with a modified version of the Adomian decomposition method. This process produces solutions that call for the boundary conditions to be applied explicitly. Statistical results demonstrating the robustness and efficiency of the proposed scheme are included. An exact and approximate solution comparison is made with known results. The quantitative outcomes showcase our novel approach’s high numerical precision and consistency across a range of parameter configurations.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2024-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v14i5.pp5738-5743</dc:identifier><dc:identifier>10.11591/ijece.v14i5.pp5738-5743</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 14 No 5 (2024); 5738</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/35818/17711</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>