A Numerical Schemefor the Probability Density of the First Hitting Time for Some Random Processes

: Departing from a general stochastic model for a moving boundary problem, we consider the density function of probability for the ﬁrst passing time. It is well known that the distribution of this random variable satisﬁes a problem ruled by an advection–diffusion system for which very few solutions are known in exact form. The model considers also a deterministic source, and the coefﬁcients of this equation are functions with sufﬁcient regularity. A numerical scheme is designed to estimate the solutions of the initial-boundary-value problem. We prove rigorously that the numerical model is capable of preserving the main characteristics of the solutions of the stochastic model, that is, positivity, boundedness and monotonicity. The scheme has spatial symmetry, and it is theoretically analyzed for consistency, stability and convergence. Some numerical simulations are carried out in this work to assess the capability of the discrete model to preserve the main structural features of the solutions of the model. Moreover, a numerical study conﬁrms the efﬁciency of the scheme, in agreement with the mathematical results obtained in this work.


Preliminaries
In this manuscript, we let B = {B s : s ≥ 0} be the Brownian motion, and we assume that b, f , σ : [0, ∞) → R are functions. More concretely, we will suppose that f is continuous on [0, ∞), b ∈ L 1 ([0, ∞)) and σ ∈ L 2 ([0, ∞)). The purpose of this work is to investigate the stochastic model Here, x is some fixed (though arbitrary) real number. It is easy to check that the process {X x t : t ≥ 0} is Gaussian, and it has mean equal to t 0 b(s)ds and variance t 0 σ 2 (s)ds. Associated with this process, we define the first hitting time at the boundary f by It is indispensable to remember here that the variable τ f x has a continuous density if f has continuous derivatives up to the first order [1,2].
The class of stochastic processes considered in this investigation is a type of time-homogeneous Gauss-Markov diffusion process. As a consequence, the sample paths are continuous functions (which are nowhere differentiable) and, therefore, the concept of first hitting time through a boundary coincides with that of first passage time (see [3], for instance). In particular, this means that the random variable τ f x can be defined equivalently as Interestingly, the literature on the determination of first passage times in diffusion processes is vast. As examples, there are important research avenues which link the calculation of first passage time probability densities to the resolution of certain Volterra equations of the second kind for homogeneous [4] and non-homogeneous [5] diffusion processes that arise from Wiener processes.
It is important to point out that, for the stochastic model considered in this work, the associated parabolic initial-boundary-value problem (5) is obtained from the Volterra integral equation of the second kind satisfied by the probability density of the first hitting time by making use of Itô's formula and some properties on continuous martingales. The details on this relationship are provided in reference [6]. On the other hand, some exact solutions of this model are known in exact form [6]. More precisely, let α, β ∈ R, X t = x + B t and f (t) = α + βt. For each x < α, Here, Φ is the cumulative distribution of a standard normal random variable. It is easy to check that solves (5) with b ≡ 0 and σ ≡ 1. However, for different expressions of the functions b, f and σ, the determination of explicit solutions for the problem (5) is a difficult task. This limitation motivates the design and analysis of numerical techniques to approximate the distribution of probability of the first hitting time in the stochastic model (1). It is worth pointing out that the determination of the first hitting time often arises in problems associated with moving boundaries. Indeed, there are reports which study the first hitting time and the last exit time for Brownian motions to and from a moving boundary, respectively [7]. Other works tackle the investigation of the first hitting time for reducible diffusion processes [8], one-dimensional diffusion and compound Poisson processes [9], Markov processes between moving retaining or absorbing barriers [10], time-dependent Ornstein-Uhlenbeck processes to a moving boundary [11], moving boundaries for asymptotically stable Lévy processes [12], moving boundaries for some Gaussian stochastic processes [6], the pricing of continuously monitored barrier options under stochastic volatility with jumps [13], just to mention some examples [14][15][16].
In general, moving boundary problems have found interesting applications in the sciences and engineering. Indeed, this family of problems have been found in the diffusion of oxygen in absorbing tissues [17], in the analysis of progressive liquefaction [18], in the mathematical modeling of bread baking [19], in the asymptotic behavior of solutions of multidimensional problems associated with tumor growth [20], in the problem of thermal conduction in the solid phase of a phase-change material during melting driven by natural convection in the liquid [21] and problems on concrete carbonation [22]. Some recent studies have reported on applications of moving boundary problems to the radial fluid flow in infinite low-permeability reservoirs with threshold pressure gradients [23], to space-fractional diffusion logistic population models and density-dependent dispersal rates [24], to problems with variable specific heat and thermal conductivity [24], to the solvent diffusion within glassy polymers [25] and to American call options with transition costs [26], among other recent examples in the sciences and engineering [27,28].
In this manuscript, we investigate a moving boundary problem which considers the presence of a deterministic and a stochastic components. It is well known that the first hitting time has a distribution of probability governed by a parabolic advection-diffusion differential equation, for which very few solutions are known in exact form [6]. Motivated by this fact, we will propose a spatially symmetric finite-difference scheme to approximate the solutions of this differential model. Emphasis will be made on the preservation of the main analytical properties of the solutions of the problem, namely, the symmetry, the boundedness and the monotonicity. In that sense, the scheme proposed in this work will be a structure-preserving model [29,30]. Structure-preserving models have been designed to preserve the positivity and the symmetry of the solutions of Fisher-type equations [31], the monotonicity and boundedness of numerical model for Burgers-Huxley-type equations [32], the positivity of high-order Galerkin schemes for compressible Euler equations [33], the positivity and boundedness of numerical schemes for space-time fractional predator-prey models [34] and the energy and symmetry of Riesz space-fractional nonlinear wave equations [35]. In summary, the development of structure-preserving numerical techniques has been an important factor in problems where particular features of the solutions are physically meaningful [35,36].
In this work, we will investigate a generalization of the parabolic problem arising in Theorem 1. Precisely, we consider the generalized form of the parabolic equation of (5) given by the formula subjected to the initial and boundary conditions We will assume that φ, ψ : R × [0, ∞) → R with φ ≥ 0, and suppose that χ : R → R is a nondecreasing function with the property that 0 ≤ χ ≤ 1.
The present work is organized as follows. Section 2 is devoted to provide a structure-preserving numerical model to solve problem (13). Some equivalent presentations of the discrete system are provided, including a convenient vector form. We show therein that the discrete model conserves non-negativity, boundedness from above and monotonicity of the approximations. In Section 3 we establish that the numerical model is a consistent technique which is unconditionally stable and convergent. Some illustrative examples are provided in that section to show through computational simulations the most important features of the model. Finally, we close this manuscript with a section of discussions and some concluding remarks.

Discrete Model
For the remainder of this work, we will agree that I n = {1, . . . , n} and I n = I n ∪ {0}, for each n ∈ N. For computational purposes, we will let c, d and T be real numbers such that c < d and T > 0, and let K, N ∈ N. We will fix a uniform partition of the interval [c, d] consisting of K subintervals, of the form c = x 0 < x 1 < . . . < x k < . . . < x K = d, for each k ∈ I K . On the other hand, we will also fix a uniform partition of the temporal interval [0, T] consisting of N subintervals, and we will let it take the form 0 = t 0 < t 1 < . . . < t n < . . . < t N = T, for each n ∈ I N . For each (k, n) ∈ I K × I N , we let u n k = u(x k , t n ), and we use U n k to represent a numerical approximation to the exact value of u n k . Let h = (d − c)/K and τ = T/N. Following the usual conventions, we will employ R h to represent the grid {x k : k ∈ I K }. Moreover, V h will denote the set of all real-valued functions defined on R h . It is easy to check then that u n = (u n k ) K k=0 and U n = (U n k ) K k=0 are members of V h , for each n ∈ I N . For the sake of convenience, we will let u = (u n ) N n=0 and U = (U n ) N n=0 in what follows. Moreover, we will require the following discrete linear operators.
n=0 be a sequence in V h . We define the discrete linear operators It is well known that these discrete operators provide consistent first-order or second-order approximations to suitable differential operators under appropriate regularity conditions. Moreover, with this nomenclature, the scheme to approximate the solutions of the initial-boundary-value problem (8) is given by the discrete system About the boundary conditions, we will suppose that the solutions are prescribed at the boundary using Dirichlet data. More precisely, we will assume that ϕ a , ϕ b : [0, T] → R are functions, and we will consider the following initial and boundary conditions: For convenience, Figure 1 provides the forward-difference stencil of the discrete model (13) and (14). It is worth observing the spatial symmetry of the scheme at each time-step.

6
f f Figure 1. Spatially symmetric forward-difference stencil for the approximation of (8) at the time t n using the implicit scheme (13). The black circle represents the known approximation to the exact solution at time t n , while the crosses denote the unknown approximations at time t n+1 .
It is easy to check that the finite-difference scheme (13) and (14) is a two-step implicit technique. Moreover, the discrete model can be expressed in an equivalent form after some algebraic manipulations. For the sake of convenience, define the constants φ n k = φ(x k , t n ) and ψ n k = ψ(x k , t n ), for each (k, n) ∈ I K × I N . Rearranging algebraically the terms in the expression of the general recursive formula in (13), we readily obtain the spatially symmetric implicit expression In this expression, It is obvious from (15) that the finite-difference scheme (13) is a linear model. In order to express it in vector form, we define de (K + 1)-dimensional real vectors We have used here to represent the operation of matrix and vector transposition. It is obvious that U n provides a vector representation of the function U n , for each n ∈ I N . Moreover, notice that b n includes already the data at the boundary, for each n ∈ I N . Now, for each n ∈ I N , we define the real tridiagonal matrix A n = (A n ij ) of size (K + 1) × (K + 1) by Here, we let Using this nomenclature, it is easy to check that the spatially symmetric finite-difference scheme (13) and (14) can be equivalently rewritten in vector form as We will recall now some definitions from the literature.

Definition 2.
A square real matrix is an M-matrix if the following conditions are satisfied for the matrix: (a) it is strictly diagonally dominant, (b) its off-diagonal entries are less than or equal to zero, and (c) its diagonal entries are greater than zero.
It is worth pointing out that every M-matrix is nonsingular, and that the components of its inverse are all positive numbers (see [37] and references therein). Now, we wish to establish conditions under which the matrices A n above are all M-matrices. To that end, we will show that the properties (a), (b) and (c) of Definition 2 are satisfied. Lemma 1. Let n ∈ I N . If hψ n k < φ n k is satisfied for each k ∈ I K−1 , then A n is an M-matrix.
Proof. Observe that the hypotheses imply that R n k > r n k or, equivalently, that µ n k > 0, for each k ∈ I K−1 . Since ν n k > 0 also holds for each k ∈ I K−1 , it follows that the off-diagonal entries of A n are non-positive. It is obvious that the diagonal components of A n are positive, so it only remains to prove that the matrix is strictly diagonally dominant. Let k ∈ I K−1 , and consider the (k + 1)th row of A n . Note that It readily follows then that A n is strictly diagonally dominant, so it is an M-matrix.

Definition 3.
Let V and W be real vectors of the same dimension.
• We use the notation V ≥ 0 to represent that all the components of V are nonnegative. • If the components of V are less than or equal to 1, then we denote this by V ≤ 1. Note that V ≤ 1 if and only if 1 − V ≥ 0, where 1 is the vector of the same dimension of V whose components are equal to 1.

•
If both V ≥ 0 and V ≤ 1 are satisfied, then we will write 0 ≤ V ≤ 1.

•
We use the nomenclature V ≤ W to denote that W − V ≥ 0. Obviously, this represents that each component of V is less then or equal to the corresponding component of W.
The following result establishes the existence and uniqueness of positive and bounded solutions of (13) and (14). The proof will hinge on various applications of Lemma 1.
Let hψ n k < φ n k , for each (k, n) ∈ I K−1 × I N . Then there exists a unique sequence (U n ) N n=0 in V h satisfying (13), with the property that 0 ≤ U n ≤ 1, for each n ∈ I N .
Proof. Beforehand, notice that the assumptions imply that the matrices A n are M-matrices, for each n ∈ I N . The proof of this result employs mathematical induction. Since the first approximation has the desired properties by assumption, we suppose that 0 ≤ U n ≤ 1 holds for some n ∈ I N−1 . The fact that A n+1 is an M-matrix guarantees that it is nonsingular, and that the components of its inverse are all positive numbers. Moreover, the assumptions on the functions ϕ a and ϕ b and the induction hypothesis assure that b n ≥ 0. As a consequence, U n+1 = (A n+1 ) −1 b n ≥ 0, and it only remains to prove that U n+1 ≤ 1. To that end, let 1 be the (K + 1)-dimensional vector all of whose components are equal to 1, and define V n+1 = 1 − U n+1 or, equivalently, U n+1 = 1 − V n+1 . Substituting this identity into the vector equation of (24) and rearranging terms, we obtain that A n+1 V n+1 = c n+1 , where It readily follows that V n+1 ≥ 0 or, equivalently, that U n+1 ≤ 1. Summarizing, we have checked that 0 ≤ U n+1 ≤ 1, and the result follows now by induction.
The following result states that the finite-difference model (13) and (14) is a monotone technique. Theorem 3. Let χ, χ : [c, d] → R and ϕ a , ϕ b , ϕ a , ϕ b : [0, T] → R be functions. Let hψ n k < φ n k and h ψ n k < φ n k , for each (k, n) ∈ I K−1 × I N , and agree that (U n ) N n=0 and ( U n ) N n=0 are the solutions of the numerical model (13) and (14) corresponding to the initial-boundary data (χ, ϕ a , ϕ b ) and ( χ, ϕ a , ϕ b ), respectively. Suppose that the initial-boundary conditions satisfy Then 0 ≤ U n ≤ U n ≤ 1, for each n ∈ I N .
Proof. Beforehand, observe that the hypotheses on the initial conditions assure that 0 ≤ U 0 ≤ 1 and 0 ≤ U 0 ≤ 1. Moreover, the boundary data are bounded in [0, 1]. Theorem 2 implies now that the solutions (U n ) N n=0 and ( U n ) N n=0 of the problem (13) and (14) corresponding to the initial-boundary data (χ, ϕ a , ϕ b ) and ( χ, ϕ a , ϕ b ) exist, are unique, and satisfy 0 ≤ U n ≤ 1 and 0 ≤ U n ≤ 1, for each n ∈ I N . It only remains to show that U n ≤ U n , for each n ∈ I N . Proceeding by induction, notice that this property is satisfied for n = 0, so let us assume that it holds for some n ∈ I N−1 . Observe that are satisfied. Here, b n = ( ϕ a (t n+1 ), U n 1 , . . . , U n K−1 , ϕ b (t n+1 )) .
On the other hand, note that the induction hypothesis and the assumption on the boundary conditions yield that b n − b n ≥ 0. Subtracting now (27) from (28), it follows that We use the fact now that A n+1 is an M-matrix under the hypotheses of this theorem. The fact that the components of the inverse of A n+1 are all positive numbers establishes that U n+1 − U n+1 ≥ 0 or, equivalently, that U n+1 ≥ U n+1 , as desired.
The following is a straightforward consequence of Theorem 3. Its relevance arises from the fact that the solutions of (5) are cumulative distributions of probability in the sense of Theorem 1.
Proof. To start with, notice that the existence and the uniqueness of nonnegative and bounded solutions is guaranteed by Theorem 2, so it only remains to show that U n ≤ U n+1 , for each n ∈ I N−1 .
To that end, let U n = U n+1 , for each n ∈ I N−1 . An application of Theorem 3 to the sequences (U n ) N−1 n=0 and ( U n ) N−1 n=0 establishes now that U n ≤ U n is satisfied for each n ∈ I N−1 , whence the conclusion of this result readily follows.

Numerical Properties
The present section is devoted to study the main numerical features of the finite-difference scheme (13) and (14). In particular, we will investigate the consistency of the scheme, its stability and its convergence. In a first stage, we will tackle the problem of the consistency of our numerical technique. To that end, let Ω = (c, d) × (0, T) and define the differential operator and the difference operator For the sake of convenience, we let L(u n ) = (L(u n k )) K k=0 and L(u n ) = (L(u n k )) K k=0 , for each n ∈ I N .

Theorem 4.
Let u ∈ C 4,2 x,t (Ω), and suppose that φ and ψ are bounded in Ω. There exists a constant C ≥ 0 which is independent of τ and h, such that L(u n ) − L(u n ) ∞ ≤ C(τ + h 2 ), for each n ∈ I N .
Proof. Using the regularity of the functions u, φ and ψ along with Taylor's theorem, it is easy to show that there exist nonnegative constants C 1 , C 2 and C 3 which are independent of τ and h, such that x u n k ≤ C 3 h 2 , ∀(k, n) ∈ I K−1 × I N .
Using the triangle inequality, it is easy to check that The conclusion of this theorem readily follows now if we define C = C 1 + 1 2 C 2 + C 3 , which is a nonnegative constant that is independent of τ and h.
Next, we tackle the problems on the stability and the convergence of the finite-difference scheme. The following technical results will be of utmost importance to that end. Lemma 2 (Chen et al. [38]). Suppose that A is a real matrix of size (K + 1) × (K + 1) which satisfies (37) Lemma 3. Let n ∈ I N . If hψ n k < φ n k , for each k ∈ I K−1 , then which means that the inequality (37) is satisfied in this case. It is easy to check that this inequality is also satisfied when k = 1 or k = K + 1. The conclusion follows now from Lemma 2.
We establish now the nonlinear stability of the finite-difference model (13) and (14). To that end, we will consider two sets of initial-boundary conditions, which will be denoted by (χ, ϕ a , ϕ b ) and ( χ, ϕ a , ϕ b ). The corresponding solutions obtained using the numerical model will be denoted by (U n ) N n=0 and ( U n ) N n=0 , respectively.
Theorem 5. Suppose that hψ n k < φ n k holds for each (k, n) ∈ I K−1 × I N , and let (U n ) N n=0 and ( U n ) N n=0 be solutions of the discrete model (13) and (14) corresponding to the initial-boundary conditions (χ, ϕ a , ϕ b ) and ( χ, ϕ a , ϕ b ), respectively. Then U n − U n ∞ ≤ U 0 − U 0 ∞ , for each n ∈ I N .
Proof. Under the conditions of this result, the conclusion of Lemma 3 is satisfied. As a consequence The conclusion of this result readily follows now using mathematical induction.
The following result will be required to prove the linear stability of our scheme. In that result, the function ρ(·) will denote the spectral radius of real and square matrices. [39]). Let M = (m ij ) be an M-matrix, and let N = (n ij ) be a nonnegative matrix of the same size as M. If M is strictly diagonally dominant by rows then ρ(M −1 N) satisfies

Lemma 4 (Tian and Huang
Theorem 6. If hψ n k < φ n k is satisfied for each (k, n) ∈ I K−1 × I N , then the scheme (13) and (14) is linearly stable.
Proof. The hypotheses guarantee that A n is an M-matrix, for each n ∈ I N . On the other hand, the applying the previous lemma with N being the identity matrix of the same size as A n yields The linear stability of the scheme readily follows from this fact.
The next result is a direct consequence of the consistency and stability properties of the scheme.

Theorem 7.
Let u ∈ C 4,2 x,t (Ω) be a solution of the problem (8) and (9), and suppose that φ and ψ are bounded in Ω. The solutions of the corresponding discrete model (13) and (14) converge to u with order O(τ + h 2 ), whenever the parameter h satisfies hψ n k < φ n k , for each (k, n) ∈ I K−1 × I N .
Before closing this section, we will provide some illustrative simulations on the performance of the numerical model proposed in this work. In particular, we wish to exhibit the capability of the numerical model to preserve the positivity, the boundedness and the monotonicity of the discrete solutions. To that end, we will compare the numerical results against the exact solution described after Theorem 1. It is worth pointing out that the initial and the boundary data will be prescribed exactly using that analytical solution.
In our simulations, we will consider the stochastic process X t = x + B t with the moving boundary f (t) = α + βt. In that case, the solution of the problem (5) is given by the function (7). We will set now α = 1, Ω = (0, 1) × (0, 10), and employ the computational parameters h = 0.01 and τ = 0.0001. Under these circumstances, Figure 2 shows the exact solution (left) and the numerical approximation (right) to the solution of this problem. We used the finite-difference scheme (13) and (14) Figure 3, and they prove that there exists a good agreement between the numerical and the theoretical results, as expected. To check this fact, Figure 4 provides absolute error plots corresponding to the graphs in Figure 3. Finally, Figure 5 provides a graph of the analysis of precision (using the · ∞ norm) versus computational cost, and contrasts the results against those obtained in [6] for the model described in the caption therein. The present scheme shows a superior performance due to the fact that less computer operations are required.   (7), while the numerical approximation was obtained using (13) and (14) (7), while the numerical approximation was obtained using (13) and (14). The remaining model and numerical parameters used are α = 1, c = 0, d = 1, T = 10, h = 0.01, τ = 0.0001.  (13) and the scheme reported in [6]. The graphs were obtained using b ≡ 0, σ ≡ 1 and f (t) = α + βt. The exact solution was given by (7). The remaining model parameters are α = 1, β = 1, c = 0, d = 1, T = 10.

Discussion and Conclusions
To start with, we present various remarks with the intention of responding various important criticisms and suggestions by the reviewers of this work.
1. Regarding the calculation of the first hitting time densities, only some few solutions are known in exact form for certain types of boundaries [4,5]. In every other case, numerical schemes should be considered and, in that sense, the present work contributes to the development of reliable numerical models to approximate the densities of first hitting times. However, we must point out that those densities can also be approximated by numerical schemes derived from the approximation to the associated integral equations. It is worth pointing out that some software has been developed following that approach [40]. The author of the present manuscript has followed a different approach, but the comparison between the present scheme and that reported in [40] is an interesting topic of investigation. However, extensive tests would need to be carried out under similar computational conditions. To start with, the codes must be in the same language and tests must be performed under the same computational architecture. To this day, the author has not devoted time to perform these tests, but it is an interesting task that the author of this work intends to carry out in the future. 2. We must mention that it is possible to generalize the numerical procedure proposed in this work to account for more general stochastic processes than that considered herein, though some suitable adjustments are needed to that effect. As an example, it is well known that the probability distribution of the first passage time for Lévy time-charged Brownian motion with drift is a solution of a time-fractional advection-diffusion equation subjected to initial-boundary conditions [41]. In that case, the present approach can be modified to account for the presence of Caputo time-fractional derivatives and approximate the solutions of the associated partial differential equation. However, the structural and numerical analysis of that scheme would require a substantial amount of more effort and time. That could be the research topic of some independent report in the near future. 3. It is important to point out that the same mathematical problem was considered in the work [6].
In that paper, the authors proposed a finite-difference scheme to approximate the probability distribution of the first hitting time associated with the same problem investigated in the present manuscript. The present approach has more advantages, though. To start with, the current numerical model is easier to implement computationally than that investigated in [6]. This fact can be easily checked from the Matlab code in Appendix A. Moreover, various theoretical and numerical advantages in the present approach are described below in the conclusions. 4. The numerical scheme presented in this work may be relatively simple, but the analysis is rigorous and has various advantages. For example, it preserves the positivity, the boundedness and the monotonicity of the numerical solutions. This is an important feature in view that the relevant solutions of the parabolic problem considered herein possess these properties. The existence and uniqueness of solutions was thoroughly established here. Moreover, the scheme proposed in this work was theoretically analyzed for the numerical properties. Another advantage of our present approach is that the proofs of stability and convergence do not require additional conditions other than those asked to guarantee the existence of solutions.
Summarizing, we proposed a finite-difference model to solve a parabolic initial-value-problem associated with a stochastic model. The motivating problem is a stochastic equation which considers both the presence of a deterministic component and a Gaussian term, as well as nonconstant coefficients. This system has various applications, including the modeling of moving boundary systems and crossing times. It is known that the first hitting time of the stochastic model has a probability distribution which is described by a linear parabolic initial-boundary-value problem. The exact solution of that problem is only known in some specific scenarios, whence the need to propose a reliable numerical model to solve it is an important problem of investigation. Moreover, in view that the relevant solutions of the initial-boundary-value problem are cumulative distributions of probability, it is important to guarantee that the numerical solutions be nondecreasing and nonnegative functions, bounded from above by 1.
The proposed finite-difference scheme is a numerical model which is capable of preserving the properties of monotonicity, nonnegativity and boundedness, and that has spatial symmetry. These features are thoroughly established in this work using matrix theory. Solutions of the discrete model exist, and the computer implementation of this discrete model can be carried out efficiently using matrix representations. The scheme is quadratically consistent in space, and linearly consistent in time. The properties of linear stability, nonlinear stability and convergence of the scheme are also theoretically elucidated. In particular, we show that our numerical model has order of convergence equal to 2 in space, and equal to 1 in time. We implemented the scheme computationally, and some computer simulations were provided in this work in order to show that the scheme is capable of preserving the main features of the relevant solutions of the initial-boundary-value problem. In addition, our computational results confirm that the scheme is stable and convergent.
The present approach has various advantages with respect to some previous efforts reported in the literature to approximate the cumulative probability distribution of the first hitting time to similar moving boundary problems. For example, in reference [6], the authors proposed and analyzed a finite-difference scheme to approximate the probability distribution of the first hitting time for the same problem investigated in the present work. Various advantages are found in the present manuscript when compared against that work of the literature:

•
The numerical model introduced in the present work has a much easier computational implementation, in view that the system to solve at each time step is simpler. Indeed, the simplified Matlab program to obtain the simulations in this manuscript is that presented in Appendix A. Notice the simplicity of the code. Obviously, the computer program may be simplified or generalized even more. • The current discretization presents spatial symmetry. • The analysis of stability is the numerical model of the present manuscript was carried out without assuming that the matrices A n+1 depend on the approximations at the time t n . This is a strong limitation of the results in [6]. Indeed, in that work, the authors needed to assume that the matrices did not depend on U n , which was an unrealistic assumption.
• The limitations of [6] described in the previous remark carried over to the analysis of convergence. Indeed, the model proposed in that paper had order of convergence O(τ 2 + h 2 ), but the hypotheses to guarantee that order were utterly restrictive and unrealistic. • Stability and convergence were established in the present discretization. On the contrary, the paper mentioned above requires additional constraints which limit the approach severely.
Our present approach has convergence order O(τ + h 2 ), but the theoretical result need less constraints to guarantee this order. We have performed numerical tests of convergence (not presented here in order to avoid redundancy), and they show that the present scheme has linear order of convergence in the temporal variable, and second order in the spatial domain. • It is worth mentioning that there are various reports available in the literature in which problems with moving boundaries have been investigated numerically [42][43][44][45][46][47][48]. However, the present is an easy-to-implement model which preserves various advantages from the structural and numerical points of view.

Funding:
The author wishes to acknowledge the financial support from the National Council for Science and Technology of Mexico (CONACYT) through grant A1-S-45928.