Dipartimento di Matematica e Applicazioni "Renato Caccioppoli", Università degli Studi di Napoli Federico Ⅱ, Via Cintia, Monte S. Angelo 80126 Napoli, Italy
2.
Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italy
Received:
28 July 2021
Revised:
26 November 2021
Accepted:
05 December 2021
Published:
10 January 2022
We derive a matrix version of Li & Yau–type estimates for positive solutions of semilinear heat equations on Riemannian manifolds with nonnegative sectional curvatures and parallel Ricci tensor, similarly to what R. Hamilton did in [5] for the standard heat equation. We then apply these estimates to obtain some Harnack–type inequalities, which give local bounds on the solutions in terms of the geometric quantities involved.
Citation: Giacomo Ascione, Daniele Castorina, Giovanni Catino, Carlo Mantegazza. A matrix Harnack inequality for semilinear heat equations[J]. Mathematics in Engineering, 2023, 5(1): 1-15. doi: 10.3934/mine.2023003
Related Papers:
[1]
Jun Hu, Jie Wu, Mengzhe Wang .
Research on VIKOR group decision making using WOWA operator based on interval Pythagorean triangular fuzzy numbers. AIMS Mathematics, 2023, 8(11): 26237-26259.
doi: 10.3934/math.20231338
[2]
Manar A. Alqudah, Artion Kashuri, Pshtiwan Othman Mohammed, Muhammad Raees, Thabet Abdeljawad, Matloob Anwar, Y. S. Hamed .
On modified convex interval valued functions and related inclusions via the interval valued generalized fractional integrals in extended interval space. AIMS Mathematics, 2021, 6(5): 4638-4663.
doi: 10.3934/math.2021273
[3]
Yanhong Su, Zengtai Gong, Na Qin .
Complex interval-value intuitionistic fuzzy sets: Quaternion number representation, correlation coefficient and applications. AIMS Mathematics, 2024, 9(8): 19943-19966.
doi: 10.3934/math.2024973
[4]
Tatjana Grbić, Slavica Medić, Nataša Duraković, Sandra Buhmiler, Slaviša Dumnić, Janja Jerebic .
Liapounoff type inequality for pseudo-integral of interval-valued function. AIMS Mathematics, 2022, 7(4): 5444-5462.
doi: 10.3934/math.2022302
[5]
Mustafa Ekici .
On an axiomatization of the grey Banzhaf value. AIMS Mathematics, 2023, 8(12): 30405-30418.
doi: 10.3934/math.20231552
[6]
Muhammad Bilal Khan, Muhammad Aslam Noor, Thabet Abdeljawad, Bahaaeldin Abdalla, Ali Althobaiti .
Some fuzzy-interval integral inequalities for harmonically convex fuzzy-interval-valued functions. AIMS Mathematics, 2022, 7(1): 349-370.
doi: 10.3934/math.2022024
[7]
Waqar Afzal, Mujahid Abbas, Jongsuk Ro, Khalil Hadi Hakami, Hamad Zogan .
An analysis of fractional integral calculus and inequalities by means of coordinated center-radius order relations. AIMS Mathematics, 2024, 9(11): 31087-31118.
doi: 10.3934/math.20241499
[8]
Le Fu, Jingxuan Chen, Xuanchen Li, Chunfeng Suo .
Novel information measures considering the closest crisp set on fuzzy multi-attribute decision making. AIMS Mathematics, 2025, 10(2): 2974-2997.
doi: 10.3934/math.2025138
[9]
Li Li, Mengjing Hao .
Interval-valued Pythagorean fuzzy entropy and its application to multi-criterion group decision-making. AIMS Mathematics, 2024, 9(5): 12511-12528.
doi: 10.3934/math.2024612
[10]
Scala Riccardo, Schimperna Giulio .
On the viscous Cahn-Hilliard equation with singular potential and inertial term. AIMS Mathematics, 2016, 1(1): 64-76.
doi: 10.3934/Math.2016.1.64
Abstract
We derive a matrix version of Li & Yau–type estimates for positive solutions of semilinear heat equations on Riemannian manifolds with nonnegative sectional curvatures and parallel Ricci tensor, similarly to what R. Hamilton did in [5] for the standard heat equation. We then apply these estimates to obtain some Harnack–type inequalities, which give local bounds on the solutions in terms of the geometric quantities involved.
1.
Introduction
Random numbers are very important in statistical, probability theory, and mathematical analysis in such complex cases, where the real numbers are difficult to record. The random numbers are generated from the uniform distribution when an interval is defined for their selection of random numbers. The random numbers are generated in sequence and depict the behavior of the real data. In addition, random data can be used for estimation and forecasting purposes. According to [1], "The method is based on running the model many times as in random sampling. For each sample, random variates are generated on each input variable; computations are run through the model yielding random outcomes on each output variable. Since each input is random, the outcomes are random. In the same way, they generated thousands of such samples and achieved thousands of outcomes for each output variable. In order to carry out this method, a large stream of random numbers was needed". To generate random numbers, a random generator is applied. The random numbers have no specific pattern and are generated from the chance process. Nowadays, the latest computer can be used to generate random numbers using a well-defined algorithm; see [1]. Bang et al. [2] investigated normality using random-number generating. Schulz et al. [3] presented a pattern-based approach. Tanyer [4] generated random numbers from uniform sampling. Kaya and Tuncer [5] proposed a method to generate biological random numbers. Tanackov et al. [6] presented a method to generate random numbers from the exponential distribution. Jacak et al. [7] presented the methods to generate pseudorandom numbers. More methods can be seen in [8,9,10].
The neutrosophic statistical distributions were found to be more efficient than the distributions under classical statistics. The neutrosophic distributions can be applied to analyze the data that is given in neutrosophic numbers. Sherwani et al. [11] proposed neutrosophic normal distribution. Duan et al. [12] worked on neutrosophic exponential distribution. Aliev et al. [13] generated Z-random numbers from linear programming. Gao and Ralescu [14] studied the convergence of random numbers generated under an uncertain environment. More information on random numbers generators can be seen in [15,16,17,18]. In recent works, Aslam [19] introduced a truncated variable algorithm for generating random variates from the neutrosophic DUS-Weibull distribution. Additionally, in another study [20], novel methods incorporating sine-cosine and convolution techniques were introduced to generate random numbers within the framework of neutrosophy. Albassam et al. [21] showcased probability/cumulative density function plots and elucidated the characteristics of the neutrosophic Weibull distribution as introduced by [22]. The estimation and application of the neutrosophic Weibull distribution was also presented by [21].
In [22], the Weibull distribution was introduced within the realm of neutrosophic statistics, offering a more inclusive perspective compared to its traditional counterpart in classical statistics. [21] further examined the properties of the neutrosophic Weibull distribution introduced by [22]. Despite an extensive review of existing literature, no prior research has been identified regarding the development of algorithms for generating random numbers using both the neutrosophic uniform and Weibull distributions. This paper aims to bridge this gap by presenting innovative random number generators tailored specifically for the neutrosophic uniform distribution and the neutrosophic Weibull distribution. The subsequent sections will provide detailed explanations of the algorithms devised to generate random numbers for these distributions. Additionally, the paper will feature multiple tables showcasing sets of random numbers across various degrees of indeterminacy. Upon thorough analysis, the results reveal a noticeable decline in random numbers as the degree of indeterminacy increases.
2.
Neutrosophic uniform distribution
Let xNU=xNL+xNUIxNU;IxNUϵ[IxLU,IxUU] be a neutrosophic random variable that follows the neutrosophic uniform distribution. Note that the first part xNL denotes the determinate part, xNUIxNU the indeterminate part, and IxNUϵ[IxLU,IxUU] the degree of indeterminacy. Suppose f(xNU)=f(xLU)+f(xUU)INU;INUϵ[ILU,IUU] presents the neutrosophic probability density function (npdf) of neutrosophic uniform distribution (NUD). Note that the npdf of NUD is based on two parts. The first part xNL, f(xLU) denotes the determinate part and presents the probability density function (pdf) of uniform distribution under classical statistics. The second part xNUIxNU, f(xUU)INU denotes the indeterminate part and IxNUϵ[IxLU,IxUU], INUϵ[ILU,IUU] are the measures of indeterminacy associated with neutrosophic random variable and the uniform distribution. The npdf of the uniform distribution by following [22] is given as
Note here that the npdf of uniform distribution is a generalization of pdf of the uniform distribution. The neutrosophic uniform distribution reduces to the classical uniform distribution when IxUU = 0. The neutrosophic cumulative distribution function (ncdf) of the neutrosophic uniform distribution is given by
Note that the first part presents the cumulative distribution function (cdf) of the uniform distribution under classical statistics, and the second part is the indeterminate part associated with ncdf. The ncdf reduces to cdf when IxUU = 0. The simplified form of ncdf of the Uniform distribution when L=U=S can be written as
where α and β are the scale and shape parameters of the Weibull distribution. The npdf of the Weibull distribution reduces to pdf of the Weibull distribution when INS=0. The ncdf of the Weibull distribution is expressed by
F(xNSW)=1−{e−(xNSWα)β(1+INW)}+INW;INWϵ[ILW,IUW].
(8)
The ncdf of the Weibull distribution reduces to cdf of the Weibull distribution under classical statistics when INW = 0. The neutrosophic mean of the Weibull distribution is given as [22]
μNW=αΓ(1+1/β)(1+INW);INWϵ[ILW,IUW].
(9)
The neutrosophic median of the Weibull distribution is given by
˜μNW=α(ln(2))1/β(1+INW);INWϵ[ILW,IUW].
(10)
4.
Simulation methodology
This section presents the methodology to generate random variates from the proposed neutrosophic uniform distribution and the neutrosophic Weibull distribution. Let uNϵ[uL,uU] be a neutrosophic random uniform from uN∼UN([0,0],[1,1]). The neutrosophic random numbers from NUD and NWD will be obtained as follows:
Step-4: From the routine, the first value of xNSW will be generated.
Step-5: Repeat the routine k times to generate k random numbers from NWD.
4.1. Examples
To illustrate the proposed simulation methods, two examples will be discussed in this section.
4.1.1. Example 1
Suppose that xNSU is a neutrosophic uniform random variable with parameters ([20,20],[30,30]) and a random variate xNSU under indeterminacy is needed. To generate a random number from NUD, the following steps have been carried out.
Step-1: Generate a uniform random number uN=0.05 from uN∼UN([0,0],[1,1]).
Step-2: Fix the values of INS=0.1.
Step-3: Generate values of xNSU using the expression xNSU=20+(0.05(1+0.1))(30−20)=20.5.
Step-4: From the routine, the first value of xNSU=20.5 will be generated.
Step-5: Repeat the routine k times to generate k random numbers from NUD.
4.1.2. Example 2
Step-1: Generate a uniform random number uN=0.30 from uN∼UN([0,0],[1,1]).
Step-2: Fix the values of INS=0.20, α=5, and β=0.5.
Step-3: Generate values of xNSW using the expression xNSW=5[−ln(1−(uN−INW)1+INW)]10.5=0.04.
Step-4: From the routine, the first value of xNSW=0.04 will be generated.
Step-5: Repeat the routine k times to generate k random numbers from NWD.
5.
Simulation study
In this section, random numbers are generated by simulation using the above-mentioned algorithms for NUD and NWD. To generate random numbers from NUD, several uniform numbers are generated from uN∼UN([0,0],[1,1]) and placed in Tables 1 and 2. In Tables 1 and 2, several values of INS are considered to generate random numbers from the NUD. Table 1 is depicted by assuming that NUD has the parameters aNS = 10 and bNS = 20 and Table 2 is shown by assuming that NUD has the parameters aNS = 20 and bNS = 30. From Tables 1 and 2, the following trends can be noted in random numbers generated from NUD.
Table 1.
Random numbers from NUD when aNS = 10 and bNS = 20.
1) For fixed INS, aNS = 10 and bNS = 20, as the values of u increase from 0.05 to 0.95, there is an increasing trend in random numbers.
2) For fixed u, aNS = 10 and bNS = 20, as the values of INS increase from 0 to 1.1, there is a decreasing trend in random numbers.
3) For fixed values of u and INS, as the values of aNS and bNS increases, there is an increasing trend in random numbers.
The random numbers for NWD are generated using the algorithm discussed in the last section. The random numbers for various values of u, INS, α, and β are considered. The random numbers when α=5 and β=0 are shown in Table 3. The random numbers when α=5 and β=1 are shown in Table 4. The random numbers when α=5 and β=2 are shown in Table 5.
Table 3.
Random numbers from NUD when α=5 and β=0.5.
In this section, the performance of simulations using classical simulation and neutrosophic simulation will be discussed using the random numbers from the NUD and the NWD distribution. As explained earlier, the proposed simulation method under neutrosophy will be reduced to the classical simulation method under classical statistics when no uncertainty is found in the data. To study the behavior of random numbers, random numbers from NUD when INS=1.1, aNS = 20, and bNS = 30 are considered and depicted in Figure 3. In Figure 3, it can be seen that the curve of random numbers from the classical simulation is higher than the curve of random numbers from the neutrosophic simulation. From Figure 3, it is clear that the proposed neutrosophic simulation method gives smaller values of random numbers than the random numbers generated by the neutrosophic simulation method. The random numbers from NWD when INS=0.9, α=5, and β=0.5 are considered and their curves are shown in Figure 4. From Figure 4, it can be seen that random numbers generated by neutrosophic simulation are smaller than the random numbers generated by the classical simulation method under classical statistics. The random numbers generated by the neutrosophic simulation are close to zero. The random numbers from NWD when INS=0.1, α=5, and β=1 (exponential distribution) are considered and their curves are shown in Figure 5. From Figure 5, it can be seen that the curve of random numbers generated by neutrosophic simulation is lower than the curve of random numbers generated by the classical simulation method under classical statistics. The random numbers from NWD when INS=0.1, α=5, and β=2 are considered and their curves are shown in Figure 6. From Figure 6, it can be seen that the curve of random numbers generated by neutrosophic simulation is lower than the curve of random numbers generated by the classical simulation method under classical statistics. From Figures 4–6, it can be concluded that the proposed simulation gives smaller values of random numbers as compared to the classical simulation method under classical statistics.
Figure 3.
Random numbers behavior from NUD when INS=1.1, aNS = 20, and bNS = 30.
The simulation method under neutrosophic statistics and classical methods was discussed in the last sections. From Tables 1 and 2, it can be seen that random numbers from the NUD can be generated when INS<1, INS=1 and INS>1. On the other hand, the random numbers from the NWD can be generated for INS<1, INS=1, and INS>1 when the shape parameter β<1. From Table 4 and 5, it can be noted that for several cases, the NWD generates negative results or random numbers do not exist. Based on the simulation studies, it can be concluded that the NWD generates random numbers INS<1, INS=1, and INS>1 only when β<1. To generate random numbers from NWD when β≥1, the following expression will be used
xNSW=α[−ln(1−uN+INW1+INW)]1β;1−uN+INW≥0.
8.
Concluding remarks
In this paper, we initially introduced the NUD and presented a novel method for generating random numbers from both NUD and the NWD. We also introduced algorithms for generating random numbers within the context of neutrosophy. These algorithms were applied to generate random numbers from both distributions using various parameters. We conducted an extensive discussion on the behavior of these random numbers, observing that random numbers generated under neutrosophy tend to be smaller than those generated under uncertain environments. It is worth noting that generating random numbers from computers is a common practice. Tables 1–5 within this paper offer valuable insights into how the degree of determinacy influences random number generation. Additionally, these tables can be utilized for simulation purposes in fields marked by uncertainty, such as reliability, environmental studies, and medical science. From our study, we conclude that the proposed method for generating random numbers from NUD and NWD can be effectively applied in complex scenarios. In future research, exploring the statistical properties of the proposed NUD would be advantageous. Additionally, investigating the proposed algorithm utilizing the accept-reject method could be pursued as a future research avenue. Moreover, there is potential to develop algorithms using other statistical distributions for further investigation.
Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Acknowledgements
The authors are deeply thankful to the editor and reviewers for their valuable suggestions to improve the quality and presentation of the paper.
Conflict of interest
The authors declare no conflicts of interest.
References
[1]
D. Castorina, G. Catino, C. Mantegazza, Semilinear Li & Yau inequalities, unpublished work.
[2]
S. Gallot, D. Hulin, J. Lafontaine, Riemannian geometry, Berlin, Heidelberg: Springer, 1990. http://dx.doi.org/10.1007/978-3-642-18855-8
[3]
R. S. Hamilton, Four-manifolds with positive curvature operator, J. Differential Geom., 24 (1986), 153–179. http://dx.doi.org/10.4310/jdg/1214440433 doi: 10.4310/jdg/1214440433
[4]
R. S. Hamilton, The Harnack estimate for the Ricci flow, J. Differential Geom., 37 (1993), 225–243. http://dx.doi.org/10.4310/jdg/1214453430 doi: 10.4310/jdg/1214453430
[5]
R. S. Hamilton, A matrix Harnack estimate for the heat equation, Commun. Anal. Geom., 1 (1993), 113–126. http://dx.doi.org/10.4310/CAG.1993.v1.n1.a6 doi: 10.4310/CAG.1993.v1.n1.a6
[6]
R. S. Hamilton, The Harnack estimate for the mean curvature flow, J. Differential Geom., 41 (1995), 215–226. http://dx.doi.org/10.4310/jdg/1214456010 doi: 10.4310/jdg/1214456010
[7]
P. Li, S.-T. Yau, On the parabolic kernel of the Schrödinger operator, Acta Math., 156 (1986), 153–201. http://dx.doi.org/10.1007/BF02399203 doi: 10.1007/BF02399203
[8]
C. Mantegazza, Lecture notes on mean curvature flow, Basel: Springer, 2011. http://dx.doi.org/10.1007/978-3-0348-0145-4
Giacomo Ascione, Daniele Castorina, Giovanni Catino, Carlo Mantegazza. A matrix Harnack inequality for semilinear heat equations[J]. Mathematics in Engineering, 2023, 5(1): 1-15. doi: 10.3934/mine.2023003
Giacomo Ascione, Daniele Castorina, Giovanni Catino, Carlo Mantegazza. A matrix Harnack inequality for semilinear heat equations[J]. Mathematics in Engineering, 2023, 5(1): 1-15. doi: 10.3934/mine.2023003