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:
where
is a nonzero real constant, and
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 . For simplicity, we use to denote 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
with non-negative integers
and
satisfying
and
(see [
14,
15,
16]).
A particular solution of
for the general second-order linear partial differential operator
with constant coefficients
and
, which is denoted by
, satisfies
It has been proven in [
14] that
can be expressed as follows:
In particular, a specific solution of the polynomial basis function
for the differential operator
has the following expression [
25]:
In numerical experiments, we use (
2) to compute the particular solution for both differential operators
, which is used in the localized numerical schemes of LMAPS and LHMAPS.
For the PS radial basis function
of positive integer order
, let
denote a particular solution of
, where
r stands for the Euclidean norm
for any
. The particular solutions associated with PS radial basis functions of orders
for the differential operator
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 be a generic point in . Let be the the set of collocation points in , where and denote the set of interior points in and the set of boundary collocation points on , respectively. For simplicity, we also let with .
For an interior collocation point , a neighborhood is determined by a fixed number of nearest collocation points. We assume that contains n collocation points , containing and its nearest neighbors. Without loss of generality, we set . Moreover, we choose for the Hermite interpolation. For instance, if contains structured 2D rectangular nodes, a popular nine-point stencil centered at contains and its nearest eight neighbors, four of which are also used for Hermite interpolation.
2.3. LMAPS Using PS Radial Basis Functions
For each
, the LMAPS using PS radial basis functions seeks a local approximation
to
u in
as follows:
where
(
) and
(
) are real constants,
denotes all monomials of degree no more than
k with
. The initial LMAPS method proposed in [
11] did not incorporate auxiliary polynomials
. 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
, then
and
.
Define coefficient vectors and . 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
where
In addition to (
4), we impose
ℓ auxiliary constraints
to yield a symmetric local weight matrix in the following linear system
If we denote the above coefficient matrix on the right-hand side by
, the coefficients are expressed as
Furthermore, we denote by
Combining (
3) and (
5) yields
By setting
in (
6), we obtain the expression of
in terms of values of
u on
in
. We then denote the local weights in the above expression by the vector
and express the local numerical scheme for approximating the differential Equation (
1) as
Each local weight vector associated with is assembled into a row of the global coefficient matrix according to the global indices of nodes in . Solving the resulting global linear system yields approximations to for all .
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
, which contains
basis functions. Without loss of generality, we set the number of nodes in each local neighborhood
to be
.
We approximate the solution
in
by
where
(
) are real constants, and
are particular solutions of polynomial basis functions
, which represent an arrangement of all monomials in the form of
with
.
A linear system for determining
can be formed by selecting
in (
7)
where
Solving (
8) for
and submitting it into the expression of
via (
7) yield
By setting
in (
9), we obtain the expression of
in terms of values of
u on
. The local weights can be calculated from (
9), as
and
are known.
The coefficient matrix of the global linear system consists of all weights in (
9) associated with
, arranged according to the global indices of the nodes in
. Solving the resultant linear system yields the approximation to
for all
.
3. LHMAPS Using PS Radial Basis Functions
The Hermite interpolation is carried out on an additional subset , consisting of a collection of nodes , . For structured Cartesian nodes, a standard nine-point stencil centered at an interior node includes 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
to
u in
involving Hermite interpolation terms and auxiliary polynomials of degree no more than
k:
where
(
),
(
), and
(
) are real constants with
. Define coefficient vectors
,
, and
. The first two vectors contain the local weights associated with the function values of
u and
.
We set
in (
10), which leads to the following linear system
where
Second, we require that the approximation (
10) interpolates the second-order differentiation
, which equals
f, at
where
Next, to make a symmetric local weight matrix, we impose
ℓ auxiliary constrains
combining (
11)–(
13) yields the following linear system:
If we denote the above coefficient matrix on the right-hand side of (
14) by
, the coefficients can be expressed as
Furthermore, we denote
and substitute (
15) into (
10)
The expression of
in terms of values of
u on
and values of
f on
in the neighborhood
of node
depends on the local weights calculated from (
16) as
,
, and
are known.
We then assemble the global linear system with all weights in (
16) associated with
, ordered according to the global indices of the nodes in
. The resulting coefficient matrix is sparse, with
n nonzero entries in each row and each column. The terms involving
in (
16) are transferred to the same side as
f and
g. Solving the resulting global linear system then produces approximations to
for all
.
4. LHMAPS Using Polynomial Basis Functions
To define the local scheme of LHMAPS using polynomial basis functions, we approximate the solution
in
by
where
(
) and
(
) are real constants with
;
are particular solutions of polynomial basis functions
, which represent an arrangement of all monomials in the form of
with
;
in the second summation represents a radial basis function.
Without loss of generality, we set
and
. Define
and
. Then, a linear system for determining
and
can be formed by selecting
in (
17)
where
In addition, we also require that the approximation (
17) interpolates
, which equals
f, at
:
where
Combining (
18) and (
19) leads to the following linear system:
We denote the above coefficient matrix on the right-hand side by
so that the coefficients can be expressed as
From (
19) and (
21), we get
By setting
in (
22), we obtain the expression of
in terms of values of
u on
and values of
f on
in the neighborhood
of node
. The local weights can be calculated from (
22) since
,
, and
are known.
The global system matrix is formed by collecting the weights in (
22) corresponding to
and placing them according to the global indexing of the nodes in
. The contributions involving
in (
22) are shifted to the same side as
f and
g. Solving the resulting system yields approximations to
at all interior nodes
.
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
and the exact solution
defined as follows:
Example 1. We consider problem (1) with , , and . The analytical solution is chosen to be . Figure 1 shows examples of Cartesian nodes and unstructured notes. We also set the total number of Cartesian nodes N to be , 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
, respectively, and compare their RMSEs in
Table 2. In LHMAPS, we use the MQ radial basis functions centered at
nearest nodes to the local center. It can be seen that LMAPS using structured stencils fails to produce a solution when
, since the matrices for computing local weights become singular. Therefore, we only list the RMSEs of LMAPS for
. However, when the Hermite interpolation is added in the local numerical scheme, the errors of LHMAPS using polynomial basis functions with
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
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
. Therefore, we present errors of LHMAPS using polynomial basis functions and PS radial basis functions of order
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
on unstructured nodes, as reported in
Table 5, which confirms the better accuracy of LHMAPS. Here, we use unstructured node sets with
, where
, matching the corresponding Cartesian cases.
Example 2. We consider problem (1) with and in the flower domain. The analytical solution is given by . This domain Ω
is defined to be the interior region of the closed curve with . Figure 3 shows examples of Cartesian nodes and unstructured notes distributed inside the flower domain. The boundary points are selected by partitioning
into
equal parts and by setting
and
with
for any
.
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
, 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
when
and
. From this comparison,
is selected for Hermite interpolation when
,
, with different
N used to generate
Table 8.
Secondly, we present the LMAPS results using PS radial basis functions of order
with
and of order
with
in
Table 9. These results are compared with those of LHMAPS augmented by multiquadric (MQ) radial basis functions using
and
, 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
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
nodes to LMAPS does not show significant improvement on unstructured nodes when
, 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
,
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.