High-Order Finite Difference Method for Helmholtz Equation in Polar Coordinates

Abstract

We present a fourth-order finite difference scheme for the Helmholtz equation in polar coordinates. We employ the finite difference format in the interior of the region and derive a nine-point fourth-order scheme. Specially, ghost points outside the region are applied to obtain the approximation for the Neumann boundary condition. We obtain the matrix form of the linear system and the sparsity of the coefficient matrix is favorable for the computation of the Helmholtz equation. The feasibility and accuracy of the method are validated by two test examples which have exact solutions.

Share and Cite:

Zhu, N. and Zhao, M. (2019) High-Order Finite Difference Method for Helmholtz Equation in Polar Coordinates. American Journal of Computational Mathematics, 9, 174-186. doi: 10.4236/ajcm.2019.93013.

1. Introduction

Helmholtz equation has attracted much attention in many fields such as electromagnetic cavity scattering problems [1] , wave propagation [2] and acoustic problems [3] . Many methods have been proposed to solve the Helmholtz equation in general Cartesian coordinates, such as finite difference method [4] , finite element method [5] and other methods [6] . This equation is important for both theory and applications. Its theoretical significance has a variable coefficient under the first derivative, which renders the existing fourth-order compact finite difference methods inapplicably. From the standpoint of applications, the Helmholtz equation in polar coordinates appears in many scattering problems.

In general Cartesian coordinates, high-order methods for solving the Helmholtz equation have been well developed since the accuracy is related to the amount of the grid points with the wave number increases. Manohar et al. [7] proposed second- and sixth-order finite difference schemes for solving the Helmholtz equation which requires the derivatives and much computational cost. Nabavi et al. [8] further developed a compact nine-point sixth-order finite difference scheme and obtained a sixth-order approximation for the Neumann boundary condition. Sutmann [9] developed a new compact sixth-order finite difference scheme of sixth-order for three-dimensional Helmholtz equations.

In polar coordinates, the symmetric problem can be described more concisely. A finite difference method was proposed to solve the parabolic equation in polar coordinates in [10] . Britt et al. [11] constructed a high-order compact difference scheme for the Helmholtz equation. Su et al. [12] proposed a fourth-order method for solving Helmholtz equation with discontinuous wave number and Dirichlet boundary condition. A novel compact scheme based on finite difference discretizations and geometric grid has been developed to solve two-dimensional mildly non-linear elliptic equations in polar co-ordinate constituting singular terms [13] .

The existed works didn’t discuss the Neumann boundary condition and the sparsity of the coefficient matrix. In this paper, we develop a fourth-order scheme for the Helmholtz equation in polar coordinates with Dirichlet and Neumann boundary conditions. The sparse matrix form of the linear system is derived. With the help of the sparsity of the coefficient matrix of the linear system, the computational cost is remarkably reduced. Moreover, we give the approximation for the Neumann boundary condition. The feasibility and the order of method are verified by the Helmholtz equation with Dirichlet and Neumann boundary condition.

The paper is outlined as follows. In Section 2, a fourth-order finite difference scheme and the sparse matrix form for the Helmholtz equation in polar coordinates are derived. In Section 3, the approximation for the boundary condition is obtained. Two numerical experiments of the high-order algorithm are presented in Section 4. The paper is concluded in Section 5.

2. Fourth-Order Finite Difference Scheme

2.1. Fourth-Order Approximation

We consider the following two-dimensional Helmholtz equation in polar coordinates

1 r r ( r u r ) + 1 r 2 2 u θ 2 + k 2 u = f , ( r , θ ) D , (1)

where k is the wave number, D is a given region and f is a known function. For convenience, we rewrite the above equation as

1 r r ( r u r ) = f r = f k 2 u 1 r 2 2 u θ 2 , (2)

1 r 2 2 u θ 2 = f θ = f k 2 u 1 r r ( r u r ) . (3)

Define a uniform mesh on the region D = ( r a , r b ) × ( θ c , θ d ) . r i = r a + ( i 1 ) h r , i = 0 , 1 , , M + 1 , θ j = θ c + ( j 1 ) h θ , j = 0 , 1 , , N + 1 . u ( r i , θ j ) denotes the fourth-order solution of u at point ( r i , θ j ) .

First, we employ a fourth-order approximation on the left side of Equation (2) and obtain

1 r r ( r u r ) | i , j = 1 r i 1 h r ( r i + 1 2 u i + 1 , j u i , j h r r i 1 2 u i , j u i 1 , j h r ) h r 2 12 ( 2 f r r 2 + 1 r f r r + 1 r 2 f r 2 r 3 u r ) | i , j + O ( h r 4 ) , (4)

where

f r r = f r k 2 u r r ( 1 r 2 2 u θ 2 ) ,

2 f r r 2 = 2 f r 2 k 2 2 u r 2 2 r 2 ( 1 r 2 2 u θ 2 ) .

Then approximating the derivatives of u with the second-order accuracy by central differences, we have

f r | i , j = f i , j k 2 u i , j 1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 + O ( h r 2 ) , f r r | i , j = f r | i , j k 2 u i + 1 , j u i 1 , j 2 h r 1 2 h r ( 1 r i + 1 2 u i + 1 , j + 1 2 u i + 1 , j + u i + 1 , j 1 h θ 2 1 r i 1 2 u i 1 , j + 1 2 u i 1 , j + u i 1 , j 1 h θ 2 ) + O ( h r 2 ) , 2 f r r 2 | i , j = 2 f r 2 | i , j k 2 u i + 1 , j 2 u i , j + u i 1 , j h r 2 1 h r 2 ( 1 r i + 1 2 u i + 1 , j + 1 2 u i + 1 , j + u i + 1 , j 1 h θ 2 2 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 + 1 r i 1 2 u i 1 , j + 1 2 u i 1 , j + u i 1 , j 1 h θ 2 ) + O ( h r 2 ) . (5)

By substituting Equation (5) into Equation (4), we can obtain a nine-point stencil approximation for 1 r r ( r u r ) | i , j .

We now turn to the fourth-order approximation for the left side of Equation (3). Applying a standard central difference operator to the left item of Equation (3), we have

1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 = f θ | i , j , (6)

and the error

1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 = 1 r 2 u θ 2 + 1 r h θ 2 12 4 u θ 4 + O ( h θ 4 ) . (7)

Differentiating both sides of (3) with respect to θ and combing (7), we have

1 r 2 2 u θ 2 | i , j = 1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ h θ 2 12 2 f θ θ 2 | i , j + O ( h θ 4 ) . (8)

Similarly, all derivatives of f θ with respect to θ can be approximated as follows

f θ | i , j = 2 f θ 2 | i , j k 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 1 r i 1 h θ 2 h r 2 { r i + 1 2 ( u i + 1 , j + 1 u i , j + 1 ) r i 1 2 ( u i , j + 1 u i 1 , j + 1 ) 2 [ r i + 1 2 ( u i + 1 , j u i , j ) r i 1 2 ( u i , j u i 1 , j 1 ) ] + r i + 1 2 ( u i + 1 , j 1 u i , j 1 ) r i 1 2 ( u i , j 1 u i 1 , j 1 ) } + O ( h θ 2 ) . (9)

By substituting Equation (9) into Equation (8), the fourth-order finite difference scheme for 2 u θ 2 is obtained.

Therefore, combing Equation (4) and Equation (8), we have the overall fourth-order finite difference form for the Helmholtz equation in polar coordinates

1 r r ( r u r ) + 2 u θ 2 + k 2 u = 1 r i 1 h r ( r i + 1 2 u i + 1 , j u i , j h r r i 1 2 u i , j u i 1 , j h r ) + 1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 h r 2 12 ( 2 f r r 2 + 1 r f r r + 1 r 2 f r 2 r 3 u r ) | i , j h θ 2 12 2 f θ θ 2 | i , j + k 2 u i , j = f i , j (10)

Replacing the derivatives of f r and f θ by Equations (5) and (9), we can derive

1 r i 1 h r ( r i + 1 2 u i + 1 , j u i , j h r r i 1 2 u i , j u i 1 , j h r ) + 1 r i 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 h r 2 12 [ 2 f r 2 | i , j k 2 u i + 1 , j 2 u i , j + u i 1 , j h r 2 ] + 1 12 h θ 2 [ 1 r i + 1 2 ( u i + 1 , j + 1 2 u i + 1 , j + u i + 1 , j 1 ) 2 r i 2 ( u i , j + 1 2 u i , j + u i , j 1 ) + 1 r i 1 2 ( u i 1 , j + 1 2 u i 1 , j + u i 1 , j 1 ) ]

h r 2 12 r i [ f r | i , j k 2 u i + 1 , j u i 1 , j 2 h r 1 2 h r h θ 2 ( 1 r i + 1 2 ( u i + 1 , j + 1 2 u i + 1 , j + u i + 1 , j 1 ) 1 r i 1 2 ( u i 1 , j + 1 2 u i 1 , j + u i 1 , j 1 ) ) ] h r 2 12 r i 2 ( f i , j k 2 u i , j 1 r i 2 h θ 2 ( u i , j + 1 2 u i , j + u i , j 1 ) ) + h r 12 r i 3 ( u i + 1 , j u i 1 , j ) h θ 2 12 ( 2 f θ 2 | i , j k 2 u i , j + 1 2 u i , j + u i , j 1 h θ 2 )

+ 1 12 h r 2 r i [ r i + 1 2 ( u i + 1 , j + 1 u i , j + 1 ) r i 1 2 ( u i , j + 1 u i 1 , j + 1 ) 2 ( r i + 1 2 ( u i + 1 , j u i , j ) r i 1 2 ( u i , j u i 1 , j ) ) + r i + 1 2 ( u i + 1 , j 1 u i , j 1 ) r i 1 2 ( u i , j 1 u i 1 , j 1 ) ] + k 2 u i , j = f i , j . (11)

For simplicity, we rewrite the above Equation (11) in the following form

l 1 u i 1 , j 1 + l 2 u i 1 , j + l 3 u i 1 , j + 1 + l 4 u i , j 1 + l 5 u i , j + l 6 u i , j + 1 + l 7 u i + 1 , j 1 + l 8 u i + 1 , j + l 9 u j + 1 , j + 1 = b i , j , (12)

where

l 1 = l 3 = 1 12 h θ 2 r i 1 2 h r 24 h θ 2 r i 1 2 1 r i + r i 1 2 12 h r 2 1 r i , l 2 = 5 r i 1 2 6 h r 2 r i + k 2 12 1 6 h θ 2 r i 1 2 + ( h r 12 h θ 2 r i 1 2 h r k 2 r i ) 1 12 h r 12 r i 3 , l 4 = l 6 = 5 6 r i 2 h θ 2 + h r 2 12 r i 4 h θ 2 r i + 1 2 + r i 1 2 12 h r 2 r i + k 2 12 , l 5 = 5 3 h θ 2 r i 2 5 ( r i + 1 2 + r i 1 2 ) 6 h r 2 r i + 2 k 2 3 ( h r 2 6 r i 2 h θ 2 h r 2 k 2 r i 2 ) 1 r i 2 ,

l 7 = l 9 = 1 12 h θ 2 r i + 1 2 + h r 24 h θ 2 r i + 1 2 1 r i + r i + 1 2 12 h r 2 1 r i , l 8 = 5 r i + 1 2 6 h r 2 r i + k 2 12 1 6 h θ 2 r i + 1 2 ( h r 12 h θ 2 r i + 1 2 h r k 2 12 ) 1 r i + h r 12 r i 3 , b i , l = f i , l + h r 2 12 r i 2 f i , l + h r 2 12 r i f r + h r 2 12 2 f r 2 + h θ 2 12 2 f θ 2 .

2.2. The Sparse Matrix Form of the Scheme

The relationship between the nine points can be illustrated in three parts in matrix form A X , A Y , A D , which represent the horizontal, vertical, diagonal relationships respectively,

( A X + A Y + A D ) U = F , (13)

where

U = ( u 1 , 1 , u 1 , 2 , , u 1 , N , u 2 , 1 , u 2 , 2 , , u 2 , N , , u M , 1 , u M , 2 , , u M , N ) T , A X = A x I N , A Y = diag { A Y ( 1 ) , A Y ( 2 ) , , A Y ( M ) } , A Y ( i ) = tridiag { l 6 ( i ) , l 5 ( i ) 4 , l 4 ( i ) } , A D = A D 1 I D 1 + A D 2 I D 2 + A D 3 I N , A x = ( l 5 ( 1 ) 4 l 8 ( 1 ) l 2 ( 2 ) l 5 ( 2 ) 4 l 8 ( 2 ) l 2 ( M ) l 5 ( M ) 4 ) , A D 1 = ( 0 l 7 ( 1 ) l 1 ( 2 ) 0 l 7 ( 2 ) l 1 ( M 1 ) 0 l 7 ( M 1 ) l 1 ( M ) 0 ) ,

I r 1 = ( 0 1 0 1 0 1 0 ) , A D 2 = ( 0 l 9 ( 1 ) l 3 ( 2 ) 0 l 9 ( 2 ) l 3 ( M 1 ) 0 l 9 ( M 1 ) l 3 ( M ) 0 ) , I r 2 = ( 0 1 0 1 0 1 0 ) , A D 3 = ( l 5 ( 1 ) 2 l 5 ( 2 ) 2 l 5 ( M ) 2 )

and denotes the Kronecker product, I N is the N × N identity matrix. F is the right side item containing b i , j and the boundary conditions which will be discussed in the following section.

3. Boundary Condition

Implementation of Dirichlet boundary conditions at r = r a , r b , θ = θ c , θ d is straightforward. And the right side item of Equation (13) can be written as

F = f ˜ + U B l + U B r + U B b + U B t , (14)

where

f ˜ = ( b 11 , b 12 , , b 1 N , b 21 , b 22 , , b 2 N , , b M 1 , b M 2 , , b M N ) T , U B l = ( B 1 u 0 , : , 0 , 0 , , 0 , 0 , 0 , , 0 , 0 , 0 , , 0 ) T , u 0 , : = ( u 0 , 0 , u 0 , 1 , , u 0 , N + 2 ) T , U B r = ( B 2 u M + 1 , : , 0 , 0 , , 0 , 0 , 0 , 0 , 0 , 0 , , 0 ) T , u M , : = ( u M , 0 , u M , 1 , , u M , N + 2 ) T , U B b = B 3 u : , 0 a N , U B b = B 4 u : , N + 1 b N , u : , 0 = ( u 1 , 0 , u 2 , 0 , , u M , 0 ) T , u : , N + 1 = ( u 1 , N + 1 , u 2 , N + 1 , , u M , N + 1 ) T ,

B 1 = ( l 3 ( 1 ) l 2 ( 1 ) l 1 ( 1 ) l 3 ( 1 ) l 2 ( 1 ) l 1 ( 1 ) l 3 ( 1 ) l 2 ( 1 ) l 1 ( 1 ) ) , B 2 = ( l 9 ( M ) l 8 ( M ) l 7 ( M ) l 9 ( M ) l 8 ( M ) l 7 ( M ) l 9 ( M ) l 8 ( M ) l 7 ( M ) ) , B 3 = B 4 = ( l 4 ( 1 ) l 7 ( 1 ) l 1 ( 2 ) l 4 ( 2 ) l 7 ( 2 ) l 1 ( M 1 ) l 4 ( M 1 ) l 7 ( M 1 ) l 4 ( M ) l 7 ( M ) ) , a N = ( 1 0 0 ) , b N = ( 0 0 1 ) ,

and a N , b N are vectors in N × 1 dimensions.

Implementation of the Dirichlet boundary conditions at r = r a , r b , θ = θ c , θ d is more complicated. We consider the following Neumann boundary condition and it can be extended to the general cases

u θ | θ = θ t o p = α u + g ( r , θ ) , (15)

where α is a constant, g ( r , θ ) is a given function.

The ghost points are utilized to derive the difference scheme on the boundary can be written as

u θ | i , N + 1 = u i , N + 2 u i , N 2 h θ + O ( h 2 ) . (16)

Therefore, the Neumann boundary condition can be approximated as

α u i , N + 1 + g ( r i , θ N + 1 ) = u i , N + 2 u i , N 2 h θ , i = 1 , 2 , , M . (17)

We can obtain

u : , N + 2 u : , N = 2 h θ g : , N + 1 + 2 h θ α u : , N + 1 , (18)

where

u : , N = ( u 1 , N , u 2 , N , , u M , N ) T , u : , N + 1 = ( u 1 , N + 1 , u 2 , N + 1 , , u M , N + 1 ) T , u : , N + 2 = ( u 1 , N + 2 , u 2 , N + 2 , , u M , N + 2 ) T , g : , N + 1 = ( g 1 , N + 1 , g 2 , N + 1 , , g M , N + 1 ) T . (19)

Substituting j for N + 1 in Equation (12) gives

A u : , N + 2 + B u : N + 1 + A u : , N = b : , N + 1 , (20)

where

A = ( l 4 ( 1 ) l 7 ( 1 ) l 1 ( 2 ) l 4 ( 2 ) l 7 ( 2 ) l 1 ( M 1 ) l 4 ( M 1 ) l 7 ( M 1 ) l 4 ( M ) l 7 ( M ) ) , B = ( l 5 ( 1 ) l 8 ( 1 ) l 2 ( 2 ) l 5 ( 2 ) l 8 ( 2 ) l 2 ( M 1 ) l 5 ( M 1 ) l 8 ( M 1 ) l 5 ( M ) l 8 ( M ) ) , b : , N + 1 = ( b 1 , N + 1 , b 2 , N + 1 , , b M , N + 1 ) T .

Combining Equations (18) and (20), we can eliminate u : , N + 2 and obtain

2 A u : , N + ( 2 h θ α A + B ) u : , N + 1 = b : , N + 1 2 h θ A g : , N + 1 . (21)

Therefore, collaborating Equations (13) and (21), the global system can be written as follows

( A 11 A 12 A 21 A 22 ) ( U u : , N + 1 ) = ( b 1 b 2 ) , (22)

where

A 11 = A X + A Y + A D , A 12 = B 4 , A 21 = 2 A a N , A 22 = 2 h θ α A + B , b 1 = f ˜ + U B l + U B r + U B b , b 2 = b : , N + 1 2 h θ A g : , N + 1 .

We can observe the sparsity of the global system of the Helmholtz equation with the Neumann boundary condition in Figure 1.

4. Numerical Experiments

4.1. Example 1

We first consider the problem with Dirichlet boundary condition in polar coordinates as follows

1 r r ( r u r ) + 1 r 2 2 u θ 2 + k 2 u = 0 , ( r , θ ) [ 1 , 2 ] × [ 0 , 2 π ] u | r = 1 = sin ( θ ) , u | r = 2 = 2 sin ( θ ) , u | θ = 0 = u | θ = 2 π = 0. (23)

and the exact solution is u ( r , θ ) = r cos ( θ ) .

As we can see from Figure 2 and Figure 3, the numerical solution derived by the proposed method is highly consistent with the exact solution. Moreover, we depict the numerical solution in Cartesian coordinates in the right side of Figure 3. Furthermore, in order to test the computational order of the proposed method, we give the error between the numerical solution and the exact solution with different grid points and k in Table 1 and Table 2. The order is calculated by the following equation

order = log ( error ( M 1 ) error ( M 2 ) ) / log ( M 2 M 1 ) .

It can be clearly seen from Table 1 and Table 2 that the finite difference scheme can reach the fourth-order when the wavenumber k is relatively small. As the mesh is refined and the number of grid points increases, the error becomes smaller and the accuracy tends to be fourth-order and gradually stabilized. When the wavenumber k increases, the error becomes oscillatory. Table 3

Figure 1. The sparsity of the global system with Neumann boundary condition.

Figure 2. The numerical solution (left) and the exact solution with k = 1 and M = N = 64 .

Figure 3. The error inside the region (left) and the numerical solution in Cartesian coordinates (right) with k = 1 and M = N = 64 .

Table 1. The errors and order of the proposed method with k = 1 and k = 5 .

Table 2. The errors and order of the proposed method with k = 10 and k = 20 .

Table 3. Computational time (s) for solving the Helmholtz equation with k = 10 .

gives the comparison of the computational time(s) for solving the Helmholtz equation in polar coordinates, where Method I and Method II denote methods with and without the utilization of the sparsity of the coefficient matrix of the linear system. It can be observed that with the help of the sparsity of the coefficient matrix of the linear system, the computational cost is remarkably reduced.

4.2. Example 2

This example is a Helmholtz equation in polar coordinates with Neumann boundary condition

1 r r ( r u r ) + 1 r 2 2 u θ 2 + k 2 u = 0 , ( r , θ ) [ 1 , 2 ] × [ 0 , 2 π ] u θ = r cos ( θ ) , θ = 2 π , u | r = 1 = sin ( θ ) , u | r = 2 = 2 sin ( θ ) , u | θ = 0 = 0 , (24)

and the exact solution is u = r sin ( θ ) . As we can see from Figures 4-6 that the

Figure 4. The numerical solution (left) and the exact solution with k = 5 and M = N = 128 .

Figure 5. The error inside the region (left) and the error on the top boundary (right) with k = 5 and M = N = 128 .

Figure 6. The numerical solution in Cartesian coordinates.

numerical solution is well agreed with the exact solution with k = 5 and M = N = 128 .

5. Conclusion

In this paper, we propose a high-order fast algorithm for solving the two-dimensional Helmholtz equation with Dirichlet and Neumann boundary conditions in polar coordinates. We develop a fourth-order accurate compact finite difference approximation to the Helmholtz equation. The sparse matrix form for the Helmholtz equation in polar coordinates is obtained which improves the efficiency for the computation process. Two numerical experiments have demonstrated the validity of the fourth-order algorithm.

Acknowledgements

This research was supported by the Fundamental Research Funds for the Central Universities (No. 2018MS129).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Zhao, M.L. (2013) A Fast High Order Iterative Solver for the Electromagnetic Scattering by Open Cavities Filled with Inhomogeneous Media. Advances in Applied Mathematics and Mechanics, 5, 235-257. https://doi.org/10.4208/aamm.12-m12119
[2] Zhao, C. and Liu, T. (2003) Nonlinear Artificial Boundaries for Transient Scalar Wave Propagation in a Two-Dimensional Infinite Homogeneous Layer. International Journal for Numerical Methods in Engineering, 58, 1435-1456. https://doi.org/10.1002/nme.703
[3] Colton, D. and Kress, R. (1998) Inverse Acoustic and Electromagnetic Scattering Theory. Springer, Berlin. https://doi.org/10.1007/978-3-662-03537-5
[4] Singer, I. and Turkel, E. (1998) High-Order Finite Difference Methods for the Helmholtz Equation. Computer Methods in Applied Mechanics and Engineering, 163, 343-358. https://doi.org/10.1016/S0045-7825(98)00023-1
[5] Harari, I. and Hughes, T. (1991) Finite Element Methods for the Helmholtz Equation in an Exterior Domain: Model Problems. Computer Methods in Applied Mechanics and Engineering, 87, 59-96. https://doi.org/10.1016/0045-7825(91)90146-W
[6] Kashirin, A., Smagin, S. and Taltykina, M. (2016) Osaic-Skeleton Method as Applied to the Numerical Solution of Three-Dimensional Dirichlet Problems for the Helmholtz Equation in Integral Form. Computational Mathematics and Mathematical Physics, 56, 612-625.
https://doi.org/10.1134/S0965542516040096
[7] Manohar, R. and Tephenson, J. (1983) Single Cell High Order Difference Methods for Helmholtz Equation. Journal of Computational Physics, 51, 444-453.
https://doi.org/10.1016/0021-9991(83)90163-8
[8] Nabavi, M., Siddiqui, M. and Dargahi, J. (2007) A New 9-Point Sixth-Order Accurate Compact Finite Difference Method for the Helmholtz Equation. Journal of Sound and Vibration, 37, 972-982. https://doi.org/10.1016/j.jsv.2007.06.070
[9] Sutmann, G. (2007) Compact Finite Difference Schemes of Sixth-Order for the Helmholtz Equation. Journal of Computational and Applied Mathematics, 203, 15-31.
https://doi.org/10.1016/j.cam.2006.03.008
[10] Zhang, R.S., Lu, G.Z. and Abomakhleb, G. (2017) Finite-Difference Solution of the Parabolic Equation under Horizontal Polar Coordinates. IEEE Antennas and Wireless Propagation Letters, 16, 2931-2934. https://doi.org/10.1109/LAWP.2017.2753220
[11] Britt, S., Tsynkov, S. and Turkel, E. (2001) Numerical Simulation of Time-Harmonic Waves in Inhomogeneous Media Using a Compact High Order Schemes. Communications in Computational Physics, 9, 520-541. https://doi.org/10.4208/cicp.091209.080410s
[12] Su, X.L., Feng, X.F. and Li, Z.L. (2016) Fourth-Order Compact Schemes for Helmholtz Equation with Piecewise Wave Numbers in the Polar Coordinates. Journal of Computational Mathematics, 34, 499-510. https://doi.org/10.4208/jcm.1604-m2015-0290
[13] Jha, N., Monhanty, R.K. and Kumar, N. (2017) Compact-FDM for Midly Nonlinear Two-Space Dimensional Elliptic BVPs in Polar Coordinate System and Its Convergence Theory. Journal of Computational and Applied Mathematics, 3, 255-270.
https://doi.org/10.1007/s40819-015-0104-0

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.