Study on Discrete Null-Field Equation Methods for Bounded Simply Connected Domains: Better Locations of Source Nodes

Li-Ping Zhang, Zi-Cai Li, Hung-Tsai Huang (), Ming-Gong Lee () and Alexander L. Kazakov
Additional contact information
Li-Ping Zhang: School of Mathematical Sciences, Qufu Normal University, Qufu 273165, China
Zi-Cai Li: Department of Applied Mathematics, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan
Hung-Tsai Huang: Department of Data Science and Analytics, I-Shou University, Kaohsiung 84001, Taiwan
Ming-Gong Lee: Department of Tourism and Leisure/Ph.D. Program in Engineering Science, Chung Hua University, Hsin-Chu 30012, Taiwan
Alexander L. Kazakov: Matrosov Institute for System Dynamics and Control Theory, Siberian Branch of the Russian Academy of Sciences, 134, Lermontov St., Irkutsk 664033, Russia

Mathematics, 2024, vol. 13, issue 1, 1-29

Abstract: The discrete null-field equation method (DNFEM) was proposed based on the null-field equation (NFE) of Green’s representation formulation, where only disk domains were discussed. However, the study of the DNFEM for bounded simply connected domains S is essential for practical applications. Since the source nodes must be located outside of a solution domain S , the first issue in computations is how to locate them. It includes two topics—Topic I: The source nodes must be located not only outside S but also outside the exterior boundary layers. The width of the exterior boundary layers is derived as O ( 1 / N ) , where N is the number of unknowns in the DNFEM. Topic II: There are numerous locations for source nodes outside the exterior boundary layers. Based on the sensitivity index, several better choices of pseudo-boundaries are studied for bounded simply connected domains. The advanced study of Topics I and II needs stability and error analysis. The bounds of condition numbers (Cond) are derived for bounded simply connected domains, and they are similar to those of the method of fundamental solutions (MFS). New error bounds are also provided for bounded simply connected domains. The thorough study of determining better locations of source nodes is also valid for the MFS and the discrete boundary integral equation method (DBIEM). The development of algorithms based on the NFE lags far behind that of the traditional boundary element method (BEM). Some progress has been made by following the MFS, and reported in this paper. From the theory and computations in this paper, the DNFEM may become a competent boundary method in scientific/engineering computing.

Keywords: null-field equation; discrete null-field equation method; interior boundary layers; exterior boundary layers; conformal mapping; method of fundamental solutions; Laplace’s equation; stability analysis; error analysis; locations of source nodes; pseudo-boundaries; sensitivity index (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/1/131/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/1/131/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2024:i:1:p:131-:d:1558047

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().