Loading [MathJax]/extensions/TeX/boldsymbol.js
Research article

Generalized estimation equations method for fixed effects panel interval-valued data models

  • This paper studied panel interval-valued data models with individual fixed effects, in which the correlation within a group was considered and the group average method was used to eliminate the fixed effects. Then, we applied generalized estimation equations (GEEs) to analyze panel interval-valued data models and gave a computational algorithm to obtain the estimators. Some Monte Carlo simulations and real data analysis showed that, in contrast with the least-squares dummy-variable (LSDV) method, the proposed GEEs method has advantages in forecasting performance.

    Citation: Chi Liu, Ruiqin Tian, Dengke Xu. Generalized estimation equations method for fixed effects panel interval-valued data models[J]. Electronic Research Archive, 2025, 33(6): 3733-3755. doi: 10.3934/era.2025166

    Related Papers:

    [1] Mani Pavuluri, Amber May . I Feel, Therefore, I am: The Insula and Its Role in Human Emotion, Cognition and the Sensory-Motor System. AIMS Neuroscience, 2015, 2(1): 18-27. doi: 10.3934/Neuroscience.2015.1.18
    [2] David I. Dubrovsky . “The Hard Problem of Consciousness”. Theoretical solution of its main questions. AIMS Neuroscience, 2019, 6(2): 85-103. doi: 10.3934/Neuroscience.2019.2.85
    [3] Timothy J. Ricker . The Role of Short-term Consolidation in Memory Persistence. AIMS Neuroscience, 2015, 2(4): 259-279. doi: 10.3934/Neuroscience.2015.4.259
    [4] Anna Lardone, Marianna Liparoti, Pierpaolo Sorrentino, Roberta Minino, Arianna Polverino, Emahnuel Troisi Lopez, Simona Bonavita, Fabio Lucidi, Giuseppe Sorrentino, Laura Mandolesi . Topological changes of brain network during mindfulness meditation: an exploratory source level magnetoencephalographic study. AIMS Neuroscience, 2022, 9(2): 250-263. doi: 10.3934/Neuroscience.2022013
    [5] Brion Woroch, Alex Konkel, Brian D. Gonsalves . Activation of stimulus-specific processing regions at retrieval tracks the strength of relational memory. AIMS Neuroscience, 2019, 6(4): 250-265. doi: 10.3934/Neuroscience.2019.4.250
    [6] Amory H. Danek, Virginia L. Flanagin . Cognitive conflict and restructuring: The neural basis of two core components of insight. AIMS Neuroscience, 2019, 6(2): 60-84. doi: 10.3934/Neuroscience.2019.2.60
    [7] Andrea J. Rapkin, Steven M. Berman, Edythe D. London . The Cerebellum and Premenstrual Dysphoric Disorder. AIMS Neuroscience, 2014, 1(2): 120-141. doi: 10.3934/Neuroscience.2014.2.120
    [8] Yang Yu, Tsuyoshi Setogawa, Jumpei Matsumoto, Hiroshi Nishimaru, Hisao Nishijo . Neural basis of topographical disorientation in the primate posterior cingulate gyrus based on a labeled graph. AIMS Neuroscience, 2022, 9(3): 373-394. doi: 10.3934/Neuroscience.2022021
    [9] Aini Ismafairus Abd Hamid, Nurfaten Hamzah, Siti Mariam Roslan, Nur Alia Amalin Suhardi, Muhammad Riddha Abdul Rahman, Faiz Mustafar, Hazim Omar, Asma Hayati Ahmad, Elza Azri Othman, Ahmad Nazlim Yusoff . Distinct neural mechanisms of alpha binaural beats and white noise for cognitive enhancement in young adults. AIMS Neuroscience, 2025, 12(2): 147-179. doi: 10.3934/Neuroscience.2025010
    [10] Arianna Polverino, Pierpaolo Sorrentino, Matteo Pesoli, Laura Mandolesi . Nutrition and cognition across the lifetime: an overview on epigenetic mechanisms. AIMS Neuroscience, 2021, 8(4): 448-476. doi: 10.3934/Neuroscience.2021024
  • This paper studied panel interval-valued data models with individual fixed effects, in which the correlation within a group was considered and the group average method was used to eliminate the fixed effects. Then, we applied generalized estimation equations (GEEs) to analyze panel interval-valued data models and gave a computational algorithm to obtain the estimators. Some Monte Carlo simulations and real data analysis showed that, in contrast with the least-squares dummy-variable (LSDV) method, the proposed GEEs method has advantages in forecasting performance.



    Adaptive Finite Element Methods (AFEM) for self-adjoint coercive problems written in the form

    uV : B(u,v)=F(v),vV,

    iterate the sequence

    SOLVEESTIMATEMARKREFINE

    to produce better and better approximations of u. Their practical efficiency is corroborated by sound theoretical results of convergence, complexity, and optimality, which in various cases (such as, e.g., conforming h-versions) completely explain the behaviour of the adaptive algorithms [11,13,14,15,18].

    The standard AFEM realization preserves the conformity of the initial mesh, at the expense of performing a completion step in REFINE: In addition to elements marked for refinement due to their contribution to the global error estimator, other elements are refined. Without this step, one would obtain nonconforming meshes, containing elements with hanging nodes.

    In the new perspective opened by the introduction of Virtual Element Methods (VEM) [3,4], elements with hanging nodes can be viewed as polygons with aligned edges, carrying virtual (i.e., non-accessible) functions together with standard polynomial functions. The potential advantage is that all activated degrees of freedom are motivated by error reduction, not just by geometric reasons. On the other hand, in this transformation of an adaptive FEM into an adaptive VEM, one loses the availability of a general convergence theory, which so far is lacking (although results on a posteriori error estimates [8,12] have been obtained, together with efficient practical recipes for refining polytopal meshes [2,9,10]).

    Such a shift in perspective inspired the recent papers [5,6], devoted to the analysis of an adaptive VEM generated by the successive newest-vertex bisections of triangular elements without applying completion, in the lowest-order case (polynomial degree k=1). Despite the simple geometric setup, the investigation faced some VEM-specific obstacles in the analysis, giving answers that could prove useful in the study of more general adaptive VEM discretizations. For instance, a VEM solution uTVTV, defined by the Galerkin projection

    uTVT : BT(uT,vT)=FT(vT),vTVT,

    satisfies an a posteriori error bound of the type

    uuT2V  η2T(uT)+ST(uT,uT),

    where ηT(uT) is a residual-type error estimator, ST(uT,uT) is the stabilization term that makes the discrete bilinear form BT(uT,vT) coercive in V, and for simplicity we assume piecewise constant data on the mesh T. Unfortunately, the term ST(uT,uT) need not reduce under a mesh refinement, as η2T(uT) does: This makes the convergence analysis problematic. However, one of the key results obtained in [5] states that ST(uT,uT) is dominated by η2T(uT), i.e.,

    ST(uT,uT)  η2T(uT),

    provided an assumption of admissibility of the non-conforming meshes generated by successive refinements is fulfilled; such a restriction, which appears to have little practical impact, amounts to requiring the uniform boundedness of the global index of all hanging node, a useful concept introduced in [5] to hierarchically organize the set of hanging nodes. Once the a posteriori error bound is reduced to

    uuT2V  η2T(uT),

    the convergence analysis becomes feasible, and a contraction property is proven to hold for a linear combination of the (squared) energy norm of the error and the (squared) residual estimator.

    The purpose of this paper is to extend the results in [5] to the case of VEMs of order k2 built on triangular meshes. The problem at hand is again a variable-coefficient, second-order self-adjoint elliptic equation with Dirichlet boundary conditions. The geometric concept of hanging node (a vertex for some elements, contained inside an edge of some other elements) is replaced by a functional one, referring to the degrees of freedom associated with the node; once the meaning of hanging node is clarified, the definition of global index of a node, and its role in the analysis, is similar to the one given in [5].

    A significant difference with respect to the content of that paper concerns the control of the stabilization term, which does not involve only the residual estimator, but a new term, called the virtual inconsistency estimator and denoted by ΨT(uT). It measures the projection error, upon local spaces of polynomials, of certain expressions depending on the operator coefficients and the discrete solution; it vanishes when k=1 or when the coefficients are constant. The new stabilization bound, which we derive under an admissibility assumption of the mesh, takes the form

    ST(uT,uT)  η2T(uT)+Ψ2T(uT),

    which leads to the a posteriori, stabilization-free error control

    uuT2V  η2T(uT)+Ψ2T(uT).

    Correspondingly, we obtain the convergence of the adaptive VEM of order k by proving a contraction result for a linear combination of (squared) energy norm of the error, (squared) residual estimator, and (squared) virtual inconsistency estimator.

    Similarly to [5], we assume here that the data D of our boundary-value problem are piecewise polynomials of degrees related to k1, on the initial mesh T0 and consequently on each mesh T derived by newest-vertex bisection. This is not a restriction, since we propose to insert the adaptive VEM procedure just described, which we now consider as a module GALERKIN, into an outer loop AVEM of the form

    [T,uT]=AVEM(T0,ϵ0,ω,tol)

    j=0

    while ϵj>12tol do

      [ˆTj,ˆDj]=DATA(Tj,D,ωϵj)

      [Tj+1,Dj+1]=GALERKIN(ˆTj,ˆDj,ϵj)

      ϵj+112ϵj

      jj+1

    end while

    return

    where the module DATA produces, via greedy-type iterations, a piecewise polynomial approximation of the input data with prescribed accuracy, defined on a suitable refinement of the input partition. Manifestly, the target accuracy is matched after a finite number of calls to DATA and GALERKIN. Properties of complexity and quasi-optimality of this two-loop algorithm are investigated in [6] in the linear case k=1. We plan to do the same for the case k2 in a forthcoming paper.

    The outline of this paper is as follows. In Sections 2 and 3, we introduce the model boundary-value problem, and its discretization by an enhanced version of the VEM ([1]). In Section 4 we define the global index of a node, and we formulate the admissibility assumption on the mesh. Two essential properties for bounding the stabilization term are established in Section 5. The a posteriori error estimators are defined in Section 6, whereas stabilization-free a posteriori error estimates are proven in Section 7. In Section 8, we investigate how the a posteriori error estimators are reduced under mesh refinement. These properties are needed to justify the refinement strategy in our adaptive module GALERKIN, which is described in Section 9. In Section 9, we discuss the proof of convergence of the loop GALERKIN. The paper ends with some numerical experiments, reported in Section 11.

    We consider the following Dirichlet boundary value problem in a polygonal domain Ω,

    {(Au)+cu=f in Ω,u=0 on Ω, (2.1)

    where A(L(Ω))2×2 is symmetric and uniformly positive definite in Ω, cL(Ω) and non-negative in Ω, fL2(Ω). Data will be denoted by D=(A,c,f). The variational formulation of this problem is written as

    {find uV:=H10(Ω) such thatB(u,v)=(f,v),vV, (2.2)

    where (,) is the scalar product in L2(Ω) and B(u,v):=a(u,v)+m(u,v) is the bilinear form associated with Problem (2.1), i.e.,

    a(u,v):=(Au,v),m(u,v):=(cu,v).

    We denote the energy norm as ||||||=B(,), which satisfies

    cB|v|2|||v|||2cB|v|2,vV, (2.3)

    for suitable 0<cBcB.

    Remark 2.1. For the sake of simplicity, in (2.1) we consider the Poisson problem with vanishing Dirichlet conditions on the whole boundary domain. The extension to generic Dirichlet and/or Neumann/Robin boundary conditions does not pose conceptual difficulties. In the numerical examples, we actually provide experiments with more general Dirichlet boundary conditions.

    In order to find a discrete approximation of the solution of Problem (2.2), we firstly introduce a fixed initial partition T0 on the domain ¯Ω made of triangular elements E. We will denote by T any refinement of T0 obtained by a finite number of newest-vertex element bisections. We underline that we are not requiring T to be a conforming mesh, since hanging nodes may arise in the refinement. The classification of nodes, which will play a crucial role in the proofs presented in this paper, is postponed in Section 4.

    According to the Virtual Element theory [3], an element E of the triangulation can be viewed as a polygon with more than three edges, if some hanging nodes are sitting on its boundary. We can then denote by EE the set of edges e of element E and E:=ETEE. We finally define the diameter of an element E as hE=|E|1/2 and h=maxET{hE}.

    We introduce the functional spaces needed to apply the VEM. We start by defining the space of functions on the boundary of E, VE,k, which is constituted by the functions that are continuous on the boundary of E and that, when restricted to any edge of E, are polynomials of degree k>0, i.e.,

    VE,k:={vC0(E):v|ePk(e),eE}.

    Then, we define the "enhanced" VEM space in E, as done in [1], such that

    VE,k:={vH1(E):v|EVE,k,ΔvPk(E),(vΠEv,q)E=0qPk(E)Pk2(E)}, (2.4)

    where Pk(E)Pk2(E) is the space spanned by the monomials of degree equal to k and k1, and ΠE:H1(E)Pk(E) is the projector defined by

    ((vΠEv),q)E=0,qPk(E),E(vΠEv)=0.

    We remark that VE,k contains the polynomial space of degree k on E and its dimension is

    dim(VE,k)=nEek+k(k1)2, (2.5)

    where nEe is the number of edges of E. We notice that in the case k>1 a function v in VE,k is uniquely defined by

    ● the set of the values at the vertices of E;

    ● the set of the values at the k1 equally-spaced internal points on each edge of E;

    ● the set of the moments 1|E|Ev(x)m(x)dxmMk2(E),

    where the set Mp(E), p0, is defined as

    Mp(E)={(xxEhE)s,|s|p}. (2.6)

    We will denote by μp(E,v)=(1|E|Ev(x)m(x)dx:mMp(E)Mp1(E)) the vector of the moments of v of order p. By |μp(E,v)| we will denote the l2-norm of this vector.

    We can now introduce the global discrete space as

    VT:={vV:v|EVE,kET}.

    On T we need also to give the definition of the space of piecewise polynomial functions on T

    WkT:={wL2(Ω):w|EPk(E)ET}, (2.7)

    and its subspace

    V0T:=VTWkT, (2.8)

    which plays a crucial role in the forthcoming analysis.

    We now introduce a series of projectors that will be used in the rest of the paper. For any ET, we denote by Π0p,E:L2(E)Pp(E) the L2(E)-orthogonal projector onto the space of polynomial of degree p on E. Thanks to the choice of the enhanced space VE,k (2.4), we remark that Π0k,Ev and Π0k1,Ev can be computed for any function vVE,k, see [1] for the details. To simplify the notation, in the following we will drop the symbol E from Π0k,E when no confusion arises. The global L2-orthogonal projector is denoted by Π0p,T:L2(Ω)WpT.

    We can also define the Lagrange interpolation operator IE:VE,kPk(E) on E, which builds a polynomial of degree k using the 3k degrees of freedom on the boundary of E and the moments of order k3, since

    dim(Pk(E))=3k+(k1)(k2)2.

    Moreover, we will denote by IT:VTWkT the Lagrange interpolation operator that restricts to IE on each ET.

    In the rest of this paper, we assume that data D=(A,c,f) are piecewise polynomials of degree k1 on the initial partition T0, hence on each partition T obtained by newest-vertex refinement. Their values on each element of the triangulation will be denoted by

    (AE,cE,fE)(Pk1(E))2×2×Pk1(E)×Pk1(E).

    We here define the bilinear forms that we need for the Galerkin discretization problem, starting from aE,mE:VE,k×VE,kR, such that

    aT(v,w):=ETE(AEΠ0k1v)(Π0k1w)=:ETaE(v,w),mT(v,w):=ETEcEΠ0kvΠ0kw=:ETmE(v,w).

    We also introduce the symmetric bilinear form sE:VE×VER as

    sE(v,w):=¯NEi=1v(xi)w(xi),

    where {xi}¯NEi=1 indicates the set of the degrees of freedom on the boundary of E. Indeed, we remark that in this case the stabilization term can be built without using the internal degrees of freedom, as shown in [7]. We assume for sE the existence of two positive constant cs and Cs independent on E, such that

    cs|v|2sE(v,v)Cs|v|2,vVEPk(E). (3.1)

    We define the local stabilizing form as

    SE(v,w)=sE(vIEv,wIEw),v,wVE,

    and the global stabilization form

    ST(v,w):=ETSE(v,w),v,wVT.

    From (3.1), we get

    ST(v,v)|vITv|2,vVT,

    where || denotes the broken H1-seminorm over T. Thus, we can now define the bilinear form BT(,), BT:VT×VTR, as

    BT(v,w)=aT(v,w)+mT(v,w)+γST(v,w), (3.2)

    with γ independent of T satisfying γγ0 for some fixed γ0>0. For the loading term we introduce FT:VTR as

    FT(v):=ETEfEΠ0kv=ETEfEv,vVT, (3.3)

    since fE has been already approximated with a polynomial of degree k1. Note that the equality in (3.3) remains true if fE is an approximation of f of degree k on E.

    We have now defined all the forms that appear in the discrete formulation of the Problem (2.2). It reads as

    {find uTVT such thatBT(uT,v)=FT(v),vVT. (3.4)

    The bilinear form BT is continuous and coercive, hence, there exists a unique and stable solution of the Problem (3.4). Furthermore, the following result extends Lemma 2.6 in [5].

    Lemma 3.1 (Gakerkin quasi-orthogonality). For any vVT and wV0T, it holds

    aT(v,w)=a(v,w)ETE(AE(IΠ0k1)v)w,mT(v,w)=m(v,w)ETEcE((IΠ0k)v)w,ST(v,w)=0.

    Consequently,

    |B(uuT,w)|ST(uT,uT)1/2|w|1,Ω,

    where u is the solution of (2.2) and uT the solution of (3.4).

    A crucial concept, firstly introduced in [5] for the case k=1, is the global index of a node: It will be used in the proofs of Section 5. In order to extend its definition to the case k>1, we preliminarily introduce some useful definitions.

    Let

    ˆE:={(x,y)R2:x0,y0,x+y1}

    be the reference element and denote by ˆRˆE,k the k-lattice built on ˆE, i.e.,

    ˆRˆE,k:={(ik,jk)R2:i0,j0,i+jk}.

    Considering the affine function FE:ˆEE mapping the reference element onto an element ET, we define the physical lattice on E by

    RE,k:=FE(ˆRˆE,k),

    and the set of proper nodes of E as the points of the physical lattice sitting on the boundary of E, i.e.,

    PE:=RE,kE.

    Observe that we implicitly assume that k2 is sufficiently small so that interpolation on equally spaced nodes is numerically stable.

    Next, we denote by HE the set of hanging nodes of E, i.e., the set of points xE that are not proper nodes of E, but that are proper nodes of some other element E, i.e.,

    HE:={xE:ET such that xPE}PE.

    Finally, let NE:=PEHE be the set of all nodes sitting on E.

    At the global level, N:=ETNE will be the set of all nodes of the triangulation T, which we split into the set P:={xN:xPE E containing x} of the proper nodes ofT, and the set H:=NP of the hanging nodes ofT.

    Next, let us clarify what happens when a hanging node is created. Let S be an element edge that is being refined, i.e., split into two contiguous edges S and S+. Before the refinement, S contains k+1 equally-spaced nodes ξn, n=1,k+1: The endpoints and the k1 internal ones. After the refinement, S contains 2k+1 nodes, precisely k+1 equally-spaced nodes on each sub-edge S±, with the midpoint in common; see Figure 1. The spacing of the 'old' nodes on S was |S|k (where |S| denotes the length of S), whereas the spacing of the 'new' nodes is |S|2k. Consequently, k+1 of these nodes coincide with those initially on S, and the new nodes introduced in the refinement are only k. We will denote these latter by ζi, i=1,,k.

    Figure 1.  Blue squares represent the k+1 equally-spaced nodes ξn on the edge S before refinement. Red circles represent the 2k+1 nodes that arise after refinement. We have denoted by ζi the new nodes that do not coincide with any ξn.

    This suggests the following definition.

    Definition 4.1 (closest neighbors of a node). With the previous notation, if x:=ζi is created as the midpoint of the segment [x,x]:=[ξni,ξni+1] for some ni, we define the set B(x):={x,x}.

    We are ready to give the announced definition of global index of a node of the triangulation T.

    Definition 4.2. (global index of a node). Given a node xN, we define its global index λ recursively as follows:

    If x is a proper node, then λ(x):=0;

    If x is a hanging node, with x,xB(x), then set

    λ(x):=max{λ(x),λ(x)}+1.

    Figure 2 shows the evolution of the global index after three refinements in the cases k=2 (a) and k=3 (b). We remark that, for instance, the midpoint of the horizontal edge is a proper node in case (a), and a hanging node in case (b).

    Figure 2.  Triangulation after the three refinements in the case k=2 (a) and in the case k=3 (b). Blue crosses represent the original degrees of freedom. Red squares, green circles and orange triangles are used for the degrees of freedom of the first, second and third refinement, respectively. All nodes are proper, except those on the horizontal line, whose global index is reported.

    The largest global index in T will be denoted by ΛT:=maxxN{λ(x)}. In this paper, as in [5], we will consider sequences of successively refined triangulations {T} whose global index does not blow up.

    Assumption 4.3. There exists a constant Λ>0 such that, for any triangulation T generated by successive refinements of T0, it holds

    ΛTΛ.

    Any such triangulation will be called Λ-admissible.

    In this section we discuss the validity of some results for the degree k>1 that will be used in the rest of the paper. We will highlight in particular the differences from the case k=1.

    Proposition 5.1 (scaled Poincaré inequality in VT). There exists a constant CP>0, independent of T, such that

    ETh2Ev2CP|v|2,vVTsuch that v(x)=0,xP. (5.1)

    Proof. Let ET be an element of the triangulation. If E is an element of the original partition T0, all its vertices are proper nodes. Otherwise, E has been generated after some refinements by splitting an element ˜E into two elements, E and E. Let L be the common edge shared by E and E. If L is not further refined, then all the nodes on L are proper because they are shared by E and E. If L is refined and k is even, then the midpoint of L is a proper node.

    So, let us consider the case k odd and let us assume that L is refined M1 times. We focus in particular on the internal node ˉx of L is at distance |L|k from one of the endpoints, Figure 3 shows the case k=3. This point belongs to one of the M+1 intervals in which L is refined, having width |L|/2s, for some 1sM. We remark that s depends on how L has been refined (in the case of uniform refinements of L, one has 2s=M+1). We localize the chosen node ˉx in L by defining an m0 such that

    |L|m2s|L|k|L|(m+1)2s,
    Figure 3.  The case k=3 with 3 refinements of the edge L (in blue) is shown. Red, green and orange lines are the lines needed to refine L the first, the second and the third time respectively. Blue crosses are the degrees of freedom on L of the function living on E. Red squares, green circles, orange diamonds are the degrees of freedom on L generated after the first, the second and the third refinement of L.

    or, equivalently,

    km2sk(m+1). (5.2)

    The interval going from |L|m2s to |L|(m+1)2s is an edge for a smaller element E, thus it contains k1 internal nodes. Since they are equi-spaced, their positions are at

    |L|2s(m+nk) with n=0,,k.

    By taking n=2smk, which is compatible with conditions (5.2), we conclude that one of the internal nodes of E coincides with ˉx.

    This guarantees that E has at least one proper node x on its boundary. By hypothesis v(x)=0, and so we can apply the classical Poincaré inequality,

    h2Ev2|v|2,

    that concludes the proof.

    Remark 5.2. The previous proof exploits the fact that when k>1, each element of the triangulation contains at least a proper node. This differs from the case k=1 in which the edges do not contain internal nodes, and then elements with all hanging nodes as vertices are admissible. As a further difference from the case k=1, we highlight that in Proposition 5.1 the constant CP does not depend on the constant Λ, whose existence has been introduced in Assumption 4.3.

    The next result we are going to establish is a hierarchical representation of the interpolation error vIEv on the boundary E of an element ET. Assume that vVE,k, and let L be a side of the triangle E; for simplicity, in the sequel the restriction of v to L, which is a piecewise polynomial of degree k, will be still denoted by v. The subsequent bisections of L which generate the nodes in NEL allow us to write the difference (vIEv)|L telescopically as

    (vIEv)|L=JLj=1(IjIj1)v; (5.3)

    here, I0=IE|L, IJL is the identity operator, whereas Ijv for 1jJL1 is the piecewise polynomial of degree k which interpolates v on the partition of L of level j, namely the partition formed by sub-edges of length |L|2j.

    In order to understand the structure of the detail (IjIj1)v, assume that S is a sub-edge of L of length =|L|2j1, which is split into two sub-edges S± of length =|L|2j (see Figure 1). On S we have two interpolation operators, namely

    I:=Ij1|S:C0(S)Pk(S)

    and

    I:=Ij|S:C0(S)Pk(S,S+)={vC0(S):v|SPk(S) and v|S+Pk(S+)},

    which coincides with the interpolation operator I:C0(S)Pk(S) when restricted to S and with the analogous operator I+ when restricted to S+. With the notation introduced just before Definition 4.1, we can quantify the discrepancy between the two interpolation operators by defining the k basis functions

    ψiPk(S,S+) such that ψi(x)={1 if x=ζi,0 if x=ζj,ji,0 if x=ξn, n=1,,k+1,1ik.

    See Figure 4 for a graphical representation of these functions in the cases k=1 (a), k=2 (b), k=3 (c).

    Figure 4.  Blue squares are the k+1 equi-spaced original nodes on the blue edge. Red points represent the nodes added after the refinement of the interval. Black lines show the shapes of the basis ψi, i=1,,k, in the case k=1 (a), k=2 (b), k=3 (c).

    Hence, the difference between the two interpolation operators on S can be written as

    IvIv=ki=1d(v,ζi)ψi,

    where d is defined as

    d(v,ζi):=(IvIv)(ζi)=(vIv)(ζi). (5.4)

    The values of Iv at the k nodes ζi are a linear combination of the values of Iv at the k+1 nodes ζn, where Iv coincides with v. Thus, there exist coefficients αi,n such that

    (Iv)(ζi)=k+1n=1αi,nv(ξn),i=1,,k. (5.5)

    The explicit values of these coefficients in the case k=2 for the two new nodes ζ1 and ζ2 are given in these expressions:

    (Iv)(ζ1)=38v(ξ1)+34v(ξ2)18v(ξ3),(Iv)(ζ2)=18v(ξ1)+34v(ξ2)+38v(ξ3),

    where ξiζiξi+1, i=1,2. Similarly, in the case k=3, we get

    (Iv)(ζ1)=516v(ξ1)+1516v(ξ2)516v(ξ3)+116v(ξ4),(Iv)(ζ2)=116v(ξ1)+916v(ξ2)+916v(ξ3)116v(ξ4),(Iv)(ζ3)=116v(ξ1)516v(ξ2)+1516v(ξ3)+516v(ξ4),

    where again ξiζiξi+1, i=1,2,3. Figure 5 shows both cases. We notice that the coefficients αi,n depend only on the relative positions of the nodes on S, not on the level j of refinement.

    Figure 5.  Black points are the proper nodes. Red points represent the hanging nodes generated after a refinement. In (a) the case k=2 is showed, ζ1 is the hanging node obtained after the refinement of ξ1 and ξ3 and it is the midpoint of ξ1 and ξ2. We notice that if we have called the other red point ζ2, ξ1 and ξ3 would have been switched. Analogously, (b) represents the case k=3.

    Summarizing, at the level j of refinement of the edge L, we get

    (IjIj1)v=xHL,jd(v,x)ψx,

    where HL,j is the set of hanging nodes on L created at the level j of refinement, whereas

    d(v,x)=(IjvIj1v)(x)=(vIj1v)(x).

    Summing-up over the levels and recalling (5.3), we obtain

    (vIEv)|L=xHLd(v,x)ψx.

    where HL=HEL, whence

    (vIEv)|E=xHEd(v,x)ψx.

    We now introduce the subspace of VE,k

    XE:={wVE,k:w(x)=0xPE, and μp(w,E)=0,0pk3},

    which contains vIEv by definition of IE. On XE, we have two norms, namely the seminorm |w|1,E (which is a norm on XE due to the vanishing of w at the three vertices of E) and the norm

    [[w]]XE:=(xHEd2(w,x)+|μk2(E,w)|2)1/2.

    Note that, due to Assumption 4.3, the dimension of XE is uniformly bounded by a constant depending on Λ; furthermore, the number of possible patterns of hanging nodes on E, which determines the details d(w,x), is also bounded in terms of Λ. As a consequence, the two norms are equivalent, with equivalence constants depending on Λ. Therefore,

    xHEd2(w,x)[[w]]2XE|w|21,E,wXE.

    Since vIEvXE and d(vIEv,x)=d(v,x) for any xHE, we obtain

    xHEd2(v,x)|vIEv|21,E.

    Summing-up over all the elements of the triangulation, we arrive at the following result.

    Lemma 5.3 (global interpolation error vs hierarchical errors). There exists a constant CD>0 depending on Λ but independent of the triangulation T such that

    xHd2(v,x)CD|vITv|2,vVT. (5.6)

    Next, we introduce the interpolation operator

    I0T:VTV0T, (5.7)

    where V0T is defined in (2.8), by the following conditions:

    (I0Tv)(x)=v(x) for all xP,

    μp(E,I0Tv)=μp(E,v) for all 0pk3 and for all ET.

    These conditions uniquely identify I0Tv. Indeed, if xH is generated by a refinement of level j of an edge L (say, x=ζi with the notation introduced before Definition 4.1), then (I0Tv)(x) can be expressed in terms of the values of I0Tv at the k+1 nodes (say, ξn) created at the previous levels of refinement of L, using the same coefficients as in formula (5.5), i.e.,

    (I0Tv)(ζi)=k+1n=1αi,n(I0Tv)(ξn),i=1,,k; (5.8)

    and so on recursively.

    The following result provides a representation of the error ITvI0Tv.

    Lemma 5.4. It holds

    |ITvI0Tv|2xHδ2(v,x),vVT,

    where δ(v,x):=v(x)(I0Tv)(x).

    Proof. Consider an element ET. Recall that by construction it holds μp(E,IEv)=μp(E,v)=μp(E,I0Tv), whence μp(IEvI0Tv,E)=0 for all 0pk3. Consequently,

    |IEvI0Tv|2xPE|(IEvI0Tv)(x)|2.

    If xPE, (IEv)(x)=v(x), hence

    |IEvI0Tv|2xPE|(vI0Tv)(x)|2.

    Summing on all the elements of the partition, we get

    ET|IEvI0Tv|2xN|(vI0Tv)(x)|2xH|(vI0Tv)(x)|2,

    since if xP, (I0Tv)(x)=v(x). This concludes the proof.

    Concatenating Lemmas 5.3 and 5.4, we can prove the second key property of this section.

    Proposition 5.5 (comparison between interpolation operators). Let Tbe Λ-admissible. Then, there exists a constant CI>0, depending on Λ, but independent of T, such that

    |vI0Tv|CI|vITv|,vVT.

    Proof. Given a function vVT, by the triangle inequality

    |vI0Tv|=|vI0Tv|1,T|vITv|1,T+|ITvI0Tv|1,T,

    so it is enough to bound the last norm on the right-hand side. To this end, considering the vectors

    δ=(δ(x))xH:=(δ(v,x))xH,d=(d(x))xH:=(d(v,x))xH,

    and recalling the two Lemmas, the proof can be concluded if we show that

    δl2(H)dl2(H).

    Given xH, assume that it is generated by a refinement of level j of an edge L (say, x=ζi with the notation introduced before Definition 4.1). Writing v:=I0Tv for short, and exploiting formulas (5.4) and (5.5), we get

    δ(ζi)=v(ζi)v(ζi)=v(ζi)k+1n=1αi,nv(ξn)=v(ζi)k+1n=1αi,nv(ξn)k+1n=1αi,n(v(ξn)v(ξn)))=d(ζi)+k+1n=1αi,nδ(ξn). (5.9)

    Thus, we can build a matrix W:l2(H)l2(H) such that δ=Wd, and we just need to prove that

    ||W||21.

    We now organize the hanging nodes with respect to the global index λ[1,ΛT]. Calling Hλ={xH:λ(x)=λ}, and H=1λΛTHλ, the matrix W can be factorized in lower triangular matrices Wλ, that change the nodes of level λ, leaving the others unchanged. In particular,

    W=WΛTWΛT1...W2W1,

    where W1 is just the identity matrix I, whereas each other matrix Wλ differs from the identity only in the rows of block λ. In each of these rows, all entries are zero, but the entries αi,n in the off-diagonal part and 1 on the diagonal. In order to estimate Wλ, we use the Hölder inequality ||Wλ||22||Wλ||1||Wλ||. From the construction of Wλ have that

    ||Wλ||maxn{k+1i=1|αi,n|}+1=:β1,||Wλ||15kmaxi,n|αi,n|+1=:β2,

    where in the last inequality it has been used the fact that a hanging node of global index <λ may appear at most 5 times on the right-hand side of (5.9), since at most five edges meet at a node [5, Proposition 3.2]. These bring us to the following bound

    ||W||22λΛT||Wλ||2(β1β2)Λ12

    and the proof is concluded.

    With the aim of discussing the a posteriori error analysis, and following [12], we define the a posteriori error estimators, starting from the internal residual over an element E, i.e.,

    rT(E;v,D):=fE+(AEΠ0k1v)cEΠ0kv, (6.1)

    for any vVE,k. We highlight that in the case k=1, with piecewise constant data, the diffusion term in the residual vanishes. Furthermore, we define the jump residual over e, where e is an edge shared by two elements E1 and E2 of the partition T, as

    jT(e;v,T):=[[AΠ0k1v]]e=(AE1Π0k1v|E1)n1+(AE2Π0k1v|E2)n2,

    where denotes the unit normal vector to pointing outward with respect to ; we set of . Then, let the local residual estimator associated with be

    (6.2)

    and the global residual estimator as the sum of the local residuals

    In contrast to what has been done for the case , we also need to introduce the virtual inconsistency terms, defined by

    (6.3)

    as well as their sum

    (6.4)

    In this section we present one of the main results of this paper, a stabilization-free a posteriori error bound. In this view, we firstly start by introducing the classical Clément operator upon the space , ; it is defined at the proper nodes on the skeleton of as the average of the target function on the support of the associated basis functions, whereas the internal moments (if any) coincide with those of the target function.

    The scaled Poincaré inequality (Proposition 5.1) and Proposition 5.5 guarantee the validity of the error estimate for . Given these propositions, its proof does not involve the polynomial degree , hence, it does not change with respect to the one presented in [5].

    Lemma 7.1 (Clément interpolation estimate). , it holds

    where the hidden constant depends on but not on .

    We can now prove the following results, which is similar to Theorem 13 in [12], but with a slightly modified proof.

    Proposition 7.2 (upper bound). There exists a constant , independent of , , and , such that

    (7.1)

    Proof. For any , using the definition of Problem (2.2), we have that

    where . The first term can be written as

    The addend can be expressed as

    which can be bounded by using Lemma 7.1,

    On the other hand, noting that

    (7.2)

    and applying again Lemma 7.1 and the stability of the Clément operator in the norm, the addend can be bounded as follows:

    Looking now at the term , we have by Lemma 3.1

    Finally, by taking , we get

    which, using the coercivity of , concludes the proof.

    We now report a bound for the local residual estimator, proved in [12, Theorem 16].

    Proposition 7.3 (local lower bound). There holds

    where . The hidden constant is independent of , , and .

    Summing on all the elements of the partition, we get the following corollary.

    Corollary 7.4 (global lower bound). There exists a constant , independent of , , and , such that

    In the following proposition we present a bound of the stabilization term. We remark that in the case the inconsistency term does not appear.

    Proposition 7.5 (bound of the stabilization term). There exists a constant independent of , and , such that

    (7.3)

    Proof. From the Definition (3.2) of the form and from (3.4), it holds

    Defining , we get

    (7.4)

    We notice that

    (7.5)

    and

    (7.6)

    By substituting (7.5) and (7.6) into (7.4), it results

    With the same strategy used in [5], for any , we get

    where

    Posing now and applying Proposition 5.1, we get

    whereas Proposition 5.5 yields

    so we obtain

    for a suitable constant .

    Combining Propositions 7.2 and 7.5, we arrive at the following key result.

    Corollary 7.6 (stabilization-free a posteriori error upper bound). It holds

    where and .

    Remark 7.7. Note that the chosen stabilization affects the value of the constant , which in principle may depend on the polynomial degree and the geometry of the mesh. However, this dependence is under control; indeed, (i) we are not proposing a -method, so the polynomial degree is fixed, (ii) the refinement procedure is obtained by newest-vertex bisection, which guarantees shape regularity on the refined elements, (iii) Assumption 4.3 enforces an upper bound on the number of hanging nodes on each edge.

    In view of the convergence analysis of the adaptive algorithm , in this section we analyse the effect of refining the partition by applying one or more newest-vertex bisections to some of its elements. Specifically, in Sect. 8.1 we prove that the residual estimator (6.2) is reduced by a fixed fraction (up to an addend proportional to the stabilization term) when the element is split into two elements by one bisection. We prove a similar result for the inconsistency term estimator (6.4), provided a suitable number of bisections is applied to . Next, in Sect. 8.2 we establish a quasi-orthogonality property in the energy norm between the solutions on two partitions, one being a refinement of the other.

    Let us consider an element in which is bisected into elements and ; the refined partition containing these two elements will be denoted by . Given , we notice that is known on , and in particular at the new vertex of and produced by the bisection. Denoting by the new edge, we associate a function to such that , , and for all and for . In the following we will write instead of when no confusion arises.

    Let be defined in (6.2) and be the sum of the local residual estimators on the two newly formed elements, defined as follows:

    where we recall that , We notice that, since does not change under refinement, the functions , and will be denoted again by , and , respectively.

    Lemma 8.1 (local residual estimator reduction). There exist constants and such that for any

    where with .

    Proof. Recalling the Definition (6.1), we have the following residuals

    Writing

    we get, for any ,

    The second term can be bounded by using the inverse inequality and the minimality of as follows:

    while, for the last term, using the Poincaré inequality we have

    Finally, taking an appropriate value of and setting (for instance, if , ) we get

    where is a constant.

    For the jump condition, we will essentially use the proof given in [5, Lemma 5.2]. In particular, we write and for any

    with and . On the new edge we notice that , then,

    We now define ; for any edge , we denote by the element such that . Then,

    where indicates the parent of . Using the trace inequality we have

    Using now the minimality property of and , we easily get as above

    which, for a sufficiently small , concludes the proof.

    From this Lemma and the Lipschitz continuity of the residual estimator with respect to the argument (whose proof is independent of the used polynomial degree, so we refer to [5, Lemma 5.3]), we immediately deduce the following result.

    Proposition 8.2 (residual estimator reduction on refined elements). There exist constants , and independent of such that for any and , and any element which is split into two children , one has

    (8.1)

    Given and , consider the two virtual inconsistency terms and introduced in (6.3). When is bisected into and , the term is reduced by a factor up to an addend proportional to the stabilization term, i.e., there exists such that

    (8.2)

    This stems from the presence of the factor in front of the norm , with an argument similar to the one used in the proof of Lemma 8.1.

    Due to the lack of the factor , a reduction result similar to (8.2) does not hold for . Indeed, since , one may ask whether a constant esists such that

    (8.3)

    Unfortunately, the answer is no, as it can be seen numerically, working on the reference element by affinity and identifying as the largest eigenvalue of a generalized eigenvalue problem. However, the same numerics indicates that if is split into triangles of equal area by successive levels of uniform bisections, then becomes for large enough, as seen in Table 1.

    Table 1.  Value of in (8.3) for different values of the polynomial degree and the level of refinement .
    1.0000 0.3153
    1.0000 0.6648

     | Show Table
    DownLoad: CSV

    This is indeed predicted by the following result.

    Lemma 8.3. Let . For any polynomial degree there exists a minimal and a constant independent of such that, if is partitioned into elements of equal area by levels of uniform newest vertex bisection, it holds

    (8.4)

    Proof. Since by construction , classical approximation results give

    for some constant depending on . Replacing by leaves the left-hand side unchanged, whereas on the right-hand side an inverse inequality yields

    One concludes taking as the smallest integer such that .

    Based on these results, let be a refinement of in which the element has undergone levels of uniform refinements by newest vertex bisection, and has been replaced by subelements . Given , let us set

    Lemma 8.4. There exist constants and such that for any

    Proof. Write

    sum over , and conclude using (8.4) and the usual arguments based on the minimality of the -orthogonal projections.

    Let us set

    with

    Applying a bound similar to (8.2) to the successive level of refinements, we arrive at the following result.

    Lemma 8.5. There exist constants and such that for any

    Combining this estimate with the Lipschitz continuity property of the virtual inconsistency estimator, we obtain the following result.

    Proposition 8.6 (virtual inconsistency estimator reduction on refined elements). There exist constants , and independent of such that for any and , and any element which is split into children , one has

    (8.5)

    Let be the solution of Problem (3.4) on the refined mesh . Hereafter we establish relations between the two energy errors and . The first result follows from Proposition 5.5 and Lemma 3.1; the proof is independent of the used polynomial degree, so we refer to [5, Proposition 5.7].

    Proposition 8.7 (comparison of the energy error under refinement). For any there exists a constant independent of and such that

    Next result extends Corollary 5.8 in [5].

    Proposition 8.8 (quasi-orthogonality of energy errors without stabilization). Given any , there exists such that for any , it holds

    Proof. Let , , , , , , and . From Corollary 7.4 and (2.3), we get while, from Proposition 7.5, Combining them, we have

    Doing the same on and defining

    provided , we get

    Employing Proposition 8.7, we obtain

    If we define ,

    By choosing such that

    (8.6)

    we get

    which concludes the proof by observing that and , when .

    Let us consider a -admissible input mesh , a set of approximated data which consist of piecewise polynomials of degree on , and a tolerance . The call

    produces a -admissible refined mesh and the Galerkin approximation , such as

    where is the solution of Problem (2.2) and , with is defined in (2.3) and in Corollary 7.6. We obtain it by iterating the sequence

    At each step, a admissible mesh and the associated solution of the discrete Problem (3.4) are produced. The process stops when the condition is reached.

    In particular, the modules are defined as follows:

    produces the solution of Problem (3.4) with data ;

    computes the local estimators on ;

    implements the Dörfler criterion [15] and finds an almost minimal set of elements in such that

    (9.1)

    for a given parameter ;

    returns a -admissible refined mesh obtained from by suitable newest-vertex bisections of the elements in , and possibly of other elements to fullfil the -admissibility condition.

    It is worth adding some details about the procedure . Let be an element marked for refinement. For simplicity, hereafter let us set and . The refinement of is performed as follows:

    ● If , then is bisected once;

    ● If , then is bisected -times, where has been introduced in Section 8.1.2 (see Lemma 8.3).

    Denote by the partition of so obtained, and set and Then, recalling Lemmas 8.1 and 8.5, one gets when

    Indeed, can be written as for a certain and

    In the case ,

    In all cases, it holds

    (9.2)

    which shows that in each marked element the sum of the two estimators is reduced under refinement, up to the stabilization term. Note that for values or of the polynomial degree of practical use, two bisections () are enough when .

    This refinement may create non-admissible hanging nodes, i.e., hanging nodes with global index larger than . To remove them and guarantee -admissibility of , further refinements should be applied. For the realization of this technical part, we refer to Section 11.1 in [6].

    The following section proves the convergence of the algorithm.

    Proposition 10.1 (global estimators reduction). Let be the solution of the discrete variational Problem (3.4). There exist constants and independent of such that, if is the refinement of obtained by applying , one has for any

    (10.1)

    Proof. One can reach the conclusion e.g., as in [5, proof of Proposition 5.5], using the bound (9.2) in each element marked for refinement.

    Theorem 10.2 (contraction property of ). Let be the set of the marked elements relative to the solution of the discrete variational Problem (3.4). If is the refinement of obtained by applying , then for sufficiently large there exist and , such that

    Proof. To simplify notation, we set again , , , , , , , and . From Proposition 8.8,

    whereas using Proposition 10.1 and Proposition 7.5, we get

    Combining them, we get

    which suggests choosing such that

    (10.2)

    Next, we write

    and we invoke Corollary 7.6 to write

    which gives

    We now choose and such that

    which holds true if

    (10.3)

    (recall that we already assumed ). Similarly, we choose and such that

    which holds true if satisfies the first condition in (10.3), whereas satisfies

    (10.4)

    This proves the result, if we define , with defined by (10.2) and , and

    (10.5)

    The conditions on and which lead to the desired estimate are given in (8.6), (10.3) and (10.4).

    The aim of this numerical test is to confirm the convergence of our algorithm. We consider a classical test with an shaped domain and the reaction-diffusion problem (2.1), with polynomial coefficients of order one for the case , i.e.,

    and polynomials of order two for the case ,

    The forcing term and the Dirichlet boundary conditions are chosen so that the solution of the problem results

    (11.1)

    where and are the polar coordinates. It is possible to prove that there exists a with such that when , and when , where and indicate respectively Sobolev and Lipschitz spaces. Then, according to the theory of approximation classes [16,17], we expect the maximal rate of convergence, i.e., , where is the number of the degrees of freedom. We apply the adaptive algorithm as described in Section 9 and for the marking strategy (9.1) we consider . In order to compute the VEM error, we consider the computable quantity:

    In Figure 6, we represent the evolution of and the estimator terms and , which confirms the results of Corollary 7.6. Furthermore, we notice that after a transient phase, the error and the estimator terms decays reach asymptotically the theoretical optimal rate (for the case ) and (for the case ). In Figure 7, we depict the meshes after 20, 35 and 50 loops of the adaptive algorithm in the case . We highlight the presence of hanging nodes in the different meshes loops.

    Figure 6.  (red), the residual type term (blue), the inconsistency term (green), and the expected optimal decay (dashed) in the case (a) and (b).
    Figure 7.  The partition of the domain after 20 loops (first), 35 loops (second), and 50 loops (third) of the adaptive algorithm of order .

    In this paper, we presented an adaptive VEM of order on nonconforming triangular meshes. In the analysis, the space of continuous, piecewise polynomials functions of degree on the triangulation plays a fundamental role. Indeed, it is contained in the global VEM space, , and guarantees a quasi-orthogonality property for any refinement of , since . By pivoting on this space, we proved an a posteriori error estimate which does not contain the stabilization term appearing in the VEM discrete formulation. Consequently, we established the convergence of the adaptive VEM algorithm, by a contraction argument.

    Extensions of our work include:

    ● The complexity and optimality analysis of the two step algorithm AVEM mentioned in the Introduction to account for non-polynomial data;

    ● The study of a variant of the adaptive algorithm in which the polynomial degree may take large values, in the spirit of a -version;

    ● The treatment of more general polygonal meshes which, as remarked in [5], seems non-trivial. The main difficulties lay in the choice of a suitable refinement strategy in replacement of the newest-vertex bisection used here, and in the lack of a conforming space for general polygonal meshes.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors performed this research in the framework of the Italian MIUR Award "Dipartimenti di Eccellenza 2018-2022" granted to the Department of Mathematical Sciences, Politecnico di Torino (CUP: E11G18000350001). CC was partially supported by the Italian MIUR through the PRIN grant 201752HKH8; DF thanks the INdAM-GNCS project "Metodi numerici per lo studio di strutture geometriche parametriche complesse" (CUP: E53C22001930001). The authors are members of the Italian INdAM-GNCS research group.

    The authors declare no conflicts of interest.



    [1] E. Diday, The symbolic approach in clustering and related methods of data analysis, classification and related methods of data analysis, in Proceedings of the first Conference of the Federation of the classification societies. North Holland, 1988.
    [2] L. Billard, E. Diday, Regression analysis for interval-valued data, in Data Analysis, Classification, and Related Methods, Springer, (2000), 369–374.
    [3] L. Billard, E. Diday, Symbolic regression analysis, in Classification, Clustering, and Data Analysis: Recent Advances and Applications, Springer, (2002), 281–288.
    [4] E. d. A. L. Neto, F. D. A. De Carvalho, Centre and range method for fitting a linear regression model to symbolic interval data, Comput. Stat. Data Anal., 52 (2008), 1500–1515. https://doi.org/10.1016/j.csda.2007.04.014 doi: 10.1016/j.csda.2007.04.014
    [5] L. Kong, X. Gao, A regularized MM estimate for interval-valued regression, Expert Syst. Appl., 238 (2024), 122044. https://doi.org/10.1016/j.eswa.2023.122044 doi: 10.1016/j.eswa.2023.122044
    [6] M. Xu, Z. Qin, A bivariate bayesian method for interval-valued regression models, Knowl.-Based Syst., 235 (2022), 107396. https://doi.org/10.1016/j.knosys.2021.107396 doi: 10.1016/j.knosys.2021.107396
    [7] U. Beyaztas, H. L. Shang, A. S. G. Abdel-Salam, Functional linear models for interval-valued data, Commun. Stat.-Simul. Comput., 51 (2022), 3513–3532. https://doi.org/10.1080/03610918.2020.1714662 doi: 10.1080/03610918.2020.1714662
    [8] Q. Zhao, H. Wang, S. Wang, Robust regression for interval-valued data based on midpoints and log-ranges, Adv. Data Anal. Classif., 17 (2023), 583–621. https://doi.org/10.1007/s11634-022-00518-2 doi: 10.1007/s11634-022-00518-2
    [9] L. C. Lin, H. L. Chien, S. Lee, Symbolic interval-valued data analysis for time series based on auto-interval-regressive models, Stat. Method. Appl., 30 (2021), 295–315. https://doi.org/10.1007/s10260-020-00525-7 doi: 10.1007/s10260-020-00525-7
    [10] J. Zhang, M. Liu, M. Dong, Variational bayesian inference for interval regression with an asymmetric laplace distribution, Neurocomputing, 323 (2019), 214–230. https://doi.org/10.1016/j.neucom.2018.09.083 doi: 10.1016/j.neucom.2018.09.083
    [11] C. Yang, Interval riccati equation-based and non-probabilistic dynamic reliability-constrained multi-objective optimal vibration control with multi-source uncertainties, J. Sound Vibr., 595 (2025), 118742. https://doi.org/10.1016/j.jsv.2024.118742 doi: 10.1016/j.jsv.2024.118742
    [12] C. Yang, Y. Liu, H. Gao, Reliability-constrained uncertain spacecraft sliding mode attitude tracking control with interval parameters, IEEE Trans. Aerosp. Electron. Syst., 61 (2025), 1–14. https://doi.org/10.1109/TAES.2025.3529798 doi: 10.1109/TAES.2025.3529798
    [13] A. F. Galvao Jr, Quantile regression for dynamic panel data with fixed effects, J. Econom., 164 (2011), 142–157. https://doi.org/10.1016/j.jeconom.2011.02.016 doi: 10.1016/j.jeconom.2011.02.016
    [14] E. Aristodemou, Semiparametric identification in panel data discrete response models, J. Econom., 220 (2021), 253–271. https://doi.org/10.1016/j.jeconom.2020.04.002 doi: 10.1016/j.jeconom.2020.04.002
    [15] B. H. Beyaztas, S. Bandyopadhyay, Robust estimation for linear panel data models, Stat. Med., 39 (2020), 4421–4438. https://doi.org/10.1002/sim.8732 doi: 10.1002/sim.8732
    [16] J. Bai, S. H. Choi, Y. Liao, Feasible generalized least squares for panel data with cross-sectional and serial correlations, Empir. Econ., 60 (2021), 309–326. https://doi.org/10.1007/s00181-020-01977-2 doi: 10.1007/s00181-020-01977-2
    [17] B. H. Baltagi, D. Li, Prediction in the panel data model with spatial correlation, in Advances in Spatial Econometrics: Methodology, Tools and Applications, Springer, (2004), 283–295.
    [18] J. P. Elhorst, Spatial panel data models, in Spatial Econometrics: From Cross-Sectional Data to Spatial Panels, Springer, (2014), 37–93.
    [19] Y. Zhang, J. Jiang, Y. Feng, Penalized quantile regression for spatial panel data with fixed effects, Commun. Stat.-Theory Methods, 52 (2023), 1287–1299. https://doi.org/10.1080/03610926.2021.1934028 doi: 10.1080/03610926.2021.1934028
    [20] A. Ji, J. Zhang, X. He, Y. Zhang, Fixed effects panel interval-valued data models and applications, Knowl.-Based Syst., 237 (2022), 107798. https://doi.org/10.1016/j.knosys.2021.107798 doi: 10.1016/j.knosys.2021.107798
    [21] J. Zhang, Q. Li, B. Wei, A. Ji, Robust estimation method for panel interval-valued data model with fixed effects, J. Stat. Comput. Simul., 94 (2024), 3230–3251. https://doi.org/10.1080/00949655.2024.2381491 doi: 10.1080/00949655.2024.2381491
    [22] A. Ji, J. Zhang, Y. Cao, Bivariate maximum likelihood method for fixed effects panel interval-valued data models, Comput. Econ., 64 (2024), 1–28. https://doi.org/10.1007/s10614-024-10737-8 doi: 10.1007/s10614-024-10737-8
    [23] K. Y. Liang, S. L. Zeger, Longitudinal data analysis using generalized linear models, Biometrika, 73 (1986), 13–22. https://doi.org/10.1093/biomet/73.1.13 doi: 10.1093/biomet/73.1.13
    [24] M. Crowder, On consistency and inconsistency of estimating equations, Econom. Theory, 2 (1986), 305–330. https://doi.org/10.1017/S0266466600011646 doi: 10.1017/S0266466600011646
    [25] R. M. Balan, I. S. Kratina, Asymptotic results with generalized estimating equations for longitudinal data, Ann. Stat., 33 (2005), 522–541. https://doi.org/10.1214/009053604000001255 doi: 10.1214/009053604000001255
    [26] L. Wang, Gee analysis of clustered binary data with diverging number of covariates, Ann. Stat., 39 (2011), 389–417. https://doi.org/10.1214/10-AOS846 doi: 10.1214/10-AOS846
    [27] Y. G. Wang, V. Carey, Working correlation structure misspecification, estimation and covariate design: implications for generalised estimating equations performance, Biometrika, 90 (2003), 29–41. https://doi.org/10.1093/biomet/90.1.29 doi: 10.1093/biomet/90.1.29
    [28] W. Pan, Model selection in estimating equations, Biometrics, 57 (2001), 529–534. https://doi.org/10.1111/j.0006-341X.2001.00529.x doi: 10.1111/j.0006-341X.2001.00529.x
    [29] M. Wang, Generalized estimating equations in longitudinal data analysis: a review and recent developments, Adv. Stat., 2014 (2014), 303728. https://doi.org/10.1155/2014/303728 doi: 10.1155/2014/303728
    [30] S. Seaman, A. Copas, Doubly robust generalized estimating equations for longitudinal data, Stat. Med., 28 (2009), 937–955. https://doi.org/10.1002/sim.3520 doi: 10.1002/sim.3520
    [31] N. R. Chaganty, An alternative approach to the analysis of longitudinal data via generalized estimating equations, J. Stat. Plan. Infer., 63 (1997), 39–54. https://doi.org/10.1016/S0378-3758(96)00203-0} doi: 10.1016/S0378-3758(96)00203-0
    [32] N. R. Chaganty, J. Shults, On eliminating the asymptotic bias in the quasi-least squares estimate of the correlation parameter, J. Stat. Plan. Infer., 76 (1999), 145–161. https://doi.org/10.1016/S0378-3758(98)00180-3 doi: 10.1016/S0378-3758(98)00180-3
    [33] C. Hu, L. T. He, An application of interval methods to stock market forecasting, Reliab. Comput., 13 (2007), 423–434. https://doi.org/10.1007/s11155-007-9039-4 doi: 10.1007/s11155-007-9039-4
  • This article has been cited by:

    1. Haitao Yu, Chaofan Wang, Kai Li, Jiang Wang, Chen Liu, 2022, Resonance Dynamics and Latent Manifolds in Cortical Neural Networks with Temporal Interference Stimulation, 978-988-75815-3-6, 5717, 10.23919/CCC55666.2022.9902309
    2. Robert Friedman, Higher Cognition: A Mechanical Perspective, 2022, 2, 2673-8392, 1503, 10.3390/encyclopedia2030102
    3. Robert Friedman, All Is Perception, 2022, 14, 2073-8994, 1713, 10.3390/sym14081713
    4. Robert Friedman, Geometry-Based Deep Learning in the Natural Sciences, 2023, 3, 2673-8392, 781, 10.3390/encyclopedia3030056
    5. Robert Friedman, Large Language Models and Logical Reasoning, 2023, 3, 2673-8392, 687, 10.3390/encyclopedia3020049
  • Reader Comments
  • © 2025 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(127) PDF downloads(10) Cited by(0)

Figures and Tables

Figures(4)  /  Tables(10)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog