Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
Research article

Virtual Reality Technology: Analysis based on text and opinion mining

  • Received: 16 January 2022 Revised: 24 March 2022 Accepted: 02 May 2022 Published: 26 May 2022
  • The purpose of this research is to highlight the importance of periodically analyzing the data obtained from the technological sources used by customers, such as user comments on social networks and videos, using qualitative data analysis software. This research analyzes user sentiments, words, and opinions about virtual reality (VR) videos on YouTube in order to explore user reactions to such videos, as well as to establish whether this technology contributes to the sustainability of natural environments. User-generated data can provide important information for decision making about future policies of companies that produce video content. The results of our analysis of 12 videos revealed that users predominantly perceived these videos positively. This conclusion was supported by the findings of an opinion and text analysis, which identified positive reviews for videos and channels with many followers and large numbers of visits. The features such as the quality of the video and the accessibility of technology were appreciated by the viewers, whereas videos that are 100% VR and require special glasses to view them do not have as many visits. However, VR was seen to be a product which viewers were interested in and, according to Google, there are an increasing number of searches and sales of VR glasses in holiday seasons. Emotions of wonder and joy are more evident than emotions of anger or frustration, so positive feelings can be seen to be predominant.

    Citation: Pedro R. Palos Sánchez, José A. Folgado-Fernández, Mario Alberto Rojas Sánchez. Virtual Reality Technology: Analysis based on text and opinion mining[J]. Mathematical Biosciences and Engineering, 2022, 19(8): 7856-7885. doi: 10.3934/mbe.2022367

    Related Papers:

    [1] John D. Towers . An explicit finite volume algorithm for vanishing viscosity solutions on a network. Networks and Heterogeneous Media, 2022, 17(1): 1-13. doi: 10.3934/nhm.2021021
    [2] Boris Andreianov, Kenneth H. Karlsen, Nils H. Risebro . On vanishing viscosity approximation of conservation laws with discontinuous flux. Networks and Heterogeneous Media, 2010, 5(3): 617-633. doi: 10.3934/nhm.2010.5.617
    [3] Giuseppe Maria Coclite, Carlotta Donadello . Vanishing viscosity on a star-shaped graph under general transmission conditions at the node. Networks and Heterogeneous Media, 2020, 15(2): 197-213. doi: 10.3934/nhm.2020009
    [4] Markus Musch, Ulrik Skre Fjordholm, Nils Henrik Risebro . Well-posedness theory for nonlinear scalar conservation laws on networks. Networks and Heterogeneous Media, 2022, 17(1): 101-128. doi: 10.3934/nhm.2021025
    [5] Giuseppe Maria Coclite, Nicola De Nitti, Mauro Garavello, Francesca Marcellini . Vanishing viscosity for a 2×2 system modeling congested vehicular traffic. Networks and Heterogeneous Media, 2021, 16(3): 413-426. doi: 10.3934/nhm.2021011
    [6] Karoline Disser, Matthias Liero . On gradient structures for Markov chains and the passage to Wasserstein gradient flows. Networks and Heterogeneous Media, 2015, 10(2): 233-253. doi: 10.3934/nhm.2015.10.233
    [7] Wen Shen . Traveling wave profiles for a Follow-the-Leader model for traffic flow with rough road condition. Networks and Heterogeneous Media, 2018, 13(3): 449-478. doi: 10.3934/nhm.2018020
    [8] Giuseppe Maria Coclite, Lorenzo di Ruvo, Jan Ernest, Siddhartha Mishra . Convergence of vanishing capillarity approximations for scalar conservation laws with discontinuous fluxes. Networks and Heterogeneous Media, 2013, 8(4): 969-984. doi: 10.3934/nhm.2013.8.969
    [9] Abraham Sylla . Influence of a slow moving vehicle on traffic: Well-posedness and approximation for a mildly nonlocal model. Networks and Heterogeneous Media, 2021, 16(2): 221-256. doi: 10.3934/nhm.2021005
    [10] Christophe Chalons, Paola Goatin, Nicolas Seguin . General constrained conservation laws. Application to pedestrian flow modeling. Networks and Heterogeneous Media, 2013, 8(2): 433-463. doi: 10.3934/nhm.2013.8.433
  • The purpose of this research is to highlight the importance of periodically analyzing the data obtained from the technological sources used by customers, such as user comments on social networks and videos, using qualitative data analysis software. This research analyzes user sentiments, words, and opinions about virtual reality (VR) videos on YouTube in order to explore user reactions to such videos, as well as to establish whether this technology contributes to the sustainability of natural environments. User-generated data can provide important information for decision making about future policies of companies that produce video content. The results of our analysis of 12 videos revealed that users predominantly perceived these videos positively. This conclusion was supported by the findings of an opinion and text analysis, which identified positive reviews for videos and channels with many followers and large numbers of visits. The features such as the quality of the video and the accessibility of technology were appreciated by the viewers, whereas videos that are 100% VR and require special glasses to view them do not have as many visits. However, VR was seen to be a product which viewers were interested in and, according to Google, there are an increasing number of searches and sales of VR glasses in holiday seasons. Emotions of wonder and joy are more evident than emotions of anger or frustration, so positive feelings can be seen to be predominant.



    This paper proposes an explicit finite volume scheme for first-order scalar conservation laws on a network having a single junction. The algorithm and analysis extend readily to networks with multiple junctions, due to the finite speed of propagation of the solutions of conservation laws. For the sake of concreteness, we view the setup as a model of traffic flow, with the vector of unknowns representing the vehicle density on each road. A number of such scalar models have been proposed, mostly differing in how the junction is modeled. An incomplete list of such models can be found in [4,5,6,7,8,11,12,13,14,15,16,18,19]. In this paper we focus on the so-called vanishing viscosity solution proposed and analyzed in [7] and [2]. The junction has m incoming and n outgoing roads. With uh denoting the density of vehicles on road h, and fh() denoting the flux on road h, on each road traffic evolves according to the Lighthill-Witham-Richards model

    tuh+xfh(uh)=0,h=1,,m+n. (1.1)

    Incoming roads are indexed by i{1,,m}, and outgoing roads by j{m+1,m+n}. Each road has a spatial domain denoted by Ωh, where Ωi=(,0) for i{1,,m} and Ωj=(0,) for j{m+1,m+n}. The symbol Γ is used to denote the spatial domain defined by the network of roads, and L(Γ×R+;[0,R]m+n) denotes the set of vectors u=(u1,,um+n) of functions satisfying

    uiL(R×R+;[0,R]),i{1,,m},ujL(R+×R+;[0,R]),j{m+1,,m+n}. (1.2)

    Following [2] we make the following assumptions concerning the fluxes fh.

    (A.1) For each h{1,,m+n}, fhLip([0,R];R+), and fhLh. Each fh satisfies fh(0)=fh(R)=0 and is unimodal (bell-shaped), meaning that for some ˉuh(0,R) fh(u)(ˉuhu)>0 for a.e. u[0,R].

    (A.2) For each h{1,,m+n}, fh is not linearly degenerate, meaning that fh is not constant on any nontrivial subinterval of [0,R].

    The study of vanishing viscosity solutions on a network was initiated by Coclite and Garavello [7], who proved that vanishing viscosity solutions converge to weak solutions if n=m and all of the fluxes fh are the same. Andreianov, Coclite and Donadello [2] proved well-posedness of the more general problem discussed in this paper, relying upon a generalization of recent results concerning conservation laws with discontinuous flux [1,3].

    For the convenience of the reader, and to establish notation, we review some relevant portions of the theory of network vanishing viscosity solutions, as described in [2], where we refer the reader for a more complete development. Let Gh(,) denote the Godunov flux associated with fh():

    Gh(β,α)={min (1.3)

    (Compared to [2], we list the arguments \alpha , \beta of G_h in reversed order.) Note that G_h is consistent, i.e., G_h(\alpha, \alpha) = f_h(\alpha) . Also, G_h(\cdot, \cdot) is a nonincreasing (nondecreasing) function of its first (second) argument, is Lipschitz continuous with respect to each argument, i.e., for \alpha, \beta \in [0, R] there exists L_h >0 such that

    \begin{equation} -L_h \le \partial G_h(\beta, \alpha)/\partial \beta \le 0, \quad 0\le \partial G_h(\beta, \alpha)/\partial \alpha \le L_h, \quad h \in \{1, \ldots, m+n\}. \end{equation} (1.4)

    Definition 1.1 (Vanishing viscosity germ [2]). The vanishing viscosity germ \mathcal{G}_{VV} is the subset of [0, R]^{m+n} consisting of vectors \vec{u} = (u_1, \ldots, u_{m+n}) such that for some p_{ \vec{u}} \in [0, R] there holds

    \begin{equation} \begin{split} &\sum\limits_{i = 1}^m G_i(p_{ \vec{u}}, u_i) = \sum\limits_{j = m+1}^{m+n} G_j(u_j, p_{ \vec{u}}), \\ &G_i(p_{ \vec{u}}, u_i) = f_i(u_i), \quad i = 1, \ldots, m, \\ &G_j(u_j, p_{ \vec{u}}) = f_j(u_j), \quad j = m+1, \ldots, m+n. \end{split} \end{equation} (1.5)

    The definition of entropy solution requires one-sided traces along the half-line x = 0 in \mathbb{R} \times \mathbb{R}_+ . Thanks to Assumption A.2, the existence of strong traces at x = 0 in the L^1_{ \text{loc}} sense is guaranteed [20]. The traces are denoted

    \begin{equation} \begin{split} &\gamma_i u_i(\cdot) = u_i(\cdot, 0^-), \quad i \in \{1, \ldots, m \}, \\ &\gamma_j u_j(\cdot) = u_j(\cdot, 0^+), \quad j \in \{m+1, \ldots, m+n \}. \end{split} \end{equation} (1.6)

    Definition 1.2 ( \mathcal{G}_{VV} -entropy solution [2]). Define q_h: [0, R]^2 \rightarrow \mathbb{R} :

    \begin{equation} q_h(v, w) = \mathrm{sign}(v-w)\left(f_h(v)-f_h(w) \right), \quad h = 1, \ldots, m+n. \end{equation} (1.7)

    Given an initial condition \vec{u}_0 \in L^{\infty}(\Gamma; [0, R]^{m+n}) , a vector \vec{u} = (u_1, \ldots, u_{m+n}) in L^{\infty}(\Gamma \times \mathbb{R}_+; [0, R]^{m+n}) is a \mathcal{G}_{VV} entropy solution associated with \vec{u}_0 if it satisfies the following conditions:

    ● For each h \in \{1, \ldots, m+n\} , each c \in [0, R] , and any test function \xi \in \mathcal{D}(\Omega_h \times \mathbb{R}; \mathbb{R}_+) ,

    \begin{align} \int_{ \mathbb{R}_+} \int_{\Omega_h} \Bigl(\left|{u_h-c}\right| \partial_t \xi + q_h(u_h, c)\partial_x \xi \Bigr)\, dx\, dt + \int_{\Omega_h} \left|{u_{h, 0}-c}\right| \xi(x, 0) \, dx \geq 0. \end{align} (1.8)

    ● For a.e. t \in \mathbb{R}_+ , the vector of traces at the junction

    \gamma \vec{u}(t): = (\gamma_1u_1(t), \ldots, \gamma_{m+n} u_{m+n}(t)) belongs to \mathcal{G}_{VV} .

    Associated with each \vec{k} \in \mathcal{G}_{VV} , and allowing for a slight abuse of notation, one defines a road-wise constant stationary solution \vec{k}(x) via

    \begin{equation} k_h(x) = k_h, \quad x \in \Omega_h, \quad h \in \{1, \ldots, m+n\}. \end{equation} (1.9)

    It is readily verified that viewed in this way, k_h is a \mathcal{G}_{VV} -entropy solution. In fact all road-wise constant stationary solutions that are \mathcal{G}_{VV} -entropy solutions are associated with a \vec{k} \in \mathcal{G}_{VV} in this manner.

    Definition 1.2 reveals the relationship between the set \mathcal{G}_{VV} and \mathcal{G}_{VV} -entropy solutions, and is well-suited to proving uniqueness of solutions. On the other hand, Definition 1.3 below is equivalent (Theorem 2.11 of [2]), and is better suited to proving that the limit of finite volume approximations is a \mathcal{G}_{VV} -entropy solution.

    Definition 1.3 ( \mathcal{G}_{VV} -entropy solution [2]). Given an initial condition \vec{u}_0 \in L^{\infty}(\Gamma; [0, R]^{m+n}) , a vector \vec{u} = (u_1, \ldots, u_{m+n}) in L^{\infty}(\Gamma \times \mathbb{R}_+; [0, R]^{m+n}) is a \mathcal{G}_{VV} entropy solution associated with u_0 if it satisfies the following conditions:

    ● The first item of Definition 1.2 holds.

    ● For any \vec{k} \in \mathcal{G}_{VV} , \vec{u} satisfies the following Kružkov-type entropy inequality:

    \begin{equation} \sum\limits_{h = 1}^{m+n} \left(\int_{ \mathbb{R}_+} \int_{\Omega_h} \left\{\left|{u_h - k_h }\right|\xi_t + q_h(u_h, k_h)\xi_x\right\} \, dx \, dt \right) \ge 0 \end{equation} (1.10)

    for any nonnegative test function \xi \in \mathcal{D}( \mathbb{R} \times (0, \infty)) .

    Theorem 1.4 (Well posedness [2]). Given any initial datum

    \begin{equation} \vec{u}_0 = (u_{1, 0}, \ldots, u_{m+n, 0}) \in L^{\infty}(\Gamma; [0, R]^{m+n}), \end{equation} (1.11)

    there exists one and only one \mathcal{G}_{VV} -entropy solution \vec{u} \in L^{\infty}(\Gamma\times \mathbb{R}_+;[0, R]^{m+n}) in the sense of Definition 1.2.

    In addition to the results above, reference [2] also includes a proof of existence of the associated Riemann problem. Based on the resulting Riemann solver, a Godunov finite volume algorithm is constructed in [2], which handles the interface in an implicit manner. This requires the solution of a single nonlinear equation at each time step. The resulting finite volume scheme generates approximations that are shown to converge to the unique \mathcal{G}_{VV} -entropy solution. Reference [21] validates the algorithm by comparing finite volume approximations with exact solutions of a collection of Riemann problems.

    The main contribution of the present paper is an explicit version of the finite volume scheme of [2]. It differs only in the processing of the junction. We place an artificial grid point at the junction, which is assigned an artificial density. The artificial density is evolved from one time level to the next in an explicit manner. Thus a nonlinear equation solver is not required. (However, we found that in certain cases accuracy can be improved by processing the junction implicitly on the first time step.) Like the finite volume scheme of [2], the new algorithm has the order preservation property and is well-balanced. This makes it possible to employ the analytical framework of [2], resulting in a proof that the approximations converge to the unique entropy solution of the associated Cauchy problem.

    In Section 2 we present our explicit finite volume scheme and prove convergence to a \mathcal{G}_{VV} -entropy solution. In Section 3 we discuss numerical experience with the new scheme, including one example. Appendix A contains a proof that a fixed point algorithm introduced in Section 2 converges.

    For a fixed spatial mesh size {\Delta} x , define the grid points x_0 = 0 and

    \begin{equation} \begin{split} &x_{\ell} = (\ell + 1/2) {\Delta} x, \quad \ell \in \{\ldots, -2, -1\}, \\ &x_{\ell} = (\ell - 1/2) {\Delta} x, \quad \ell \in \{1, 2, \ldots\}. \end{split} \end{equation} (2.1)

    Each road \Omega_h is discretized according to

    \begin{equation} \begin{split} &\Omega_i = \bigcup\limits_{\ell \le -1} I_\ell, \quad I_\ell : = (x_\ell - {\Delta} x/2, x_\ell + {\Delta} x/2] ~\text{ for}~ \ell \le -1 , \\ &\Omega_j = \bigcup\limits_{\ell \ge 1} I_\ell, \quad I_\ell : = [x_\ell - {\Delta} x/2, x_\ell + {\Delta} x/2) ~\text{for }~ \ell \ge 1 . \end{split} \end{equation} (2.2)

    Our discretization of the spatial domain \Gamma is identical to that of [2], but differs slightly in appearance since we prefer to use whole number indices for cell centers and fractional indices for cell boundaries. We use the following notation for the finite volume approximations:

    \begin{equation} \begin{split} &U_{\ell}^{h, s} \approx u_h(x_\ell, t^s), \quad \ell \in \mathbb{Z} \setminus \{0\}, \\ &P^s \approx p_{\gamma \vec{u}(t^s)}. \end{split} \end{equation} (2.3)

    We are somewhat artificially assigning a density, namely P^s , to the single grid point x_0 = 0 where the junction is located. We view the junction as a grid cell with width zero. We advance P^s from one time level to the next in an explicit manner, without requiring a nonlinear equation solver. This is the novel aspect of our finite volume scheme.

    Remark 1. We make the association P^s \approx p_{\gamma \vec{u}(t^s)} because it is conceptually helpful. In fact, it is justified in the special case of a stationary solution of the scheme associated with \vec{k} \in \mathcal{G}_{VV} ; see the proof of Lemma 2.3. However, we do not attempt to prove that P^s \rightarrow p_{\gamma \vec{u}(t^s)} when {\Delta} \rightarrow 0 . Fortunately, the convergence proof does not rely on pointwise convergence of P^s as {\Delta} \rightarrow 0 .

    The initial data are initialized via

    \begin{equation} \begin{split} &U^{h, 0}_{\ell} = {1\over {\Delta} x} \int_{I_{\ell}} u_{h, 0}(x) \, dx, \quad h \in \{1, \ldots, m+n \}, \\ &P^0 \in [0, R]. \end{split} \end{equation} (2.4)

    Note that P^0 can be any conveniently chosen value lying in [0, R] (but see Remark 3 and Section 3). Recall that (2.3) introduced U_{\ell}^{h, s} only for \ell \in \mathbb{Z} \setminus \{0\} . We can simplify some of the formulas that follow by defining U_0^{h, s} = P^s for each h\in \{1, \dots, m+n\} . The finite volume scheme then advances the approximations from time level s to time level s+1 according to

    \begin{equation} \left\{ \begin{split} &P^{s+1} = P^s - \lambda \left(\sum\limits_{j = m+1}^{m+n} G_j(U_{1}^{j, s}, P^s) - \sum\limits_{i = 1}^m G_i(P^s, U_{-1}^{i, s}) \right), \\ &U_\ell^{i, s+1} = U_\ell^{i, s} - \lambda \left(G_i(U_{\ell+1}^{i, s}, U_{\ell}^{i, s}) - G_i(U_{\ell}^{i, s}, U_{\ell-1}^{i, s}) \right), \quad i \in \{1, \ldots, m \}, \, \, \ell \le -1, \\ &U_\ell^{j, s+1} = U_\ell^{j, s} - \lambda \left(G_j(U_{\ell+1}^{j, s}, U_{\ell}^{j, s}) - G_j(U_{\ell}^{j, s}, U_{\ell-1}^{j, s}) \right), \quad j \in \{m+1, \ldots, m+n \}, \\ & \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \, \, \ell \ge 1.\\ \end{split} \right. \end{equation} (2.5)

    Define \lambda = {\Delta} t /{\Delta} x . When taking the limit {\Delta} : = ({\Delta} x, {\Delta} t) \rightarrow 0 , we assume that \lambda is fixed. Let L = \max\{L_h | h \in \{1, \ldots, m+n \} \} . In what follows we assume that the following CFL condition is satisfied:

    \begin{equation} \lambda (m+n) L\le 1. \end{equation} (2.6)

    If all of the f_h are the same, i.e., f_h(\cdot) = f(\cdot) for all h \in \{1, \ldots, m+n\} , then (2.6) can be replaced by the following less restrictive condition (see Remark 6):

    \begin{equation} \lambda \max(m, n) L\le 1. \end{equation} (2.7)

    Remark 2. The algorithm (2.5) is an explicit version of the scheme of [2]. To recover the scheme of [2] from (2.5), one proceeds as follows:

    ● first substitute P^s for P^{s+1} in the first equation of (2.5), and solve the resulting equation for P^s (the implicit part of the algorithm of [2]),

    ● then advance each U^{h, s} to the next time level using the second and third equations of (2.5) (recalling the notational convention U^{h, s}_0 = P^s ).

    The equation mentioned above (after substituting P^s for P^{s+1} ) is clearly equivalent to

    \begin{equation} \sum\limits_{j = m+1}^{m+n} G_j(U_{1}^{j, s}, P^s) = \sum\limits_{i = 1}^m G_i(P^s, U_{-1}^{i, s}). \end{equation} (2.8)

    The implicit portion of the scheme of [2] consists of solving (2.8) for the unknown P^s . Lemma 2.3 of [2] guarantees that this equation has a solution, which can be found using, e.g., regula falsi.

    Remark 3. The convergence of the scheme (2.5) is unaffected by the choice of P^0 , as long as it lies in [0, R] . However the choice of P^0 does affect accuracy, see Section 3. We found that accurate results are obtained when P^0 is a solution to the s = 0 version of (2.8). We also found this solution can be conveniently approximated by iterating the first equation of (2.5), i.e.,

    \begin{equation} P^{0}_{\nu+1} = P^0_\nu - \lambda \left(\sum\limits_{j = m+1}^{m+n} G_j(U_{1}^{j, 0}, P^0_\nu) - \sum\limits_{i = 1}^m G_i(P^0_\nu, U_{-1}^{i, 0}) \right). \end{equation} (2.9)

    Moreover, we found that this same fixed point iteration approach is a convenient way to solve (2.8) when implementing the implicit scheme of [2]. From this point of view the algorithm of this paper and the algorithm of [2] only differ in whether the first equation of (2.5) is iterated once, or iterated to (approximate) convergence. See Appendix A for a proof that the iterative scheme (2.9) converges to a solution of (2.8).

    Remark 4. The CFL condition associated with the finite volume scheme of [2] is

    \begin{equation} \lambda L \le 1/2. \end{equation} (2.10)

    As soon as there are more than a few roads impinging on the junction, our CFL condition (2.6) imposes a more severe restriction on the allowable time step, which becomes increasingly restrictive as more roads are included. One could view this as the price to be paid for the simplified processing of the junction. On the other hand, most of the specific examples discussed in the literature are limited to \max(m, n) = 2 . In that case, if also all of the f_h are the same, then (2.7) and (2.10) are equivalent. Finally, at the cost of some additional complexity, one could use a larger spatial mesh adjacent to the junction, which would allow for larger time steps. We do not pursue that here.

    Let \chi_{\ell}(x) denote the characteristic function of the spatial interval I_{\ell} , and let \chi^s(t) denote the characteristic function of the temporal interval [s {\Delta} t, (s+1){\Delta} t) . We extend the grid functions to functions defined on \Omega_{\ell} \times \mathbb{R}_+ via

    \begin{equation} \begin{split} &u^{i, {\Delta}} = \sum\limits_{s\ge 0} \sum\limits_{\ell \le -1} \chi_{\ell}(x) \chi^s(t) U^{i, s}_\ell, \quad i \in \{1, \ldots, m \}, \\ &u^{j, {\Delta}} = \sum\limits_{s\ge 0} \sum\limits_{\ell \ge 1} \chi_{\ell}(x) \chi^s(t) U^{j, s}_\ell, \quad j \in \{m+1, \ldots, m+n \}.\\ \end{split} \end{equation} (2.11)

    The discrete solution operator is denoted by \mathcal{S}^{\Delta} , which operates according to

    \begin{equation} S^{\Delta} \vec{u}_0 = \left(u^{i, {\Delta}}, \ldots, u^{m, {\Delta}}, u^{m+1, {\Delta}}, \ldots u^{m+n, {\Delta}} \right). \end{equation} (2.12)

    The symbol \Gamma_{ \text{discr}} is used to denote the spatial grid (excluding the artificial grid point associated with \ell = 0 ):

    \begin{equation} \Gamma_{ \text{discr}} = \Bigl(\{1, \ldots, m \}\times\{\ell \in \mathbb{Z}, \ell \le -1 \} \Bigr) \bigcup \Bigl(\{m+1, \ldots, m+n \}\times\{\ell \in \mathbb{Z}, \ell \ge 1 \} \Bigr), \end{equation} (2.13)

    and with the notation

    \begin{equation} U^s = \left(U_{\ell}^{h, s} \right)_{(h, l)\in \Gamma_{ \text{discr}}}, \end{equation} (2.14)

    (U^s, P^s) denotes the grid function generated by the scheme at time step s .

    Remark 5. In the case where m = n = 1 , i.e., a one-to-one junction, and f_1 \neq f_2 , we have the special case of a conservation law with a spatially discontinuous flux at x = 0 . If we redefine the grid so that x_j = j {\Delta} x , and set U_0^s = P^s , the explicit finite volume scheme proposed here reduces to the Godunov scheme first proposed in [10]. In reference [17] it was proven that (for m = n = 1 ) the scheme converges to the vanishing viscosity solution under more general assumptions about the flux than the unimodality condition imposed here.

    Lemma 2.1. Fix a time level s . Assume that P^s \in [0, R] and U_{\ell}^{h, s} \in [0, R] for each h \in \{1, \ldots m+n\} . Then each U_{\ell}^{h, s+1} is a nondecreasing function of each of its three arguments. Likewise, P^{s+1} is a nondecreasing function of each of its m+n+1 arguments.

    Proof. For h\in \{1, \ldots, m \} and \ell<-1 , or h \in \{m+1, \ldots, m+n \} and \ell>1 , the assertion about U_{\ell}^{h, s+1} is a standard fact about three-point monotone schemes for scalar conservation laws [9]. For the remaining cases, we show that the relevant partial derivatives are nonnegative.

    Fix i \in \{1, \ldots, m \} , let \ell = -1 . The partial derivatives of \partial U^{i, s+1}_{-1} are

    \begin{equation} \begin{split} &\partial U^{i, s+1}_{-1}/ \partial U^{i, s}_{-2} = \lambda \partial G_i(U^{i, s}_{-1}, U^{i, s}_{-2})/\partial U^{i, s}_{-2}, \\ &\partial U^{i, s+1}_{-1}/ \partial U^{i, s}_{0} = -\lambda \partial G_i(U^{i, s}_{0}, U^{i, s}_{-1})/\partial U^{i, s}_{0}, \\ &\partial U^{i, s+1}_{-1}/ \partial U^{i, s}_{-1} = 1- \lambda \partial G_i(U^{i, s}_{0}, U^{i, s}_{-1})/\partial U^{i, s}_{-1} + \lambda \partial G_i(U^{i, s}_{-1}, U^{i, s}_{0})/\partial U^{i, s}_{-1}. \end{split} \end{equation} (2.15)

    That partial derivatives in the first two lines are nonnegative is a well-known property of the Godunov numerical flux. The partial derivative on the third line is nonnegative due to (1.4) and the CFL condition (2.6).

    A similar calculation shows that the partial derivatives of U^{j, s+1}_{1} are nonnegative, for each j \in \{m+1, \ldots, m+n \} .

    It remains to show that the partial derivatives of P^{s+1} are all nonnegative. Note that P^{s+1} is a function of P^s , along with U^{i, s}_{-1} for i \in \{1, \ldots, m \} , and U^{j, s}_{1} for j \in \{m+1, \ldots, m+n \} . The partial derivatives of P^{s+1} are

    \begin{equation} \begin{split} &\partial P^{s+1}/\partial U^{i, s}_{-1} = \lambda \partial G_i(P^s, U^{i, s}_{-1})/\partial U^{i, s}_{-1}, \\ &\partial P^{s+1}/\partial U^{j, s}_{1} = -\lambda \partial G_j(U^{j, s}_{1}, P^s)/\partial U^{j, s}_{1}, \\ &\partial P^{s+1}/\partial P^s = 1 - \lambda \left(\sum\limits_{j = m+1}^{m+n} \partial G_j(U^{j, s}_{1}, P^s)/\partial P^s - \sum\limits_{i = 1}^m \partial G_i(P^s, U^{i, s}_{-1})/\partial P^s \right)\\ &\qquad \qquad \quad \ge 1 - \lambda \left(\sum\limits_{j = m+1}^{m+n} \max(0, f'_j(P^s)) - \sum\limits_{i = 1}^m \min(0, f'_i(P^s)) \right). \end{split} \end{equation} (2.16)

    The first two partial derivatives are clearly nonnegative. For the third partial derivative we have used the following readily verified fact about the Godunov flux:

    \begin{equation} \min(0, f'_h(\beta)) \le {\partial G_h \over \partial \beta}(\beta, \alpha) \le 0 \le {\partial G_h \over \partial \alpha}(\beta, \alpha) \le \max(0, f'_h(\alpha)), \end{equation} (2.17)

    and thus the third partial derivative is nonnegative due to (1.4) and the CFL condition (2.6).

    Remark 6. If all of the fluxes f_h = f are the same, then the bound above for \partial P^{s+1}/\partial P^s simplifies to

    \begin{equation} \partial P^{s+1}/\partial P^s \ge 1 - \lambda \left(n \max(0, f'(P^s)) - m \min(0, f'(P^s)) \right), \end{equation} (2.18)

    from which it is clear that \partial P^{s+1}/\partial P^s \ge 0 under the less restrictive CFL condition (2.7).

    Lemma 2.2. Assuming that the initial data satisfies \vec{u}_0 \in L^{\infty}(\Gamma; [0, R]^{m+n}) , the finite volume approximations satisfy U^{h, s}_{\ell} \in [0, R] , P^s \in [0, R] for s\ge 0 .

    Proof. The assertion is true for s = 0 , due to our method of discretizing the initial data. Define a pair of grid functions (\tilde{U}, \tilde{P}) and (\hat{U}, \hat{P}) :

    \begin{equation} \begin{split} \tilde{U}^{h}_{\ell} = 0, \quad \tilde{P} = 0, \\ \hat{U}^{h}_{\ell} = R, \quad \hat{P} = R. \end{split} \end{equation} (2.19)

    It is readily verified that (\tilde{U}, \tilde{P}) and (\hat{U}, \hat{P}) are stationary solutions of the finite volume scheme, and we have

    \begin{equation} \tilde{U}_{\ell}^h \le U^{0, h}_\ell \le \hat{U}_{\ell}^h, \quad \tilde{P} \le P^0 \le \hat{P}. \end{equation} (2.20)

    After an application of a single step of the finite volume scheme, these ordering relationships are preserved, as a result of Lemma 2.1. Since (\tilde{U}, \tilde{P}) and (\hat{U}, \hat{P}) remain unchanged after applying the finite volume scheme, we have

    \begin{equation} \tilde{U}_{\ell}^h \le U^{1, h}_\ell \le \hat{U}_{\ell}^h, \quad \tilde{P} \le P^1 \le \hat{P}. \end{equation} (2.21)

    This proves the assertion for s = 1 , and makes it clear that the proof can be completed by continuing this way by induction on s .

    Given \vec{k} \in \mathcal{G}_{VV} , we define a discretized version (K, P) with K = \left(K_{\ell}^{h} \right)_{(h, l)\in \Gamma_{ \text{discr}}} where

    \begin{equation} K^{h}_\ell = \begin{cases} k^i, \quad & \ell < 0~ \text{ and}~ h\in \{1, \ldots, m \} , \\ k^j, \quad & \ell > 0 ~~\text{and}~~ h\in \{m+1, \ldots, m+n \} .\\ \end{cases} \end{equation} (2.22)

    and P = p_{ \vec{k}} . Here p_{ \vec{k}} denotes the value of p associated with \vec{k} whose existence is stated in Definition 1.1.

    Lemma 2.3. The finite volume scheme of Section 2 is well-balanced in the sense that each (K, P) associated with \vec{k} \in \mathcal{G}_{VV} as above is a stationary solution of the finite volume scheme.

    Proof. For each fixed h , and \left|{\ell}\right| >1 , the scheme reduces to the classical Godunov scheme without any involvement of the junction, and thus \{K^h_{\ell} \}_{\left|{\ell}\right|>1} is clearly unchanged by application of the scheme in this case.

    Fix i \in \{1, \ldots, m \} , and take \ell = -1 . When the scheme is applied in order to advance K^i_{-1} = k^i to the next time level, the result is

    \begin{equation} k^i - \lambda \left(G_i(p_{ \vec{k}}, k^{i}) - G_i(k^i, k^i) \right) = k^i - \lambda \left(f_i(k^{i}) - f_i(k^i) \right) = k^i. \end{equation} (2.23)

    Here we have used the definition of p_{ \vec{k}} , along with the consistency of the Godunov flux, G_i(\alpha, \alpha) = f_i(\alpha) . Similarly, when j \in \{m+1, \ldots, m+n \} is fixed, and the scheme is applied at \ell = 1 , the result is k^j . It remains to show that the scheme leaves P unchanged. The quantity P = p_{ \vec{k}} is advanced to the next time level according to

    \begin{equation} p_{ \vec{k}} - \lambda \left(\sum\limits_{j = m+1}^n G_j(k^j, p_{ \vec{k}}) - \sum\limits_{i = 1}^m G_i(p_{ \vec{k}}, k^i) \right) = p_{ \vec{k}}, \end{equation} (2.24)

    where we have applied the first equation of (1.5).

    With the notation a\vee b = \max(a, b) and a \wedge b = \min(a, b) , define

    \begin{equation} Q_{\ell+1/2}^{h}[U^s, \hat{U}^s] = G_h(U^{h, s}_{\ell+1} \vee \hat{U}^{h, s}_{\ell+1}, U^{h, s}_{\ell} \vee \hat{U}^{h, s}_{\ell}) - G_h(U^{h, s}_{\ell+1} \wedge \hat{U}^{h, s}_{\ell+1}, U^{h, s}_{\ell} \wedge \hat{U}^{h, s}_{\ell}). \end{equation} (2.25)

    Lemma 2.4. Let 0\le \xi \in \mathcal{D}( \mathbb{R} \times (0, \infty)) , and define \xi^s_{\ell} = \xi(x_{\ell}, t^s) . Given any initial conditions \vec{u}_0, \hat{ \vec{u}}_0 \in L^{\infty}(\Gamma; [0, R]^{m+n}) , the associated finite volume approximations satisfy the following discrete Kato inequality:

    \begin{equation} \begin{split} &\sum\limits_{i = 1}^m {\Delta} x {\Delta} t\sum\limits_{s = 1}^{+\infty} \sum\limits_{\ell < 0} \left|{U^{i, s}_{\ell}-\hat{U}^{i, s}_{\ell}}\right| \left(\xi_{\ell}^{s}-\xi_{\ell}^{s-1} \right)/{\Delta} t\\ &+\sum\limits_{i = 1}^m {\Delta} x {\Delta} t \sum\limits_{s = 0}^{+\infty} \sum\limits_{\ell \le 0} \, Q^i_{\ell-1/2}[U^s, \hat{U}^s] \left(\xi^{s}_{\ell} - \xi^{s}_{\ell-1} \right)/{\Delta} x\\ &+\sum\limits_{j = m+1}^{m+n} {\Delta} x {\Delta} t \sum\limits_{s = 1}^{+\infty} \sum\limits_{\ell > 0} \left|{U^{i, s}_{\ell}-\hat{U}^{i, s}_{\ell}}\right| \left(\xi_{\ell}^{s}-\xi_{\ell}^{s-1} \right)/{\Delta} t\\ &+\sum\limits_{j = m+1}^{m+n} {\Delta} x {\Delta} t \sum\limits_{s = 0}^{+\infty} \sum\limits_{\ell \ge 0} \, Q^j_{\ell+1/2}[U^s, \hat{U}^s] \left(\xi^{s}_{\ell+1} - \xi^{s}_{\ell} \right)/{\Delta} x\\ & +{\Delta} x {\Delta} t \sum\limits_{s = 1}^{+\infty} \, \left|{P^s-\hat{P}^s}\right| \left(\xi_{0}^{s}-\xi_{0}^{s-1} \right)/{\Delta} t \ge 0.\\ \end{split} \end{equation} (2.26)

    Proof. From the monotonicity property (Lemma 2.1), a standard calculation [9] yields

    \begin{equation} \begin{split} &\left|{U_{\ell}^{i, s+1}-\hat{U}_{\ell}^{i, s+1}}\right| \le \left|{U_{\ell}^{i, s}-\hat{U}_{\ell}^{i, s}}\right|\\ &\qquad \qquad \qquad \qquad - \lambda \left(Q^i_{\ell+1/2}[U^s, \hat{U}^s] - Q^i_{\ell-1/2}[U^s, \hat{U}^s] \right), \quad \ell \le -1, \\ & \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \, \, \, \, i \in \{1, \ldots, m \}, \\ &\left|{U_{\ell}^{j, s+1}-\hat{U}_{\ell}^{j, s+1}}\right| \le \left|{U_{\ell}^{j, s}-\hat{U}_{\ell}^{j, s}}\right|\\ &\qquad \qquad \qquad \qquad - \lambda \left(Q^j_{\ell+1/2}[U^s, \hat{U}^s] - Q^j_{\ell-1/2}[U^s, \hat{U}^s] \right), \quad \ell \ge 1, \\ & \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad j \in \{m+1, \ldots, m+n \}, \\ &\left|{P^{s+1}-\hat{P}^{s+1}}\right| \le \left|{P^{s}-\hat{P}^{s}}\right| - \lambda \left(\sum\limits_{j = m+1}^{m+n} Q_{1/2}^j[U^s, \hat{U}^s] - \sum\limits_{i = 1}^m Q_{-1/2}^i[U^s, \hat{U}^s]\right). \end{split} \end{equation} (2.27)

    We first multiply each of the first and second set of inequalities indexed by - \Delta x \xi^s_{\ell} . Likewise, we multiply each of the last set of inequalities by -{\Delta} x \xi_0^s . Next we sum the inequalities indexed by i over i \in \{1, \ldots, m \} , s \ge 0 , \ell \le -1 , and then sum by parts in s and \ell . Similarly, we sum the inequalities indexed by j over j \in \{m+1, \ldots, m+n \} , s \ge 0 , \ell \ge 1 , and then sum by parts in s and \ell . For the last set of inequalities we sum over s\ge 0 , and then sum by parts in s . When all of the sums are combined the result is (2.26).

    Lemma 2.5. Suppose that \vec{u} is a subsequential limit of the finite volume approximations \mathcal{S}^{{\Delta}} \vec{u}_0 generated by the scheme of Section 2. Then \vec{u} is a \mathcal{G}_{VV} entropy solution.

    Proof. The proof that the first condition of Definition 1.2 holds is a slight adaptation of a standard fact about monotone schemes for scalar conservation laws [9].

    The proof is completed by verifying the second condition of Definition 1.2. Let \vec{k} \in \mathcal{G}_{VV} , with \vec{k} also denoting (by a slight abuse of notation) the associated road-wise constant \mathcal{G}_{VV} solution. Following [2], we invoke Lemma 2.4, with \hat{ \vec{u}} = \vec{k} , and rely on the fact that \mathcal{S}^{{\Delta}} \vec{k} is a stationary solution of the finite volume scheme (Lemma 2.3). When {\Delta} \rightarrow 0 in the resulting version of (2.26), the result is the desired Kružkov-type entropy inequality (1.10). The crucial observation here is that the last sum on the left side of (2.26) vanishes in the limit.

    With Lemmas 2.1 through 2.5 in hand it is possible to repeat the proof of Theorem 3.3 of [2], which yields Theorem 2.6 below.

    Theorem 2.6. For a given initial datum \vec{u}_0 \in L^{\infty}(\Gamma;[0, R^{m+n}]) , the finite volume scheme of Section 2 converges to the unique \mathcal{G}_{VV} -entropy solution \vec{u} , i.e., \mathcal{S}^{{\Delta}} \vec{u}_0 \rightarrow \vec{u} as {\Delta} \rightarrow 0 .

    We found that if P^0 is initialized carefully the approximations generated by the explicit scheme of Section 2 differ only slightly from those generated by the implicit scheme of [2]. This conclusion is based on testing on the Riemann problems of [21], among others. Thus we limit our discussion to the initialization of P^0 , including one numerical example that illustrates the difference between a bad choice for P^0 and a good one.

    Initialization of P^0 . As mentioned previously, convergence is guaranteed as long as P^0 \in [0, R] , but the choice of P^0 can affect accuracy. A bad choice of P^0 can result in spurious numerical artifacts, more specifically "bumps" that travel away from x = 0 . These bumps have been noticed before in the case of a one-to-one junction, see Example 2 of [17]. We have found two approaches that are effective in initializing P^0 :

    ● Initialize P^0 by solving the nonlinear equation (2.8) (with s = 0 ). In other words, the scheme is implicit on the first time step, and explicit on all subsequent time steps. No spurious artifacts were observed with this method of initialization. For our numerical tests, we solved (2.8) via the iteration (2.9) purely as a matter of convenience, but regula falsi, as suggested in [2], may be more efficient.

    ● Initialize P^0 by choosing P^0 = U^{i, 0}_{-1} for some i \in \{1, \ldots, m \} or P^0 = U^{j, 0}_{1} for some j \in \{m+1, \ldots, m+n \} . If a spurious bump is observed, try a different choice from the same finite set. Obviously, this is a trial and error method, and may require re-running a simulation. Based on a substantial amount of experience with one-to-one junctions (discontinuous flux problems), there seems to always be a choice for which no spurious bump appears. This approach also seems to work for more general junctions (up to and including two-by-two), but our experience here is more limited.

    Example 1. This example demonstrates the appearance of a spurious bump when P^0 is initialized with a "bad" value. We emphasize that convergence is not affected, only accuracy. This is a Riemann problem featuring a two-to-one merge junction. The initial data is (u_{1, 0}, u_{2, 0}, u_{3, 0}) = (3/4, 4/5, 1/5) . See Figure 1. We used ({\Delta} x, {\Delta} t) = (.005, .0025) , \lambda = 1/2 , for 25 time steps. In the left panel, we used P^0 = 1/5 . In the right panel, we computed P^0 by the fixed point iteration (2.9), stopping when the difference was \left|{P^0_{k+1}-P^0_k}\right|< 10^{-6} . In the left panel, a spurious bump in the graph of u_2 left is visible. This numerical artifact is not visible in the right panel.

    Figure 1. 

    Example 1. Left panel: P^0 = 1/5 . Right panel: P^0 computed by the fixed point iteration (2.9), or by choosing P^0 = 4/5 . Solid line: u_1 , dashed line: u_2 , dot-dashed line: u_3 . In the left panel a spurious bump in u_2 is visible, due to a bad choice of P^0 (which does not affect convergence). In the right panel there is no spurious bump

    .

    One can also get rid of the spurious bump by choosing P^0 = 4/5 . With this choice we got results that are visually indistinguishable from those obtained when using (2.9) for P^0 .

    I thank two anonymous referees for their comments and suggestions.

    In this appendix we prove that the fixed point iterations (2.9) converge to a solution of the equation (2.8). Let p = P^s , and define the vector \vec{u} = (u_1, \ldots, u_{m+n}) by

    \begin{equation} u_i = U_{-1}^{i, s} for i = 1, \ldots, m , \quad u_j = U_{1}^{j, s} ~\text{for }~ j = m+1, \ldots, m+n . \end{equation} (A.1)

    Then (2.8) takes the form

    \begin{equation} \Phi_{{\vec u}}^{ \text{out}}(p) = \Phi_{\vec{u}}^{ \text{in}}(p), \end{equation} (A.2)

    where

    \begin{equation} \Phi_{\vec{u}}^{ \text{in}}(p) = \sum\limits_{i = 1}^m G_i(p, u_i), \quad \Phi_{{\vec u}}^{ \text{out}}(p) = \sum\limits_{j = m+1}^{m+n} G_j(u_j, p). \end{equation} (A.3)

    This notation agrees with that of [2], where it was shown that \Phi_{\vec{u}}^{ \text{in}}(\cdot)- \Phi_{{\vec u}}^{ \text{out}}(\cdot) changes from nonnegative to nonpositive over the interval [0, R] , and thus the intermediate value theorem guarantees at least one solution of (A.2). Reference [2] suggested regula falsi as a method of locating such a solution. As an alternative we proposed the iterative method (2.9) because it clarifies the relationship between the finite volume algorithm of this paper and that of [2]. Moreover we found that our explicit finite volume scheme can be improved by using a hybrid method, where the implicit scheme of [2] is employed on the first time step and our explicit method is used on all later time steps. In that situation the iterative algorithm (2.9) was found to be a convenient way to implement the nonlinear equation solver that is required on the first time step.

    With the simplified notation introduced above, the iterative scheme (2.9) becomes

    \begin{equation} p_{\nu+1} = p_{\nu} - \lambda \left( \Phi_{{\vec u}}^{ \text{out}}(p_{\nu}) - \Phi_{\vec{u}}^{ \text{in}}(p_{\nu}) \right), \quad p_0 \in [0, R]. \end{equation} (A.4)

    Proposition 1. The sequence \{p_{\nu} \} produced by the iterative scheme (A.4) converges to a solution of (A.2).

    Proof. Note that p \mapsto G_i(p, u_i) is nonincreasing on [0, R] , p \mapsto G_j(u_j, p) is nondecreasing on [0, R] , and

    \begin{equation} \begin{split} &0 \le G_i(0, u_i), \quad G_i(R, u_i) = 0, \\ &G_j(u_j, 0) = 0, \quad 0 \le G_j(u_j, R). \end{split} \end{equation} (A.5)

    Thus, p \mapsto \Phi_{\vec{u}}^{ \text{in}}(p) is nonincreasing on [0, R] , p \mapsto \Phi_{{\vec u}}^{ \text{out}}(p) is nondecreasing on [0, R] , and

    \begin{equation} \begin{split} &0 \le \Phi_{\vec{u}}^{ \text{in}}(0), \quad \Phi_{\vec{u}}^{ \text{in}}(R) = 0, \\ & \Phi_{{\vec u}}^{ \text{out}}(0) = 0, \quad 0 \le \Phi_{{\vec u}}^{ \text{out}}(R). \end{split} \end{equation} (A.6)

    Define \Psi_{ \vec{u}} according to

    \begin{equation} \Psi_{ \vec{u}}(p) = \Phi_{{\vec u}}^{ \text{out}}(p) - \Phi_{\vec{u}}^{ \text{in}}(p), \end{equation} (A.7)

    and observe that \Psi_{ \vec{u}} is Lipschitz continuous on [0, R] with Lipschitz constant bounded by (m+n)L . Also note that \Psi_{ \vec{u}} is nondecreasing on [0, R] , and

    \begin{equation} \Psi_{ \vec{u}}(0) \le 0 \le \Psi_{ \vec{u}}(R). \end{equation} (A.8)

    Define

    \begin{equation} \Pi(p) = p - \lambda \Psi_{ \vec{u}}(p). \end{equation} (A.9)

    \Pi is Lipschitz continuous and

    \begin{equation} \Pi'(p) = 1 - \lambda \Psi'_{ \vec{u}}(p) \ge 1 - \lambda (m+n)L. \end{equation} (A.10)

    Thanks to (A.10) and the CFL condition (2.6), it is clear that \Pi is nondecreasing on [0, R] , and recalling (A.8) we have

    \begin{equation} 0 \le \Pi(0) \le \Pi(p) \le \Pi(R) \le R ~\text{for}~ p \in [0, R] . \end{equation} (A.11)

    Thus \Pi maps [0, R] continuously into [0, R] . In terms of \Pi , the iterative scheme (A.4) is

    \begin{equation} p_{\nu +1} = \Pi(p_{\nu}), \quad p_0 \in [0, R]. \end{equation} (A.12)

    We can now prove convergence of the sequence \{p_{\nu} \} . First take the case where p_{\nu_0 +1} = p_{\nu_0} for some \nu_0 . Then p_{\nu} = p_{\nu_0} for \nu \ge \nu_0 , so p_{\nu} \rightarrow p_{\nu_0} . Also p_{\nu_0 +1} = p_{\nu_0} implies that \Psi_{ \vec{u}}(p_{\nu_0}) = 0 , and thus p_{\nu_0} is a solution of (A.3).

    Now consider the case where p_{\nu +1} \neq p_{\nu} for all \nu \ge 0 . Then

    \begin{equation} \begin{split} p_{\nu+1}-p_{\nu} & = \Pi(p_{\nu}) - \Pi(p_{\nu-1}) \\ & = {\Pi(p_{\nu}) - \Pi(p_{\nu-1})\over p_{\nu} - p_{\nu-1} } (p_{\nu} - p_{\nu-1}). \end{split} \end{equation} (A.13)

    Since \Pi is nondecreasing and p_{\nu} - p_{\nu-1} \neq 0 , p_{\nu+1} - p_{\nu} \neq 0 , (A.13) implies that

    \begin{equation} \mathrm{sign}(p_{\nu+1}-p_{\nu}) = \mathrm{sign}(p_{\nu}-p_{\nu-1}) = \ldots = \mathrm{sign}(p_{1}-p_{0}). \end{equation} (A.14)

    In other words, the sequence \{p_{\nu} \} is monotonic. Since we also have \{p_{\nu}\} \subseteq [0, R] , p_{\nu} converges to some p \in [0, R] , and it follows from continuity of \Psi_{ \vec{u}} that the limit p is a solution of (A.3).



    [1] A. Porreca, F. Scozzari, M. Di Nicola, Using text mining and sentiment analysis to analyze YouTube Italian videos concerning vaccination, BMC Public Health, 20 (2020), 1–9. https://doi.org/10.1186/s12889-020-8342-4 doi: 10.1186/s12889-020-8342-4
    [2] Z. Li, R. Li, G. Jin, Sentiment analysis of danmaku videos based on Naïve Bayes and sentiment dictionary, IEEE Access, 8 (2020), 75073–75084. https://doi.org/10.1109/ACCESS.2020.2986582 doi: 10.1109/ACCESS.2020.2986582
    [3] G. S. Chauhan, Y. K. Meena, YouTube video ranking by aspect-based sentiment analysis on user feedback, Soft Comput. Signal Process., (2019), 63–71. https://doi.org/10.1007/978-981-13-3600-3_6 doi: 10.1007/978-981-13-3600-3_6
    [4] T. Tomihira, A. Otsuka, A. Yamashita A, T. Satoh, Multilingual emoji prediction using BERT for sentiment analysis, Int. J. Web Inf. Syst., 16 (2020), 265–280. https://doi.org/10.1108/IJWIS-09-2019-0042 doi: 10.1108/IJWIS-09-2019-0042
    [5] R. Botsman, R. Rogers, What's mine is yours, The rise of collaborative consumption. New York: HarperCollins, (2010).
    [6] S. M. C. Loureiro, J. Guerreiro, F. Ali, 20 years of research on virtual reality and augmented reality in tourism context: A text-mining approach, Tour. Manag., 77 (2020), 104028. https://doi.org/10.1016/j.tourman.2019.104028 doi: 10.1016/j.tourman.2019.104028
    [7] R. G. Bilro, S. M. C. Loureiro, J. Guerreiro, Exploring online customer engagement with hospitality products and its relationship with involvement, emotional states, experience and brand advocacy, J. Hosp. Market. Manag., 28 (2019), 147–171. https://doi.org/10.1080/19368623.2018.1506375 doi: 10.1080/19368623.2018.1506375
    [8] S. M. C. Loureiro, J. Guerreiro, S. Eloy, D. Langaro, P. Panchapakesan, Understanding the use of Virtual Reality in Marketing: A text mining-based review, J. Bus. Res., 100 (2019), 514–530. https://doi.org/10.1016/j.jbusres.2018.10.055 doi: 10.1016/j.jbusres.2018.10.055
    [9] M. Wedel, E. Bigné, J. Zhang, Virtual and augmented reality: Advancing research in consumer marketing, Int. J. Res. Mark., 37 (2020), 443–465. https://doi.org/10.1016/j.ijresmar.2020.04.004 doi: 10.1016/j.ijresmar.2020.04.004
    [10] F. Velicia-Martin, J. A. Folgado-Fernández, P. R. Palos-Sánchez, B. López-Catalán, mWOM Business Strategies: Factors Affecting Recommendations, J. Comput. Inf. Syst., (2022), 1–14. https://doi.org/10.1080/08874417.2022.2041504 doi: 10.1080/08874417.2022.2041504
    [11] S. Moro, P. Rita, P. Ramos, J. Esmeraldo, Analysing recent augmented and virtual reality developments in tourism, J. Hosp. Tour. Technol., 10 (2019), 571–586. https://doi.org/10.1108/JHTT-07-2018-0059 doi: 10.1108/JHTT-07-2018-0059
    [12] S. M. C. Loureiro, H. Roschk H, Differential effects of atmospheric cues on emotions and loyalty intention with respect to age under online/offline environment, J. Retail. Consum. Serv., 21 (2014), 211–219. https://doi.org/10.1016/j.jretconser.2013.09.001 doi: 10.1016/j.jretconser.2013.09.001
    [13] X. Xu, Y. Li, The antecedents of customer satisfaction and dissatisfaction toward various types of hotels: A text mining approach, Int. J. Hosp. Manag., 55 (2016), 57–69. https://doi.org/10.1016/j.ijhm.2016.03.003 doi: 10.1016/j.ijhm.2016.03.003
    [14] L. Serrano, A. Ariza-Montes, M. Nader, A. Sianes, R. Law, Exploring preferences and sustainable attitudes of Airbnb green users in the review comments and ratings: A text mining approach, J. Sustain. Tour., 28 (2020), 1–19. https://doi.org/10.1080/09669582.2020.1838529 doi: 10.1080/09669582.2020.1838529
    [15] X. Wu, Q., Zhi, Impact of shared economy on urban sustainability: From the perspective of social, economic, and environmental sustainability, Energy Proced., 104 (2016), 191–196. https://doi.org/10.1016/j.egypro.2016.12.033 doi: 10.1016/j.egypro.2016.12.033
    [16] H. Han, B. Meng, W. Kim, Emerging bicycle tourism and the theory of planned behavior, J. Sustain. Tour., 25 (2017), 292–309. https://doi.org/10.1080/09669582.2016.1202955 doi: 10.1080/09669582.2016.1202955
    [17] C. Midgett, J. S. Bendickson, J. Muldoon, S. J. Solomon, The sharing economy and sustainability: A case for Airbnb, Small Bus. Inst. J., 13 (2018), 51–71.
    [18] A. N. Srivastava, M. Sahami, Text mining: Classification, clustering, and applications, New York, NY, Chapman & Hall/CRC, (2009).
    [19] C. Koltinger, A. Dickinger, Analyzing destination branding and image from online sources: A web content mining approach, J. Bus. Res. 68 (2015), 1836–1843. https://doi.org/10.1016/j.jbusres.2015.01.011 doi: 10.1016/j.jbusres.2015.01.011
    [20] S. M. C. Loureiro, J. Guerreiro, F. Ali, 20 years of research on virtual reality and augmented reality in tourism context: A text-mining approach, Tour. Manag., 77 (2020), 104028.
    [21] S. Rangelova, E. Andre, A survey on simulation sickness in driving applications with Virtual Reality Head-mounted displays, Presence V. Augmented R., 27 (2019), 15–31. https://doi.org/10.1162/pres_a_00318 doi: 10.1162/pres_a_00318
    [22] J. Martínez-Navarro, E. Bigné, J. Guixeres, M. Alcaniz, C. Torrecilla, The influence of virtual reality in e-commerce, J. Bus. Res., 100 (2019), 475–482. https://doi.org/10.1016/j.jbusres.2018.10.054 doi: 10.1016/j.jbusres.2018.10.054
    [23] K. Zhang, J. Suo, J. Chen, X. Liu, L. Gao, Design and implementation of fire safety education system on campus based on virtual reality technology, Federated Conference on Computer Science and Information Systems (FedCSIS), (2017), 1297–1300.
    [24] C. Anthes, R. J. García-Hernández, M. Wiedemann, D. Kranzlmüller, State of the art of virtual reality technology, IEEE Aerospace Conference, (2016), 1–19.
    [25] C. Flavián, S. Ibáñez-Sánchez, C. Orús, Integrating virtual reality devices into the body: effects of technological embodiment on customer engagement and behavioral intentions toward the destination, J. Travel Tour. Mark., 36 (2019), 847–863. https://doi.org/10.1080/10548408.2019.1618781 doi: 10.1080/10548408.2019.1618781
    [26] M. A. Gigante, Virtual Reality: Definitions, History and Applications, in Virtual Reality Systems (eds. R. A. Earnshaw, M. A. Gigante and H. Jones), Boston, Academic Press, (1993), 3–14.
    [27] P. Disztinger, S. Schlögl, A. Groth, Technology Acceptance of Virtual Reality for Travel Planning, in Information and Communication Technologies in Tourism 2017 (Eds. R. Schegg and B. Stangl), Cham, Springer International Publishing, (2017), 255–268.
    [28] I. P. Tussyadiah, D. Wang, T. H. Jung, M. C. Tom Dieck, Virtual reality, presence, and attitude change: Empirical evidence from tourism, Tourism Manage, 66 (2018), 140–154. https://doi.org/10.1016/j.tourman.2017.12.003 doi: 10.1016/j.tourman.2017.12.003
    [29] M. Fagan, C. Kilmon, V. Pandey, Exploring the adoption of a virtual reality simulation: The role of perceived ease of use, perceived usefulness and personal innovativeness, Campus-Wide Inf. Sys., 29 (2012), 117–127. https://doi.org/10.1108/10650741211212368 doi: 10.1108/10650741211212368
    [30] M. Mihelj, D. Novak, S. Beguš, Virtual Reality Technology and Applications, Dordrecht, Springer Netherlands, (2014).
    [31] Y. C. Huang, K. F. Backman, S. J. Backman, L. L. Chang, Exploring the implications of Virtual Reality Technology in tourism marketing: An integrated research framework, Int. J. Tour. Res., 18 (2016), 116–128. https://doi.org/10.1002/jtr.2038 doi: 10.1002/jtr.2038
    [32] D. M. Tamás, Introduction to the WIPO Pearl patent terminology database, Fordítástudomány, 23 (2021), 49–62. https://doi.org/10.35924/fordtud.23.1.3 doi: 10.35924/fordtud.23.1.3
    [33] D. Babčanová, J. Šujanová, D. Cagáňová, N. Horňáková, H. Hrablik Chovanová, Qualitative and quantitative analysis of social network data intended for brand management, Wirel. Netw., 27 (2019), 1–8. https://doi.org/10.1007/s11276-019-02052-0 doi: 10.1007/s11276-019-02052-0
    [34] Z. T. Osakwe, I. Ikhapoh, B. K. Arora, O. M. Bubu, Identifying public concerns and reactions during the COVID-19 pandemic on Twitter: A text-mining analysis. Public Health Nur., 38 (2021), 145–151. https://doi.org/10.1111/phn.12843 doi: 10.1111/phn.12843
    [35] A. Brait, Attitudes of Austrian history teachers towards memorial site visits, Eine Analyse mithilfe von MAXQDA zeitgeschichte, 47 (2020), 441–466. https://doi.org/10.14220/zsch.2020.47.4.441 doi: 10.14220/zsch.2020.47.4.441
    [36] P. Kowalczuk, Consumer acceptance of smart speakers: a mixed methods approach, J. Res. Interact. Mark., 12 (2018), 418–431. https://doi.org/10.1108/JRIM-01-2018-0022 doi: 10.1108/JRIM-01-2018-0022
    [37] R. P. S. Kaurav, K. Suresh, S. Narula, R. Baber, The new education policy 2020 using Twitter mining, J. Content Community Commun., 12 (2021), 4–13. https://doi.org/10.31620/JCCC.12.20/02 doi: 10.31620/JCCC.12.20/02
    [38] D. H. Choi, A. Dailey-Hebert, J. Simmons Estes, Emerging Tools and Applications of Virtual Reality in Education: IGI Global, (2016).
    [39] M. A. Ríos-Martín, J. A. Folgado-Fernández, P. R. Palos-Sanchez, P. Castejón-Jiménez, The impact of the environmental quality of online feedback and satisfaction when exploring the critical factors for Luxury Hotels, Sustainability, 12 (2019), 299. https://doi.org/10.3390/su12010299 doi: 10.3390/su12010299
    [40] J. R. Saura, P. R. Palos-Sanchez, M. A. R. Martín, Attitudes expressed in online comments about environmental factors in the Tourism sector: An exploratory study, Int. J. Environ. Res. Public Health, 15 (2018), 553. https://doi.org/10.3390/ijerph15030553 doi: 10.3390/ijerph15030553
    [41] J. R. Saura, P. R. Palos-Sanchez, A. Grilo, Detecting indicators for startup business success: Sentiment analysis using text data mining, Sustainability, 11 (2019), 917. https://doi.org/10.3390/su11030917 doi: 10.3390/su11030917
    [42] J. R.Saura, A. Reyes-Menendez, P. Palos-Sanchez, Are Black Friday deals worth it? Mining Twitter users' sentiment and behavior response, J. Open Innov. Tech., Market Complex., 5 (2019), 58. https://doi.org/10.3390/joitmc5030058 doi: 10.3390/joitmc5030058
    [43] J. R. Saura, A. Reyes-Menéndez, P. R. Palos-Sanchez, A Twitter sentiment analysis with machine learning: Identifying sentiment about #BlackFriday deals, Revista Espacios, 39 (2018).
    [44] P. R. Palos-Sanchez, J. R.Saura, F. Debasa, The influence of social networks on the development of recruitment actions that favor user interface design and conversions in mobile applications powered by linked data, Mob. Inf. Syst., 2018 (2018). https://doi.org/10.1155/2018/5047017 doi: 10.1155/2018/5047017
    [45] P. R. Palos-Sanchez, J. R. Saura, M.B. Correia, Do tourism applications' quality and user experience influence its acceptance by tourists? Rev. Manag. Sci., 15 (2021), 1205–1241. https://doi.org/10.1007/s11846-020-00396-y doi: 10.1007/s11846-020-00396-y
    [46] D. Gefen, Reflections on the dimensions of trust and trustworthiness among online consumers, ACM SIGMIS Database: The Database for Advances in Information Systems, 33 (2002), 38–53. https://doi.org/10.1145/569905.569910 doi: 10.1145/569905.569910
    [47] A. C. Calheiros, S. Moro, P. Rita, Sentiment classification of consumer-generated online reviews using topic modeling, Hosp. Market. Manag., 26 (2017), 675–693. https://doi.org/10.1080/19368623.2017.1310075 doi: 10.1080/19368623.2017.1310075
    [48] S. Kang, S. Dove, H. Ebright, S. Morales, H. Kim, Does virtual reality affect behavioral intention? Testing engagement processes in a K-Pop video on YouTube, Comput. Hum. Behav. 123 (2021), 106875. https://doi.org/10.1016/j.chb.2021.106875 doi: 10.1016/j.chb.2021.106875
    [49] E. Filter, A Eckes, F. Fiebelkorn, A. G. Büssing, Virtual reality nature experiences involving wolves on YouTube: Presence, emotions, and attitudes in immersive and nonimmersive settings, Sustainability, 12 (2020), 3823. https://doi.org/10.3390/su12093823 doi: 10.3390/su12093823
    [50] C. C.W. Lim, J. Leung, J. Y.C. Chung, T. Sun, C. Gartner, J. Connor, et al., Content analysis of cannabis vaping videos on YouTube, Addiction, 116 (2021), 2443–2453. https://doi.org/10.1111/add.15424 doi: 10.1111/add.15424
    [51] J. Y. Lim, S. Kim, J. Kim, S. Lee, Identifying trends in nursing start-ups using text mining of YouTube content, Plos One, 15 (2020), e0226329. https://doi.org/10.1371/journal.pone.0226329 doi: 10.1371/journal.pone.0226329
    [52] N. Öztürk, S. Ayvaz, Sentiment analysis on Twitter: A text mining approach to the Syrian refugee crisis, Telemat. Inform., 35 (2018), 136–147. https://doi.org/10.1016/j.tele.2017.10.006 doi: 10.1016/j.tele.2017.10.006
    [53] A. Alarifi, M. Alsaleh, A. Al-Salman, Twitter turing test: Identifying social machines, Inf. Sci., 372 (2016), 332–346. https://doi.org/10.1016/j.ins.2016.08.036 doi: 10.1016/j.ins.2016.08.036
    [54] R. Filieri, S. Alguezaui, F. McLeay, Why do travelers trust TripAdvisor? Antecedents of trust towards consumer-generated media and its influence on recommendation adoption and word of mouth, Tour. Manag., 51 (2015), 174–185. https://doi.org/10.1016/j.tourman.2015.05.007 doi: 10.1016/j.tourman.2015.05.007
    [55] M. M. Mostafa, More than words: Social networks' text mining for consumer brand sentiments, Expert Syst. Appl., 40 (2013), 4241–4251. https://doi.org/10.1016/j.eswa.2013.01.019 doi: 10.1016/j.eswa.2013.01.019
    [56] C. L. Santos, P. Rita, J. Guerreiro, Improving international attractiveness of higher education institutions based on text mining and sentiment analysis, Int. J. Educ. Manag., 32 (2018) 431–447. https://doi.org/10.1108/IJEM-01-2017-0027 doi: 10.1108/IJEM-01-2017-0027
    [57] S. Lee, J. Song, Y. Kim, An empirical comparison of four text mining methods, J. Comput. Inf. Syst., 51 (2010), 1–10.
    [58] R. S. Lu, H. Y. Tsao, H. C. K. Lin, Y. C. Ma, C. T. Chuang, Sentiment analysis of brand personality positioning through text mining, J. Inf. Technol. Res., 12 (2019), 93–103. https://doi.org/10.4018/JITR.2019070106 doi: 10.4018/JITR.2019070106
    [59] A. Z. Hamdi, A. H. Asyhar, Y. Farida, N. Ulinnuha, D. C. R. Novitasari, A. Zaenal, Sentiment analysis of regional head candidate's electability from the national mass media perspective using the text mining algorithm, Adv. Sci. Technol. Eng. Syst., 4 (2019), 134–139.
    [60] K. Hornik, B. Grün, Topic models: An R package for fitting topic models, J. Stat. Softw., 40 (2011), 1–30.
    [61] M. Isik, B. Öztaysi, K. H. Fenerci, A sentiment analysis as a tool to identify the status of universities: The case of ITU, Procedings of the International Conference on Industrial Engineering and Operations Management, (2012), 3–6.
    [62] A. C. Calheiros, S. Moro, P. Rita, Sentiment classification of consumer-generated online reviews using topic modeling, J. Hosp. Market. Manag., 26 (2017), 675–693. https://doi.org/10.1080/19368623.2017.1310075 doi: 10.1080/19368623.2017.1310075
    [63] Y. Yang, L. Akers, T. Klose, C. B. Yang, Text mining and visualization tools–Impressions of emerging capabilities, World Pat. Inf., 30 (2008), 280–293. https://doi.org/10.1016/j.wpi.2008.01.007 doi: 10.1016/j.wpi.2008.01.007
    [64] B. Liu, L. A. Zhang, A survey of opinion mining and sentiment analysis, Mining text data, Boston, MA, Springer, (2012), 415–463. https://doi.org/10.1007/978-1-4614-3223-4_13
    [65] F. Zhou, J. R. Jiao, X. J. Yang, B. Lei, Augmenting feature model through customer preference mining by hybrid sentiment analysis, Expert Syst. Appl., 89 (2017), 306–317. https://doi.org/10.1016/j.eswa.2017.07.021 doi: 10.1016/j.eswa.2017.07.021
    [66] Z. P. Fan, Y. J. Che, Z. Y. Chen, Product sales forecasting using online reviews and historical sales data: A method combining the Bass model and sentiment analysis., J. Bus. Res., 74 (2017), 90–100. https://doi.org/10.1016/j.jbusres.2017.01.010 doi: 10.1016/j.jbusres.2017.01.010
    [67] T. Li, L. Lin, M. Choi, S. Gong, J. Wang, YouTube AV 50k: An annotated corpus for comments in autonomous vehicles, International Joint Symposium on Artificial Intelligence and Natural Language Processing (iSAI-NLP), (2018), 1–5.
    [68] J. Wen, C. E. Yu, E. Goh, Physician-assisted suicide travel constraints: Thematic content analysis of online reviews, Tour. Recreat. Res., 44 (2019) 553–557. https://doi.org/10.1080/02508281.2019.1660488 doi: 10.1080/02508281.2019.1660488
    [69] C. E. Yu, J. Wen, S. Yang, Viewpoint of suicide travel: An exploratory study on YouTube comments, Tour. Manag. Perspect., 34 (2020) 100669. https://doi.org/10.1016/j.tmp.2020.100669 doi: 10.1016/j.tmp.2020.100669
    [70] Y. Guo, S. J. Barnes, Q. Jia, Mining meaning from online ratings and reviews: Tourist satisfaction analysis using latent Dirichlet allocation, Tour. Manag., 59 (2017), 467–483. https://doi.org/10.1016/j.tourman.2016.09.009 doi: 10.1016/j.tourman.2016.09.009
    [71] MAXQDA 2020, computer software, Berlin, Germany, VERBI Software, 2019.
    [72] U. Kuckartz, S. Rädiker, Introduction: Analyzing qualitative data with software, Analyzing Qualitative Data with MAXQDA, Cham, Springer, (2019), 1–11. https://doi.org/10.1007/978-3-030-15671-8_1
    [73] J. Guerreiro, P. Rita, D. Trigueiros, A text mining-based review of cause-related marketing literature, J. Bus. Ethics, 139 (2016), 111–128. https://doi.org/10.1007/s10551-015-2622-4 doi: 10.1007/s10551-015-2622-4
    [74] K. N. Lau, K. H. Lee, Y. Ho, Text mining for the hotel industry, Cornell Hotel Restaur Admin. Q., 46 (2005), 344–362. https://doi.org/10.1177/0010880405275966 doi: 10.1177/0010880405275966
    [75] F. R. Lin, D. Hao, D. Liao, Automatic content analysis of media framing by text mining techniques, 49th Hawaii International Conference on System Sciences, (2016), 2770–2779.
    [76] M. Bouchet-Valat, G. Bastin, RcmdrPlugin. temis, a graphical integrated text mining solution in R, The R J., 5 (2013), 188–196.
    [77] G. Bastin, M. Bouchet-Valat, Media corpora, text mining, and the sociological imagination-A free software text mining approach to the framing of Julian Assange by three news agencies using R, TeMiS Bull. Sociol. Methodol., 122 (2014) 5–25. https://doi.org/10.1177/0759106314521968 doi: 10.1177/0759106314521968
    [78] J. Pino-Díaz, Tutorial de R-Text Mining Solution, Universidad de Málaga, (2016), 2–56. http://hdl.handle.net/10630/11924
    [79] M. L. Jockers, Syuzhet: Extract sentiment and plot arcs from text, R Package Version, 2017.
    [80] M. Jockers, Msyuzhet: Extracts Sentiment and Sentiment-Derived Plot Arcs from Text, 2020.
    [81] T. Rinker, sentimentr: Calculate Text Polarity Sentiment, 2021.
    [82] M. Misuraca, A. Forciniti, G. Scepi, M. Spano, Sentiment analysis for education with R: Packages, methods and practical applications, arXiv, 27, (2020). https://doi.org/10.48550/arXiv.2005.12840 doi: 10.48550/arXiv.2005.12840
    [83] J. Chang, Lda: Collapsed Gibbs Sampling Methods for Topic Models, (2015). http://CRAN.R-project.org/package=lda
    [84] S. A. García, M. I. M. Menéndez, Applications of statistics to framing and text mining in communication studies, Inform. Culture Soc., 39 (2018), 61–70. https://doi.org/10.34096/ics.i39.4260 doi: 10.34096/ics.i39.4260
    [85] P. R. Palos-Sanchez, M. B. Correia, The collaborative economy based analysis of demand: Study of Airbnb case in Spain and Portugal, J. Theor. Appl. Electron. Commer. Res., 13 (2018), 85–98. https://doi.org/10.4067/S0718-18762018000300105 doi: 10.4067/S0718-18762018000300105
    [86] J. Pino Díaz, J. Minguillón Campos, Application of the Simple Linear Regression technique to the Contribution-Quality relationship in correspondence analysis in data mining with R, Fiabilidad Industr., (2016). http://hdl.handle.net/10630/11102
    [87] M. Terrádez Gurrea, Lexical frequencies and statistical analysis, How do you comment on a colloquial text?, Ariel, (2000), 111–124.
    [88] R. Gutiérrez, A. González, F. Torres, J. A. Gallardo, Multivariate data analysis techniques, Universidad de Granada, 1994.
    [89] P. Carracedo, R. Puertas, L. Marti, Research lines on the impact of the COVID-19 pandemic on business, A text mining analysis, J. Bus. Res., 132 (2021). https://doi.org/10.1016/j.jbusres.2020.11.043 doi: 10.1016/j.jbusres.2020.11.043
    [90] A. Porreca, F. Scozzari, M. Di Nicola, Using text mining and sentiment analysis to analyze YouTube Italian videos concerning vaccination, BMC Public Health, 20 (2020), 1–9. https://doi.org/10.1186/s12889-020-8342-4 doi: 10.1186/s12889-020-8342-4
    [91] H. K. Ko, An analysis of YouTube comments on BTS using text mining, The Rhizom. Revol. Rev., 10 (2020).
    [92] M. Sánchez, P. R. Palos-Sánchez, F.Velicia-Martin, Eco-friendly performance as a determining factor of the Adoption of Virtual Reality Applications in National Parks, Sci. Total Environ., 798 (2021), 148990. https://doi.org/10.1016/j.scitotenv.2021.148990 doi: 10.1016/j.scitotenv.2021.148990
  • This article has been cited by:

    1. Nicola De Nitti, Enrique Zuazua, On the Controllability of Entropy Solutions of Scalar Conservation Laws at a Junction via Lyapunov Methods, 2023, 51, 2305-221X, 71, 10.1007/s10013-022-00598-9
    2. Michael Herty, Niklas Kolbe, Siegfried Müller, Central schemes for networked scalar conservation laws, 2022, 18, 1556-1801, 310, 10.3934/nhm.2023012
    3. Markus Musch, Ulrik Skre Fjordholm, Nils Henrik Risebro, Well-posedness theory for nonlinear scalar conservation laws on networks, 2022, 17, 1556-1801, 101, 10.3934/nhm.2021025
    4. Michael Herty, Niklas Kolbe, Siegfried Müller, A Central Scheme for Two Coupled Hyperbolic Systems, 2024, 6, 2096-6385, 2093, 10.1007/s42967-023-00306-5
    5. Dilip Sarkar, Shridhar Kumar, Pratibhamoy Das, Higinio Ramos, Higher-order convergence analysis for interior and boundary layers in a semi-linear reaction-diffusion system networked by a k -star graph with non-smooth source terms, 2024, 19, 1556-1801, 1085, 10.3934/nhm.2024048
    6. Sabrina F. Pellegrino, A filtered Chebyshev spectral method for conservation laws on network, 2023, 151, 08981221, 418, 10.1016/j.camwa.2023.10.017
  • Reader Comments
  • © 2022 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(5616) PDF downloads(229) Cited by(20)

Figures and Tables

Figures(15)  /  Tables(8)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog