Processing math: 100%
Research article

Piecewise reproducing kernel-based symmetric collocation approach for linear stationary singularly perturbed problems

  • Received: 05 April 2020 Accepted: 03 July 2020 Published: 23 July 2020
  • MSC : 65L60, 65R20

  • The aim of this paper is to develop an accurate symmetric collocation scheme for a class of linear stationary singular perturbation problems with two boundary layers. To adapt to the character of solutions, piecewise reproducing kernels is constructed. In the boundary layers intervals, inverse multiquadrics kernel function is employed. In the regular interval, exponential kernel function is used. On the basis of the piecewise reproducing kernels, a new symmetric collocation technique is presented for the considered linear stationary singular perturbation problems. Results of numerical tests illustrate that our method is easy to implement and is uniformly effective for any small ε.

    Citation: F. Z. Geng. Piecewise reproducing kernel-based symmetric collocation approach for linear stationary singularly perturbed problems[J]. AIMS Mathematics, 2020, 5(6): 6020-6029. doi: 10.3934/math.2020385

    Related Papers:

    [1] Xiuying Li, Yang Gao, Boying Wu . Approximate solutions of Atangana-Baleanu variable order fractional problems. AIMS Mathematics, 2020, 5(3): 2285-2294. doi: 10.3934/math.2020151
    [2] Ali Akgül, Esra Karatas Akgül, Sahin Korhan . New reproducing kernel functions in the reproducing kernel Sobolev spaces. AIMS Mathematics, 2020, 5(1): 482-496. doi: 10.3934/math.2020032
    [3] Shakeel Muhammad, Obaid J. Algahtani, Sayed Saifullah, Amir Ali . Theoretical and numerical aspects of the Malaria transmission model with piecewise technique. AIMS Mathematics, 2023, 8(12): 28353-28375. doi: 10.3934/math.20231451
    [4] Jian Zhang, Jinjiao Hou, Jing Niu, Ruifeng Xie, Xuefei Dai . A high order approach for nonlinear Volterra-Hammerstein integral equations. AIMS Mathematics, 2022, 7(1): 1460-1469. doi: 10.3934/math.2022086
    [5] Shiyv Wang, Xueqin Lv, Songyan He . The reproducing kernel method for nonlinear fourth-order BVPs. AIMS Mathematics, 2023, 8(11): 25371-25381. doi: 10.3934/math.20231294
    [6] Xijun Deng, Aiyong Chen . Traveling wave fronts in a single species model with cannibalism and strongly nonlocal effect. AIMS Mathematics, 2024, 9(10): 26688-26701. doi: 10.3934/math.20241298
    [7] Chuanli Wang, Biyun Chen . An $ hp $-version spectral collocation method for fractional Volterra integro-differential equations with weakly singular kernels. AIMS Mathematics, 2023, 8(8): 19816-19841. doi: 10.3934/math.20231010
    [8] Ramsha Shafqat, Ateq Alsaadi . Artificial neural networks for stability analysis and simulation of delayed rabies spread models. AIMS Mathematics, 2024, 9(12): 33495-33531. doi: 10.3934/math.20241599
    [9] Mohammad Reza Foroutan, Mir Sajjad Hashemi, Leila Gholizadeh, Ali Akgül, Fahd Jarad . A new application of the Legendre reproducing kernel method. AIMS Mathematics, 2022, 7(6): 10651-10670. doi: 10.3934/math.2022594
    [10] Şuayip Toprakseven, Seza Dinibutun . Error estimations of a weak Galerkin finite element method for a linear system of $ \ell\geq 2 $ coupled singularly perturbed reaction-diffusion equations in the energy and balanced norms. AIMS Mathematics, 2023, 8(7): 15427-15465. doi: 10.3934/math.2023788
  • The aim of this paper is to develop an accurate symmetric collocation scheme for a class of linear stationary singular perturbation problems with two boundary layers. To adapt to the character of solutions, piecewise reproducing kernels is constructed. In the boundary layers intervals, inverse multiquadrics kernel function is employed. In the regular interval, exponential kernel function is used. On the basis of the piecewise reproducing kernels, a new symmetric collocation technique is presented for the considered linear stationary singular perturbation problems. Results of numerical tests illustrate that our method is easy to implement and is uniformly effective for any small ε.


    In this study, we focus on the singular perturbation problems (SPPs) with turning points

    {εv(x)+a0(x)v(x)+a1(x)v(x)=g(x),v(0)=τ0,v(1)=τ1, (1.1)

    where 0x1, 0<ε1, a0(γ)=0 for a point in interval (0,1).

    The points such that a0(x)=0 are called turning points. Usually, turning points problems lead to boundary layers or interior layers. And therefore, for SPPs with turning points, the numerical solutions is a more challenging job. Under certain assumptions in [1], problem (1) has a unique solution with two boundary layers at left and right end points of the interval [0,1]. The goal of the work is to present an accurate symmetric collocation scheme for this class of SPPs.

    SPPs arise in the physical theory of semiconductors, chemical reactions, biological sciences, etc. Solutions of SPPs, unlike regular problems, have boundary or interior layers. The derivatives of the solution in these subintervals grow without bound as ε0. For SPPs, the use of classical numerical techniques for regular problems can not lead to accurate numerical solutions. In the last decade, there have been many effective numerical methods for SPPs [1,2,3,4,5,6,7,8,9,10,11,12]. However, most of the existing work has considered SPPs without tuning points, while much less is known on SPPs with tuning points. In Ref. [1,4,5,6,7,8], some existing numerical techniques have been proposed for SPPs with turning points.

    Reproducing kernel method (RKM) is a powerful technique for operator equations. Over the last decades, the method has achieved important developments in fractional differential equations, singular integral equations, fuzzy differential equations, and so on [8,9,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29]. Unfortunately, the direct employ of the method can not produce ideal approximate solutions to SPPs with turning points. In [8], Geng and Qian based on the RKM and the idea of domain decomposition, present an effective method for SPPs with turning points and having two boundary layers. However, the implement of the method is complicated. In this paper, we shall construct a piecewise reproducing kernel function (RKF) based on the inverse multiquadrics kernel functions and the exponential kernel functions. Then we present a symmetric collocation method for SPPs with turning points.

    In this section, following the idea in [20], we will introduce a piecewise reproducing kernel function which is used to deal with the character of solutions to SPPs (1).

    Definition 2.1. A Hilbert space H consists of complex value functions defined on E, is named a reproducing kernel Hilbert space (RKHS) if for each xE, the evaluation functional ex(f)=f(x) is continuous.

    The application of Riesz Representation Theorem for Hilbert space yields the following theorem.

    Theorem 2.1. For the above space H and each xE, there exists a unique KxH such that (f,Kx)=f(x) for all fH.

    Definition 2.2. Let H be a Hilbert function space defined in E. The function K:E×ER defined by K(x,y)=Kx(y) is known as a RKF of space H.

    Definition 2.3. For asymmetric function K:E×ER, it is known as a positive definite kernel (PDK) if for any nN, x1,x2,,xnE,c1,c2,,cnR, ni,j=1cicjK(xi,xj)0.

    Theorem 2.2. The RKF of a RKHS is positive definite. Also, every PDK can define a unique RKHS, of which it is the RKF.

    Theorem 2.3. Both inverse multiquadrics kernel function IMQ(x,y)=1(xy)2+γ2 and exponential kernel function G(x,y)=eαxy(α>0) are strictly positive definite.

    By Theorem 2.2, IMQ1(x,y)=IMQ(x,y),x,y[0,δ1] is the RKF of a RKHS H1[0,δ1], G(x,y),x,y[δ1,δ2] is the RKF of a RKHS H2[δ1,δ2] and IMQ2(x,y)=IMQ(x,y),x,y[δ2,1] is the RKF of a RKHS H3[δ2,1].

    Define piecewise kernel function

    K(x,y)={IMQ1(x,y),x,y[0,δ1),G(x,y),x,y[δ1,δ2],IMQ2(x,y),x,y(δ2,1],0,others. (2.1)

    and Hilbert functions space

    H[0,1]={w(x)|w(x)={w1(x),x[0,δ1),w2(x),x,y[δ1,δ2],w3(x),x,y(δ2,1].w1H1[0,δ1],w2H2[δ1,δ2],w3H3[δ2,1]}. (2.2)

    The inner product in this space is

    (u,v)H=(u1,v1)H1+(u2,v2)H2+(u3,v3)H3.

    Theorem 2.4. H[0,1] is a RKHS with RKF K(x,y).

    Proof. We will prove K(x,y) given in (2) is a RKF. For each v(y)H, if x[0,δ1),

    (v(y),K(x,y))H=(v1(y),IMQ1(x,y))H1+(v2(y),0)H2+(v3(y),0)H3=v1(x).

    Similarly, if x[δ1,δ2],

    (v(y),K(x,y))H=v2(x).

    And if x(δ2,1],

    (v(y),K(x,y))H=v3(x).

    This follows that (v(y),K(x,y))H=v(x), for x[0,1]. Therefore, H[0,1] is a RKHS with RKF K(x,y).

    Setting δ1=¯Kε and δ2=1¯Kε, the interval [0,1] is then divided into three subintervals [0,δ1], [δ1,δ2] and [δ2,1], where [0,δ1] and [δ2,1] are the boundary layers regions, and [δ1,δ2] is the regular region. Eq.(1) is equivalent to

    {εv(x)+a0(x)v(x)+a1(x)v(x)=g(x),v(0)=τ0,v(δ1)v(δ+1)=0,v(δ1)v(δ+1)=0,v(δ2)v(δ+2)=0,v(δ2)v(δ+2)=0,v(1)=τ1. (3.1)

    Define Lv=εv+a0(x)v+a1(x)v, B1v=v(0),B2v=v(δ1)v(δ+1), B3v=v(δ1)v(δ+1), B4v=v(δ2)v(δ+2), B5v=v(δ2)v(δ+2), B6v=v(1).

    Choosing N distinct scattered points in [0,1], such as {x1,x2,,xN}. We construct basis functions by the piecewise RKF K(x,y). Let ψi(x)=LyK(x,y)|y=xi,i=1,2,,N, ψN+j(x)=Bj,yK(x,y),j=1,2,6, here Bj,y denotes operator Bj acts on the function of y. The collocation solution vN(x) for Eq. (1) may be written as

    vN(x)=N+6i=1βiψi(x), (3.2)

    where {βi}N+6i=1 are constants to be determined.

    We require vN(x) to satisfy the governing differential equation at all centers xj,j=1,2,,N, i.e.

    LvN(xk)=N+6i=1βiLψi(xk)=g(xk),k=1,2,,N. (3.3)

    In addition, let vN(x) satisfy boundary conditions

    {B1vN(x)=N+6i=1βiB1ψi(x)=τ0,B2vN(x)=N+6i=1βiB2ψi(x)=0,B3vN(x)=N+6i=1βiB3ψi(x)=0,B4vN(x)=N+6i=1βiB4ψi(x)=0,B5vN(x)=N+6i=1βiB5ψi(x)=0,B6vN(x)=N+6i=1βiB6ψi(x)=τ1. (3.4)

    System (6) and (7) of linear equations can be reduced to the matrix form:

    Aβ=g, (3.5)

    where β=(β1,β2,,βN+6), g=(g(x1),g(x2),,g(xN),τ0,0,0,0,0,τ1). Clearly, A is a symmetric matrix.

    Define functionals λi=δxiL,i=1,2,,N, λN+j=Bj,j=1,2,,6, i.e. λi(v)=Lv(xi),i=1,2,,N, λN+j(v)=Bj(v),j=1,2,,6.

    Theorem 3.1. If the functionals λi,i=1,2,,N+6 are linearly independent, then the matrix A is invertible. That is, system (8) has a unique solution.

    The present method is outlined as follows:

    Step 1: Construct basis functions ψi(x) using the kernel function K(x,y), operator L and Bj,j=1,2,,6.

    Step 2: Set collocation approximation vN(x)=N+6i=1βiψi(x).

    Step 3: Let vN satisfies the equation and boundary conditions in (4).

    Step 4: Obtain the coefficients in vN and then get approximate solution vN.

    Theorem 3.2. If a0(x),a1(x) and g(x)C2[0,1], then

    v(x)vN(x)=maxx[0,1]v(x)vN(x)∣≤ch2,

    where c>0 is a real number and h=max1iN1xixi+1.

    Proof. Because vN(x)H[0,1] and satisfies formula (8), we have

    vN(x)C1[0,1].

    Although vN(x) only belongs to C1 on the entire interval [0,1], from the assumptions of the Theorem and the regularity of functions in H1[0,δ1],H2[δ1,δ2] and H3[δ2,1], we have

    LvN(x)g(x)C2

    on three subintervals [0,δ1], [δ1,δ2] and [δ2,1]. respectively.

    By applying [28], v(x)vN(x)∣≤ch2 on three subintervals. Hence,

    v(x)vN(x)=maxx[0,1]v(x)vN(x)∣≤ch2.

    Define the maximum absolute errors EN=∥vvNmaxx[0,1]v(x)vN(x).

    Example 1

    We applied our method to the SPPs given by [1,9]

    εv(x)2(2x1)v(x)4v(x)=0,x(0,1), (4.1)

    with the boundary conditions v(0)=v(1)=1. Its true solution is v(x)=e2x(x1)ε. Choosing δ1=¯Kε,δ2=1¯Kε,¯K=10, γ=2ε,α=1, xi={δ1(i1)N1,i=1,2,,N1,δ1+(δ2δ1)(iN1)N2N1+1,i=N1+1,,N2,δ2+(1δ2)(iN2)NN2,i=N2+1,,N,(N1=59,N2=69,N=128) in the present method, Table 1 shows the maximum absolute errors compared with the methods in [1,9]. If the zero mean normally distributed white noise with standard derivation of 0.01 is added to the right function g(x)=0, the obtained errors are depicted in Figure 1. It is found from Table and Figure 1 that our novel approach has higher accuracy and is robust.

    Table 1.  Example 1: Comparison of errors EN.
    ε N=128([1]) N=128([9]) N=128(Our method)
    28 3.68×103 3.33×104 3.88×105
    210 8.26×103 4.70×103 3.86×105
    212 8.01×103 8.20×102 3.85×105
    216 3.85×105
    220 3.85×105
    224 3.85×105

     | Show Table
    DownLoad: CSV
    Figure 1.  Graphics of the absolute errors on the entire interval for ε=212 with noise data.

    Example 2 Next, we consider the SPPs given by [1,9]

    {εv(x)2(2x1)v(x)4v(x)=g(x),x(0,1),v(0)=v(1)=1, (4.2)

    where g(x)=4(4x1). Its exact solution v(x)=2x+(erf(2x12ε)erf(12ε)+2)e2(1x)xε. Taking δ1=¯Kε,δ2=1¯Kε,¯K=10, γ=2ε,α=1, xi={δ1(i1)N1,i=1,2,,N1,δ1+(δ2δ1)(iN1)N2N1+1,i=N1+1,,N2,δ2+(1δ2)(iN2)NN2,i=N2+1,,N, (N1=59,N2=69,N=128) in the present method, Table 2 shows the maximum absolute errors compared with the methods in [1,9]. Figure 2 shows the absolute errors on the left boundary layer for ε=106. Figure 3 shows the absolute errors on the right boundary layer for ε=106. Figure 4 shows the absolute errors on the regular interval for ε=106.

    Table 2.  Example 2: Comparison of errors EN.
    ε N=256([1]) N=256([9]) N=128(Our method)
    28 1.33×103 2.26×104 1.29×105
    212 1.22×103 5.02×104 1.28×105
    216 1.28×105
    220 1.28×105
    224 1.28×105

     | Show Table
    DownLoad: CSV
    Figure 2.  Graphics of the absolute errors on the left boundary layer for ε=106.
    Figure 3.  Graphics of the absolute errors on the right boundary layer for ε=106.
    Figure 4.  Graphics of the absolute errors on the regular interval for ε=106.

    By using the inverse multiquadrics RKF and the exponential RKF, a new piecewise RKF is builded. Take advantage of the piecewise RKFs, a new symmetric collocation scheme is presented for linear stationary SPPs. The significant advantage of the present novel technique is that it can adapt to the character of boundary layers of the solution to SPPs. Our method can give accurate approximation to the solutions of the considered SPPs on both the boundary intervals and the regular interval. The results of numerical tests illustrate that the method is uniformly effective for any small ε.

    This research was financially supported by the National Natural Science Foundation of China (No.11271100) and China Postdoctoral Science Foundation (2019M651765). The authors was also supported by Natural Science Foundation for the Youth of Jiangsu Province (No.BK20181030).

    All authors declare no conflicts of interest in this paper.



    [1] M. K. Kadalbajoo, P. Arora, V. Gupta, Collocation method using artificial viscosity for solving stiff singularly perturbed turning point problem having twin boundary layers, Comput. Math. Appl., 61 (2014), 1595-1607.
    [2] G. M. Amiraliyev, F. Erdogan, Uniform numerical method for singularly perturbed delay differential equations, Comput. Math. Appl., 53 (2007), 1251-1259. doi: 10.1016/j.camwa.2006.07.009
    [3] G. M. Amiraliyev, E. Cimen, Numerical method for a singularly perturbed convection diffusion problem with delay, Appl. Math. Comput., 216 (2010), 2351-2359.
    [4] P. Rai, K. K. Sharma, Numerical study of singularly perturbed differential-difference equation arising in the modeling of neuronal variability, Comput. Math. Appl., 63 (2012), 118-132. doi: 10.1016/j.camwa.2011.10.078
    [5] P. Rai, K. K. Sharma, Numerical analysis of singularly perturbed delay differential turning point problem, Appl. Math. Comput., 218 (2011), 3483-3498.
    [6] S. Natesan, J. Jayakumar, J. Vigo-Aguiar, Parameter uniform numerical method for singularly perturbed turning point problems exhibiting boundary layers, J. Comput. Appl. Math., 158 (2003), 121-134. doi: 10.1016/S0377-0427(03)00476-X
    [7] A. T. Chekole, G. F. Duresssa, G. G. Kiltu, PNon-polynomial septic spline method for singularly perturbed two point boundary value problems of order three, J. Taibah Univ. Sci., 13 (2019), 651-660. doi: 10.1080/16583655.2019.1617986
    [8] F. Z. Geng, S. P. Qian, Modified reproducing kernel method for singularly perturbed boundary value problems with a delay, Appl. Math. Model., 39 (2015), 5592-5597. doi: 10.1016/j.apm.2015.01.021
    [9] F. Z. Geng, S. P. Qian, Reproducing kernel method for singularly perturbed turning point problems having twin boundary layers, Appl. Math. Lett., 26 (2013), 998-1004. doi: 10.1016/j.aml.2013.05.006
    [10] D. V. Lukyanenko, M. A. Shishlenin, V. T. Volkov, Solving of the coefficient inverse problems for a nonlinear singularly perturbed reaction-diffusion-advection equation with the final time data, Commun. Nonlinear Sci., 54 (2018), 233-247. doi: 10.1016/j.cnsns.2017.06.002
    [11] L. Beilina, M. V. Klibanov, A globally convergent numerical method for a coefficient inverse problem, SIAM J. Sci. Comput., 31 (2008), 478-509. doi: 10.1137/070711414
    [12] A. B. Bakushinskii, M. V. Klibanov, N. A. Koshev, Carleman weight functions for a globally convergent numerical method for ill-posed Cauchy problems for some quasilinear PDEs, Nonlinear Anal. Real., 34 (2017), 201-224. doi: 10.1016/j.nonrwa.2016.08.008
    [13] F. Z. Geng, S. P. Qian, An optimal reproducing kernel method for linear nonlocal boundary value problems, Appl. Math. Lett., 77 (2018), 49-56. doi: 10.1016/j.aml.2017.10.002
    [14] F. Z. Geng, A new higher order accurate reproducing kernel-based approach for boundary value problems, Appl. Math. Lett., 107 (2020), 106494.
    [15] F. Z. Geng, Numerical methods for solving Schröinger equations in complex reproducing kernel Hilbert spaces, Math. Sci., (2020), https://doi.org/10.1007/s40096-020-00337-6.
    [16] X. Y. Li, B. Y. Wu, A new reproducing kernel method for variable order fractional boundary value problems for functional differential equations, J. Comput. Appl. Math., 311 (2017), 387-393. doi: 10.1016/j.cam.2016.08.010
    [17] X. Y. Li, B. Y. Wu, A numerical technique for variable fractional functional boundary value problems, Appl. Math. Lett., 43 (2015), 108-113. doi: 10.1016/j.aml.2014.12.012
    [18] X. Y. Li, B. Y. Wu, A new kernel functions based approach for solving 1-D interface problems, Appl. Math. Comput., 380 (2020), 125276.
    [19] X. Y. Li, Y. Gao, B. Y. Wu, Approximate solutions of Atangana-Baleanu variable order fractional problems, AIMS Math., 5 (2020), 2285-2294. doi: 10.3934/math.2020151
    [20] M. Q. Xu, Z. H. Zhao, J. Niu, et al. A simplified reproducing kernel method for 1-D elliptic type interface problems, J. Comput. Appl. Math., 351 (2019), 29-40. doi: 10.1016/j.cam.2018.10.027
    [21] H. Sahihi, S. Abbasbandy, T. Allahviranloo, Computational method based on reproducing kernel for solving singularly perturbed differential-difference equations with a delay, Appl. Math. Comput., 361 (2019), 583-598.
    [22] O. Abu Arqub, B. Maayah, Modulation of reproducing kernel Hilbert space method for numerical solutions of Riccati and Bernoulli equations in the Atangana-Baleanu fractional sense, Chaos Soliton. Fract., 125 (2019), 163-170. doi: 10.1016/j.chaos.2019.05.025
    [23] O. Abu Arqub, Computational algorithm for solving singular Fredholm time-fractional partial integrodifferential equations with error estimates, J. Appl. Math. Comput., 59 (2019), 227-243. doi: 10.1007/s12190-018-1176-x
    [24] O. Abu Arqub, M. Al-Smadi, Fuzzy conformable fractional differential equations: Novel extended approach and new numerical solutions, Soft Comput., 2020, https://doi.org/10.1007/s00500-020-04687-0.
    [25] O. Abu Arqub, Numerical algorithm for the solutions of fractional order systems of Dirichlet function types with comparative analysis, Fund. Inform., 166 (2019), 111-137. doi: 10.3233/FI-2019-1796
    [26] A. Akgül, Reproducing kernel Hilbert space method based on reproducing kernel functions for investigating boundary layer flow of a Powell-Eyring non-Newtonian fluid, J. Taibah Univ. Sci., 13 (2019), 858-863. doi: 10.1080/16583655.2019.1651988
    [27] A. Akgül, E. K. Akgül, S. Korhan, New reproducing kernel functions in the reproducing kernel Sobolev spaces, AIMS Math., 5 (2020), 482-496. doi: 10.3934/math.2020032
    [28] Z. H. Zhao, Y. Z. Lin. J. Niu, Convergence order of the reproducing kernel method for solving boundary value problems, Math. Model. Anal., 21 (2016), 466-477. doi: 10.3846/13926292.2016.1183240
    [29] H. Sahihi, T. Allahviranloo, S. Abbasbandy, Solving system of second-order BVPs using a new algorithm based on reproducing kernel Hilbert space, Appl. Numer. Math., 151 (2020), 27-39. doi: 10.1016/j.apnum.2019.12.008
    [30] N. Aronszajn, Theory of reproducing kernel, Trans. A.M.S., 168 (1950), 1-50.
    [31] H. Wendland, Scattered data approximation, New York: Cambridge University Press, 2004.
  • This article has been cited by:

    1. Yan Ji, Zhen Kang, Three‐stage forgetting factor stochastic gradient parameter estimation methods for a class of nonlinear systems, 2021, 31, 1049-8923, 971, 10.1002/rnc.5323
    2. Ling Xu, Feng Ding, Quanmin Zhu, Decomposition strategy-based hierarchical least mean square algorithm for control systems from the impulse responses, 2021, 0020-7721, 1, 10.1080/00207721.2020.1871107
    3. Hao Ma, Xiao Zhang, Qinyao Liu, Feng Ding, Xue‐Bo Jin, Ahmed Alsaedi, Tasawar Hayat, Partially‐coupled gradient‐based iterative algorithms for multivariable output‐error‐like systems with autoregressive moving average noises, 2020, 14, 1751-8644, 2613, 10.1049/iet-cta.2019.1027
    4. Ling Xu, Feng Ding, Erfu Yang, Auxiliary model multiinnovation stochastic gradient parameter estimation methods for nonlinear sandwich systems, 2021, 31, 1049-8923, 148, 10.1002/rnc.5266
    5. Ting Cui, Feng Ding, Jie Sheng, Parameter estimation for a multi-input multi-output state-space system with unmeasurable states through the data filtering technique , 2020, 14, 1751-8644, 3062, 10.1049/iet-cta.2020.0866
    6. Xuehai Wang, Feng Ding, The robust multi‐innovation estimation algorithm for Hammerstein non‐linear systems with non‐Gaussian noise, 2021, 1751-8644, 10.1049/cth2.12097
    7. Lanjie Guo, Hao Wang, Zhe Lin, Recursive least-squares algorithm for a characteristic model with coloured noise by means of the data filtering technique, 2021, 0020-7721, 1, 10.1080/00207721.2021.1889707
    8. Huan Xu, Feng Ding, Min Gan, Ahmed Alsaedi, Tasawar Hayat, Parameter estimation for an exponential autoregressive time series model by the Newton search and multi-innovation theory, 2021, 0020-7721, 1, 10.1080/00207721.2021.1895356
    9. Feng Ding, Hao Ma, Jian Pan, Erfu Yang, Hierarchical gradient- and least squares-based iterative algorithms for input nonlinear output-error systems using the key term separation, 2021, 00160032, 10.1016/j.jfranklin.2021.04.006
    10. Jimei Li, Feng Ding, Identification methods of nonlinear systems based on the kernel functions, 2021, 0924-090X, 10.1007/s11071-021-06417-z
    11. Y. Gao, X. Y. Li, B. Y. Wu, A continuous kernel functions method for mixed-type functional differential equations, 2021, 2008-1359, 10.1007/s40096-021-00409-1
    12. Ping Ma, Lei Wang, Filtering‐based recursive least squares estimation approaches for multivariate equation‐error systems by using the multiinnovation theory, 2021, 35, 0890-6327, 1898, 10.1002/acs.3302
    13. Qilin Liu, Yongsong Xiao, Feng Ding, Tasawar Hayat, Decomposition‐based over‐parameterization forgetting factor stochastic gradient algorithm for Hammerstein‐Wiener nonlinear systems with non‐uniform sampling, 2021, 31, 1049-8923, 6007, 10.1002/rnc.5576
    14. Xiuying Li, Hongliang Wang, Boying Wu, An accurate numerical technique for fractional oscillation equations with oscillatory solutions, 2022, 45, 0170-4214, 956, 10.1002/mma.7825
    15. Zhi-Yuan Li, Mei-Chun Wang, Yu-Lan Wang, Solving a class of variable order nonlinear fractional integral differential equations by using reproducing kernel function, 2022, 7, 2473-6988, 12935, 10.3934/math.2022716
    16. Zhen Kang, Yan Ji, Ximei Liu, Hierarchical recursive least squares algorithms for Hammerstein nonlinear autoregressive output‐error systems, 2021, 35, 0890-6327, 2276, 10.1002/acs.3320
    17. Ling Xu, Separable Multi-innovation Newton Iterative Modeling Algorithm for Multi-frequency Signals Based on the Sliding Measurement Window, 2022, 41, 0278-081X, 805, 10.1007/s00034-021-01801-x
    18. Qilin Liu, Feiyan Chen, Feng Ding, Ahmed Alsaedi, Tasawar Hayat, Recursive least squares estimation methods for a class of nonlinear systems based on non‐uniform sampling, 2021, 35, 0890-6327, 1612, 10.1002/acs.3263
    19. Hao Ma, Feng Ding, Yan Wang, Multi‐innovation Newton recursive methods for solving the support vector machine regression problems, 2021, 31, 1049-8923, 7239, 10.1002/rnc.5672
    20. Kutorzi Edwin Yao, Mahvish Samar, Yufeng Shi, Approximation approach for backward stochastic Volterra integral equations, 2024, 4, 2767-8946, 390, 10.3934/mmc.2024031
    21. Mahvish Samar, Kutorzi Yao, Xinzhong Zhu, Numerical Solution of Nonlinear Backward Stochastic Volterra Integral Equations, 2023, 12, 2075-1680, 888, 10.3390/axioms12090888
    22. Edwin Yao Kutorzi, Yuxue Zhang, Yufeng Shi, Yuan Gao, 2024, Approximate solution for stochastic Volterra integral equations with constant delay, 9798400717284, 53, 10.1145/3670085.3670099
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3545) PDF downloads(166) Cited by(22)

Figures and Tables

Figures(4)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog