Next Article in Journal
Advanced Statistical Learning: Limit Theorems for Nonparametric Conditional U-Statistics Smoothed by Asymmetric Kernels Under Missing-at-Random Sampling
Previous Article in Journal
On (m¯, m)-Conformal (F¯, F)-Mappings
Previous Article in Special Issue
Semantics-Driven 3D Scene Retrieval via Joint Loss Deep Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Localized Hermite Method of Approximate Particular Solutions for Solving the Helmholtz Equation

1
School of Mathematics and Natural Sciences, The University of Southern Mississippi, Hattiesburg, MS 39406, USA
2
School of Mathematics and Information Science, Zhongyuan University of Technology, Zhengzhou 450007, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(12), 2109; https://doi.org/10.3390/math14122109
Submission received: 27 February 2026 / Revised: 6 June 2026 / Accepted: 9 June 2026 / Published: 12 June 2026

Abstract

This paper proposes a localized Hermite method of approximate particular solutions (LHMAPS) for solving the 2D inhomogeneous Helmholtz-type equations. Building on the local scheme of the localized method of approximate particular solutions (LMAPS) for the Helmholtz-type differential operator, LHMAPS employs Hermite-type local approximations involving both the solution values and their Laplacian to improve the accuracy of LMAPS. The polyharmonic spline (PS) radial basis functions and polynomial basis functions are considered in the formulation of LHMAPS. Numerical experiments are presented to demonstrate the enhanced accuracy achieved by employing Hermite-type local approximations.

1. Introduction

Meshfree methods based on radial basis functions (RBFs) for numerical approximation and for solving differential equations constitute an important class of numerical methods in scientific computing [1,2,3,4,5,6]. These methods have been developed to address the limitations of traditional mesh-based methods in problems involving complex geometries, large deformations, moving boundaries, and high-dimensional domains, where mesh generation and remeshing can become difficult or computationally expensive. They have been applied in a variety of industrial and engineering settings, such as fluid dynamics, wave propagation, geophysical modeling, and materials science [7,8,9,10].
Compared with classical finite element or finite difference methods, meshfree methods offer the advantage of avoiding mesh generation and providing flexible node placement, which simplifies the handling of complex or evolving geometries. However, although global RBF-based methods can achieve high-order accuracy with relatively simple formulations, they also have several limitations, including high computational cost associated with global approximations, potential ill-conditioning of interpolation matrices, and sensitivity to shape parameter selection or stencil configuration in localized variants [1]. Many of these issues can be alleviated by adopting localized schemes [2,6,11]. Among various localized RBF collocation methods, the localized method of approximate particular solutions (LMAPS), which employs particular solutions of radial basis functions to locally approximate the solution of a differential equation, rather than using the RBFs themselves, has attracted considerable attention due to its high accuracy [11,12,13]. LMAPS using particular solutions of polynomial basis functions has also been investigated in [14,15,16].
The localized Hermite method of approximate particular solutions (LHMAPS) was proposed in [17,18] for solving the Poisson equation and convection–reaction–diffusion equations. This method resembles compact finite difference schemes [19,20] in its local approximation of the Laplace operator around each interior collocation point, providing a combined local approximation that incorporates both RBFs and their particular solutions. Several related RBF collocation methods using Hermite interpolation have also been developed, including the Hermite-type radial basis function-based differential quadrature method (H-RBF-DQ), the localized Hermitian (symmetric) meshless method using RBFs, and the compact RBF-FD (RBF-HFD) methods [21,22,23]. Numerical experiments demonstrate that LHMAPS significantly improves the accuracy and convergence rates of traditional LMAPS for multiquadric (MQ), Gaussian (GA), and polyharmonic spline (PS) radial basis functions at the cost of only a slight increase in computational effort. A comparison of the computational costs between LMAPS and LHMAPS using these radial basis functions can be found in Table 2 of [17].
However, existing studies on LHMAPS in [17,18] have considered only particular solutions of MQ, GA, and PS radial basis functions for the Laplace operator. In this paper, we investigate LHMAPS using PS radial basis functions and polynomial basis functions whose particular solutions for Helmholtz-type differential operators have been derived previously [11,24,25]. More specifically, in this paper, we consider LMHAPS using these two types of particular solutions for solving the inhomogeneous Helmholtz equation with the Dirichlet boundary condition:
Δ u ± λ 2 u = f , i n Ω , u = g , o n Ω .
where λ is a nonzero real constant, and Ω R 2 is a bounded, simply connected domain with a piecewise smooth boundary Ω . f and g are real-valued functions defined on Ω and Ω , respectively.
The remainder of this article is organized as follows. A brief introduction of LMAPS with polynomial basis functions and PS radial basis functions is given in Section 2.4. The LHMAPS schemes using polynomial basis functions and PS radial basis functions are presented in Section 3 and Section 4, respectively. Numerical experiments are discussed in Section 5, and the main findings are summarized in Section 6.

2. A Review of LMAPS

In this section, we first introduce polynomial basis functions, PS radial basis functions, and their particular solutions under the Helmholtz-type differential operator L ± : = Δ ± λ 2 . For simplicity, we use L to denote L ± when presenting the numerical schemes for LMAPS and LHMAPS.
Then, we elaborate on the notations used for the collocation points and local neighborhoods. Following this, a brief review of LMAPS using PS and polynomial basis functions is presented.

2.1. Polynomial Basis Functions and PS Radial Basis Functions

The polynomial basis functions of degree k used in LMAPS are usually denoted by ψ ( x ) = x 1 ξ x 2 η with non-negative integers ξ and η satisfying 0 ξ , η k and ξ + η = k (see [14,15,16]).
A particular solution of ψ ( x ) for the general second-order linear partial differential operator D with constant coefficients { a i } i = 1 6 and a 6 0 , which is denoted by Ψ ( x ) , satisfies
D Ψ ( x ) : = a 1 2 x 1 2 + a 2 2 x 1 x 2 + a 3 2 x 2 2 + a 4 x 1 + a 5 x 2 + a 6 Ψ ( x ) = ψ ( x ) .
It has been proven in [14] that Ψ ( x ) can be expressed as follows:
Ψ ( x ) = 1 a 6 j = 0 k 1 a 6 j D j ( x 1 ξ x 2 η ) .
In particular, a specific solution of the polynomial basis function ψ ( x ) for the differential operator L + has the following expression [25]:
Ψ ( x ) = i = 0 [ η / 2 ] j = 0 [ η / 2 ] ( 1 ) i + j ( i + j ) ! ξ ! η ! x 1 ξ 2 i x 2 η 2 j λ 2 i + 2 j + 2 i ! j ! ( ξ 2 i ) ! ( η 2 j ) ! .
In numerical experiments, we use (2) to compute the particular solution for both differential operators L ± , which is used in the localized numerical schemes of LMAPS and LHMAPS.
For the PS radial basis function ϕ ( r ) : = r 2 ω ln ( r ) of positive integer order ω , let Φ ( r ) denote a particular solution of L Φ ( r ) = ϕ ( r ) , where r stands for the Euclidean norm x for any x R 2 . The particular solutions associated with PS radial basis functions of orders ω = 1 , 2 , 3 for the differential operator L were obtained in [11,24]. The corresponding PS radial basis functions are listed in Table 1 and are denoted by PS1, PS2, and PS3, respectively.

2.2. Notations for the Collocation Points and Local Neighbourhoods

Let x = ( x , y ) be a generic point in R 2 . Let X : = X I X B be the the set of collocation points in Ω ¯ , where X I : = { x j } 1 N I and X B = { x i B } 1 N B denote the set of interior points in Ω and the set of boundary collocation points on Ω , respectively. For simplicity, we also let X = { x j } 1 N with N : = N I + N B .
For an interior collocation point x s X I , a neighborhood Ω s is determined by a fixed number of nearest collocation points. We assume that Ω s contains n collocation points X [ s ] : = { x j [ s ] } j = 1 n X , containing x s and its nearest n 1 neighbors. Without loss of generality, we set x 1 [ s ] = x s . Moreover, we choose X H [ s ] X [ s ] for the Hermite interpolation. For instance, if X contains structured 2D rectangular nodes, a popular nine-point stencil centered at x s contains x s and its nearest eight neighbors, four of which are also used for Hermite interpolation.

2.3. LMAPS Using PS Radial Basis Functions

For each x s X I , the LMAPS using PS radial basis functions seeks a local approximation u ˜ to u in Ω s as follows:
u ˜ ( x ) = j = 1 n α j [ s ] Φ ( x x j [ s ] ) + j = 1 𝓁 γ j [ s ] p j ( x ) ,
where α j [ s ] ( j = 1 , , n ) and γ j [ s ] ( j = 1 , , 𝓁 ) are real constants, p j ( x ) denotes all monomials of degree no more than k with 𝓁 = ( k + 1 ) ( k + 2 ) / 2 . The initial LMAPS method proposed in [11] did not incorporate auxiliary polynomials p j ( x ) . A more detailed exploration of the role of the auxiliary polynomials of degree k in enhancing the accuracy of LMAPS using PS radial basis functions was studied in [12]. For instance, if we set k = 1 , then 𝓁 = 3 and { p j ( x ) } j = 1 3 = { 1 , x 1 , x 2 } .
Define coefficient vectors α [ s ] : = ( α 1 [ s ] , , α n [ s ] ) T and γ [ s ] : = ( γ 1 [ s ] , , γ 𝓁 [ s ] ) T . Here and throughout the paper, the superscript T denotes the transpose of a vector or matrix.
Next, we rewrite (3) as the following linear system by selecting x X [ s ]
U [ s ] = Φ n n P n 𝓁 α [ s ] γ [ s ] ,
where
U [ s ] : = u ( x 1 [ s ] ) , , u ( x n [ s ] ) n × 1 T , Φ n n : = Φ ( x i [ s ] x j [ s ] ) n × n , P n 𝓁 : = p j ( x i [ s ] ) n × 𝓁 .
In addition to (4), we impose auxiliary constraints
j = 1 n α j p i ( x j [ s ] ) = 0 , i = 1 , , 𝓁 ,
to yield a symmetric local weight matrix in the following linear system
U [ s ] 0 = Φ n n P n 𝓁 P 𝓁 n 0 𝓁 𝓁 α [ s ] γ [ s ] .
If we denote the above coefficient matrix on the right-hand side by A 1 [ s ] , the coefficients are expressed as
α [ s ] γ [ s ] = ( A 1 [ s ] ) 1 U [ s ] 0 .
Furthermore, we denote by
Φ [ s ] ( x ) : = Φ ( x x 1 [ s ] ) , Φ ( x x 2 [ s ] ) , , Φ ( x x n [ s ] ) 1 × n , P [ s ] ( x ) : = p 1 ( x ) , , p 𝓁 ( x ) 1 × 𝓁 .
Combining (3) and (5) yields
L u ˜ ( x ) = L Φ [ s ] ( x ) L P [ s ] ( x ) α [ s ] γ [ s ] = L Φ [ s ] ( x ) L P [ s ] ( x ) ( A 1 [ s ] ) 1 U [ s ] 0 .
By setting x = x s in (6), we obtain the expression of L u ˜ ( x s ) in terms of values of u on X [ s ] in Ω s . We then denote the local weights in the above expression by the vector τ [ s ] : = L Φ [ s ] ( x s ) L P [ s ] ( x s ) ( A 1 [ s ] ) 1 and express the local numerical scheme for approximating the differential Equation (1) as
τ [ s ] U [ s ] = f ( x s ) , for any x s X I .
Each local weight vector τ [ s ] associated with x s is assembled into a row of the global coefficient matrix according to the global indices of nodes in X [ s ] . Solving the resulting global linear system yields approximations to u ( x s ) for all x s X I .

2.4. LMAPS Using Polynomial Basis Functions

MAPS with a polynomial basis were proposed in [14,15], while its localized version was considered in [16]. LMAPS with a polynomial basis first constructs a local approximation to the solution u over a local stencil of n nodes by using explicit particular solutions for the monomial basis functions in the polynomial space P k , which contains 𝓁 : = ( k + 1 ) ( k + 2 ) / 2 basis functions. Without loss of generality, we set the number of nodes in each local neighborhood Ω s to be n = 𝓁 .
We approximate the solution u ( x ) in Ω s by
u ˜ ( x ) = j = 1 𝓁 α j [ s ] Ψ j ( x ) ,
where α j [ s ] ( j = 1 , , n ) are real constants, and { Ψ j ( x ) } j = 1 𝓁 are particular solutions of polynomial basis functions { ψ j ( x ) } j = 1 𝓁 , which represent an arrangement of all monomials in the form of x 1 ξ x 2 η with 0 ξ + η k .
A linear system for determining α [ s ] can be formed by selecting x X [ s ] in (7)
U [ s ] = Ψ n 𝓁 α [ s ]
where
Ψ n 𝓁 : = Ψ j ( x i [ s ] ) n × n , α [ s ] : = ( α 1 [ s ] , , α 𝓁 [ s ] ) T , U [ s ] : = u ( x 1 [ s ] ) , , u ( x n [ s ] ) n × 1 T .
Furthermore, we define
Ψ [ s ] ( x ) : = Ψ 1 ( x ) , Ψ 2 ( x ) , , Ψ n ( x ) 1 × n .
Solving (8) for α and submitting it into the expression of L u ˜ ( x ) via (7) yield
L u ˜ ( x ) = L Ψ [ s ] ( x ) α [ s ] = [ L Ψ [ s ] ( x ) Ψ n 𝓁 1 ] U [ s ] .
By setting x = x s in (9), we obtain the expression of L u ˜ ( x s ) in terms of values of u on X [ s ] . The local weights can be calculated from (9), as L Ψ [ s ] and Ψ n 𝓁 are known.
The coefficient matrix of the global linear system consists of all weights in (9) associated with U [ s ] , arranged according to the global indices of the nodes in X [ s ] . Solving the resultant linear system yields the approximation to u ( x s ) for all x s X I .

3. LHMAPS Using PS Radial Basis Functions

The Hermite interpolation is carried out on an additional subset X H [ s ] X [ s ] , consisting of a collection of nodes x ¯ j [ s ] , j = 1 , , m . For structured Cartesian nodes, a standard nine-point stencil centered at an interior node x s X [ s ] includes x s and its eight nearest neighbors. The four nearest neighboring nodes are further utilized to construct a Hermite interpolation scheme that incorporates both function values and derivative information.
The proposed LHMAPS method seeks a local approximation u ˜ to u in Ω s involving Hermite interpolation terms and auxiliary polynomials of degree no more than k:
u ˜ ( x ) = j = 1 n α j [ s ] Φ ( x x j [ s ] ) + j = 1 m β j [ s ] ϕ ( x x ¯ j [ s ] ) + j = 1 𝓁 γ j [ s ] p j ( x ) ,
where α j [ s ] ( j = 1 , , n ), β j [ s ] ( j = 1 , , m ), and γ j [ s ] ( j = 1 , , 𝓁 ) are real constants with 𝓁 = ( k + 1 ) ( k + 2 ) / 2 . Define coefficient vectors α [ s ] : = ( α 1 [ s ] , , α n [ s ] ) T , β [ s ] : = ( β 1 [ s ] , , β m [ s ] ) T , and γ [ s ] : = ( γ 1 [ s ] , , γ 𝓁 [ s ] ) T . The first two vectors contain the local weights associated with the function values of u and L u .
We set x X [ s ] in (10), which leads to the following linear system
U [ s ] = Φ n n ϕ n m P n 𝓁 α [ s ] β [ s ] γ [ s ] ,
where
Φ n n : = Φ ( x i [ s ] x j [ s ] ) n × n , ϕ n m : = ϕ ( x i [ s ] x ¯ j [ s ] ) n × m , P n 𝓁 : = p j ( x i [ s ] ) n × 𝓁 , U [ s ] : = u ( x 1 [ s ] ) , , u ( x n [ s ] ) n × 1 T .
Second, we require that the approximation (10) interpolates the second-order differentiation L u , which equals f, at X H [ s ]
f [ s ] = ϕ m n L ϕ m m L P m 𝓁 α [ s ] β [ s ] γ [ s ] ,
where
ϕ m n : = ϕ ( x ¯ i [ s ] x j [ s ] ) m × n , L ϕ m m : = L ϕ ( x ¯ i [ s ] x ¯ j [ s ] ) m × m , L P m 𝓁 : = L p j ( x ¯ i [ s ] ) m × 𝓁 , f [ s ] : = f ( x ¯ 1 [ s ] ) , , f ( x ¯ m [ s ] ) m × 1 T .
Next, to make a symmetric local weight matrix, we impose auxiliary constrains
j = 1 n α j p i ( x j [ s ] ) + j = 1 m β j L p i ( x j [ s ] ) = 0 , i = 1 , , 𝓁 ,
combining (11)–(13) yields the following linear system:
U [ s ] f [ s ] 0 = Φ n n ϕ n m P n 𝓁 ϕ m n L ϕ m m L P m 𝓁 P 𝓁 n L P 𝓁 m 0 𝓁 𝓁 α [ s ] β [ s ] γ [ s ] .
If we denote the above coefficient matrix on the right-hand side of (14) by A 2 [ s ] , the coefficients can be expressed as
α [ s ] β [ s ] γ [ s ] = ( A 2 [ s ] ) 1 U [ s ] f [ s ] 0 .
Furthermore, we denote
ϕ [ s ] ( x ) : = ϕ ( x x 1 [ s ] ) , , ϕ ( x x n [ s ] ) 1 × n , L ϕ ¯ [ s ] ( x ) : = L ϕ ( x x ¯ 1 [ s ] ) , , L ϕ ( x x ¯ m [ s ] ) 1 × m , L p [ s ] ( x ) : = L p 1 ( x ) , , L p 𝓁 ( x ) 1 × 𝓁 ,
and substitute (15) into (10)
L u ˜ ( x ) = ϕ [ s ] ( x ) L ϕ ¯ [ s ] ( x ) L P [ s ] ( x ) α [ s ] β [ s ] γ [ s ] = ϕ [ s ] ( x ) L ϕ ¯ [ s ] ( x ) L P [ s ] ( x ) ( A 2 [ s ] ) 1 U [ s ] f [ s ] 0 .
The expression of L u ˜ ( x s ) in terms of values of u on X [ s ] and values of f on X H [ s ] in the neighborhood Ω s of node x s depends on the local weights calculated from (16) as L ϕ [ s ] , L ϕ ¯ [ s ] , and A 2 [ s ] are known.
We then assemble the global linear system with all weights in (16) associated with U [ s ] , ordered according to the global indices of the nodes in X [ s ] . The resulting coefficient matrix is sparse, with n nonzero entries in each row and each column. The terms involving f [ s ] in (16) are transferred to the same side as f and g. Solving the resulting global linear system then produces approximations to u ( x j ) for all x j X .

4. LHMAPS Using Polynomial Basis Functions

To define the local scheme of LHMAPS using polynomial basis functions, we approximate the solution u ( x ) in Ω s by
u ˜ ( x ) = j = 1 𝓁 α j [ s ] Ψ j ( x ) + j = 1 m β j [ s ] ϕ ( x x ¯ j [ s ] ) ,
where α j [ s ] ( j = 1 , , 𝓁 ) and β j [ s ] ( j = 1 , , m ) are real constants with 𝓁 = ( k + 1 ) ( k + 2 ) / 2 ; { Ψ j ( x ) } j = 1 𝓁 are particular solutions of polynomial basis functions { ψ j ( x ) } j = 1 𝓁 , which represent an arrangement of all monomials in the form of x 1 ξ x 2 η with 0 ξ + η k ; ϕ in the second summation represents a radial basis function.
Without loss of generality, we set n = 𝓁 and m 𝓁 . Define α [ s ] : = ( α 1 [ s ] , , α 𝓁 [ s ] ) T and β [ s ] : = ( β 1 [ s ] , , β m [ s ] ) T . Then, a linear system for determining α [ s ] and β [ s ] can be formed by selecting x X [ s ] in (17)
U [ s ] = Ψ n n ϕ n m α [ s ] β [ s ] ,
where
Ψ n n : = Ψ j ( x i [ s ] ) n × n , ϕ n m : = ϕ ( x i [ s ] x ¯ j [ s ] ) n × m , U [ s ] : = u ( x 1 [ s ] ) , , u ( x n [ s ] ) n × 1 T .
In addition, we also require that the approximation (17) interpolates L u , which equals f, at X H [ s ] :
f [ s ] = L Ψ m n L ϕ m m α [ s ] β [ s ] ,
where
L Ψ m n : = L Ψ j ( x ¯ i [ s ] ) m × n , L ϕ m m : = L ϕ ( x ¯ i [ s ] x ¯ j [ s ] ) m × m , f [ s ] : = f ( x ¯ 1 [ s ] ) , , f ( x ¯ m [ s ] ) m × 1 T .
Combining (18) and (19) leads to the following linear system:
U [ s ] f [ s ] = Ψ n n ϕ n m L Ψ m n L ϕ m m α [ s ] β [ s ] .
We denote the above coefficient matrix on the right-hand side by A 3 [ s ] so that the coefficients can be expressed as
α [ s ] β [ s ] = ( A 3 [ s ] ) 1 U [ s ] f [ s ] .
Furthermore, we denote
L Ψ [ s ] ( x ) : = L Ψ j ( x ) 1 × n , L ϕ ¯ [ s ] ( x ) : = L ϕ ( x x ¯ j [ s ] ) 1 × m .
From (19) and (21), we get
L u ˜ ( x ) = L Ψ [ s ] ( x ) L ϕ ¯ [ s ] ( x ) α [ s ] β [ s ] = L Ψ [ s ] ( x ) L ϕ ¯ [ s ] ( x ) ( A 3 [ s ] ) 1 U [ s ] f [ s ] .
By setting x = x s in (22), we obtain the expression of L u ˜ in terms of values of u on X [ s ] and values of f on X H [ s ] in the neighborhood Ω s of node x s . The local weights can be calculated from (22) since L Ψ [ s ] , L ϕ [ s ] , and A 3 [ s ] are known.
The global system matrix is formed by collecting the weights in (22) corresponding to U [ s ] and placing them according to the global indexing of the nodes in X [ s ] . The contributions involving f [ s ] in (22) are shifted to the same side as f and g. Solving the resulting system yields approximations to u ( x j ) at all interior nodes x j X I .

5. Numerical Results

Two examples are discussed in this section to show the accuracy and effectiveness of LHMAPS using PS radial basis functions and polynomial basis functions for solving the Helmholtz equation compared to LMAPS. Polynomials of order ω are employed for PS radial basis functions in the local approximations. When MQ radial basis functions are used, leave-one-out cross-validation (LOOCV) is employed to select an optimal shape parameter [11]. Numerical experiments are conducted in the MATLAB R2025b environment on a laptop equipped with an 11th-generation Intel(R) Core(TM) i7-11370H processor and 16 GB of RAM.
To demonstrate the convergence behavior of the numerical solutions obtained using LHMAPS, we compute the RMSE between the numerical solution u ˜ and the exact solution u e x a c t defined as follows:
E R M S E : = 1 N j = 1 N u ˜ ( x j ) u e x a c t ( x j ) 2 .
Example 1.
We consider problem (1) with L = L + , λ = 1 , and Ω = ( 0 , 1 ) 2 . The analytical solution is chosen to be u = e x + y . Figure 1 shows examples of Cartesian nodes and unstructured notes. We also set the total number of Cartesian nodes N to be M × M , with M denoting the number of nodes in each row and each column.
In this example, we first compute the numerical solutions of LMAPS and LHMAPS using polynomial basis functions of degree k = 2 , 3 , 4 , 5 , respectively, and compare their RMSEs in Table 2. In LHMAPS, we use the MQ radial basis functions centered at m = 5 nearest nodes to the local center. It can be seen that LMAPS using structured stencils fails to produce a solution when k > 2 , since the matrices for computing local weights become singular. Therefore, we only list the RMSEs of LMAPS for k = 2 . However, when the Hermite interpolation is added in the local numerical scheme, the errors of LHMAPS using polynomial basis functions with k = 2 , 3 , 4 , 5 converges as N increases.
Secondly, we test LHMAPS using polynomial basis functions and PS radial basis functions in the Hermite interpolation. To determine the appropriate order ω for the PS radial basis functions, we compute errors of LHMAPS solution obtained from a 20 × 20 grid and select the order ω from orders 1–7 that minimizes the LHMAPS error (see Table 3). It is observed that the minimum of errors is achieved when w = 5 . Therefore, we present errors of LHMAPS using polynomial basis functions and PS radial basis functions of order ω = 5 in Table 4, which shows a significant improvement compared to LMAPS.
In addition, we compute LMAPS and LHMAPS solutions using polynomial basis functions and multiquadric (MQ) radial basis functions with m = 5 on unstructured nodes, as reported in Table 5, which confirms the better accuracy of LHMAPS. Here, we use unstructured node sets with N = M 2 , where M = 20 , 40 , 60 , 80 , matching the corresponding Cartesian cases.
Lastly, Figure 2 plots the convergence behaviors of LMAPS and LHMAPS from Table 2, Table 4 and Table 5.
Example 2.
We consider problem (1) with L = L and λ = 10 in the flower domain. The analytical solution is given by u = sin π x 6 cos 3 π y 4 . This domain Ω is defined to be the interior region of the closed curve ρ = 1 + cos 2 ( 4 θ ) with Ω = { ( x , y ) , x = ρ cos ( θ ) , y = ρ sin ( θ ) , 0 θ 2 π } .
Figure 3 shows examples of Cartesian nodes and unstructured notes distributed inside the flower domain. The boundary points are selected by partitioning 2 π into N B equal parts and by setting θ j = 2 ( j 1 ) π N B and ( x j , y j ) = ( ρ j cos θ j , ρ j sin θ j ) with ρ j = 1 + cos 2 ( 4 θ j ) for any j = 1 , , N B .
In this example, we consider LHMAPS with several types of basis function combinations: polynomial basis functions combined with MQ radial basis functions for Hermite interpolation, polynomial basis functions combined with PS radial basis functions for Hermite interpolation, and PS radial basis functions combined with PS radial basis functions for Hermite interpolation.
First, we combine polynomial basis functions with MQ radial basis functions for Hermite interpolation in the LHMAPS scheme. Numerical results on Cartesian nodes are presented in Table 6. It is observed again that LMAPS works only for k = 2 , and LHMAPS improves the results of LMAPS by using additional MQ radial basis functions. Similar results are observed when using polynomial basis functions with PS radial basis functions for Hermite interpolation in the LHMAPS scheme, as shown in Table 7 and Table 8. Table 7 compares the RMSEs of LHMAPS using polynomial basis functions of degree 2 and PS radial basis functions of order ω = 1 , , 8 when N = 199 and m = 4 . From this comparison, ω = 3 is selected for Hermite interpolation when k = 2 , m = 4 , with different N used to generate Table 8.
Secondly, we present the LMAPS results using PS radial basis functions of order ω = 2 with n = 9 and of order ω = 3 with n = 13 in Table 9. These results are compared with those of LHMAPS augmented by multiquadric (MQ) radial basis functions using ( ω , n , m ) = ( 2 , 9 , 4 ) and ( ω , n , m ) = ( 3 , 13 , 9 ) , respectively. The results clearly indicate that incorporating Hermite interpolation into LMAPS leads to improved accuracy.
In addition, we apply the proposed LHMAPS to unstructured nodes as shown in the right plot of Figure 1. Table 10 presents the comparison of LMAPS using polynomial basis functions of degrees 2 , 3 , 4 and the corresponding LHMAPS using MQ radial basis functions in Hermite interpolation, which shows that the additional MQ polynomials are unnecessary. Table 11 presents the comparison between LMAPS using PS radial basis functions and its corresponding LHMAPS using PS radial basis functions in Hermite interpolation. It appears that adding the Hermite interpolation over a small-sized stencil of n = 9 nodes to LMAPS does not show significant improvement on unstructured nodes when ω = 2 , as it did on Cartesian nodes, which implies that a larger-sized stencil is more appropriate for unstructured nodes. These results show that LHMAPS using PS3 with n = 13 , m = 4 achieves the highest accuracy on unstructured node sets.

6. Conclusions and Future Work

We propose LHMAPS for solving two-dimensional inhomogeneous Helmholtz-type equations using three types of combined basis functions: polynomial basis functions with MQ radial basis functions, polynomial basis functions with PS radial basis functions, and PS radial basis functions with MQ radial basis functions. This framework improves the local approximation of LMAPS by incorporating additional derivative information through Hermite interpolation and provides an alternative to compact finite difference methods for solving partial differential equations. The flexibility of coupling the LMAPS local scheme with different basis functions for Hermite interpolation broadens the range of localized RBF collocation approaches.
Numerical experiments were used to investigate different basis function combinations of LHMAPS and compare their performance with LMAPS. In both numerical experiments, LHMAPS consistently yielded substantial accuracy improvements over LMAPS on structured (Cartesian) grids, at the cost of only a slight increase in computational effort. However, on unstructured node sets, the performance of LHMAPS was less uniform and appeared to depend on the complexity of the computational domain, a behavior that warrants further investigation.
In future work, we plan to extend the proposed framework to anisotropic Helmholtz equations arising in geophysics and electromagnetics, as well as nonlinear Helmholtz equations encountered in plasma physics.

Author Contributions

Conceptualization, methodology; K.A. and H.Z.; Software and validation, K.A. and Z.Y.; writing—original draft preparation, K.A. and H.Z.; writing—review and editing, Z.Y. and H.Z.; supervision, H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

The second author was supported by the National Natural Science Foundation of China (Grant No. 12572070) and the Natural Science Foundation of Henan Province, China (Grant No. 252300420357).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Fasshauer, G.E. Meshfree Approximation Methods with MATLAB; Interdisciplinary Mathematical Series; World Scientific: Singapore, 2007; Volume 6. [Google Scholar] [CrossRef] [Scilit]
  2. Fornberg, B.; Flyer, N. Solving PDEs with radial basis functions. Acta Numer. 2015, 24, 215–258. [Google Scholar] [CrossRef] [Scilit]
  3. Fu, Z.; Xi, Q.; Gu, Y.; Li, J.; Qu, W.; Sun, L.; Wei, X.; Wang, F.; Lin, J.; Li, W.; et al. Singular boundary method: A review and computer implementation aspects. Eng. Anal. Bound. Elem. 2023, 147, 231–266. [Google Scholar] [CrossRef] [Scilit]
  4. Gu, Y.; Fan, C.-M.; Qu, W.; Wang, F. Localized method of fundamental solutions for large-scale modelling of three-dimensional anisotropic heat conductionproblems—Theory and MATLAB code. Comput. Struct. 2019, 220, 144. [Google Scholar] [CrossRef] [Scilit]
  5. Wendland, H. Scattered Data Approximation; Vo. 17 of Cambridge Monographs on Applied and Computational Mathematics; Cambridge University Press: Cambridge, UK, 2023. [Google Scholar] [CrossRef] [Scilit]
  6. Shu, C. Differential Quadrature and Its Application in Engineering; Springer: London, UK, 2000. [Google Scholar] [CrossRef] [Scilit]
  7. Zhang, X.; Wu, Y. High-resolution strategy for localized method of approximate particular solutions to solve unsteady Navier–Stokes problems. Eng. Anal. Bound. Elem. 2024, 159, 11–16. [Google Scholar] [CrossRef] [Scilit]
  8. Shi, C.Z.; Zheng, H.; Wen, P.H.; Hon, Y.C. The local radial basis function collocation method for elastic wave propagation analysis in 2D composite plate. Eng. Anal. Bound. Elem. 2023, 150, 571–582. [Google Scholar] [CrossRef] [Scilit]
  9. Lin, J.; Hong, Y.; Kuo, L.H.; Liu, C.S. Numerical simulation of 3D nonlinear Schrödinger equations by using the localized method of approximate particular solutions. Eng. Anal. Bound. Elem. 2017, 78, 20–25. [Google Scholar] [CrossRef] [Scilit]
  10. Cao, D.; Li, X.; Zhu, H. A polynomial-augmented RBF collocation method using fictitious centres for solving the Cahn–Hilliard equation. Eng. Anal. Bound. Elem. 2023, 137, 41–55. [Google Scholar] [CrossRef] [Scilit]
  11. Yao, G.; Chen, C.S.; Kolibal, J. A localized approach for the method of approximate particular solutions. Comput. Math. Appl. 2011, 61, 2376–2387. [Google Scholar] [CrossRef] [Scilit]
  12. Yao, G. An improved localized method of approximate particular solutions for solving elliptic PDEs. Comput. Math. Appl. 2016, 71, 171–184. [Google Scholar] [CrossRef] [Scilit]
  13. Yao, G.; Chen, C.S.; Zheng, H. A Modified Method of Approximate Particular Solutions for Solving Linear and Nonlinear PDEs. Numer. Methods Partial Differ. Equ. 2017, 33, 1839–1858. [Google Scholar] [CrossRef] [Scilit]
  14. Dangal, T.; Chen, C.S.; Lin, J. Polynomial particular solutions for solving elliptic partial differential equations. Comput. Math. Appl. 2017, 73, 60–70. [Google Scholar] [CrossRef] [Scilit]
  15. Golberg, M.A.; Muleshkov, A.S.; Chen, C.S.; Cheng, A.H.-D. Polynomial particular solutions for certain partial differential operators. Numer. Methods Partial Differ. Equ. 2003, 19, 112–133. [Google Scholar] [CrossRef] [Scilit]
  16. Li, X.; Dangal, T.; Lei, B. Localized method of approximate particular solutions with polynomial basis functions. Eng. Anal. Bound. Elem. 2018, 97, 16–22. [Google Scholar] [CrossRef] [Scilit]
  17. Acheampong, K.; Zhu, H. Localized Hermite method of approximate particular solutions for solving the Poisson equation. Appl. Math. Lett. 2025, 164, 109471. [Google Scholar] [CrossRef] [Scilit]
  18. Acheampong, K.; Tian, H.; Zhu, H. LMAPS incorporating Hermite interpolation for solving convection–reaction–diffusion equations. Eng. Anal. Bound. Elem. 2025, 179, 106403. [Google Scholar] [CrossRef] [Scilit]
  19. Lele, S.K. Compact finite difference schemes with spectral-like resolution. J. Comput. Phys. 1992, 103, 16–42. [Google Scholar] [CrossRef] [Scilit]
  20. Thomas, J.W. Numerical Partial Differential Equations: Finite Difference Methods, Texts in Applied Mathematics; Springer: Berlin/Heidelberg, Germany, 1995. [Google Scholar] [CrossRef] [Scilit]
  21. Krowiak, A. Hermite type radial basis function-based differential quadrature method for higher order equations. Appl. Math. Model. 2016, 40, 2421–2430. [Google Scholar] [CrossRef] [Scilit]
  22. Stevens, D.; Power, H.; Lees, M.; Morvan, H. The use of PDE centres in the local RBF hermitian method for 3D convective-diffusion problems. J. Comput. Phys. 2009, 228, 4606–4624. [Google Scholar] [CrossRef] [Scilit]
  23. Wright, G.B.; Fornberg, B. Scattered node compact finite difference-type formulas generated from radial basis functions. J. Comput. Phys. 2006, 212, 99–123. [Google Scholar] [CrossRef] [Scilit]
  24. Lamichhane, A.R.; Chen, C.S. The closed-form particular solutions for Laplace and biharmonic operators using a Gaussian function. Appl. Math. Lett. 2015, 46, 50–56. [Google Scholar] [CrossRef] [Scilit]
  25. Muleshkov, A.S.; Chen, C.S.; Golberg, M.A.; Cheng, A.H.-D. Analytic particular solutions for inhomogeneous Helmholtz-type equations. In Advances in Computational Engineering and Sciences; Atluri, S.N., Brust, F.W., Eds.; Tech Science Press: Henderson, NV, USA, 2000; pp. 27–32. [Google Scholar] [CrossRef] [Scilit]
Figure 1. N = M × M = 40 × 40 structured nodes in a square domain vs. 1600 unstructured nodes in a square domain.
Figure 1. N = M × M = 40 × 40 structured nodes in a square domain vs. 1600 unstructured nodes in a square domain.
Mathematics 14 02109 g001
Figure 2. The convergence behaviors of LMAPS and LHMAPS with polynomial basis functions and MQ-RBFs on structured notes ((Left) plot), polynomial basis functions and PS-RBFs on structured notes ((Middle) plot), and polynomial basis functions and MQ-RBFs on unstructured notes ((Right) plot).
Figure 2. The convergence behaviors of LMAPS and LHMAPS with polynomial basis functions and MQ-RBFs on structured notes ((Left) plot), polynomial basis functions and PS-RBFs on structured notes ((Middle) plot), and polynomial basis functions and MQ-RBFs on unstructured notes ((Right) plot).
Mathematics 14 02109 g002
Figure 3. Structured nodes vs. unstructured nodes in a flower domain.
Figure 3. Structured nodes vs. unstructured nodes in a flower domain.
Mathematics 14 02109 g003
Table 1. PS radial basis functions and their particular solutions for L .
Table 1. PS radial basis functions and their particular solutions for L .
ϕ ( r ) Φ ( r )
PS1 = r 2 ln ( r ) 4 λ 4 ( K 0 ( λ r ) + ln ( r ) ) r 2 ln ( r ) λ 2 4 λ 4 , if r > 0 , 4 λ 4 ( γ + ln ( λ 2 ) ) 4 λ 4 , if r = 0 .   
PS2 = r 4 ln ( r ) 64 λ 6 ( K 0 ( λ r ) + ln ( r ) ) r 2 ln ( r ) λ 2 ( 16 λ 2 + r 2 ) 8 r 2 λ 4 96 λ 6 , if r > 0 , 64 λ 6 ( γ + ln ( λ 2 ) ) 96 λ 6 , if r = 0 .   
PS3 = r 6 ln ( r ) 2304 λ 8 ( K 0 ( λ r ) + ln ( r ) ) r 2 ln ( r ) λ 2 ( 576 λ 4 + 36 r 2 λ 2 + r 4 ) , if r > 0 , 12 r 2 λ 4 ( 40 λ 2 + r 2 ) 4224 λ 8 , if r = 0 .
Table 2. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , 3 , 4 , 5 and MQ with m = 5 .
Table 2. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , 3 , 4 , 5 and MQ with m = 5 .
MLMAPSLHMAPS
k = 2 k = 2 k = 3 k = 4 k = 5
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
20 5.47 × 10 5 - 2.66 × 10 5 - 2.53 × 10 5 - 5.84 × 10 8 - 3.67 × 10 8 -
40 1.34 × 10 5 2.03 6.65 × 10 6 1.99 5.17 × 10 6 2.29 4.58 × 10 9 3.67 6.21 × 10 10 5.88
60 5.89 × 10 6 2.02 2.95 × 10 6 2.00 2.19 × 10 6 2.11 3.30 × 10 10 6.48 5.46 × 10 11 6.00
80 3.30 × 10 6 2.01 1.65 × 10 6 2.02 1.21 × 10 6 2.06 2.03 × 10 9 −6.31 3.42 × 10 11 1.62
Table 3. RMSE errors of LHMAPS using polynomials of degree k = 2 and PS of order ω = 1 , , 7 when M = 20 and m = 5 .
Table 3. RMSE errors of LHMAPS using polynomials of degree k = 2 and PS of order ω = 1 , , 7 when M = 20 and m = 5 .
ω 1234567
RMSE 2.77 × 10 4 1.01 × 10 4 4.11 × 10 5 1.39 × 10 5 6.24 × 10 7 9.21 × 10 6 1.46 × 10 5
Table 4. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , 3 , 4 , 5 and PS radial basis functions of order ω = 5 when m = 5 .
Table 4. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , 3 , 4 , 5 and PS radial basis functions of order ω = 5 when m = 5 .
MLMAPSLHMAPS
k = 2 k = 2 k = 3 k = 4 k = 5
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
20 5.47 × 10 5 - 1.14 × 10 6 - 2.00 × 10 3 - 2.67 × 10 6 - 1.25 × 10 6 -
40 1.34 × 10 5 2.03 5.27 × 10 7 1.11 1.07 × 10 3 0.91 1.74 × 10 6 0.62 9.11 × 10 9 7.10
60 5.89 × 10 6 2.02 2.75 × 10 7 1.61 2.27 × 10 4 3.83 6.73 × 10 7 2.34 1.46 × 10 7 −6.84
80 3.30 × 10 6 2.01 1.67 × 10 7 1.72 1.71 × 10 4 0.98 4.85 × 10 8 9.14 4.14 × 10 9 12.38
Table 5. RMSE errors of LMAPS using polynomials vs. LHMAPS using Poly + MQ with m = 5 on unstructured nodes.
Table 5. RMSE errors of LMAPS using polynomials vs. LHMAPS using Poly + MQ with m = 5 on unstructured nodes.
MLMAPSLHMAPS
k = 4 k = 5 k = 4 k = 5
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
20 1.38 × 10 5 - 4.05 × 10 7 - 7.18 × 10 6 - 3.31 × 10 8 -
40 3.05 × 10 6 2.1756 3.44 × 10 8 3.5586 3.57 × 10 7 4.3281 6.46 × 10 9 2.3567
60 1.39 × 10 6 1.9401 3.61 × 10 9 5.5633 3.83 × 10 8 5.5054 2.91 × 10 9 1.9625
80 4.24 × 10 7 4.1221 1.17 × 10 8 −4.0913 3.96 × 10 8 −0.1165 1.98 × 10 9 1.3404
Table 6. RMSE errors of LHMAPS using polynomials of degree k = 2 , 3 , 4 and MQ radial basis functions for Hermite interpolation with m = 5 .
Table 6. RMSE errors of LHMAPS using polynomials of degree k = 2 , 3 , 4 and MQ radial basis functions for Hermite interpolation with m = 5 .
NLMAPSLHMAPS
k = 2 k = 2 k = 3 k = 4
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
199 1.75 × 10 3 - 1.79 × 10 3 - 1.94 × 10 3 - 8.03 × 10 3 -
789 1.99 × 10 4 3.14 1.55 × 10 4 3.53 1.51 × 10 4 3.69 1.52 × 10 4 5.72
1689 7.29 × 10 5 2.58 6.72 × 10 5 2.15 1.20 × 10 4 0.58 2.01 × 10 6 11.14
3067 2.56 × 10 5 3.43 2.16 × 10 5 3.72 2.90 × 10 5 4.67 2.95 × 10 6 −1.26
4748 3.35 × 10 5 −1.20 1.12 × 10 5 2.94 5.71 × 10 6 7.28 1.71 × 10 6 2.44
Table 7. RMSE errors of LHMAPS using polynomials of degree 2 and PS radial basis functions of order ω = 1 , , 8 when N = 199 , m = 4 .
Table 7. RMSE errors of LHMAPS using polynomials of degree 2 and PS radial basis functions of order ω = 1 , , 8 when N = 199 , m = 4 .
ω 12345678
E R M S E 6.81 × 10 2 9.32 × 10 2 1.04 × 10 3 1.36 × 10 3 5.20 × 10 3 7.26 × 10 3 3.80 × 10 3 3.91 × 10 3
Table 8. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , , 4 and PS radial basis functions with order ω = 3 when m = 4 .
Table 8. RMSE errors of LMAPS and LHMAPS using polynomials of degree k = 2 , , 4 and PS radial basis functions with order ω = 3 when m = 4 .
NLMAPSLHMAPS
k = 2 k = 2 k = 3 k = 4
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
199 1.76 × 10 3 - 1.046 × 10 3 - 8.806 × 10 4 - 1.036 × 10 3 -
789 1.99 × 10 4 3.14 1.37 × 10 4 2.92 1.41 × 10 3 −0.68 5.35 × 10 5 4.27
1689 7.29 × 10 5 2.58 5.07 × 10 5 2.55 5.78 × 10 4 2.20 1.35 × 10 5 3.39
3067 2.56 × 10 5 3.43 1.91 × 10 5 3.21 8.72 × 10 5 6.57 2.59 × 10 5 −2.26
4748 3.35 × 10 5 −1.19 1.67 × 10 5 0.60 1.32 × 10 4 −1.87 2.25 × 10 6 10.94
Table 9. RMSE errors of LMAPS and LHMAPS using PS2 and MQ with n = 9 , m = 4 and PS3 with n = 13 , m = 9 .
Table 9. RMSE errors of LMAPS and LHMAPS using PS2 and MQ with n = 9 , m = 4 and PS3 with n = 13 , m = 9 .
NLMAPSLHMAPS
PS2 ( n = 9 ) PS3 ( n = 13 ) PS2 ( n = 9 , m = 4 ) PS3 ( n = 13 , m = 4 )
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
199 2.05 × 10 1 - 3.06 × 10 4 - 4.98 × 10 2 - 1.16 × 10 4 -
789 5.12 × 10 2 2.0007 1.83 × 10 5 4.0666 6.38 × 10 3 2.9648 5.36 × 10 6 4.4381
1689 6.56 × 10 2 −0.6109 4.57 × 10 6 3.4179 1.50 × 10 3 3.5755 1.04 × 10 6 4.0541
3067 2.11 × 10 2 3.9374 2.16 × 10 6 2.6081 6.26 × 10 4 3.0295 3.11 × 10 7 4.1828
4748 5.36 × 10 2 −4.1741 1.24 × 10 6 2.4923 5.71 × 10 4 0.4075 1.35 × 10 7 3.7388
Table 10. RMSE errors of LMAPS using polynomials vs. LHMAPS using polynomial basis functions of degree k = 2 , 3 , 4 and MQ with m = 5 on unstructured nodes.
Table 10. RMSE errors of LMAPS using polynomials vs. LHMAPS using polynomial basis functions of degree k = 2 , 3 , 4 and MQ with m = 5 on unstructured nodes.
NLMAPS
k = 2 k = 3 k = 4
E RMSE Rate E RMSE Rate E RMSE Rate
196 7.40 × 10 3 - 2.40 × 10 3 - 7.44 × 10 4 -
780 1.32 × 10 3 2.4917 8.76 × 10 4 1.4555 2.05 × 10 4 1.8617
1728 4.83 × 10 4 2.4702 3.15 × 10 4 2.5270 3.18 × 10 5 4.5960
3048 9.52 × 10 4 −2.3576 1.23 × 10 4 3.2633 4.86 × 10 6 6.5248
LHMAPS
N k = 2 k = 3 k = 4
E R M S E rate E R M S E rate E R M S E rate
196 5.85 × 10 3 - 2.36 × 10 3 - 1.98 × 10 3 -
780 4.37 × 10 4 3.7423 5.58 × 10 4 2.0831 3.29 × 10 4 2.5888
1728 3.97 × 10 4 0.2354 1.93 × 10 4 2.6222 4.19 × 10 3 −6.2773
3048 2.25 × 10 4 1.9851 1.96 × 10 4 −0.0661 8.50 × 10 5 13.5511
Table 11. RMSE errors of LMAPS and LHMAPS using PS2 with n = 9 , m = 4 and PS3 with n = 13 , m = 4 on unstructured nodes.
Table 11. RMSE errors of LMAPS and LHMAPS using PS2 with n = 9 , m = 4 and PS3 with n = 13 , m = 4 on unstructured nodes.
NLMAPSLHMAPS
PS2 ( n = 9 ) PS3 ( n = 13 ) PS2 ( n = 9 , m = 4 ) PS3 ( n = 13 , m = 4 )
E RMSE Rate E RMSE Rate E RMSE Rate E RMSE Rate
196 3.61 × 10 1 - 2.63 × 10 4 - 5.72 × 10 2 - 1.40 × 10 4 -
780 2.34 × 10 1 0.6271 4.55 × 10 5 2.5281 1.22 × 10 1 −1.0903 1.11 × 10 5 3.6592
1728 6.98 × 10 2 2.9835 1.47 × 10 5 2.7922 2.12 × 10 2 4.3100 3.54 × 10 6 2.8095
3048 4.55 × 10 1 −6.5149 8.45 × 10 6 1.9188 4.23 × 10 2 −2.3979 1.64 × 10 6 2.6695
4733 4.74 × 10 2 10.1364 5.29 × 10 6 2.0998 1.86 × 10 1 −6.6386 8.84 × 10 7 2.7727
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Acheampong, K.; Yu, Z.; Zhu, H. Localized Hermite Method of Approximate Particular Solutions for Solving the Helmholtz Equation. Mathematics 2026, 14, 2109. https://doi.org/10.3390/math14122109

AMA Style

Acheampong K, Yu Z, Zhu H. Localized Hermite Method of Approximate Particular Solutions for Solving the Helmholtz Equation. Mathematics. 2026; 14(12):2109. https://doi.org/10.3390/math14122109

Chicago/Turabian Style

Acheampong, Kwesi, Zhiyun Yu, and Huiqing Zhu. 2026. "Localized Hermite Method of Approximate Particular Solutions for Solving the Helmholtz Equation" Mathematics 14, no. 12: 2109. https://doi.org/10.3390/math14122109

APA Style

Acheampong, K., Yu, Z., & Zhu, H. (2026). Localized Hermite Method of Approximate Particular Solutions for Solving the Helmholtz Equation. Mathematics, 14(12), 2109. https://doi.org/10.3390/math14122109

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop