
Constructing permutation polynomials is a hot topic in the area of finite fields, and permutation polynomials have many applications in different areas. Recently, several classes of permutation trinomials were constructed. In 2015, Hou surveyed the achievements of permutation polynomials and novel methods. But, very few were known at that time. Recently, many permutation binomials and trinomials have been constructed. Here we survey the significant contribution made to the construction of permutation trinomials over finite fields in recent years. Emphasis is placed on significant results and novel methods. The covered material is split into three aspects: the existence of permutation trinomials of the respective forms xrh(xs), λ1xa+λ2xb+λ3xc and x+xs(qm−1)+1+xt(qm−1)+1, with Niho-type exponents s,t.
Citation: Varsha Jarali, Prasanna Poojary, G. R. Vadiraja Bhatta. A recent survey of permutation trinomials over finite fields[J]. AIMS Mathematics, 2023, 8(12): 29182-29220. doi: 10.3934/math.20231495
[1] | Hansaem Oh, Gwanghyun Jo . Physics-informed neural network for the heat equation under imperfect contact conditions and its error analysis. AIMS Mathematics, 2025, 10(4): 7920-7940. doi: 10.3934/math.2025364 |
[2] | Pengfei Zhu, Kai Liu . Numerical investigation of convergence in the L∞ norm for modified SGFEM applied to elliptic interface problems. AIMS Mathematics, 2024, 9(11): 31252-31273. doi: 10.3934/math.20241507 |
[3] | Hyun Geun Lee, Youngjin Hwang, Yunjae Nam, Sangkwon Kim, Junseok Kim . Benchmark problems for physics-informed neural networks: The Allen–Cahn equation. AIMS Mathematics, 2025, 10(3): 7319-7338. doi: 10.3934/math.2025335 |
[4] | Yu Xu, Youjun Deng, Dong Wei . Numerical solution of forward and inverse problems of heat conduction in multi-layered media. AIMS Mathematics, 2025, 10(3): 6144-6167. doi: 10.3934/math.2025280 |
[5] | Ruitao Liu, Wanshan Li . A new ADI-IIM scheme for solving two-dimensional wave equation with discontinuous coefficients. AIMS Mathematics, 2024, 9(11): 31180-31197. doi: 10.3934/math.20241503 |
[6] | Ahmed G. Salem, Turki D. Alharbi, Abdulaziz H. Alharbi, Anwar Ali Aldhafeeri . Impact of a spherical interface on a concentrical spherical droplet. AIMS Mathematics, 2024, 9(10): 28400-28420. doi: 10.3934/math.20241378 |
[7] | Dario Bambusi, Simone Paleari . A couple of BO equations as a normal form for the interface problem. AIMS Mathematics, 2024, 9(8): 23012-23026. doi: 10.3934/math.20241118 |
[8] | Min Wu, Jiali Zhou, Chaoyue Guan, Jing Niu . A numerical method using Legendre polynomials for solving two-point interface problems. AIMS Mathematics, 2025, 10(4): 7891-7905. doi: 10.3934/math.2025362 |
[9] | Xin Zhao, Xin Liu, Jian Li . Convergence analysis and error estimate of finite element method of a nonlinear fluid-structure interaction problem. AIMS Mathematics, 2020, 5(5): 5240-5260. doi: 10.3934/math.2020337 |
[10] | Maxime Krier, Julia Orlik . Solvability of a fluid-structure interaction problem with semigroup theory. AIMS Mathematics, 2023, 8(12): 29490-29516. doi: 10.3934/math.20231510 |
Constructing permutation polynomials is a hot topic in the area of finite fields, and permutation polynomials have many applications in different areas. Recently, several classes of permutation trinomials were constructed. In 2015, Hou surveyed the achievements of permutation polynomials and novel methods. But, very few were known at that time. Recently, many permutation binomials and trinomials have been constructed. Here we survey the significant contribution made to the construction of permutation trinomials over finite fields in recent years. Emphasis is placed on significant results and novel methods. The covered material is split into three aspects: the existence of permutation trinomials of the respective forms xrh(xs), λ1xa+λ2xb+λ3xc and x+xs(qm−1)+1+xt(qm−1)+1, with Niho-type exponents s,t.
A class of problems that give rise of singular behavior are elliptic interface problems with imperfect contact [1], and it is featured by the implicit jump condition imposed on the imperfect contact interface, and the jumping quantity of the unknown is related to the flux across the interface. The elliptic interface problems with imperfect contact have been applied to model the Stefan problem of the solidification process and crystal growth, composite materials, multi-phase flows [2,3] and the problem of temperature discontinuity between the gas and cooling solid surface [4]. More examples include the heat conduction between materials of the different heat capacities and conductivities and interface diffusion processes [5,6], the temperature discontinuity between a gas and cooling solid surface [4], the conjugate heat transfer problem in thermodynamic processes between materials that are thermally coupled through non-adiabatic contacts [7], etc.
We consider the one-dimensional (1D) elliptic interface problem with imperfect contact
{−(β(x)ux)x+c(x)u=f(x),x∈(0,α)∪(α,1),u(0)=u0,u(1)=u1, | (1.1) |
together with the following implicit jump conditions across the interface α
{[u]=u+−u−=λβ+∇u+⋅→n,[β∂u∂→n]=0, | (1.2) |
where 0<α<1, →n is a unit normal to the interface pointing from Ω− to Ω+. g± denotes the right and left limits of the function g at the point α, and [g]=g+−g−. Without loss of generality, we assume that Ω is computational domain, and the interface α separates Ω into two sub-domains Ω− and Ω+.
The solution of the elliptic interface problems is often discontinuous due to discontinuous coefficients or singular sources across the interface. To recover the numerical accuracy near the interface, a variety of methods have been developed via enforcing the jump conditions (1.2) and (1.1) into numerical discretization such that accurate and robust numerical algorithms can be designed. Finite difference methods (FDMs) constitute a commonly used approach for elliptic interface problems. Since the publication of the original immersed interface method (IIM) [8], they have been applied to various problems, such as the Stokes flow with elastic boundaries or surface tension [9], incompressible flow based on the Navier-Stokes equations with singular source terms [10], and nonlinear problems in magneto-rheological fluids [11]. Many further developments and analysis in various aspects of the FDM for elliptic interface problems were carried out to improve the accuracy, stability or efficiency [12,13,14,15,16,17,18,19]. Many other elegant methods have been proposed in the past decade, including the ghost fluid method [20,21], finite volume method [7,22,23,24], the matched interface and boundary (MIB) method [25,26,27], etc. Finite element methods (FEMs) constitute another common practice to resolve the elliptic interface problems. With the help of body-fitted unstructured meshes, FEMs [28,29,30] have been developed for handling elliptic interfaces and irregular geometries. For interfaces with complex topologies, the construction of high quality body-fitted meshes could be difficult and time-consuming. This motivates the development of immersed FEMs based on non-body-fitted structured meshes [31,32,33,34,35,36,37,38], etc. Nevertheless, most interface schemes in the literatures are designed to be of second-order accuracy.
The strategy for generating higher-order difference schemes can be roughly divided into two categories. (1) The first category is expanding the stencil and including more points in the schemes [15,16,25,26,27,39,40,41,42]. Advantages of this approaches is achieving high-order accuracy and using lower order jump conditions only. The obvious disadvantages of such approach is creating large matrix bandwidths and complicating the numerical treatment near the boundaries. Gibou and Fedkiw [16] introduced an O(h4) accurate finite difference discretization for the Laplace and heat equations on an irregular domain. Previous scholars [25,26,27] presented high-order MIB methods for solving elliptic equations with discontinuous coefficients and singular sources on Cartesian grids. This type of method is based on the use of fictitious points to achieve high-order accuracy. Zhong [40] presented a high-order IIM with general jump conditions by employing fictitious points to achieve high-order accuracy and using lower-order jump conditions only. Similar to the MIB approach, a wide stencil with more points are involved at irregular points. Feng and Zhao [42] introduced a new Cartesian grid FDM based on the fourth-order accurate MIB method. Colnago et al. [15] presented a high-order IIM for solving Poisson equations with discontinuous coefficients on Cartesian grids, it combines the FDM and ghost node strategy and requires only the ordinary jumps of the function. (2) The second category involves using the differential equation and the interface relations as additional identities [13,39,41]. The advantage of this approach is that the scheme is compact and minimal stencil is used. The disadvantage is that to maintain high-order accuracy, it requires the knowledge of jump conditions of high-order derivatives. Li and Ito [13] constructed a fourth-order IIM by computing high-order jump conditions involving mixed derivatives. Linnick and Fasel [39] presented a high-order IIM for simulating unsteady incompressible flow in an irregular domain. Instead of using analytical jump conditions, they compute the jump conditions for higher derivatives numerically. Angelova and Vulkov [41] presented high-order compact FDM for elliptic equations with intersecting interfaces by using the differential equation and the jump (interface) relations as additional identities, which can be differentiated to eliminate higher-order local truncation errors. For FEMs, the higher-order convergence crucially depends on how well the interface is resolved by the triangular mesh. In practice, subparametric, isoparametric or superparametric elements are usually employed to secure the optimal order of p+1 in the L2 norm for a polynomial order of p, for both continuous [33,43] and discontinuous Galerkin [34,35,44,45,46] FEMs. It is worth pointing out that most of the numerical methods in literatures are aimed at the elliptical interface problem with homogeneous jump conditions ([u]=0,[βu→n]=0) or nonhomogeneous jump conditions where the jumps of the temperature as well as the conductive heat flux along the interface are known explicitly (say [u]=g1, [β∂u/∂→n]=g2, with known g1 and g2). When the elliptic interface problem has an implicit jump condition as in (1.2), there are comparatively few numerical methods for solving such problems.
In this paper, we consider the 1D elliptic interface problems with imperfect contact, where the implicit jump condition is a setting for the interface and the jump of the primary variable is proportional to the normal flux across the interface. A class of high-order FDMs is constructed for the 1D elliptic interface for both the body-fitted and non-body-fitted mesh. For each case, the second-, third- and fourth-order approximations of the implicit jump condition are provided by using the original variables on both sides of the interface and a set of jump conditions and its high order derivatives. Numerical examples are presented to verify the performance of the scheme. The numerical results show that the presented schemes can reach the theoretical accuracy for solving the elliptic interface problems with imperfect contact.
The rest of this paper is organized as follows. In Section 2, we formulate the scheme for 1D elliptic equations with imperfect interfaces. Section 3 constructs the approximation of the normal derivative for the interface. Section 4 computes the primary variables u+ and u− for the interface. Numerical examples are provided in Section 5 to demonstrate the accuracy and stability of the presented scheme. A concluding remark is given in Section 6.
We assume that β(x) in (1.1) is a piecewise smooth function with a jump at the interface α, and that β(x) has upper and lower boundries:
0<βmin≤β(x)≤βmax, | (2.1) |
where βmin and βmax are two constants. The source term f(x) is piecewise smooth.
Introduce a uniform grid xi=ih,i=0,1,⋯,n with h=1n. The fourth-order compact difference scheme is constructed and three-point computational stencil for each point is adopted. For node i, the three points in computational stencil are {xi−1,xi,xi+1}. Without loss of generality, assume the interface α is located in a grid interval, xk≤α≤xk+1. Because of the interface is located in the stencil, the points k and k+1 are named as irregular points, and i≠k,k+1 are name as regular points.
At a regular point i, i.e., i≠k,k+1, for convenience, we briefly give the construction process of the fourth order compact difference scheme, for more detailed information one can refer to Ref.[47].
−βδ2xui−βxδxui+ciui+τ=fi, | (2.2) |
where
δ2xui=ui+1−2ui+ui−1h2,δxui=ui+1−ui−12h, |
and
τ=βxh23!∂3u∂x3|i+βh212∂4ux4|i+O(h4). |
Dropping the term τ in (2.2), it is the standard second-order central difference scheme. In order to get fourth-order scheme, we have to handle the high-order derivative terms ∂3u∂x3 and ∂4u∂x4. According to the governing equation (1.1), there is
uxx=1β(−βxux+cu−f). | (2.3) |
Taking the first and second derivatives to (2.3) respectively, we have
uxxx=ϕ1uxx+ϕ2ux+ϕ3u+ϕ4f+ϕ5fx, | (2.4) |
and
uxxxx=ψ1uxx+ψ2ux+ψ3u+ψ4, | (2.5) |
where
ϕ1=−βxβ,ϕ2=β2xβ2−βxxβ+cβ,ϕ3=−cβxβ2,ϕ4=βxβ2,ϕ5=−1β,ψ1=ϕ21+ϕ1,x+ϕ2,ψ2=ϕ1ϕ2+ϕ2,x+ϕ3,ψ3=ϕ1ϕ3+ϕ3,x,ψ4=(ϕ1ϕ4+ϕ4,x)f+(ϕ1ϕ5+ϕ4+ϕ5,x)fx+ϕ5fxx,ϕ1,x=β2x−ββxxβ2,ϕ2,x=2βxβββxx−β2β2−ββxxx−βxβxxβ2−cβxβ2,ϕ3,x=c(2β2x−ββxx)β3,ϕ4,x=ββxx−2β2xβ3,ϕ5,x=βxβ2. |
Substituting (2.4) and (2.5) into (2.2) and approximating the first- and second-derivatives with the central difference, we can get the fourth-order compact scheme:
Aiui+1+Biui+Ciui−1=Fi+O(h4), | (2.6) |
where
Ai=−β+ϕ1βxh26+ψ1βh212h2+−βx+ϕ2βxh26+ψ2βh2122h,Bi=2−β+ϕ1βxh26+ψ1βh212h2+(c+ϕ3βxh26+ψ3βh212),Ci=−β+ϕ1βxh26+ψ1βh212h2−−βx+ϕ2βxh26+ψ2βh2122h,Fi=fi−βxh26(ϕ4fi+ϕ5fx,i)−βh212ψ4. |
When the interface is in contact with one of the mesh nodes, it is referred to as the body-fitted case. Without loss of generality, we assume that the interface is located the mesh node k, as shown in Figure 1.
In this case, the irregular nodes are k−1 and k+1, and the compact stencil of these two irregular nodes are shown in Figure {2}. Then, the high order compact scheme at these two irregular nodes can be given as
ˉAk−1uk−2+ˉBk−1uk−1+ˉCk−1u−=ˉFk−1, | (2.7) |
and
ˉAk+1u++ˉBk+1uk+1+ˉCk+1uk+2=ˉFk+1. | (2.8) |
Apparently, there are two auxiliary qualities u− and u+ in the schemes. To apply the above scheme, it is necessary to approximate the u− and u+ with adequate accuracy. We prepare to use the interface jump connecting conditions and establish the linear systems with u+ and u− as variables. The difficulty lies in the high-order discretization of the first-order derivatives u+x and u−x on both sides of the interface.
{[u]=λβ+u+x,[βu→n]=0. | (2.9) |
Expand the uk+1 and uk−1 at the interface α by using the Taylor series, it reads
uk+1=u++h∂u∂x|++h22!∂2u∂x2|++h33!∂3u∂x3|++h44!∂4u∂x4|++h55!∂5u∂x5|++O(h6), | (2.10) |
and
uk−1=u−−h∂u∂x|−+h22!∂2u∂x2|−−h33!∂3u∂x3|−+h44!∂4u∂x4|−−h55!∂5u∂x5|−+O(h6). | (2.11) |
Rewritting the above two formulas, we can get the representations of ∂u∂x|+ and ∂u∂x|− as follows
∂u∂x|+=uk+1−u+h−h2!∂2u∂x2|+−h23!∂3u∂x3|+−h34!∂4u∂x4|+−h45!∂5u∂x5|++O(h5), | (2.12) |
∂u∂x|−=u−−uk−1h+h2!∂2u∂x2|−−h23!∂3u∂x3|−+h34!∂4u∂x4|−−h45!∂5u∂x5|−+O(h5). | (2.13) |
According to the governing equation, we have
u+xx=1β+(−β+xu+x+c+u+−f+),u−xx=1β−(−β−xu−x+c−u−−f−). | (2.14) |
Keeping the first two terms on the right-hand side of (2.12) and substituting (2.14) into (2.12), the second-order accurate approximate scheme of ∂u∂x|+ can be given as
∂u∂x|+=ρr,1u++ρr,2uk+1+ρr,3+O(h2), | (2.15) |
where
ρr,1=−(1h+h2c+β+)/Dr,ρr,2=1h/Dr,ρr,3=h2f+β+/Dr,Dr=(1−h2β+xβ+). |
To obtain the higher-order approximate of ∂u∂x|+, it is necessary to handle the third- and fourth-order derivatives in (2.12). From (2.4) and (2.5), the expressions of u+xxx and u+xxxx can be given as
u+xxx=Φ+1u+x+Φ+2u++Φ+3, | (2.16) |
and
u+xxxx=Ψ+1u+x+Ψ+2u++Ψ+3, | (2.17) |
where
Φ+1=−β+xβ+ϕ+1+ϕ+2,Φ+2=c+β+ϕ+1+ϕ+3,Φ+3=(−c+β+ϕ+1+ϕ+4)f++ϕ+5f+x,Ψ+1=−β+xβ+ψ+1+ψ+2,Ψ+2=c+β+ψ+1+ψ+3,Ψ+3=f+β+ψ+1+ψ+4. |
Keeping the first three terms on the right-hand side of (2.12), we establish the third-order accurate approximate of ∂u∂x|+ as follows:
∂u∂x|+=ˉρr,1u++ˉρr,2uk+1+ˉρr,3+O(h3), | (2.18) |
where
ˉρr,1=−(1h+h2c+β++h26Φ+2)/ˉDr,ˉρr,2=1h/ˉDr,ˉρr,3=(h2f+β+−h26Φ+3)/ˉDr,ˉDr=1−h2β+xβ++h26Φ+1. |
Further, the fourth-order approximate of ∂u∂x|+ can be given as
∂u∂x|+=ˉˉρr,1u++ˉˉρr,2uk+1+ˉˉρr,3+O(h4), | (2.19) |
where
ˉˉρr,1=−(1h+h2c+β++h26Φ+2+h324Ψ+2)/ˉˉDr,ˉˉρr,2=1h/ˉˉDr,ˉˉρr,3=(h2f+β++h26Φ+3+h324Ψ+3)/ˉˉDr,ˉˉDr=1−h2β+xβ+−h26Φ+1+h324Ψ+1. |
Similarly, the second-, third- and fourth-order approximation of ∂u∂x|− can be given as
∂u∂x|−=ρl,1u−+ρl,2uk−1+ρl,3+O(h2), | (2.20) |
∂u∂x|−=ˉρl,1u−+ˉρl,2uk−1+ˉρl,3+O(h3), | (2.21) |
∂u∂x|−=ˉˉρl,1u−+ˉˉρl,2uk−1+ˉˉρl,3+O(h4), | (2.22) |
where
ρl,1=(1h+h2c−β−)/Dl,ρl,2=−1h/Dl,ρl,3=−h2f−β−/Dl,Dl=1+h2β−xβ−,ˉρl,1=(1h+h2c−β−−h26Φ−2)/ˉDl,ˉρl,2=−1h/ˉDl,ˉρl,3=(−h2f−β−−h26Φ−3)/ˉDl,ˉDl=1+h2β−xβ−+h26Φ−1,ˉˉρl,1=(1h+h2c−β−−h26Φ−2+h324Ψ−2)/ˉˉDl,ˉˉρl,2=−1h/ˉˉDl,ˉˉρl,3=(−h2f−β−+h26Φ−3+h324Ψ−3)/ˉˉDl,ˉˉDl=1+h2β−xβ−−h26Φ−1+h324Ψ−1. |
When the interface is located within one of the computational mesh, it appears as shown in Figure 3. The irregular nodes are k and k+1, and the construction of the higher order scheme is more complicated. Owing to the interface arbitrarily cutting through the computational mesh, the computational mesh of these irregular nodes is nonuniform, as shown in Figure 4.
We assume the function u(x) is smooth enough, expand the u(xi+1),u(xi−1) at point xi by Taylor series
ui+1=ui+hf∂u∂x|i+h2f2!∂2u∂x2|i+h3f3!∂3u∂x3|i+h4f4!∂4u∂x4|i+h5f5!∂5u∂x5|i+O(h6f), | (2.23) |
and
ui−1=ui−hb∂u∂x|i+h2b2!∂2u∂x2|i−h3b3!∂3u∂x3|i+h4b4!∂4u∂x4|i−h5b5!∂5u∂x5|i+O(h6b). | (2.24) |
From (2.23) and (2.24), we can obtain
∂2u∂x2|i=2hbui+1+hfui−1−(hf+hb)uihfhb(hf+hb)−hf−hb3∂3u∂x3|i−112h3f+h3bhf+hb∂4u∂x4|i−160(h2f+h2b)(hf+hb)∂5u∂x5|i+O(h5f+h5bhf+hb), | (2.25) |
and
∂u∂x|i=h2bui+1−h2fui−1+(h2f−h2b)uih2bhf+h2fhb−hfhb6∂3u∂x3|i−hfhb(hf−hb)24∂4u∂x4|i+O((h3f+h3b)hfhbhf+hb). | (2.26) |
Define the difference operators
δxui=h2bui+1−h2fui−1+(h2f−h2b)uih2bhf+h2fhb, | (2.27) |
δ2xui=2hbui+1+hfui−1−(hf+hb)uihfhb(hf+hb). | (2.28) |
Equations (2.25) and (2.26) can be rewritten as
∂2u∂x2|i=δ2xui−hf−hb3∂3u∂x3|i−112h3f+h3bhf+hb∂4u∂x4|i−160(h2f+h2b)(hf+hb)∂5u∂x5|i+O(h5f+h5bhf+hb), | (2.29) |
and
∂u∂x|i=δxui−hfhb6∂3u∂x3|i−hfhb(hf−hb)24∂4u∂x4|i+O((h3f+h3b)hfhbhf+hb). | (2.30) |
Substituting Eqs (2.29) and (2.30) into the governing equation (1.1), we can get the difference scheme for the elliptic interface equation
−βδ2xui−βxδxui+kiui+τ=fi, | (2.31) |
where
τ=Q1∂3u∂x3|i+Q2∂4u∂x4|i+Q3∂5u∂x5|i+O(h4), | (2.32) |
and
Q1=βhf−hb3−βxhfhb6,Q2=β112h3f+h3bhf+hb−βxhfhb(hf−hb)24,Q3=β160(h2f+h2b)(hf+hb). |
To obtain the higher-order accuracy discrete scheme, it is necessary to handle the third- and fourth-order derivatives of the term τ. Substituting (2.4) and (2.5) into (2.31) and rearranging it, we have
Aiδ2xui+Bδxui+Ciui=Fi+O((h2f+h2b)(hf+hb)), | (2.33) |
where
Ai=−β+Q1ϕ1+Q2ψ1,Bi=−βx+Q1ϕ2+Q2ψ2,Ci=ci+Q1ϕ3+Q2ψ3,Fi=fi−Q1(ϕ4fi+ϕ5fx,i)−Q2ψ4. |
For the irregular points k and k+1, we use the interface α as one of the points in the compact stencil as shown in Figure 5. Thus, the 3-point compact stencil for nodes k and k+1 are k−1,k,α− and α+,k+1,k+2, respectively. From the above analysis, the difference operators for the first- and second-order derivatives for nodes k and k+1 are respectively as follows
δxuk=h2bu−−h2fuk−1+(h2f−h2b)ukh2bhf+h2fhb,δ2xuk=2hbu−+hfuk−1−(hf+hb)ukhfhb(hf+hb), | (2.34) |
and
δxuk+1=h2buk+2−h2fu++(h2f−h2b)uk+1h2bhf+h2fhb,δ2xuk+1=2hbuk+2+hfu+−(hf+hb)uk+1hfhb(hf+hb). | (2.35) |
Substituting (2.34) and (2.35) into (2.33), we can get the higher-order compact scheme for the irregular point k:
ˉAkuk−1+ˉBkuk+ˉCku−=ˉFk+O((h2f+h2b)(hf+hb)), | (2.36) |
where
ˉAk=2hb(hf+hb)Ak−h2fh2bhf+h2fhbBk,ˉBk=−2hfhbAk+h2f−h2bh2bhf+h2fhbBk+Ck,ˉCk=2hf(hf+hb)Ak+h2bh2bhf+h2fhbBk,ˉFk=Fk. |
Similarly, the higher-order compact scheme for the irregular point k+1 is as follows:
ˉAk+1u++ˉBk+1uk+1+ˉCk+1uk+2=ˉFk+1+O((h2f+h2b)(hf+hb)), | (2.37) |
where
ˉAk+1=2hb(hf+hb)Ak+1−h2fh2bhf+h2fhbBk+1,ˉBk+1=−2hfhbAk+1+h2f−h2bh2bhf+h2fhbBk+1+Ck+1,ˉCk+1=2hf(hf+hb)Ak+1+h2bh2bhf+h2fhbBk+1,ˉFk+1=Fk+1. |
From the above analysis, we have constructed the higher-order compact scheme at regular points and irregular points. It should be noted that there are two auxiliary unknown quantities u+ and u− in the scheme for the irregular points k and k+1. Therefore, we have to find a way to deal with the interface connection conditions, so as to obtain a high-precision approximation for the auxiliary unknowns u+ and u− on both sides of the interface.
The first order derivative on both sides of the interface, ∂u∂x|+ and ∂u∂x|−, can respectively be given as
∂u∂x|+=uk+1−u+hr1−hr12!∂2u∂x2|+−h2r13!∂3u∂x3|+−h3r14!∂4u∂x4|+−h4r15!∂5u∂x5|++O(h5r), | (3.1) |
and
∂u∂x|−=u−−ukhl1+hl12!∂2u∂x2|−−h2l13!∂3u∂x3|−+h3l14!∂4u∂x4|−−h4l15!∂5u∂x5|−+O(h5l), | (3.2) |
where hl1=α−xk, hr1=xk+1−α, hl2=hl1+h and hr2=hr1+h, as shown in Figure 6.
Further, the second-order derivative on both sides of the interface, ∂2u∂x2|+ and ∂2u∂x2|−, can respectively be given as
∂2u∂x2|+=−2hr1hr2h(hr2uk+1−hr1uk+2−hu+)−hr1+hr23∂3u∂x3|+−h2r1+hr1hr2+h2r212∂4u∂x4|++O(h3r1+h2r2hr1+h2r1hr2+h3r2), | (3.3) |
and
∂2u∂x2|−=−2hl1hl2h(hl2uk−hl1uk−1−hu−)+hl1+hl23∂3u∂x3|−−h2l1+hl1hl2+h2l212∂4u∂x4|−+O(h3l1+h2l2hl1+h2l1hl2+h3l2). | (3.4) |
Substituting (3.3) and (3.4) into (3.1) and (3.2) respectively, we can get
∂u∂x|+={−(1hr1+1hr2)u++(1hr1+1h)uk+1−hr1hr2huk+2}+hr1hr23!∂3u∂x3|++h2r1hr2+h2r2hr14!∂4u∂x4|++O(h3r1+h2r2hr1+h2r1hr2+h3r2), | (3.5) |
and
∂u∂x|−={(1hl1+1hl2)u−−(1hl1+1h)uk+hl1hl2huk−1}+hl1hl23!∂3u∂x3|+−h2l1hl2+h2l2hl14!∂4u∂x4|++O(h3l1+h2l2hl1+h2l1hl2+h3l2). | (3.6) |
Keep the first term in (3.6) and (3.5) and discard the other terms. We can get the approximation of the first order derivative on both sides of the interface with second-order accuracy:
u−x=ρl,1u−+ρl,2uk+ρl,3uk−1+O(h2), | (3.7) |
and
u+x=ρr,1u++ρr,2uk+1+ρr,3uk+2+O(h2), | (3.8) |
where
ρl,1=1hl1+1hl2,ρl,2=−(1hl1+1h),ρl,3=hl1hhl2,ρr,1=−(1hr1+1hr2),ρr,2=1hr1+1h,ρr,3=−hr1hhr2. |
Keeping the first two terms in (3.6) and (3.5) and discarding the other terms, and according to the (2.16), we can get the approximation of the first derivative with third order accuracy
u−x=ˉρl,1u−+ˉρl,2uk+ˉρl,3uk−1+ˉρl,4+O(h3), | (3.9) |
and
u+x=ˉρr,1u++ˉρr,2uk+1+ˉρr,3uk+2+ˉρr,4+O(h3), | (3.10) |
where
ˉρl,1=(ρ1,1+hl1hl26Φ−2)/ˉDl,ˉρl,2=ρ1,2/ˉDl,ˉρl,3=ρ1,3/ˉDl,ˉρl,4=hl1hl26Φ−3/ˉDl,ˉDl=1−hl1hl26Φ−1,ˉρr,1=(ρr,1+hr1hr26Φ+2)/ˉDr,ˉρr,2=ρr,2/ˉDr,ˉρr,3=ρr,3/ˉDr,ˉρl,4=hr1hr26Φ+3/ˉDr,ˉDr=1−hr1hr26Φ+1. |
Following the same manner as in the above subsection, we can get the approximation of the first derivative with fourth-order accuracy
u−x=ˉˉρl,1u−+ˉˉρl,2uk+ˉˉρl,3uk−1+ˉˉρl,4+O(h4), | (3.11) |
and
u+x=ˉˉρr,1u++ˉˉρr,2uk+1+ˉˉρr,3uk+2+ˉˉρr,4+O(h4), | (3.12) |
where
ˉˉρl,1=(ρl,1+hl1hl26Φ−2+h2l2hl1+h2l1hl224Ψ−2)/ˉˉDl,ˉˉρl,2=ρl,2/ˉˉDl,ˉˉρl,3=ρl,3/ˉˉDl,ˉˉρl,4=(hl1hl26Φ−3+h2l2hl1+h2l1hl224Ψ−3)/ˉˉDl,ˉˉρr,1=(ρr,1−hl1hl26Φ−1−h2l2hl1+h2l1hl224Ψ−1)/ˉˉDr,ˉˉρr,2=ρr,2/ˉˉDr,ˉˉρr,3=ρr,3/ˉˉDr,ˉˉρr,4=(hr1hr26Φ+3−h2r2hr1+h2r1hr224Ψ+3)/ˉˉDr,ˉˉDl=1−hl1hl26Φ−1−h2r2hr1+h2r1hr224Ψ+1,ˉˉDr=1−hr1hr26Φ+1−h2r2hr1+h2r1hr224Ψ+1. |
The implicit connecting condition on the interface is given as
{[u]=λβ−u−x,β+u+x=β−u−x. | (4.1) |
For the interface fitted mesh, the approximation of the first-order derivative on both sides of the interface can respectively be written as
∂u∂x|−=ρl,1u−+ρl,2uk−1+ρl,3+O(hml), | (4.2) |
∂u∂x|+=ρr,1u++ρr,2uk+1+ρr,3+O(hmr). | (4.3) |
Discarding the terms O(hml) and O(hmr) in (4.2) and (4.3), and substituting them into (4.1), the discrete format of the implicit connecting condition on the interface can be given as
{u+−u−=λβ−(ρl,1u−+ρl,2uk−1+ρl,3),β+(ρr,1u++ρr,2uk+1+ρr,3)=β−(ρl,1u−+ρl,2uk−1+ρl,3). |
For brevity, rearrange the above equation and establish linear equations with u+ and u− as variables as follows:
{a11u+−a12u−=b1,a21u++a22u−=b2, |
where
a11=1,a12=1+λβ−ρl,1,a21=β+ρr,1,a22=−β−ρl,1.b1=λβ−(ρl,2uk−1+ρl,3),b2=β−(ρl,2uk−1+ρl,3)−β+(ρr,2uk+1+ρr,3). |
Solving the above linear system, we can get the approximate of each of the unknowns u+ and u− on both sides of the interface with m-th order accuracy:
u+=τ+1uk−1+τ+2uk+1+τ+3, | (4.4) |
u−=τ−1uk−1+τ−2uk+1+τ−3, | (4.5) |
where
τ+1=(a22λ+a12)β−ρl,2a11a22+a12a21,τ+2=−a12β+ρr,2a11a22+a12a21,τ+3=(a22λ+a12)β−ρl,3−a12β+ρr,3a11a22+a12a21,τ−1=(a11−a21λ)β−ρl,2a11a22+a12a21,τ−2=−a11β+ρr,2a11a22+a12a21,τ−3=(a11−a21λ)β−ρl,3−a11β+ρr,3a11a22+a12a21. |
For the interface-cut mesh, the approximation of the first-order derivative on both sides of the interface can be written as
∂u∂x|−=ρl,1u−+ρl,2uk+ρl,3uk−1+ρl,4+O(hml), | (4.6) |
∂u∂x|+=ρr,1u++ρr,2uk+1+ρr,3uk+2+ρr,4+O(hmr). | (4.7) |
In a similar manner as above, the approximate of each of the unknowns u+ and u− on both sides of the interface with m-th-order accuracy is given as
u+=τ+1uk−1+τ+2uk+τ+3uk+1+τ+4uk+2+τ+5, | (4.8) |
u−=τ−1uk−1+τ−2uk+τ−3uk+1+τ−4uk+2+τ−5, | (4.9) |
where
τ+1=(a22λ+a12)β−ρl,3a11a22+a12a21,τ+2=(a22λ+a12)β−ρl,2a11a22+a12a21,τ+3=−a12β+ρr,2a11a22+a12a21,τ+4=−a12β+ρr,3a11a22+a12a21,τ+5=a22λβ−ρl,4+a12(β−ρl,4−β+ρr,4)a11a22+a12a21,τ−1=(a11−a21λ)β−ρl,3a11a22+a12a21,τ−2=(a11−a21λ)β−ρl,2a11a22+a12a21,τ−3=−a11β+ρr,2a11a22+a12a21,τ−4=−a11β+ρr,3a11a22+a12a21,τ−5=a11(β−ρl,4−β+ρr,4)−a21λβ−ρl,4a11a22+a12a21. |
and
a11=1,a12=1+λβ−ρl,1,a21=β+ρr,1,a22=−β−ρl,1.b1=λβ−(ρl,2uk+ρl,3uk−1+ρl,4),b2=β−(ρl,2uk+ρl,3uk−1+ρl,4)−β+(ρr,2uk+1+ρr,3uk+2+ρr,4). |
From the above sections, we establish the fourth-order compact finite-difference scheme for non-irregular mesh nodes:
Aiui−1+Biui+Ciui+1=Fi, | (5.1) |
for
i≠{{k−1,k+1},forbody−fittedmesh,{k,k+1},fornon−body−fittedmesh. |
In the interface-fitted mesh case, the higher-order compact schemes at the irregular mesh nodes k−1 and k+1 are given as (2.7) and (2.8), respectively. Eliminating the auxiliary qualities u+ and u− by substituting the formulas (4.4) and (4.5) into (2.7) and (2.8). The schemes for the irregular mesh nodes are given as
Ak−1uk−2+Bk−1uk−1+Ck−1uk+1=Fk−1, | (5.2) |
and
Ak+1uk−1+Bk+1uk+1+Ck+1uk+2=Fk+1, | (5.3) |
where
Ak−1=ˉAk−1,Bk−1=ˉBk−1+ˉCk−1τ−1,Ck−1=ˉCk−1τ−2,Ak+1=ˉAk+1τ+1,Bk+1=ˉBk+1+ˉAk+1τ+2,Ck+1=ˉCk+1,Fk−1=ˉFk−1−ˉCk−1τ−3,Fk+1=ˉFk+1−ˉAk+1τ+3. |
Similarly, in the non-body-fitted case, the higher-order compact schemes at the irregular mesh nodes k and k+1 are respectively given as (2.36) and (2.37). Substitute the formulas (4.8) and (4.9) into (2.36) and (2.37) to eliminate the auxiliary qualities u+ and u−. The higher-order compact schemes at the irregular mesh nodes k and k+1 are respectively given as
Akuk−1+Bkuk+Ckuk+1+Dkuk+2=Fk, | (5.4) |
and
Ak+1uk−1+Bk+1uk+Ck+1uk+1+Dk+1uk+2=Fk+1, | (5.5) |
where
Ak=ˉAk+ˉCτ−1,Bk=ˉBk+ˉCτ−2,Ck=ˉCkτ−3,Dk=ˉCkτ−4,Ak+1=ˉAk+1τ+1,Bk+1=ˉAk+1τ+2,Ck+1=ˉBk+1+ˉAk+1τ+3,Dk+1=ˉCk+1+ˉAk+1τ+4,Fk=ˉFk−ˉCτ−5,Fk+1=ˉFk+1−ˉAk+1τ+5. |
Obviously, the resulting discrete linear equations have a tri-diagonal form for the body-fitted case and block-diagonal form for the non-body-fitted case, which can be efficiently solved by using existing numerical methods, such as the forward and backward sweep method, BiCGstab method, etc.
In this section, we use several numerical experiments to demonstrate the performance of the discrete schemes.
Example 1. Consider the computational domain Ω=[0,1], and the solution is separated into two parts by the interface at x=α, where α=0.5 and α=0.52323, for the interface-fitted mesh and interface-cut mesh cases, respectively. The analytical solution of this problem is given by
u(x,y)={ex2,x∈(0,α),κex2,x∈(α,1). |
The diffusion coefficient is defined as follows
β={κ,x∈(0,α),1,x∈(α,1). |
Conservation of the flux on the interface satisfies
[β∂u∂x]=β+∂u+∂x−β−∂u−∂x=2κxex2−2κxex2=0,atx=α. |
The coefficient λ is given as
λ=κeα2−α22καeα2. |
Tables 1 and 2 compare the L2 and L∞ errors in second-, third- and fourth-order formats on fitted and non-fitted mesh, respectively. The tables show that the numerical results of the three methods achieve theoretical accuracy on both fitted and non-fitted mesh.
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 4.8e-1 | 8.7e-1 | 2.2e-2 | 4.7e-2 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 1.2e-1 | 2.2 | 2.2e-1 | 2.1 | 2.4e-3 | 3.2 | 5.6e-3 | 3.1 | 1.4e-4 | 4.1 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 2.1 | 5.5e-2 | 2.0 | 2.8e-4 | 3.1 | 6.8e-4 | 3.0 | 8.8e-6 | 4.0 | 1.7e-5 | 4.0 | ||
81 | 6.9e-3 | 2.0 | 1.4e-2 | 2.0 | 3.4e-5 | 3.1 | 8.4e-5 | 3.0 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.7e-3 | 2.0 | 3.4e-3 | 2.0 | 4.2e-6 | 3.0 | 1.0e-5 | 3.0 | 3.3e-8 | 4.0 | 6.8e-8 | 4.0 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 8.9e-2 | 1.8e-1 | 9.8e-2 | 2.7e-1 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 6.9e-2 | 0.4 | 1.2e-1 | 0.6 | 2.4e-2 | 2.0 | 4.5e-2 | 2.6 | 1.5e-4 | 4.0 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 1.3 | 5.5e-2 | 1.1 | 3.5e-3 | 2.8 | 7.3e-3 | 2.6 | 8.8e-6 | 4.0 | 1.8e-5 | 4.0 | ||
81 | 6.8e-3 | 2.2 | 1.3e-2 | 2.0 | 4.3e-4 | 3.1 | 8.4e-4 | 3.1 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.5e-3 | 2.1 | 3.0e-3 | 2.2 | 5.5e-5 | 2.9 | 1.0e-4 | 3.0 | 3.4e-8 | 4.0 | 6.8e-8 | 5.0 |
Due to the strong discontinuity of physical quantities at the interface, it is crucial for the numerical scheme to be stable and robust. Tables 3 and 4 compare the errors of u+ and u− for different methods on fitted and non-fitted mesh, respectively. It can be seen from the tables that the physical quantities on both sides of the interface differ in magnitude by a factor of 100, but the numerical scheme proposed can capture the discontinuity of physical quantities on both sides of the interface with a high degree of accuracy.
(u−,u+) = (1.284025,128.4025) | ||||||
Mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (8.6e-4, 8.7e-1) | (2.1e-4, 2.2e-1) | (5.3e-5, 5.5e-2) | (1.3e-5, 1.4e-2) | (3.3e-6, 3.4e-3) |
e2h∞/eh∞ | - | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | |
Third | e∞ | (8.6e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
(u−,u+) = (1.284025,128.4025) | ||||||
mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (4.7e-3, 1.3e-1) | (1.6e-3, 1.1e-1) | (1.3e-3, 5.5e-2) | (2.7e-4, 1.3e-2) | (6.4e-5, 3.0e-3) |
e2h∞/eh∞ | - | (3.6, 4.2) | (3.8, 4.1) | (3.9, 4.1) | (4.2, 4.5) | |
Third | e∞ | (8.7e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
Figure 7 compares the exact and numerical solutions on fitted and non-fitted mesh for Problem 1 at k=100 with a number of intervals of 32. It is shown that the numerical solutions are well matched with the exact solutions, in spite of the fact that the amount of physical jumps on both sides of the interface are much larger. Figures 8 and 9 errors by the fourth-order, second-order and third-order scheme on fitted and non-fitted mesh, respectively. It can be seen that the errors are decrease as the number of mesh points increases.
Example 2. Consider the elliptic interface problem with a variable diffusion coefficient, and the solution is separated into two parts by the interface at x=α, where α=0.5 and α=0.53232, for the interface-fitted mesh and interface-cut mesh cases, respectively. The analytical solution of this problem is given by
u(x,y)={x2ex,x∈(0,α),κex,x∈(α,1). |
The diffusion coefficient is defined as follows
β={κ,x∈(0,α),2x+x2,x∈(α,1). |
Conservation of the flux on the interface satisfies
[β∂u∂x]=β+∂u+∂x−β−∂u−∂x=κ(2x+x2)ex−κ(2x+x2)ex=0,atx=α. |
The coefficient λ is given as
λ=κ−α2κ(2α+α2). |
Tables 5 and 6 compare the L2 and L∞ errors in second-, third- and fourth-order formats on fitted and non-fitted mesh, respectively. It can be seen that the numerical format is able to achieve theoretical accuracy on fitted mesh. The numerical accuracy on the non-fitted mesh is slightly lower than the theoretical accuracy, probably due to the unbalanced grid step on both sides of the interface, which leads to the instability of the format.
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4e-2 | 2.9e-2 | 9.9e-5 | 2.4e-4 | 3.2e-6 | 6.1e-6 | ||||||||
41 | 3.4e-3 | 2.0 | 7.3e-3 | 2.0 | 1.1e-5 | 3.1 | 2.9e-5 | 3.1 | 2.0e-7 | 4.0 | 4.0e-7 | 4.0 | ||
81 | 8.3e-4 | 2.0 | 1.8e-3 | 2.0 | 1.4e-6 | 3.1 | 3.5e-6 | 3.0 | 1.2e-8 | 4.0 | 2.5e-8 | 4.0 | ||
161 | 2.1e-4 | 2.0 | 4.6e-4 | 2.0 | 1.7e-7 | 3.0 | 4.3e-7 | 3.0 | 7.5e-10 | 4.0 | 1.5e-9 | 4.1 | ||
321 | 5.1e-5 | 2.0 | 1.1e-4 | 2.0 | 2.1e-8 | 3.0 | 5.4e-8 | 3.0 | 4.6e-11 | 4.0 | 9.2e-11 | 4.1 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 8.9e-3 | 1.5e-2 | 1.3e-3 | 5.9e-3 | 1.1e-3 | 5.2e3 | ||||||||
41 | 3.6e-3 | 1.3 | 7.6e-3 | 1.0 | 3.2e-5 | 5.3 | 7.5e-5 | 6.3 | 3.2e-5 | 5.1 | 8.8e-5 | 5.9 | ||
81 | 8.3e-4 | 2.1 | 1.8e-3 | 2.1 | 3.7e-6 | 3.1 | 1.3e-5 | 2.5 | 3.8e-6 | 3.1 | 1.5e-5 | 2.6 | ||
161 | 1.8e-4 | 2.2 | 4.0e-4 | 2.2 | 4.2e-7 | 3.1 | 3.8e-6 | 1.8 | 4.8e-7 | 3.0 | 4.0e-6 | 1.9 | ||
321 | 2.8e-5 | 2.7 | 5.2e-5 | 2.9 | 9.5e-8 | 2.2 | 1.7e-6 | 1.2 | 9.9e-8 | 2.3 | 1.7e-6 | 1.3 |
Figure 10 compares the exact and numerical solutions on fitted and non-fitted mesh for Problem 1 at k=100 with a number of intervals of 41. It is shown that the numerical solutions are well matched with the exact solutions, in spite of the fact that the amount of physical jumps on both sides of the interface are much larger. Figure 11 compares errors by the fourth-order and third-order schemes on fitted and non-fitted mesh, respectively. As seen in the table, the errors in the fourth-order scheme are significantly lower than those in the third-order scheme.
Table 7 compares the length ratio of the interface-cut mesh interval. The table shows that as the number of grids changes, the spacing ratio changes significantly and affects the accuracy of the numerical scheme.
Mesh | 21 | 41 | 81 | 161 | 321 |
hf/hb | 1.48 | 2.80 | 1.72e-2 | 1.36 | 2.30 |
Table 8 compares the condition numbers of the linear system matrix A for the fitted and non-fitted meshes. It can be seen that the condition number of the matrix does not differ much for the same grid number, so the proposed numerical scheme is stable.
Mesh | 21 | 41 | 81 | 161 | 321 |
Fitted | 2098 | 6746 | 20081 | 63749 | 147695 |
Non-fitted | 4108 | 14355 | 31339 | 107609 | 341350 |
Example 3. Consider the elliptic interface problem with a variable diffusion coefficient, and the solution is separated into two parts by the interface at x=α, where α=0.5 and α=0.53232, for the interface-fitted mesh and interface-cut mesh cases, respectively. The analytical solution of this problem is given by
u(x,y)={sinxex2,x∈(0,α),κex2,x∈(α,1). |
The diffusion coefficient is defined as follows
β={2κx,x∈(0,α),cosx+2xsinx,x∈(α,1). |
Conservation of the flux on the interface satisfies
[β∂u∂x]=β+∂u+∂x−β−∂u−∂x=2κx(2xsinx+cosx)ex2−2κx(2xsinx+cosx)ex2=0. |
The coefficient λ is given as
λ=κ−sinα2κα(cosα+2αsinα). |
Tables 9 and 10 compare the L2 and L∞ errors in second-, third- and fourth-order formats on fitted and non-fitted mesh, respectively. It is shows that the numerical format is able to achieve theoretical accuracy on fitted mesh.
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4 | 2.6 | 2.1e-2 | 5.0e-2 | 1.8e-3 | 3.4e-3 | ||||||||
41 | 3.4e-1 | 2.0 | 6.4e-1 | 2.0 | 2.4e-3 | 3.1 | 6.0e-3 | 3.1 | 1.1e-4 | 4.0 | 2.1e-4 | 4.0 | ||
81 | 8.4e-2 | 2.0 | 1.6e-1 | 2.0 | 2.9e-4 | 3.1 | 7.4e-4 | 3.0 | 6.9e-6 | 4.0 | 1.3e-5 | 4.0 | ||
161 | 2.1e-2 | 2.0 | 4.0e-2 | 2.0 | 3.5e-5 | 3.0 | 9.1e-5 | 3.0 | 4.4e-7 | 4.0 | 8.5e-7 | 4.0 | ||
321 | 5.2e-3 | 2.0 | 1.0e-2 | 2.0 | 4.3e-6 | 3.0 | 1.1e-5 | 3.0 | 2.9e-8 | 3.9 | 5.5e-8 | 3.9 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 9.9e-1 | 1.7 | 4.0e-2 | 1.4e-1 | 1.4e-2 | 6.3e-2 | ||||||||
41 | 3.4e-1 | 1.6 | 6.4e-1 | 1.4 | 8.2e-4 | 5.6 | 1.9e-3 | 6.2 | 1.1e-3 | 3.7 | 2.5e-3 | 4.6 | ||
81 | 8.1e-2 | 2.1 | 1.6e-1 | 2.0 | 5.3e-5 | 4.0 | 1.2e-4 | 4.0 | 1.1e-4 | 3.2 | 2.9e-4 | 3.1 | ||
161 | 1.9e-2 | 2.1 | 3.6e-2 | 2.1 | 1.0e-5 | 2.4 | 5.9e-5 | 1.0 | 1.1e-5 | 3.3 | 3.0e-5 | 3.3 | ||
321 | 3.6e-3 | 2.4 | 6.3e-3 | 2.5 | 1.8e-6 | 2.5 | 3.9e-5 | 0.6 | 1.2e-6 | 3.3 | 1.7e-6 | 4.1 |
Figure 12 compares the exact and numerical solutions on fitted and non-fitted mesh for Problem 1 at k=100 with a number of intervals of 41. It can be seen that the error in matching the numerical solution to the exact solution is essentially small despite the large physical jumps on both sides of the interface. Figure 13 compares errors by the fourth-order and third-order schemes on fitted and non-fitted mesh, respectively. As can be seen in the table, the numerical accuracy of the fourth-order scheme is better than that of the third-order scheme.
The 1D elliptic interface problem with imperfect contact is characterized by the fact that the jump quantity of the solution is unknown and is related to the flux across the interface. In this paper, a class of higher-order finite-difference schemes is constructed for interface fitted and non-fitted meshes, respectively. The second-, third-, and fourth-order approximations of the jump conditions are provided by using the connected jump conditions and their higher-order derivatives. Some numerical experiments were carried out to illustrate the accuracy and stability of the present method. The numerical results show that the proposed scheme is able to capture the solution of the discontinuous case of the interface body with theoretical accuracy. The theoretical accuracy has been achieved for the elliptic interface problem with implicit interface connection conditions.
This work was partly supported by the National Natural Science Foundation (12161067, 12261067, 12001015, 62201298, 51961031), the National Natural Science Foundation of China Youth Fund Project (11801287), the Inner Mongolia Autonomous Region Youth Science and Technology Talents Support Program (NJYT20B15), the Inner Mongolia Scientific Fund Project (2020MS06010, 2021LHMS01006, 2022MS01008), and Innovation Fund Project of Inner Mongolia University of Science and Technology-Excellent Youth Science Fund Project (2019YQL02).
The authors declare that the publication of this paper does coincide with any confilict of interest.
[1] |
A. Akbary, D. Ghoica, Q. Wang, On constructing permutations of finite fields, Finite Fields Appl., 17 (2011), 51–67. https://doi.org/10.1016/j.ffa.2010.10.002 doi: 10.1016/j.ffa.2010.10.002
![]() |
[2] |
T. Bai, Y. Xia, A new class of permutation trinomials constructed from Niho exponents, Cryptography Commun., 10 (2018), 1023–1036. https://doi.org/10.1007/s12095-017-0263-4 doi: 10.1007/s12095-017-0263-4
![]() |
[3] |
D. Bartoli, L. Quoos, Permutation polynomials of the type xrg(xs) over Fq2n, Design Codes Cryptography, 86 (2018), 1589–1599. https://doi.org/10.1007/s10623-017-0415-8 doi: 10.1007/s10623-017-0415-8
![]() |
[4] |
D. Bartoli, On a conjecture about a class of permutation trinomials, Finite Fields Appl., 52 (2018), 30–50. https://doi.org/10.1016/j.ffa.2018.03.003 doi: 10.1016/j.ffa.2018.03.003
![]() |
[5] |
D. Bartoli, M. Giulietti, Permutation polynomials, fractional polynomials, and algebraic curves, Finite Fields Appl., 51 (2018), 1–16. https://doi.org/10.1016/j.ffa.2018.01.001 doi: 10.1016/j.ffa.2018.01.001
![]() |
[6] |
D. Bartoli, Permutation trinomials over Fq3, Finite Fields Appl., 61 (2020), 101597. https://doi.org/10.1016/j.ffa.2019.101597 doi: 10.1016/j.ffa.2019.101597
![]() |
[7] |
D. Bartoli, M. Timpanella, On trinomials of type xn+m(1+AXm(q−1)+BXn(q−1)), n,m odd, over Fq2, q=22s+1, Finite Fields Appl., 72 (2021), 101816. https://doi.org/10.1016/j.ffa.2021.101816 doi: 10.1016/j.ffa.2021.101816
![]() |
[8] |
D. Bartoli, M. Timpanella, A family of permutation trinomials over Fq2, Finite Fields Appl., 70 (2021), 101781. https://doi.org/10.1016/j.ffa.2020.101781 doi: 10.1016/j.ffa.2020.101781
![]() |
[9] |
G. R. V. Bhatta, B. R. Shankar, A study of permutation polynomials as Latin squares, Nearrings Nearfields Related Topics, 2017 (2017), 270–281. https://doi.org/10.1142/9789813207363-0025 doi: 10.1142/9789813207363-0025
![]() |
[10] |
S. Bhattacharya, S. Sarkar, On some permutation binomials and trinomials over F2n, Designs Codes Cryptography, 82 (2017), 149–160. https://doi.org/10.1007/s10623-016-0229-0 doi: 10.1007/s10623-016-0229-0
![]() |
[11] |
X. Cao, X. Hou, J. Mi, S. Xu, More permutation polynomials with Niho exponents which permute Fq2, Finite Fields Appl., 62 (2020), 101626. https://doi.org/10.1016/j.ffa.2019.101626 doi: 10.1016/j.ffa.2019.101626
![]() |
[12] |
L. Carlitz, Permutations in a finite field, Proc. Amer. Math. Soc., 4 (1953), 538. https://doi.org/10.1090/S0002-9939-1953-0055965-8 doi: 10.1090/S0002-9939-1953-0055965-8
![]() |
[13] |
W. Cherowitzo, α-flocks and hyperovals, Geometriae Dedicata, 72 (1998), 221–245. https://doi.org/10.1023/A:1005022808718 doi: 10.1023/A:1005022808718
![]() |
[14] |
H. Deng, D. Zheng, More classes of permutation trinomials with Niho exponents, Cryptography Commun., 11 (2019), 227–236. https://doi.org/10.1007/s12095-018-0284-7 doi: 10.1007/s12095-018-0284-7
![]() |
[15] |
L. Dickson, The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group, Ann. Math., 11 (1896), 65–120. https://doi.org/10.2307/1967217 doi: 10.2307/1967217
![]() |
[16] |
C. Ding, J. Yuan, A family of skew Hadamard difference sets, J. Comb. Theory, 113 (2006), 1526–1535. https://doi.org/10.1016/j.jcta.2005.10.006 doi: 10.1016/j.jcta.2005.10.006
![]() |
[17] |
C. Ding, Cyclic codes from some monomials and trinomials, SIAM J. Discrete Math., 27 (2013), 1977–1994. https://doi.org/10.1137/120882275 doi: 10.1137/120882275
![]() |
[18] |
C. Ding, Z. Zhou, Binary cyclic codes from explicit polynomials over GF(2m), Discrete Math., 321 (2014), 76–89. https://doi.org/10.1016/j.disc.2013.12.020 doi: 10.1016/j.disc.2013.12.020
![]() |
[19] |
C. Ding, L. Qu, Q. Wang, J. Yuan, P. Yuan, Permutation trinomials over finite fields with even characteristic, SIAM J. Discrete Math., 29 (2015), 79–92. https://doi.org/10.1137/140960153 doi: 10.1137/140960153
![]() |
[20] |
Z. Ding, M. Zieve, Determination of a class of permutation quadrinomials, Proc. London Math. Soc., 127 (2023), 221–260. https://doi.org/10.1112/plms.12540 doi: 10.1112/plms.12540
![]() |
[21] | H. Dobbertin, Uniformly representable permutation polynomials, Springer, 2022. |
[22] |
N. Fernando, X. Hou, S. Lappano, A new approach to permutation polynomials over finite fields, Ⅱ, Finite Fields Appl., 22 (2013), 122–158. https://doi.org/10.1016/j.ffa.2013.01.001 doi: 10.1016/j.ffa.2013.01.001
![]() |
[23] | N. Fernando, A note on permutation binomials and trinomials over finite fields, arXiv, 2016. https://doi.org/10.48550/arXiv.1609.07162 |
[24] | W. Fulton, Algebraic curves, University of Michigan, 1989. |
[25] | H. Guo, S. Wang, H. Song, X. Zhang, J. Liu, A new method of construction of permutation trinomials with coefficients 1, arXiv, 2021. https://doi.org/10.48550/arXiv.2112.14547 |
[26] |
R. Gupta, R. Sharma, Some new classes of permutation trinomials over finite fields with even characteristic, Finite Fields Appl., 41 (2016), 89–96. https://doi.org/10.1016/j.ffa.2016.05.004 doi: 10.1016/j.ffa.2016.05.004
![]() |
[27] | C. Hermite, Sur les fonctions de sept lettres, Académie Sciences, 1863. |
[28] |
X. Hou, A class of permutation binomials over finite fields, J. Number Theory, 133 (2013), 3549–3558. https://doi.org/10.1016/j.jnt.2013.04.011 doi: 10.1016/j.jnt.2013.04.011
![]() |
[29] | X. Hou, A class of permutation trinomials over finite fields, arXiv, 2013. https://doi.org/10.48550/arXiv.1303.0568 |
[30] |
X. Hou, Determination of a type of permutation trinomials over finite fields, Acta Arith., 3 (2014), 253–278. https://doi.org/10.4064/aa166-3-3 doi: 10.4064/aa166-3-3
![]() |
[31] |
X. Hou, Determination of a type of permutation trinomials over finite fields, II, Finite Fields Appl., 35 (2015), 16–35. https://doi.org/10.1016/j.ffa.2015.03.002 doi: 10.1016/j.ffa.2015.03.002
![]() |
[32] |
X. Hou, A survey of permutation binomials and trinomials over finite fields, Contemp. Math., 632 (2015), 177–191. https://doi.org/10.1090/conm/632/12628 doi: 10.1090/conm/632/12628
![]() |
[33] |
X. Hou, Z. Tu, X. Zeng, Determination of a class of permutation trinomials in characteristic three, Finite Fields Appl., 61 (2020), 101596. https://doi.org/10.1016/j.ffa.2019.101596 doi: 10.1016/j.ffa.2019.101596
![]() |
[34] |
X. Hou, On the Tu-Zeng permutation trinomial of type (1/4,3/4), Discrete Math., 344 (2021), 112241. https://doi.org/10.1016/j.disc.2020.112241 doi: 10.1016/j.disc.2020.112241
![]() |
[35] |
V. Jarali, P. Poojary, G. R. V. Bhatta, Construction of permutation polynomials using additive and multiplicative characters, Symmetry, 14 (2022), 1539. https://doi.org/10.3390/sym14081539 doi: 10.3390/sym14081539
![]() |
[36] |
G. Khachatrian, M. Kyureghyan, Permutation polynomials and a new public-key encryption, Discrete Appl. Math., 216 (2017), 622–626. https://doi.org/10.1016/j.dam.2015.09.001 doi: 10.1016/j.dam.2015.09.001
![]() |
[37] | G. Kyureghyan, M. Zieve, Permutation polynomials of the form x+γTr(xk), arXiv, 2016. https://doi.org/10.48550/arXiv.1603.01175 |
[38] |
J. Lee, Y. Park, Some permuting trinomials over finite fields, Acta Math. Sci., 17 (1997), 250–254. https://doi.org/10.1016/S0252-9602(17)30842-1 doi: 10.1016/S0252-9602(17)30842-1
![]() |
[39] |
K. Li, L. Qu, C. Li, S. Fu, New permutation trinomials constructed from fractional polynomials, Acta Arith., 183 (2018), 101–116. https://doi.org/10.4064/aa8461-11-2017 doi: 10.4064/aa8461-11-2017
![]() |
[40] |
K. Li, L. Qu, X. Chen, New classes of permutation binomials and permutation trinomials over finite fields, Finite Fields Appl., 43 (2017), 69–85. https://doi.org/10.1016/j.ffa.2016.09.002 doi: 10.1016/j.ffa.2016.09.002
![]() |
[41] |
N. Li, On two conjectures about permutation trinomials over F32k, Finite Fields Appl., 47 (2017), 1–10. https://doi.org/10.1016/j.ffa.2017.05.003 doi: 10.1016/j.ffa.2017.05.003
![]() |
[42] |
N. Li, T. Helleseth, Several classes of permutation trinomials from Niho exponents, Cryptography Commun., 9 (2017), 693–705. https://doi.org/10.1007/s12095-016-0210-9 doi: 10.1007/s12095-016-0210-9
![]() |
[43] |
K. Li, L. Qu, X. Chen, C. Li, Permutation polynomials of the form cx+Trql/q(xa) and permutation trinomials over finite fields with even characteristic, Cryptography Commun., 10 (2018), 531–554. https://doi.org/10.1007/s12095-017-0236-7 doi: 10.1007/s12095-017-0236-7
![]() |
[44] |
L. Li, C. Li, C. Li, X. Zeng, New classes of complete permutation polynomials, Finite Fields Appl., 55 (2019), 177–201. https://doi.org/10.1016/j.ffa.2018.10.001 doi: 10.1016/j.ffa.2018.10.001
![]() |
[45] |
N. Li, T. Helleseth, New permutation trinomials from Niho exponents over finite fields with even characteristic, Cryptography Commun., 11 (2019), 129–136. https://doi.org/10.1007/s12095-018-0321-6 doi: 10.1007/s12095-018-0321-6
![]() |
[46] |
N. Li, X. Zeng, A survey on the applications of Niho exponents, Cryptography Commun., 11 (2019), 509–548. https://doi.org/10.1007/s12095-018-0305-6 doi: 10.1007/s12095-018-0305-6
![]() |
[47] | R. Lidl, H. Niederreiter, Finite fields, Cambridge University Press, 1997. https://doi.org/10.1017/CBO9781139172769 |
[48] | X. Liu, Further results on some classes of permutation polynomials over finite fields, arXiv, 2019. https://doi.org/10.48550/arXiv.1907.03386 |
[49] |
Q. Liu, Y. Sun, Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3, J. Algebra Appl., 18 (2019), 1950069. https://doi.org/10.1142/S0219498819500695 doi: 10.1142/S0219498819500695
![]() |
[50] |
Q. Liu, X. Liu, J. Zou, A class of new permutation polynomials over F2n, J. Math., 2021 (2021), 5872429. https://doi.org/10.1155/2021/5872429 doi: 10.1155/2021/5872429
![]() |
[51] |
Q. Liu, Two classes of permutation polynomials with niho exponents over finite fields with even characteristic, Turk. J. Math., 46 (2022), 919–928. https://doi.org/10.55730/1300-0098.3132 doi: 10.55730/1300-0098.3132
![]() |
[52] |
J. Ma, T. Zhang, T. Feng, G. Ge, Some new results on permutation polynomials over finite fields, Designs Codes Cryptography, 83 (2017), 425–443. https://doi.org/10.1007/s10623-016-0236-1 doi: 10.1007/s10623-016-0236-1
![]() |
[53] |
J. Ma, G. Ge, A note on permutation polynomials over finite fields, Finite Fields Appl., 48 (2017), 261–270. https://doi.org/10.1016/j.ffa.2017.08.003 doi: 10.1016/j.ffa.2017.08.003
![]() |
[54] | Y. Niho, Multi-valued cross-correlation functions between two maximal linear recursive sequences, University of Southern California, 1972. |
[55] |
T. Niu, K. Li, L. Qu, Q. Wang, Finding compositional inverses of permutations from the AGW criterion, IEEE Trans. Inf. Theory, 67 (2021), 4975–4985. https://doi.org/10.1109/TIT.2021.3089145 doi: 10.1109/TIT.2021.3089145
![]() |
[56] |
J. Peng, L. Zheng, C. Wu, H. Kan, Permutation polynomials x2k+1+3+ax2k+2+bx over F22k and their differential uniformity, Sci. China Inf. Sci., 63 (2020), 209101. https://doi.org/10.1007/s11432-018-9741-6 doi: 10.1007/s11432-018-9741-6
![]() |
[57] | H. Peter, G. Korchmáros, F. Torres, F. Orihuela, Algebraic curves over a finite field, Princeton University Press, 2008. |
[58] |
X. Qin, L. Yan, Constructing permutation trinomials via monomials on the subsets of μq+1, Appl. Algebra Eng. Commun. Comput., 34 (2023), 321–334. https://doi.org/10.1007/s00200-021-00505-8 doi: 10.1007/s00200-021-00505-8
![]() |
[59] |
R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, 21 (1978), 120–126. https://doi.org/10.1145/359340.359342 doi: 10.1145/359340.359342
![]() |
[60] |
R. K. Sharma, R. Gupta, Determination of a type of permutation binomials and trinomials, Appl. Algebra Eng. Commun. Comput., 31 (2020), 65–86. https://doi.org/10.1007/s00200-019-00394-y doi: 10.1007/s00200-019-00394-y
![]() |
[61] |
R. Singh, K. Sarma, A. Saikia, Poly-dragon: an efficient multivariate public key cryptosystem, J. Math. Cryptology, 4 (2011), 349–364. https://doi.org/10.1515/jmc.2011.002 doi: 10.1515/jmc.2011.002
![]() |
[62] |
R. Singh, K. Sarma, A. Saikia, A public key cryptosystem using a group of permutation polynomials, Tatra Mt. Math. Publ., 77 (2020), 139–162. http://doi.org/10.2478/tmmp-2020-0013 doi: 10.2478/tmmp-2020-0013
![]() |
[63] | H. Stichtenoth, Algebraic function fields and codes, Springer Science & Business Media, 2009. http://doi.org/10.1007/978-3-540-76878-4 |
[64] | Z. Tu, X. Zeng, L. Hu, C. Li, A class of binomial permutation polynomials, arXiv, 2013. https://doi.org/10.48550/arXiv.1310.0337 |
[65] |
Z. Tu, X. Zeng, L. Hu, Several classes of complete permutation polynomials, Finite Fields Appl., 25 (2014), 182–193. https://doi.org/10.1016/j.ffa.2013.09.007 doi: 10.1016/j.ffa.2013.09.007
![]() |
[66] |
Z. Tu, X. Zeng, C. Li, T. Helleseth, A class of new permutation trinomials, Finite Fields Appl., 50 (2018), 178–195. https://doi.org/10.1016/j.ffa.2017.11.009 doi: 10.1016/j.ffa.2017.11.009
![]() |
[67] |
Z. Tu, X. Zeng, Two classes of permutation trinomials with Niho exponents, Finite Fields Appl., 53 (2018), 99–112. https://doi.org/10.1016/j.ffa.2018.05.007 doi: 10.1016/j.ffa.2018.05.007
![]() |
[68] |
Z. Tu, X. Zeng, A class of permutation trinomials over finite fields of odd characteristic, Cryptography Commun., 11 (2019), 563–583. https://doi.org/10.1007/s12095-018-0307-4 doi: 10.1007/s12095-018-0307-4
![]() |
[69] |
D. Wan, R. Lidl, Permutation polynomials of the form xrf(x(q−1)d) and their group structure, Monatsh. Math., 112 (1991), 149–163. https://doi.org/10.1007/BF01525801 doi: 10.1007/BF01525801
![]() |
[70] | Q. Wang, Cyclotomic mapping permutation polynomials over finite fields, Springer, 2007. |
[71] |
Y. Wang, Z. Zha, W. Zhang, Six new classes of permutation trinomials over F33k, Appl. Algebra Eng. Commun. Comput., 29 (2018), 479–499. https://doi.org/10.1007/s00200-018-0353-3 doi: 10.1007/s00200-018-0353-3
![]() |
[72] |
Y. Wang, W. Zhang, Z. Zha, Six new classes of permutation trinomials over F∗2n, SIAM J. Discrete Math., 32 (2018), 1946–1961. https://doi.org/10.1137/17M1156666 doi: 10.1137/17M1156666
![]() |
[73] |
B. Wu, D. Lin, On constructing complete permutation polynomials over finite fields of even characteristic, Discrete Appl. Math., 184 (2015), 213–222. https://doi.org/10.1016/j.dam.2014.11.008 doi: 10.1016/j.dam.2014.11.008
![]() |
[74] |
D. Wu, P. Yuan, C. Ding, Y. Ma, Permutation trinomials over F2m, Finite Fields Appl., 46 (2017), 38–56. https://doi.org/10.1016/j.ffa.2017.03.002 doi: 10.1016/j.ffa.2017.03.002
![]() |
[75] |
G. Wu, N. Li, Several classes of permutation trinomials over F5n from Niho exponents, Cryptography Commun., 11 (2019), 313–324. https://doi.org/10.1007/s12095-018-0291-8 doi: 10.1007/s12095-018-0291-8
![]() |
[76] |
X. Xie, N. Li, L. Xu, X. Zeng, X. Tang, Two new classes of permutation trinomials over Fq3 with odd characteristic, Discrete Math., 346 (2023), 113607. https://doi.org/10.1016/j.disc.2023.113607 doi: 10.1016/j.disc.2023.113607
![]() |
[77] |
P. Yaun, Compositional inverses of AGW-PPs-dedicated to professor cunsheng ding for his 60th birthday, Adv. Math. Commun., 16 (2022), 1185–1195. https://doi.org/10.3934/amc.2022045 doi: 10.3934/amc.2022045
![]() |
[78] | P. Yaun, Permutation polynomials and their compositional inverses, arXiv, 2022, https://doi.org/10.48550/arXiv.2206.04252 |
[79] | P. Yuan, Local method for compositional inverses of permutational polynomials, arXiv, 2022. https://doi.org/10.48550/arXiv.2211.10083 |
[80] |
Z. Zha, L. Hu, S. Fan, Further results on permutation trinomials over finite fields with even characteristic, Finite Fields Appl., 45 (2017), 43–52. https://doi.org/10.1016/j.ffa.2016.11.011 doi: 10.1016/j.ffa.2016.11.011
![]() |
[81] |
D. Zheng, M. Yuan, L. Yu, Two types of permutation polynomials with special forms, Finite Fields Appl., 56 (2019), 1–16. https://doi.org/10.1016/j.ffa.2018.10.008 doi: 10.1016/j.ffa.2018.10.008
![]() |
[82] |
L. Zheng, H. Kan, J. Peng, Two classes of permutation trinomials with Niho exponents over finite fields with even characteristic, Finite Fields Appl., 68 (2020), 101754. https://doi.org/10.1016/j.ffa.2020.101754 doi: 10.1016/j.ffa.2020.101754
![]() |
[83] |
L. Zheng, H. Kan, J. Peng, D. Tang, Two classes of permutation trinomials with Niho exponents, Finite Fields Appl., 70 (2021), 101790. https://doi.org/10.1016/j.ffa.2020.101790 doi: 10.1016/j.ffa.2020.101790
![]() |
[84] |
L. Zheng, B. Liu, H. Kan, J. Peng, D. Tang, More classes of permutation quadrinomials from niho exponents in characteristic two, Finite Fields Appl., 78 (2022), 101962. https://doi.org/10.1016/j.ffa.2021.101962 doi: 10.1016/j.ffa.2021.101962
![]() |
[85] | M. Zieve, On some permutation polynomials over of the form xrh(xq−1d), Proc. Amer. Math. Soc., 137 (2009), 2209–2216. |
[86] | M. Zieve, Permutation polynomials on Fq induced form R´edei function bijections on subgroups of F∗q, arXiv, 2013. https://doi.org/10.48550/arXiv.1310.0776 |
[87] | M. Zieve, A note on the paper arXiv: 2112.14547, arXiv, 2022. https://doi.org/10.48550/arXiv.2201.01106 |
1. | Shougui Zhang, Xiyong Cui, Guihua Xiong, Ruisheng Ran, An Optimal ADMM for Unilateral Obstacle Problems, 2024, 12, 2227-7390, 1901, 10.3390/math12121901 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 4.8e-1 | 8.7e-1 | 2.2e-2 | 4.7e-2 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 1.2e-1 | 2.2 | 2.2e-1 | 2.1 | 2.4e-3 | 3.2 | 5.6e-3 | 3.1 | 1.4e-4 | 4.1 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 2.1 | 5.5e-2 | 2.0 | 2.8e-4 | 3.1 | 6.8e-4 | 3.0 | 8.8e-6 | 4.0 | 1.7e-5 | 4.0 | ||
81 | 6.9e-3 | 2.0 | 1.4e-2 | 2.0 | 3.4e-5 | 3.1 | 8.4e-5 | 3.0 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.7e-3 | 2.0 | 3.4e-3 | 2.0 | 4.2e-6 | 3.0 | 1.0e-5 | 3.0 | 3.3e-8 | 4.0 | 6.8e-8 | 4.0 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 8.9e-2 | 1.8e-1 | 9.8e-2 | 2.7e-1 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 6.9e-2 | 0.4 | 1.2e-1 | 0.6 | 2.4e-2 | 2.0 | 4.5e-2 | 2.6 | 1.5e-4 | 4.0 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 1.3 | 5.5e-2 | 1.1 | 3.5e-3 | 2.8 | 7.3e-3 | 2.6 | 8.8e-6 | 4.0 | 1.8e-5 | 4.0 | ||
81 | 6.8e-3 | 2.2 | 1.3e-2 | 2.0 | 4.3e-4 | 3.1 | 8.4e-4 | 3.1 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.5e-3 | 2.1 | 3.0e-3 | 2.2 | 5.5e-5 | 2.9 | 1.0e-4 | 3.0 | 3.4e-8 | 4.0 | 6.8e-8 | 5.0 |
(u−,u+) = (1.284025,128.4025) | ||||||
Mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (8.6e-4, 8.7e-1) | (2.1e-4, 2.2e-1) | (5.3e-5, 5.5e-2) | (1.3e-5, 1.4e-2) | (3.3e-6, 3.4e-3) |
e2h∞/eh∞ | - | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | |
Third | e∞ | (8.6e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
(u−,u+) = (1.284025,128.4025) | ||||||
mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (4.7e-3, 1.3e-1) | (1.6e-3, 1.1e-1) | (1.3e-3, 5.5e-2) | (2.7e-4, 1.3e-2) | (6.4e-5, 3.0e-3) |
e2h∞/eh∞ | - | (3.6, 4.2) | (3.8, 4.1) | (3.9, 4.1) | (4.2, 4.5) | |
Third | e∞ | (8.7e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4e-2 | 2.9e-2 | 9.9e-5 | 2.4e-4 | 3.2e-6 | 6.1e-6 | ||||||||
41 | 3.4e-3 | 2.0 | 7.3e-3 | 2.0 | 1.1e-5 | 3.1 | 2.9e-5 | 3.1 | 2.0e-7 | 4.0 | 4.0e-7 | 4.0 | ||
81 | 8.3e-4 | 2.0 | 1.8e-3 | 2.0 | 1.4e-6 | 3.1 | 3.5e-6 | 3.0 | 1.2e-8 | 4.0 | 2.5e-8 | 4.0 | ||
161 | 2.1e-4 | 2.0 | 4.6e-4 | 2.0 | 1.7e-7 | 3.0 | 4.3e-7 | 3.0 | 7.5e-10 | 4.0 | 1.5e-9 | 4.1 | ||
321 | 5.1e-5 | 2.0 | 1.1e-4 | 2.0 | 2.1e-8 | 3.0 | 5.4e-8 | 3.0 | 4.6e-11 | 4.0 | 9.2e-11 | 4.1 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 8.9e-3 | 1.5e-2 | 1.3e-3 | 5.9e-3 | 1.1e-3 | 5.2e3 | ||||||||
41 | 3.6e-3 | 1.3 | 7.6e-3 | 1.0 | 3.2e-5 | 5.3 | 7.5e-5 | 6.3 | 3.2e-5 | 5.1 | 8.8e-5 | 5.9 | ||
81 | 8.3e-4 | 2.1 | 1.8e-3 | 2.1 | 3.7e-6 | 3.1 | 1.3e-5 | 2.5 | 3.8e-6 | 3.1 | 1.5e-5 | 2.6 | ||
161 | 1.8e-4 | 2.2 | 4.0e-4 | 2.2 | 4.2e-7 | 3.1 | 3.8e-6 | 1.8 | 4.8e-7 | 3.0 | 4.0e-6 | 1.9 | ||
321 | 2.8e-5 | 2.7 | 5.2e-5 | 2.9 | 9.5e-8 | 2.2 | 1.7e-6 | 1.2 | 9.9e-8 | 2.3 | 1.7e-6 | 1.3 |
Mesh | 21 | 41 | 81 | 161 | 321 |
hf/hb | 1.48 | 2.80 | 1.72e-2 | 1.36 | 2.30 |
Mesh | 21 | 41 | 81 | 161 | 321 |
Fitted | 2098 | 6746 | 20081 | 63749 | 147695 |
Non-fitted | 4108 | 14355 | 31339 | 107609 | 341350 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4 | 2.6 | 2.1e-2 | 5.0e-2 | 1.8e-3 | 3.4e-3 | ||||||||
41 | 3.4e-1 | 2.0 | 6.4e-1 | 2.0 | 2.4e-3 | 3.1 | 6.0e-3 | 3.1 | 1.1e-4 | 4.0 | 2.1e-4 | 4.0 | ||
81 | 8.4e-2 | 2.0 | 1.6e-1 | 2.0 | 2.9e-4 | 3.1 | 7.4e-4 | 3.0 | 6.9e-6 | 4.0 | 1.3e-5 | 4.0 | ||
161 | 2.1e-2 | 2.0 | 4.0e-2 | 2.0 | 3.5e-5 | 3.0 | 9.1e-5 | 3.0 | 4.4e-7 | 4.0 | 8.5e-7 | 4.0 | ||
321 | 5.2e-3 | 2.0 | 1.0e-2 | 2.0 | 4.3e-6 | 3.0 | 1.1e-5 | 3.0 | 2.9e-8 | 3.9 | 5.5e-8 | 3.9 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 9.9e-1 | 1.7 | 4.0e-2 | 1.4e-1 | 1.4e-2 | 6.3e-2 | ||||||||
41 | 3.4e-1 | 1.6 | 6.4e-1 | 1.4 | 8.2e-4 | 5.6 | 1.9e-3 | 6.2 | 1.1e-3 | 3.7 | 2.5e-3 | 4.6 | ||
81 | 8.1e-2 | 2.1 | 1.6e-1 | 2.0 | 5.3e-5 | 4.0 | 1.2e-4 | 4.0 | 1.1e-4 | 3.2 | 2.9e-4 | 3.1 | ||
161 | 1.9e-2 | 2.1 | 3.6e-2 | 2.1 | 1.0e-5 | 2.4 | 5.9e-5 | 1.0 | 1.1e-5 | 3.3 | 3.0e-5 | 3.3 | ||
321 | 3.6e-3 | 2.4 | 6.3e-3 | 2.5 | 1.8e-6 | 2.5 | 3.9e-5 | 0.6 | 1.2e-6 | 3.3 | 1.7e-6 | 4.1 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 4.8e-1 | 8.7e-1 | 2.2e-2 | 4.7e-2 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 1.2e-1 | 2.2 | 2.2e-1 | 2.1 | 2.4e-3 | 3.2 | 5.6e-3 | 3.1 | 1.4e-4 | 4.1 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 2.1 | 5.5e-2 | 2.0 | 2.8e-4 | 3.1 | 6.8e-4 | 3.0 | 8.8e-6 | 4.0 | 1.7e-5 | 4.0 | ||
81 | 6.9e-3 | 2.0 | 1.4e-2 | 2.0 | 3.4e-5 | 3.1 | 8.4e-5 | 3.0 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.7e-3 | 2.0 | 3.4e-3 | 2.0 | 4.2e-6 | 3.0 | 1.0e-5 | 3.0 | 3.3e-8 | 4.0 | 6.8e-8 | 4.0 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
11 | 8.9e-2 | 1.8e-1 | 9.8e-2 | 2.7e-1 | 2.4e-3 | 4.5e-3 | ||||||||
21 | 6.9e-2 | 0.4 | 1.2e-1 | 0.6 | 2.4e-2 | 2.0 | 4.5e-2 | 2.6 | 1.5e-4 | 4.0 | 2.8e-4 | 4.0 | ||
41 | 2.8e-2 | 1.3 | 5.5e-2 | 1.1 | 3.5e-3 | 2.8 | 7.3e-3 | 2.6 | 8.8e-6 | 4.0 | 1.8e-5 | 4.0 | ||
81 | 6.8e-3 | 2.2 | 1.3e-2 | 2.0 | 4.3e-4 | 3.1 | 8.4e-4 | 3.1 | 5.4e-7 | 4.0 | 1.1e-6 | 4.0 | ||
161 | 1.5e-3 | 2.1 | 3.0e-3 | 2.2 | 5.5e-5 | 2.9 | 1.0e-4 | 3.0 | 3.4e-8 | 4.0 | 6.8e-8 | 5.0 |
(u−,u+) = (1.284025,128.4025) | ||||||
Mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (8.6e-4, 8.7e-1) | (2.1e-4, 2.2e-1) | (5.3e-5, 5.5e-2) | (1.3e-5, 1.4e-2) | (3.3e-6, 3.4e-3) |
e2h∞/eh∞ | - | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | (4.0, 4.0) | |
Third | e∞ | (8.6e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
(u−,u+) = (1.284025,128.4025) | ||||||
mesh | 11 | 21 | 41 | 81 | 161 | |
Second | e∞ | (4.7e-3, 1.3e-1) | (1.6e-3, 1.1e-1) | (1.3e-3, 5.5e-2) | (2.7e-4, 1.3e-2) | (6.4e-5, 3.0e-3) |
e2h∞/eh∞ | - | (3.6, 4.2) | (3.8, 4.1) | (3.9, 4.1) | (4.2, 4.5) | |
Third | e∞ | (8.7e-4, 4.7e-2) | (1.1e-4, 5.6e-3) | (1.4e-5, 6.8e-4) | (1.7e-6, 8.4e-5) | (2.1e-7, 1.0e-5) |
e2h∞/eh∞ | - | (8.0, 8.4) | (7.9, 8.2) | (8.0, 8.1) | (8.0, 8.1) | |
Fourth | e∞ | (1.2e-5, 4.5e-3) | (7.3e-7, 2.8e-4) | (4.6e-8, 1.8e-5) | (2.9e-9, 1.1e-6) | (1.8e-10, 6.8e-8) |
e2h∞/eh∞ | - | (15.9, 16.0) | (16.0, 16.0) | (16.0, 16.1) | (16.1, 16.0) |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4e-2 | 2.9e-2 | 9.9e-5 | 2.4e-4 | 3.2e-6 | 6.1e-6 | ||||||||
41 | 3.4e-3 | 2.0 | 7.3e-3 | 2.0 | 1.1e-5 | 3.1 | 2.9e-5 | 3.1 | 2.0e-7 | 4.0 | 4.0e-7 | 4.0 | ||
81 | 8.3e-4 | 2.0 | 1.8e-3 | 2.0 | 1.4e-6 | 3.1 | 3.5e-6 | 3.0 | 1.2e-8 | 4.0 | 2.5e-8 | 4.0 | ||
161 | 2.1e-4 | 2.0 | 4.6e-4 | 2.0 | 1.7e-7 | 3.0 | 4.3e-7 | 3.0 | 7.5e-10 | 4.0 | 1.5e-9 | 4.1 | ||
321 | 5.1e-5 | 2.0 | 1.1e-4 | 2.0 | 2.1e-8 | 3.0 | 5.4e-8 | 3.0 | 4.6e-11 | 4.0 | 9.2e-11 | 4.1 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 8.9e-3 | 1.5e-2 | 1.3e-3 | 5.9e-3 | 1.1e-3 | 5.2e3 | ||||||||
41 | 3.6e-3 | 1.3 | 7.6e-3 | 1.0 | 3.2e-5 | 5.3 | 7.5e-5 | 6.3 | 3.2e-5 | 5.1 | 8.8e-5 | 5.9 | ||
81 | 8.3e-4 | 2.1 | 1.8e-3 | 2.1 | 3.7e-6 | 3.1 | 1.3e-5 | 2.5 | 3.8e-6 | 3.1 | 1.5e-5 | 2.6 | ||
161 | 1.8e-4 | 2.2 | 4.0e-4 | 2.2 | 4.2e-7 | 3.1 | 3.8e-6 | 1.8 | 4.8e-7 | 3.0 | 4.0e-6 | 1.9 | ||
321 | 2.8e-5 | 2.7 | 5.2e-5 | 2.9 | 9.5e-8 | 2.2 | 1.7e-6 | 1.2 | 9.9e-8 | 2.3 | 1.7e-6 | 1.3 |
Mesh | 21 | 41 | 81 | 161 | 321 |
hf/hb | 1.48 | 2.80 | 1.72e-2 | 1.36 | 2.30 |
Mesh | 21 | 41 | 81 | 161 | 321 |
Fitted | 2098 | 6746 | 20081 | 63749 | 147695 |
Non-fitted | 4108 | 14355 | 31339 | 107609 | 341350 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 1.4 | 2.6 | 2.1e-2 | 5.0e-2 | 1.8e-3 | 3.4e-3 | ||||||||
41 | 3.4e-1 | 2.0 | 6.4e-1 | 2.0 | 2.4e-3 | 3.1 | 6.0e-3 | 3.1 | 1.1e-4 | 4.0 | 2.1e-4 | 4.0 | ||
81 | 8.4e-2 | 2.0 | 1.6e-1 | 2.0 | 2.9e-4 | 3.1 | 7.4e-4 | 3.0 | 6.9e-6 | 4.0 | 1.3e-5 | 4.0 | ||
161 | 2.1e-2 | 2.0 | 4.0e-2 | 2.0 | 3.5e-5 | 3.0 | 9.1e-5 | 3.0 | 4.4e-7 | 4.0 | 8.5e-7 | 4.0 | ||
321 | 5.2e-3 | 2.0 | 1.0e-2 | 2.0 | 4.3e-6 | 3.0 | 1.1e-5 | 3.0 | 2.9e-8 | 3.9 | 5.5e-8 | 3.9 |
Mesh | Second-order scheme | Third-order scheme | Fourth-order scheme | |||||||||||
L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | L2 | Rate | L∞ | Rate | |||
21 | 9.9e-1 | 1.7 | 4.0e-2 | 1.4e-1 | 1.4e-2 | 6.3e-2 | ||||||||
41 | 3.4e-1 | 1.6 | 6.4e-1 | 1.4 | 8.2e-4 | 5.6 | 1.9e-3 | 6.2 | 1.1e-3 | 3.7 | 2.5e-3 | 4.6 | ||
81 | 8.1e-2 | 2.1 | 1.6e-1 | 2.0 | 5.3e-5 | 4.0 | 1.2e-4 | 4.0 | 1.1e-4 | 3.2 | 2.9e-4 | 3.1 | ||
161 | 1.9e-2 | 2.1 | 3.6e-2 | 2.1 | 1.0e-5 | 2.4 | 5.9e-5 | 1.0 | 1.1e-5 | 3.3 | 3.0e-5 | 3.3 | ||
321 | 3.6e-3 | 2.4 | 6.3e-3 | 2.5 | 1.8e-6 | 2.5 | 3.9e-5 | 0.6 | 1.2e-6 | 3.3 | 1.7e-6 | 4.1 |