Processing math: 100%
Research article Special Issues

Banking market competition in Europe—financial stability or fragility enhancing?

  • Received: 30 March 2019 Accepted: 20 May 2019 Published: 27 May 2019
  • JEL Codes: G21

  • Considering the importance of the competition-stability trade-off, contradictory theoretical predictions, and empirical evidence, its re-investigation from the angle of non-linearity is needed. Therefore, this paper focuses on the association between bank stability and competition in Europe by employing a Boone indicator and alternative competition measures. Bank stability is measured with the z-score and loan loss reserves ratio. System-GMM estimations are carried out on a panel of banks from 27 European Union member countries over the period of 2004–2014. The results confirm that when a linear association between bank stability and competition is assumed, competition-stability argument prevails. However, when potential non-linearity of this association is assumed, the results appear more diverse and complex across different competition proxies. We observe signs of U-shape association between bank stability and competition for the Boone indicator and weaker signs of an inverse U-shape association with Lerner index. This indicates that before taking policy measures, it is important to consider the potentially non-linear association between bank stability and competition and to define which aspect of competition regulators want to address. The results concerning mature and emerging Europe exhibit also some differences, indicating that suitable regulatory approaches applied even within the EU could be rather different.

    Citation: Kalle Ahi, Laivi Laidroo. Banking market competition in Europe—financial stability or fragility enhancing?[J]. Quantitative Finance and Economics, 2019, 3(2): 257-285. doi: 10.3934/QFE.2019.2.257

    Related Papers:

    [1] Maurizio Verri, Giovanna Guidoboni, Lorena Bociu, Riccardo Sacco . The role of structural viscoelasticity in deformable porous media with incompressible constituents: Applications in biomechanics. Mathematical Biosciences and Engineering, 2018, 15(4): 933-959. doi: 10.3934/mbe.2018042
    [2] Aftab Ahmed, Javed I. Siddique . The effect of magnetic field on flow induced-deformation in absorbing porous tissues. Mathematical Biosciences and Engineering, 2019, 16(2): 603-618. doi: 10.3934/mbe.2019029
    [3] Hatim Machrafi . Nanomedicine by extended non-equilibrium thermodynamics: cell membrane diffusion and scaffold medication release. Mathematical Biosciences and Engineering, 2019, 16(4): 1949-1965. doi: 10.3934/mbe.2019095
    [4] Ching-Han Huang, Yu-Min Wang, Shana Smith . Using high-dimensional features for high-accuracy pulse diagnosis. Mathematical Biosciences and Engineering, 2020, 17(6): 6775-6790. doi: 10.3934/mbe.2020353
    [5] Marya L. Poterek, Mauricio Santos-Vega, T. Alex Perkins . Equilibrium properties of a coupled contagion model of mosquito-borne disease and mosquito preventive behaviors. Mathematical Biosciences and Engineering, 2025, 22(8): 1875-1897. doi: 10.3934/mbe.2025068
    [6] Nilay Mondal, Koyel Chakravarty, D. C. Dalal . A mathematical model of drug dynamics in an electroporated tissue. Mathematical Biosciences and Engineering, 2021, 18(6): 8641-8660. doi: 10.3934/mbe.2021428
    [7] Jianguo Xu, Cheng Wan, Weihua Yang, Bo Zheng, Zhipeng Yan, Jianxin Shen . A novel multi-modal fundus image fusion method for guiding the laser surgery of central serous chorioretinopathy. Mathematical Biosciences and Engineering, 2021, 18(4): 4797-4816. doi: 10.3934/mbe.2021244
    [8] Yafei Liu, Linqiang Yang, Hongmei Ma, Shuli Mei . Adaptive filter method in Bendlet domain for biological slice images. Mathematical Biosciences and Engineering, 2023, 20(6): 11116-11138. doi: 10.3934/mbe.2023492
    [9] Panagiotes A. Voltairas, Antonios Charalambopoulos, Dimitrios I. Fotiadis, Lambros K. Michalis . A quasi-lumped model for the peripheral distortion of the arterial pulse. Mathematical Biosciences and Engineering, 2012, 9(1): 175-198. doi: 10.3934/mbe.2012.9.175
    [10] Yi Ren, Guolei Zhang, Longbin Yang, Yanwei Hu, Xiaojing Nie, Zhibin Jiang, Dawei Wang, Zhifan Wu . Study on seafloor hydrothermal systems circulation flow and heat transfer characteristics. Mathematical Biosciences and Engineering, 2022, 19(6): 6186-6203. doi: 10.3934/mbe.2022289
  • Considering the importance of the competition-stability trade-off, contradictory theoretical predictions, and empirical evidence, its re-investigation from the angle of non-linearity is needed. Therefore, this paper focuses on the association between bank stability and competition in Europe by employing a Boone indicator and alternative competition measures. Bank stability is measured with the z-score and loan loss reserves ratio. System-GMM estimations are carried out on a panel of banks from 27 European Union member countries over the period of 2004–2014. The results confirm that when a linear association between bank stability and competition is assumed, competition-stability argument prevails. However, when potential non-linearity of this association is assumed, the results appear more diverse and complex across different competition proxies. We observe signs of U-shape association between bank stability and competition for the Boone indicator and weaker signs of an inverse U-shape association with Lerner index. This indicates that before taking policy measures, it is important to consider the potentially non-linear association between bank stability and competition and to define which aspect of competition regulators want to address. The results concerning mature and emerging Europe exhibit also some differences, indicating that suitable regulatory approaches applied even within the EU could be rather different.


    Fractional derivatives, which have attracted considerable attention during the last few decades, can be defined according to their type. These include the Caputo [1,2,3,4,5,6,8,7,9,10,11,12,13], Riemann-Liouville [14,15,16,17,18,19,20,21], Riesz [22,23,24,25,26], and Caputo-Fabrizio (CF) [27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46] types. Especially for the CF derivative, there were many related reports based on some discussions of different aspects, see the above references, and the Refs. [43,44,45]. In order to better grasp the fractional order problem, one can refer to the related works [47,48] and other fractional books.

    Based on these fractional derivatives, numerous models have been developed. However, these models are difficult to solve directly by applying the general analytical methods because of the existence of fractional derivatives. This problem has inspired scholars to develop numerical algorithms to derive numerical solutions efficiently. In [5,49,50,51], a few high-order approximation formulas for the Riemann-Liouville, Caputo, and Riesz fractional derivatives were proposed and developed using different techniques or ideas. Recently, high-order discrete formulas for the CF fractional derivatives were designed and discussed in Refs. [32,33,34,35,36,37,38].

    Another difficulty for simulating the models with fractional derivatives is the non-locality which greatly reduces the efficiency of the algorithm and requires much more memory storage compared with the traditional local models. Specifically, to obtain the approximation solutions {Uk}Mk=1 with M a positive integer, for the fractional models its computing complexity is O(M2), and the memory storage is O(M), in contrast to the local models with O(M) and O(1), respectively. For fast algorithms aimed at the Riemann-Liouville, Caputo, and Riesz fractional derivatives, see Refs. [14,52,53,54,55]. However, few scholars studied the fast algorithm for the CF fractional derivative. To the best of our knowledge, authors in [39] proposed numerically a fast method for the CF fractional derivative without further analysing the error accuracy.

    In this study, our aim is to construct a novel efficient approximation formula for the following CF fractional derivative [31]

    CF0αtu(t)=11αt0u(s)exp[α1α(ts)]ds,0<α<1, (1.1)

    where t[0,T], 0<T<. Our contributions in this study mainly focus on

    Propose a novel second-order approximation formula for the CF fractional derivative with detailed theoretical analysis for the truncation error.

    Develop a fast algorithm based on the novel discretization technique which reduces the computing complexity from O(M2) to O(M) and the memory storage from O(M) to O(1). Moreover, we theoretically show that the fast algorithm maintains the optimal convergence rate.

    The remainder of this paper is structured as follows. In Section 2, we derive a novel approximation formula with second-order convergence rate for the CF fractional derivative. In Section 3, we develop a fast algorithm by splitting the CF fractional derivative into two parts, the history part and local part, and then rewrite the history part by a recursive formula. Further we prove the truncation error for the fast algorithm. In Section 4, two numerical examples are provided to verify the approximation results and the efficiency of our fast algorithm. In Section 5, we provide a conclusion and offer suggestions for future studies.

    Throughout this article, we denote C as a positive constant, which is free of the step size Δt.

    To derive a novel approximation formula, we choose a uniform time step size Δt=TM=tktk1 with nodes tk=kΔt,k=0,1,,M, where M is a positive constant. We denote uk=u(tk) on [0,T].

    We next give a discrete approximation of CF fractional derivative CF0αtu(t) at tk+12(k1)

    CF0αtu(tk+12)=11αkj=1tj+12tj12u(s)exp[α1α(tk+12s)]ds+11αt12t0u(s)exp[α1α(tk+12s)]ds=11αkj=1tj+12tj12[u(tj)+u(tj)(stj)+12u(ξj)(stj)2]exp[α1α(tk+12s)]ds+11αt12t0[u(t12)+u(t12)(st12)+12u(ξ0)(st12)2]exp[α1α(tk+12s)]ds=1αkj=1uj+1uj12Δt(Mk+12j+12Mk+12j12)+1αu1u0Δt(Mk+1212Mk+120)+Rk+121+Rk+122CF0Dαtu(tk+12)+Rk+12, (2.1)

    where ξj generally depending on s satisfies ξj(tj12,tj+12) for j1 and ξ0(t0,t12). The coefficients Mkj and error Rk+12 are defined as follows

    Mkj=exp[α1α(tktj)],     Rk+12=Rk+121+Rk+122, (2.2)
    Rk+121=11αkj=1tj+12tj12[u(tj)(stj)+12u(ξj)(stj)2]exp[α1α(tk+12s)]ds+11αt12t0[u(t12)(st12)+12u(ξ0)(st12)2]exp[α1α(tk+12s)]ds,Rk+122=11αO(Δ2t)tk+12t0exp[α1α(tk+12s)]ds. (2.3)

    From (2.1), we obtain the following approximation formula for CF0αtu(tk+12) with k1.

    CF0Dαtu(tk+12)=1αkj=1uj+1uj12Δt(Mk+12j+12Mk+12j12)+1αu1u0Δt(Mk+1212Mk+120). (2.4)

    Based on this discussion, we obtain the novel approximation formula (2.4). We next discuss the truncation error of the novel approximation formula.

    Theorem 1. For u(t)C3[0,T], the truncation error Rk+12(k0) satisfies the following estimate

    |Rk+12|CΔ2t, (2.5)

    where the constant C is independent of k and Δt.

    Proof. According to formula (2.3), we can obtain:

    |Rk+12||Rk+121|+|Rk+122||11αkj=1u(tj)tj+12tj12(stj)exp[α1α(tk+12s)]ds|+|11αu(t12)t12t0(st12)exp[α1α(tk+12s)]ds|+|12(1α)kj=1tj+12tj12u(ξj)(stj)2exp[α1α(tk+12s)]ds|+|12(1α)t12t0u(ξ0)(st12)2exp[α1α(tk+12s)]ds|+|11αtk+12t0O(Δ2t)exp[α1α(tk+12s)]ds|=I1+I2+I3+I4+I5. (2.6)

    For the term I1, using integration by parts, we can arrive at:

    I1maxt[0,T]|u(t)|Δ2t8(1α)kj=1{exp[α1α(tk+12tj+12)]exp[α1α(tk+12tj12)]}+maxt[0,T]|u(t)|αΔ2t8(1α)2tk+12t12exp[α1α(tk+12s)]dsmaxt[0,T]|u(t)|Δ2t4(1α)(1Mk+1212)CΔ2t. (2.7)

    Next, for the term I2, by using the mean value theorem of integrals, we obtain:

    I2=|Δt2(1α)u(t12)(tεt12)exp[α1α(tk+12tε)]|maxt[0,T]|u(t)|Δ2t4(1α)CΔ2t, (2.8)

    where t0tεt12.

    For the term I3, we can easily obtain:

    I3maxt[0,T]|u(t)|Δ2t8(1α)tk+12t12exp[α1α(tk+12s)]dsCΔ2t. (2.9)

    Similarly, we can estimate the term I4 as follows:

    I4maxt[0,T]|u(t)|Δ2t8(1α)t12t0exp[α1α(tk+12s)]dsCΔ2t. (2.10)

    Finally, for the term I5, we can derive:

    I511α|O(Δ2t)|(1Mk+120)CΔ2t. (2.11)

    Based on the aforementioned estimates for the terms I1, ,I5, we can complete the proof of the Theorem.

    It is obvious that the approximation formula (2.4) is nonlocal since the value at node tk+12 for the CF fractional derivative is concerned with all the values of uj, j=0,1,,k,k+1, which means the computing complexity when apply the formula (2.4) to ODEs is of O(M2) and the memory requirement is O(M). In the following analysis, inspired by the work [14], we develop a fast algorithm based on the new discretization technique used in this paper, with which the computing complexity is reduced from O(M2) to O(M) and the memory requirement is O(1) instead of O(M).

    We split the derivative CF0Dαtu(tk+12) for k1 into two parts: the history part denoted by Ch(tk+12) and the local part denoted by Cl(tk+12), respectively, as follows

    CF0αtu(tk+12)=Ch(tk+12)+Cl(tk+12)=11αtk12t0u(s)exp[α1α(tk+12s)]ds+11αtk+12tk12u(s)exp[α1α(tk+12s)]ds. (3.1)

    For the local part Cl(tk+12), we have

    Cl(tk+12)=uk+1uk12αΔt(1Mk+12k12)+Rk+12l, (3.2)

    where Mkj is defined by (2.2), and the truncation error Rk+12l is

    Rk+12l=11αtk+12tk12[u(tk)(stk)+12u(ξk)(stk)2]exp[α1α(tk+12s)]ds+11α[u(tk)uk+1uk12Δt]tk+12tk12exp[α1α(tk+12s)]ds,k1. (3.3)

    For the history part Ch(tk+12), we rewrite it into a recursive formula when k2 in the following way

    Ch(tk+12)=11αtk32t0u(s)exp[α1α(tk+12s)]ds+11αtk12tk32u(s)exp[α1α(tk+12s)]dsC(1)h(tk+12)+C(2)h(tk+12), (3.4)

    and when k=1,

    Ch(t32)=11αt12t0u(s)exp[α1α(t32s)]dsC(2)h(t32). (3.5)

    Careful calculations show that

    C(1)h(tk+12)=exp(αΔtα1)Ch(tk12),k2. (3.6)

    For the term C(2)h(tk+12), by similar analysis for the Theorem 1, we have

    C(2)h(tk+12)={ukuk22αΔt(Mk+12k12Mk+12k32)+Rk+12h,if k2u1u0αΔt(M3212M320)+R32h,if k=1, (3.7)

    where, for k2,

    Rk+12h=11αtk12tk32[u(tk1)(stk1)+12u(ξk1)(stk1)2]exp[α1α(tk+12s)]ds+11α[u(tk1)ukuk22Δt]tk12tk32exp[α1α(tk+12s)]ds, (3.8)

    and, for k=1,

    R32h=11αt12t0[u(t12)(st12)+12u(ξ0)(st12)2]exp[α1α(tk+12s)]ds+11α[u(t12)u1u0Δt]t12t0exp[α1α(t32s)]ds. (3.9)

    For the truncation error Rk+12l and Rk+12h defined respectively by (3.3) and (3.8)-(3.9), we have the estimates that

    Lemma 1. Suppose that u(t)C3[0,T], then for any k1, Rk+12l and Rk+12h satisfy

    |Rk+12l|CΔ3t,|Rk+12h|CΔ3t, (3.10)

    where the constant C is free of k and Δt.

    Proof. To avoid repetition we just prove the estimate for Rk+12l, since the estimate for Rk+12h can be derived similarly. By the definition (3.3), we have

    |Rk+12l|11αmaxt[0,T]|u(t)||tk+12tk12(stk)exp[α1α(tk+12s)]ds|+12(1α)maxt[0,T]|u(t)|tk+12tk12(stk)2exp[α1α(tk+12s)]ds+CΔ2t1αtk+12tk12exp[α1α(tk+12s)]ds.L1+L2+L3. (3.11)

    Then, for the term L1, using integration by parts and the Taylor expansion for exp(t) at zero, we have

    L1CΔ2t(Mk+12k+12Mk+12k12)+Ctk+12tk12(stk)2exp[α1α(tk+12s)]dsCΔ2t[1(1αΔt1α|O(Δ2t)|)]+CΔ3tCΔ3t. (3.12)

    For the terms L2 and L3, by the mean value theorem of integrals we can easily get L2CΔ3t and L3CΔ3t. Hence, we have proved the estimate for Rk+12l.

    Now, based on the above analysis, and for a better presentation, we can introduce an operator CF0Fαt for the fast algorithm defined by

    CF0Fαtu(tk+12)=uk+1uk12αΔt(1Mk+12k12)+Fh(tk+12),k1, (3.13)

    where the history part Fh(tk+12) satisfies

    Fh(tk+12)={exp(αΔtα1)Fh(tk12)+ukuk22αΔt(Mk+12k12Mk+12k32),if k2u1u0αΔt(M3212M320),if k=1. (3.14)

    We note that with (3.13) and (3.14), uk+1 only depends on uk, uk1 and uk2, which reduces the algorithm complexity from O(M2) to O(M) and the memory requirement from O(M) to O(1).

    The following theorem confirms the efficiency of the operator CF0Fαt, with which we can still obtain the second-order convergence rate.

    Theorem 2. Assume u(t)C3[0,T] and the operator CF0Fαt is defined by (3.13). Then

    |CF0αtu(tk+12)CF0Fαtu(tk+12)|CΔ2t, (3.15)

    where the constant C is independent of k and Δt.

    Proof. Combining (3.1), (3.2), (3.4)-(3.5) with (3.13), (3.14), we can get

    |CF0αtu(tk+12)CF0Fαtu(tk+12)||Ch(tk+12)Fh(tk+12)|+|Rk+12l|,k2. (3.16)

    Then, next we mainly analyse the estimate for |Ch(tk+12)Fh(tk+12)|. Actually, by definitions we obtain

    Ch(tk+12)Fh(tk+12)=exp(αΔtα1)[Ch(tk12)Fh(tk12)]+Rk+12h. (3.17)

    We introduce some notations to simplify the presentation. Let

    Tk+1=Ch(tk+12)Fh(tk+12),L=exp(αΔtα1). (3.18)

    Then, the recursive formula (3.17) reads that

    Tk+1=Lk1T2+Rk+1h, (3.19)

    where the term Rk+1h is defined by

    Rk+1h=Lk2R2+12h+Lk3R3+12h++Rk+12h. (3.20)

    Now, by (3.7) and (3.14) as well as the Lemma 1, we can get

    |T2|=|R32h|CΔ3t, (3.21)

    and

    |Rk+1h|CΔ3t(Lk2+Lk3++1)=CΔ3t1Lk11L. (3.22)

    Noting here that L(0,1) we have

    1L=1exp(αΔtα1)αΔt1ααΔt2(1α). (3.23)

    Combining (3.19), (3.21)-(3.23), we obtain that

    |Tk+1|CΔ2t. (3.24)

    Now, with (3.16), (3.17), (3.24) and the Lemma 1, we complete the proof for the theorem.

    To check the second-order convergence rate and the efficiency of the fast algorithm for the novel approximation formula, we choose two fractional ordinary differential equation models with the domain I=(0,T]. Let Uk be the numerical solution for the chosen models at tk, and define U0=u(0). Define the error as Err(Δt)=max1kM|Ukuk|. For the sufficiently smooth function u(t), we have the approximation formulas for u(tk+12) and its first derivative dudt|t=tk+12:

    u(tk+12)=12(uk+uk+1)+O(Δ2t),dudt|t=tk+12=uk+1ukΔt+O(Δ2t). (4.1)

    Then, combined with results (2.5) and (3.15), the second-order convergence rate in the following tests is expected.

    First, we consider the following fractional ordinary differential equation with an initial value:

    {CF0αtu(t)+u(t)=g1(t), tˉI,u(0)=φ0. (4.2)

    Next, by taking the exact solution u(t)=t2 and the initial value φ0=0, we derive the source function as follows:

    g1(t)=2tα+t22(1α)α2[1exp(α1αt)]. (4.3)

    Direct scheme: Based on the novel approximation formula (2.4), we derive the following discrete system at tk+12:

    Case k=0

    (12+1M120αΔt)U1=(12+1M120αΔt)U0+g1(t12), (4.4)

    Case k1

    (12+1Mk+12k122αΔt)Uk+1=1Mk+12k122αΔtUk112UkMk+1212Mk+120αΔt(U1U0)12αΔtk1j=1(Uj+1Uj1)(Mk+12j+12Mk+12j12)+g1(tk+12). (4.5)

    Fast scheme: Applying the fast algorithm to the equation (4.2), we can get, for k1:

    (12+1Mk+12k122αΔt)Uk+1=1Mk+12k122αΔtUk112Uk+g1(tk+12)Fh(tk+12), (4.6)

    where Fh(tk+12) is defined by (3.14). For the case k=0, the formula (4.4) is used to derive U1.

    Let T=1. By calculating based on the direct scheme (4.4)–(4.5) and the fast scheme (4.6), we obtain the error results by choosing changed mesh sizes time step Δt=210,211,212,213,214 for different fractional parameters α=0.1,0.5,0.9, respectively, in Table 1. From the computed results, we can see that the convergence rate for both of the schemes is close to 2, which is in agreement with our theoretical result.

    Table 1.  Convergence results of Example 1.
    α Δt Direct scheme Fast scheme
    Err(Δt) Rate CPU(s) Err(Δt) Rate CPU(s)
    0.1 210 4.76834890E-07 0.0625 4.76834890E-07 0.0072
    211 1.19209015E-07 1.999996 0.2508 1.19209014E-07 1.999996 0.0067
    212 2.98022864E-08 1.999998 0.8776 2.98022864E-08 1.999998 0.0088
    213 7.45057174E-09 2.000000 3.3688 7.45057174E-09 2.000000 0.0100
    214 1.86264512E-09 1.999998 13.2991 1.86264512E-09 1.999998 0.0140
    0.5 210 4.76811290E-07 0.0716 4.76811290E-07 0.0067
    211 1.19206056E-07 1.999961 0.2768 1.19206056E-07 1.999961 0.0083
    212 2.98019183E-08 1.999980 0.9433 2.98019183E-08 1.999980 0.0091
    213 7.45052997E-09 1.999990 3.6143 7.45052997E-09 1.999990 0.0098
    214 1.86263893E-09 1.999995 14.2937 1.86263893E-09 1.999995 0.0135
    0.9 210 8.88400608E-07 0.0834 8.88400608E-07 0.0071
    211 2.22067159E-07 2.000214 0.2935 2.22067163E-07 2.000214 0.0074
    212 5.55126489E-08 2.000108 1.1452 5.55126587E-08 2.000107 0.0083
    213 1.38776781E-08 2.000050 4.3128 1.38775857E-08 2.000060 0.0099
    214 3.46934370E-09 2.000032 17.1595 3.46943940E-09 1.999982 0.0199

     | Show Table
    DownLoad: CSV

    Moreover, we manifest the efficiency of our fast scheme in two aspects: (i) by comparing with a published second-order scheme [35] which is denoted as Scheme I and (ii) with the direct scheme (4.5). In Figure 1, we take T=10 and plot the CPU time consumed for Scheme I and our fast scheme under the condition |Err(Δt)|107 for each α=0.1,0.2,,0.9. It is evident that our fast scheme is much more efficient. Further, to check the computing complexity of our direct and fast schemes, we depict in Figure 2 the CPU time in seconds needed with α=0.1 in the log-log coordinate system, by taking T=1, M=103×2m, m=1,2,,6. One can see that the fast scheme has reduced the computing complexity from O(M2) to O(M).

    Figure 1.  Comparison of CPU time between our fast method and the Scheme I with the error satisfying |Err(Δt)|107.
    Figure 2.  CPU time for Example 1 with α=0.1.

    We next consider another initial value problem of the fractional ordinary differential equation:

    {du(t)dt+CF0αtu(t)=g2(t), tˉI,u(0)=ψ0, (4.7)

    where the exact solution is u(t)=exp(2t), the initial value is ψ0=1, and the source function is:

    g2(t)=22α[exp(2t)exp(α1αt)]+2exp(2t). (4.8)

    Direct scheme: For the model (4.7), we formulate the Crank-Nicolson scheme based on the new approximation formula (2.4) at tk+12 as follows:

    Case k=0

    (1Δt+1M120αΔt)U1=(1Δt+1M120αΔt)U0+g2(t12), (4.9)

    Case k1

    (1Δt+1Mk+12k122αΔt)Uk+1=1Mk+12k122αΔtUk1+1ΔtUkMk+1212Mk+120αΔt(U1U0)12αΔtk1j=1(Uj+1Uj1)(Mk+12j+12Mk+12j12)+g2(tk+12). (4.10)

    Fast scheme: Applying the fast algorithm to the model (4.7), we have, for k1:

    (1Δt+1Mk+12k122αΔt)Uk+1=1Mk+12k122αΔtUk1+UkΔt+g1(tk+12)Fh(tk+12). (4.11)

    Similarly, we also compute and list the convergence data in Table 2 to show further the effectiveness of the novel approximation and the fast algorithm.

    Table 2.  Convergence results of Example 2.
    α Δt Direct scheme Fast scheme
    Err(Δt) Rate CPU(s) Err(Δt) Rate CPU(s)
    0.2 210 1.85604636E-06 0.0620 1.85604607E-06 0.0066
    211 4.64007204E-07 2.000014 0.2317 4.64006418E-07 2.000016 0.0075
    212 1.16000631E-07 2.000015 0.8691 1.16003294E-07 1.999979 0.0091
    213 2.90011650E-08 1.999950 3.3423 2.89965145E-08 2.000214 0.0107
    214 7.24794447E-09 2.000467 13.4227 7.25755100E-09 1.998325 0.0154
    0.4 210 1.78086742E-06 0.0638 1.78086759E-06 0.0071
    211 4.45204337E-07 2.000041 0.2516 4.45203661E-07 2.000043 0.0080
    212 1.11298823E-07 2.000029 0.9043 1.11298892E-07 2.000026 0.0095
    213 2.78237513E-08 2.000049 3.5048 2.78246395E-08 2.000004 0.0110
    214 6.95804836E-09 1.999562 14.8677 6.95847024E-09 1.999521 0.0143
    0.8 210 3.89820152E-07 0.0785 3.89820181E-07 0.0115
    211 9.73901404E-08 2.000961 0.2962 9.73902248E-08 2.000960 0.0079
    212 2.43394851E-08 2.000477 1.0595 2.43393918E-08 2.000484 0.0095
    213 6.08529405E-09 1.999900 4.1052 6.08559336E-09 1.999823 0.0116
    214 1.51925406E-09 2.001964 16.5226 1.51877799E-09 2.002487 0.0156

     | Show Table
    DownLoad: CSV

    From the computed data summarized in Table 2, both of the schemes have a second-order convergence rate, and the fast scheme indeed improves the efficiency of the novel approximation formula without losing too much precision. Similarly as the Example 1, we compare in Figure 3 the times for both of the methods under different M=102×2m, for α=0.9 and m=1,2,,6 in the log-log coordinate system. One can see clearly that the computing complexity for the direct scheme is O(M2), and for the fast scheme it is O(M).

    Figure 3.  CPU time for Example 2 with α=0.9.

    In this study, we constructed a novel discrete formula for approximating the CF fractional derivative and proved the second-order convergence rate for the novel approximation formula. To overcome the nonlocal property of the derivative, we proposed a fast algorithm that tremendously improves the efficiency of the approximation formula. Moreover, we demonstrated the fast algorithm maintains the second-order convergence rate. In future works, this novel approximation formula and fast algorithm can be applied with the finite element, finite difference, or other numerical methods to specific fractional differential equation models with Caputo-Fabrizio derivatives.

    The authors are grateful to the three anonymous referees and editors for their valuable comments and good suggestions which greatly improved the presentation of the paper. This work is supported by the National Natural Science Fund (11661058, 11761053), the Natural Science Fund of Inner Mongolia Autonomous Region (2017MS0107), the program for Young Talents of Science, and Technology in Universities of the Inner Mongolia Autonomous Region (NJYT-17-A07).

    The authors declare no conflict of interest.



    [1] Agoraki MEK, Delis MD, Pasiouras F (2011) Regulations, competition and bank risk-taking in transition countries. J Financ Stabil 7: 38-48. doi: 10.1016/j.jfs.2009.08.002
    [2] Allen F, Gale D (2000) Financial contagion. J Polit Econ 108: 1-33. doi: 10.1086/262109
    [3] Allen F, Gale D (2004) Competition and financial stability. J Money Credit Bank 36: 453-480. doi: 10.1353/mcb.2004.0038
    [4] Andrieş AM, Căpraru B (2012) How does EU banking competition impact financial stability? Proceedings of the 13th International Conference on Finance and Banking, Ostrava, Czech Republic Oct 12-13, 2011.
    [5] Anginer D, Demirguc-Kunt A, Zhu M (2014) How does competition affect bank systemic risk? J Financ Intermed 23: 1-26. doi: 10.1016/j.jfi.2013.11.001
    [6] Arellano M, Bover O (1995) Another look at the instrumental variables estimation of error components models. J Econometrics 68: 29-51. doi: 10.1016/0304-4076(94)01642-D
    [7] Bain J (1956) Barriers to New Competition, Cambridge: Harvard Press.
    [8] Beck T, Coyle D, Dewatripont M, et al. (2010) Bailing out the banks: Reconciling stability and competition. Centre for Economic Policy Research.
    [9] Beck T, De Jonghe O, Schepens G (2013) Bank competition and stability: Cross-country heterogeneity. J Financ Intermed 22: 218-244. doi: 10.1016/j.jfi.2012.07.001
    [10] Berger AN, Klapper LF, Turk-Ariss R (2009) Bank competition and financial stability. J Financ Serv Res 35: 99-118. doi: 10.1007/s10693-008-0050-7
    [11] Blundell R, Bond S (1998) Initial conditions and moment restrictions in dynamic panel data models. J Econometrics 87: 11-143.
    [12] Bolt W, Humphrey D (2015) Assessing bank competition for consumer loans. J Bank Financ 61: 127-141. doi: 10.1016/j.jbankfin.2015.09.004
    [13] Bolt W, Tieman A (2004) Bank competition, risk and regulation. Scand J Econ 44: 1-34.
    [14] Boone J (2008) A new way to measure competition. Econ J 118: 1245-1261. doi: 10.1111/j.1468-0297.2008.02168.x
    [15] Boyd JH, Graham SL (1988) The profitability and risk effects of allowing bank holding companies to merge with other financial firms: A simulation study. Fed Reserve Bank Minneapolis Quart Rev 12: 3-20.
    [16] Boyd JH, De Nicoló G (2005) The theory of bank risk taking and competition revisited. J Finance 60: 1329-1343. doi: 10.1111/j.1540-6261.2005.00763.x
    [17] Boyd JH, De Nicolò G, Jalal AM (2006) Bank risk-taking and competition revisited: New theory and new evidence. IMF Working Papers No. 297.
    [18] Broecker T (1990) Credit-worthiness tests and interbank competition. Econometrica 58: 429-452. doi: 10.2307/2938210
    [19] Brůha J, Kočenda E (2018) Financial stability in Europe: Banking and sovereign risk. J Financ Stabil 36: 305-321. doi: 10.1016/j.jfs.2018.03.001
    [20] Carbó S, Humphrey D, Maudos J, et al. (2009) Cross-country comparisons of competition and pricing power in European banking. J Int Money Financ 28: 115-134. doi: 10.1016/j.jimonfin.2008.06.005
    [21] Carletti E (2008) Competition and regulation in banking, In: Boot A, Thakor A (Eds.), Handbook in Financial Intermediation, Elsevier, North Holland, 449-482.
    [22] Claessens S (2009) Competition in the financial sector: Overview of competition policies. IMF Working Paper No. 45.
    [23] Coelli TJ, Rao DSP, O'Donnell CJ, et al. (2005) An Introduction to Efficiency and Productivity Analysis, Springer Science & Business Media.
    [24] Cubillas E, González F (2014) Financial liberalization and bank risk-taking: International evidence. J Financ Stabil 11: 32-48. doi: 10.1016/j.jfs.2013.11.001
    [25] De Jonghe O, Diepstraten M, Schepens G (2016) Competition in EU banking, In: Beck T, Casu B (Eds.), The Palgrave Handbook of European Banking, Palgrave Macmillan UK, 187-211.
    [26] De Nicolò G, Loukoianova E (2007) Bank ownership, market structure and risk. IMF Working Paper No. 215.
    [27] Fiordelisi F, Mare DS, Molyneux P (2015) State-aid, stability and competition in European banking. MPRA Paper No. 67473.
    [28] Forssbæck J, Shehzad CT (2015) The conditional effects of market power on bank risk-Cross-country evidence. Rev Financ 19: 1997-2038. doi: 10.1093/rof/rfu044
    [29] Fu X, Lin Y, Molyneux P (2014) Bank competition and financial stability in Asia Pacific. J Bank Financ 38: 64-77. doi: 10.1016/j.jbankfin.2013.09.012
    [30] Goetz MR (2018) Competition and bank stability. J Financ Intermed 35: 57-69. doi: 10.1016/j.jfi.2017.06.001
    [31] Greene WH (1993) The econometric approach to efficiency analysis, In Fried HO, Lovell CAK, Schmidt SS (Eds.), The Measurement of Productive Efficiency, New York: Oxford University Press.
    [32] Hellmann TF, Murdock KC, Stiglitz JE (2000) Liberalization, moral hazard, and prudential regulation: Are capital requirements enough? Am Econ Rev 90: 147-165. doi: 10.1257/aer.90.1.147
    [33] Hesse H, Čihák M (2007) Cooperative banks and financial stability. IMF Working Papers No. 2.
    [34] Hope CJ, Gwatidzo T, Ntuli M (2013) Investigating the effect of bank competition on financial stability in ten African countries. Int Bus Econ Res J 12: 755-768.
    [35] Houston JF, Lin C, Lin P, et al. (2010) Creditor rights, information sharing, and bank risk taking. J Financ Econ 96: 485-512. doi: 10.1016/j.jfineco.2010.02.008
    [36] Inderst R (2013) Prudence as a competitive advantage: On the effects of competition on banks' risk-taking incentives. Eur Econ Rev 60: 127-143. doi: 10.1016/j.euroecorev.2012.10.001
    [37] Jeon JQ, Lim KK (2013) Bank competition and financial stability: A comparison of commercial banks and mutual savings banks in Korea. Pac-Basin Financ J 25: 253-272. doi: 10.1016/j.pacfin.2013.10.003
    [38] Jiménez G, Lopez JA, Saurina J (2013) How does competition affect bank risk-taking? J Financ Stab 9: 185-195. doi: 10.1016/j.jfs.2013.02.004
    [39] Kasman S, Kasman A (2015) Bank competition, concentration and financial stability in the Turkish banking industry. Econ Syst 39: 502-517. doi: 10.1016/j.ecosys.2014.12.003
    [40] Keeley MC (1990) Deposit insurance, risk, and market power in banking. Am Econ Rev 80: 1183-1200.
    [41] Kick T, Prieto E (2015) Bank risk and competition: Evidence from regional banking markets. Rev Financ 19: 1185-1222. doi: 10.1093/rof/rfu019
    [42] Koetter M, Kolari JW, Spierdijk L (2012) Enjoying the quiet life under deregulation? Evidence from adjusted Lerner indices for U.S. banks. Rev Econ Stat 94: 462-480.
    [43] Kumbhakar SC, Lovell CAK (2000) Stochastic Frontier Analysis, Cambridge University Press.
    [44] Kumbhakar SC, Wang H-J, Horncastle A (2014) A Practitioner's Guide to Stochastic Frontier Analysis, Cambridge University Press, Cambridge, England.
    [45] Laeven L, Levine R (2007) Is there a diversification discount in financial conglomerates? J Financ Econ 85: 331-367. doi: 10.1016/j.jfineco.2005.06.001
    [46] Laidroo L (2016) Bank ownership and lending-Does bank ownership matter? Emerg Mark Financ Tr 52: 285-301 doi: 10.1080/1540496X.2015.1095032
    [47] Laidroo L, Männasoo K (2017) Do credit commitments compromise credit quality? Res Int Bus Financ 41: 303-317. doi: 10.1016/j.ribaf.2017.04.010
    [48] Lapteacru I (2017) Market power and risk of Central and Eastern European banks: Does more powerful mean safer? Econ Model 63: 46-59 doi: 10.1016/j.econmod.2017.01.022
    [49] Leroy A, Lucotte Y (2017) Is there a competition-stability trade-off in European banking? J Int Financ Mark I: 199-215
    [50] Lepetit L, Strobel F (2013) Bank insolvency risk and time-varying z-score measures. J Int Financ Mark I: 73-87.
    [51] Liu H, Molyneux P, Nguyen LH (2012) Competition and risk in South East Asian commercial banking. Appl Econ 44: 3627-3644. doi: 10.1080/00036846.2011.579066
    [52] Liu H, Molyneux P, Wilson JOS (2013) Competition and stability in European banking: A regional analysis. Manch Sch 81: 176-201. doi: 10.1111/j.1467-9957.2011.02285.x
    [53] Maudos J, de Guevara JF (2007) The cost of market power in banking: Social welfare loss vs. cost inefficiency. J Bank Financ 31: 2103-2125. doi: 10.1016/j.jbankfin.2006.10.028
    [54] Noman AHM, Gee CS, Isa CR (2017) Does competition improve financial stability of the banking sector in ASEAN countries? An empirical analysis. PLoS ONE 12: 1-27.
    [55] Martínez-Miera D, Repullo R (2010) Does competition reduce the risk of bank failure? Rev Financ Stud 23: 3638-3664. doi: 10.1093/rfs/hhq057
    [56] Repullo R (2004) Capital requirements, market power, and risk-taking in banking. J Financ Intermed 13: 156-182. doi: 10.1016/j.jfi.2003.08.005
    [57] Roodman DM (2009) A note on the theme of too many instruments. Oxford B Econ Stat 71: 135-158. doi: 10.1111/j.1468-0084.2008.00542.x
    [58] Ruckes M (2004) Bank competition and credit standards. Rev Financ Stud 17: 1073-1102. doi: 10.1093/rfs/hhh011
    [59] Rumler F, Waschiczek W (2016) Have changes in the financial structure affected bank profitability? Evidence for Austria. Eur J Financ 22: 803-824. doi: 10.1080/1351847X.2014.984815
    [60] Samantas I (2013) Bank competition and financial (in) stability in Europe: A sensitivity analysis. MPRA Paper No. 51621.
    [61] Samantas I (2017) On the optimality of bank competition policy. Int Rev Financ Anal 54: 39-53. doi: 10.1016/j.irfa.2017.09.005
    [62] Schaeck K, Cihák M (2014). Competition, efficiency, and stability in banking. Financ Manage 43: 215-241. doi: 10.1111/fima.12010
    [63] Shaffer S (1998) The winner's curse in banking. J Financ Intermed 7: 359-392. doi: 10.1006/jfin.1998.0251
    [64] Soedarmono W, Machrouh F, Tarazi A (2011) Bank market power, economic growth and financial stability: Evidence from Asian banks. J Asian Econ 22: 460-470. doi: 10.1016/j.asieco.2011.08.003
    [65] Soedarmono W, Machrouh F, Tarazi A (2013) Bank competition, crisis and risk taking: Evidence from emerging markets in Asia. J Int Financ Mark I 23: 196-221. doi: 10.1016/j.intfin.2012.09.009
    [66] Stiglitz JE, Weiss A (1981) Credit rationing in markets with imperfect information. Am Econ Rev 71: 393-410.
    [67] Tabak BM, Fazio DM, Cajueiro DO (2012) The relationship between banking market competition and risk-taking: Do size and capitalization matter? J Bank Financ 36: 3366-3381. doi: 10.1016/j.jbankfin.2012.07.022
    [68] Turk Ariss R (2010) On the implications of market power in banking: Evidence from developing countries. J Bank Financ 34: 765-775. doi: 10.1016/j.jbankfin.2009.09.004
    [69] Uhde A, Heimeshoff U (2009) Consolidation in banking and financial stability in Europe: Empirical evidence. J Bank Financ 33: 1299-1311. doi: 10.1016/j.jbankfin.2009.01.006
    [70] Van Leuvensteijn M, Bikker JA, van Rixtel AARJM, et al. (2011) A new approach to measuring competition in the loan markets of the euro area. Appl Econ 43: 3155-3167. doi: 10.1080/00036840903493234
    [71] Wagner W (2010) Loan market competition and bank risk-taking. J Financ Serv Res 37: 71-81. doi: 10.1007/s10693-009-0073-8
    [72] Windmeijer F (2005) A finite sample correction for the variance of linear efficient two-step GMM estimators. J Econometrics 126: 25-51. doi: 10.1016/j.jeconom.2004.02.005
    [73] Yeyati E, Micco A (2007) Concentration and foreign penetration in Latin American banking sectors: Impact on competition and risk. J Bank Financ 31: 1633-1647. doi: 10.1016/j.jbankfin.2006.11.003
  • This article has been cited by:

    1. Mahendra Saini, Hemant K.S. Yadav, Priya Sen, Manish Gupta, Nidhi Chauhan, 2025, 9780443216589, 109, 10.1016/B978-0-443-21658-9.00011-5
  • Reader Comments
  • © 2019 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(7516) PDF downloads(2038) Cited by(13)

Figures and Tables

Figures(1)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog