1. Introduction
Differential equations with random inputs, referred to as stochastic differential equations (SDEs), are broadly used in applications to, e.g., characterize the evolution of the states of dynamical and other physical systems [
1] (Chap. 7). If the input to an SDE is a Gaussian process whose memory is much shorter than that of the equation, it is typically assumed that the input has no memory, i.e., it is a Gaussian white noise (GWN) process. Otherwise, the input can be defined by the solution of a linear system to GWN so that the state of the SDE under consideration, augmented with that of the linear system, satisfies a new SDE driven by GWN. The GWN is viewed as the formal derivative of the Brownian motion process so that the SDEs with GWN are interpreted in the Itô sense. Their differential and integral forms have been used to develop numerical integration algorithms. The Euler formula, a forward finite difference integration scheme, is simple to implement and delivers satisfactory results for sufficiently small integration time steps. More accurate integration schemes, e.g., the Taylor and Milstein formulas, are available [
1] (Chaps. 9 and 10) and [
2] (Sect. 3.4).
The solutions of SDEs with GWN are random processes with continuous paths, which provide realistic models for a broad range of applications. However, they cannot capture sudden changes in the states of, e.g., nonlinear systems with multiple potential wells and linear systems subjected to random pulses. These phenomena can be described by SDEs with Poisson white noise (PWN) and sums of Poisson and Gaussian white noise processes [
3,
4,
5]. The PWN process has random pulses arriving at Poisson times. It is defined by the formal derivative of the compound Poisson process (CPP), which has piecewise constant paths with jumps of random magnitudes at Poisson times. The fixed time step algorithms for integrating SDEs with GWN cannot be used directly for SDEs with PWN since the pulses of this noise process arrive at random times. There are two conceptually different integration methods for SDEs with PWN [
6,
7].
The method in [
6] constructs a recurrence formula, which gives the value of the solution of an SDE with PWN at the end of a selected integration time step in terms of its value at the beginning of the time step and the contribution of the PWN during this step. The construction is based on approximations of the integral version of the posed Itô SDE written between the ends of each time step. The resulting recurrence formula has the form of the Euler scheme for integrating SDEs with GWN.
The method in [
7] is based on the representation of the CPP defining the input PWN by a random walk with a selected fixed time step. The process takes random constant values in each time step, which result from the properties of the PWN. The representation is extended to SDEs with Lévy white noise (LWN) interpreted as the formal derivative of the Lévy process since this process can be represented by the sum of properly scaled compound Poisson and Brownian motion processes and the Brownian motion process can also be described by a random walk model. The method has been applied to integrate SDE with PWN, GWN and LWN. The resulting integration scheme resembles the Euler formula for integrating SDEs with GWN. The algorithm has also been used to characterize extremes of solutions of SDEs with PWN and LWN.
We develop a unified method for integrating SDEs with GWN and PWN, which is conceptually different from the current methods, such as the algorithms in [
6,
7]. Instead of integrating discrete time versions of the posed SDEs, we solve the posed SDEs for finite dimensional (FD) models of the Brownian motion and compound Poisson input processes, i.e., finite sums of
d deterministic functions of time weighted by random coefficients. Since the input processes have the same correlation function under proper scaling, their FD models live in the linear space spanned by the same deterministic functions of time, referred to as basis functions. Then, the same algorithm is required to solve the posed SDEs under FD models for GWN and PWN. Paths of the resulting solutions, referred to as FD solutions, can be obtained by using standard ODE solvers since the paths of the input FD models are smooth. In summary, FD solutions of the posed SDEs under GWN and PWN can be obtained by running ODE solvers for paths of FD input models, which can be obtained by elementary calculations from samples of their random coefficients. The proposed method has a notable feature for applications, which is not available for the current integration methods. It gives conditions under which the distributions of extremes and other functionals of the solutions of posed SDEs can be approximated by those of the FD solutions. This is essential for applications since statistics of FD solutions can be constructed from their paths, which can be generated by standard numerical algorithms, and actual solution paths are rarely available analytically and cannot be obtained numerically.
The paper is organized as follows.
Section 2 reviews essential properties of the compound Poisson and Brownian motion processes. FD models for these processes are constructed in
Section 3. Their basis functions are the top
d eigenfunctions of the correlation function of the Brownian motion and compound Poisson input processes, i.e., the eigenfunctions corresponding to the largest
d eigenvalues. Since the common correlation function of these processes is continuous, so are its eigenfunctions, so that the paths of the input FD models are continuous. The weak convergence of the FD models of compound Poisson and Brownian motion processes is examined in
Section 4. The analysis has to be performed in a space of functions with jumps, rather the space of continuous functions,
Section 5 proves the weak convergence of compound Poisson processes and of their FD models to the Brownian motion. The weak convergence of FD solutions to solutions of posed SDEs is discussed in
Section 6. Numerical illustrations are in
Section 7. They deal with the weak convergence of FD models of compound Poisson processes to Brownian motion and of FD solutions of SDEs with additive and multiplicative PWN inputs. Concluding remarks are in
Section 8.
2. Compound Poisson and Brownian Motion Processes
Let
be a compound Poisson process defined by
where
are independent identically distributed (iid) zero-mean random variables with finite variance and
is a homogeneous Poisson process with distribution
of intensity parameter
. The compound Poisson process has independent increments, so that
and
,
, are independent Poisson random variables of intensities
and
. The mean and correlation functions of
C are
where
.
The Brownian motion process is a zero-mean Gaussian process with independent increments and correlation function . If the first two moments of the iid random variables in the definition of the compound Poisson process are and , then the Brownian motion and the compound Poisson processes are equal in the second moment sense, i.e., they have the same mean and correlation functions. The processes have independent Gaussian and non-Gaussian increments. The paths of the Brownian motion in a time interval are elements of the space of real-valued continuous functions while the paths of the compound Poisson process are not in this space since they are piecewise constant with jumps at Poisson times.
The jumps in the paths of the compound Poisson process are finite since
by assumption and
by the Tchebychev and the Cauchy–Schwarz inequalities so that
as
. The number of jumps in any bounded time interval
is finite since
so that
This shows that the paths of compound Poisson process in a time interval
are elements of the space
of real-valued functions that are right continuous with left limits, which includes the space
[
8] (Sect. 12).
The metric
, which quantifies the discrepancy between two elements
, does not work in
. Heuristically, two elements
x and
y of
are near to each other if their ordinates and their jump times are small perturbations of each other. This suggests that the discrepancy between two elements
x and
y of
can be quantified by the difference between their ordinates at slightly distorted times. The Skorohod metric is used to quantify the discrepancy between elements of
and construct a topology on this space, referred to as the Skorohod topology [
9] (Chap. 3). This metric restricted to continuous functions coincides with the sup-metric of
.
The subsequent sections (1) construct finite dimensional (FD) models and for the Brownian motion and the compound Poisson processes, B and C, i.e., finite sums of deterministic functions with random coefficients, and (2) establish conditions under which converge weakly to B;C and the FD solutions converge weakly to corresponding target solutions. Under these conditions, functionals of FD solutions, which can be obtained from FD models of Brownian motion and the compound Poisson processes by standard integration algorithms for ordinary differential equations (ODEs), can be used as surrogates for the corresponding functionals of target solutions, which are rarely available analytically and cannot be obtained numerically. The last part of the paper illustrates the implementation and the accuracy of the proposed integration algorithm by numerical examples.
3. Finite Dimensional (FD) Models for B and C
We assume without loss of generality for our theoretical arguments that the reference time is
. It is also assumed that the first two moments of the jumps of the compound Poisson process
are
and
so that
and
. The eigenvalues and the eigenfunctions of the common correlation function of
B and
C are
The two processes admit the Karhunen–Loève (KL) series representation
with equality in the second moment sense, where
are zero-mean uncorrelated random variables with variances
, i.e.,
and
. However, the random coefficients of the KL representations of
C and
B have different distributions.
Denote by
and
the random coefficients of the representations of
B and
C. Samples of these coefficients can be obtained by projecting paths of
C and
B on the eigenfunctions
, i.e.,
These coefficients are dependent non-Gaussian variables for
C and independent Gaussian variables for
B.
Truncated versions of the KL series in (
5) with random coefficients in (
6) define the FD models
of
C and
B. The basis functions of the above FD models are the top
d eigenfunctions of the correlation function of
C and
B, i.e., the eigenfunctions corresponding to the largest
d eigenvalues. The stochastic dimension of these models is
d since they depend on
d random variables. The joint distribution of the non-Gaussian coefficients
is unknown. It can be estimated from samples of
delivered by (
6). In contrast, the joint distribution of
is known and results from the fact that the components of this vector are independent zero-mean Gaussian variables with variances
. Note also that the FD models
and
use the same basis functions so that their paths are elements of the linear space spanned by the functions
. Since the eigenfunctions are differentiable, the paths of
and
are differentiable functions so that they are in
.
4. Weak Convergence Cd ⟹ C and Bd ⟹ B
According to Theorem 15.6 in [
9] and Theorem 13.5 in [
8], the FD models
converge weakly to
C as
(written
) if (1) the finite dimensional distributions (FDDs) of
converge to those of
C as
and (2) for
and
, the inequality
holds for
and
, where
F is a nondecreasing, continuous function on
. The weak convergence
implies the convergence
in distribution as
by the continuous mapping theorem [
10] (Theorem 18.11) since the sup functional is continuous.
Theorem 1. If the random variables in (1) have finite variances, the FDDs of converge to the FDDs of C as . Proof. Denote by
and
the correlation functions of
C and
. Since the correlation function of
C is continuous, the series
converges uniformly and absolutely on
by Mercer’s theorem [
11] (Sect. 6.2). Then,
and
as
so that
which means that
in the mean square sense for any
Then, the random vector
converges to
in mean square as
for any integer
and times
in
. The Cramér–Wold criterion [
12] (Theorems 5.1 and 5.2) gives the convergence of the joint distribution of
to that of
, i.e., the convergence of the FDDs of
to those of
C as
. □
A practical implication of the above theorem is that the marginal and the finite dimensional distributions of C can be approximated by those of for a sufficiently large stochastic dimension d.
Theorem 2. If the random variables in (1) have finite variance, the FD models converge weakly to C () as . Proof. The FDDs of
converge to those of
C by the previous theorem. It remains to show that we can find
,
and
F such that the inequality of (
8) is satisfied. The increments of
in this condition have the form
where
and
. The final expressions of these increments result from the mean value theorem, where
and
. The second moments of the increments have the form
The left side of (
8) for
has the form
by using the Cauchy–Schwarz inequality and the notation
. Then, the inequality of (
8) is satisfied for
and
so that
. □
The arguments of the above theorem apply to the FD model
of
B since the FD models
and
have the same functional form, their paths are in
and this space is included in
. This means that
converges weakly to
B under the condition of the above theorem. Note that the FDDs of
converge to those of
B as
since these processes are Gaussian and the correlation function of
converges to that of
B as
by Mercer’s theorem (see Theorem 1). An alternative proof for the convergence
can be found in [
12] (Theorems 5.16 and 5.17).
The above statements imply that continuous functionals of and converge in distribution to corresponding functionals of C and B, e.g., and in distribution as . The practical implication is that the distribution of can be approximated by that of and the distribution of can be approximated by that of provided that d is sufficiently large.
5. Weak Convergence C, Cd ⟹ B
The paths of the processes
C and
B are elements of the spaces
and
so that the relationship between these processes has to be examined in
. We show that
C under proper scaling satisfies the conditions of Theorem 15.6 in [
9] and Theorem 13.5 in [
8] and conclude that
C converges weakly to
B as
.
Theorem 3. If the jumps of C are zero-mean Gaussian variables with variances , the FDDs of C converge to the FDDs of B as .
Proof. The characteristic function of
has the form
by using properties of the Poisson process and the series representation of the exponential function, where
denotes the characteristic function of
. Under the assumption
, we have
so that
by using the L’Hopital rule, where
. This shows that
as
, which is the characteristic function of
.
The processes
B and
C have independent increments so that their finite dimensional densities are completely defined by the distributions of their increments [
13] (Sect. 3.6.4). The joint density of
has the form
for any integer
and times
, where
,
, and
. The characteristic functions of the corresponding increments
of
C are
and converge to the characteristic functions of
as
so that FDDs of
C converge to those of
B. □
The statement, which we proved for Gaussian jumps, holds for any zero-mean jumps with symmetric densities of variance
. For example, the characteristic function of
with
is
so that
by repeated use of the L’Hopital rule, where
. As previously, we have
.
If the aboveequation does not fit in a line, use
As previously, the practical implication of the above theorem is that the marginal and the finite dimensional distributions of C can be approximated by those of for a sufficiently large stochastic dimension d.
Theorem 4. If the jumps of C are zero-mean Gaussian variables with variances , then as .
Proof. Under the stated conditions, the FDDs of
C converge to those of
B by the previous theorem. It remains to show that (
8) with
C in place of
holds. The increments of
C in the time intervals
and
,
, are
so that
since
C has independent increments. For
, we have
and
so that the condition of (
8) is satisfied for
and
. Then,
C converges weakly to
B as
. □
The above proof is closely related to that of Theorem 14.1 in [
14] showing that processes with piecewise constant paths, iid jumps and constant (deterministic) time steps converge weakly to the Brownian motion process as the time step decreases to zero under proper scaling. Note also that Theorem 4 holds for any other zero-mean jumps with symmetric density whose variance is such that
.
Theorem 5. If the jumps of C are zero-mean Gaussian variables with variances , then as .
Proof. Denote by
,
and
the probabilities induced by the processes
,
C and
B on the measure space
, where
and
denotes the
-field generated by the Skorohod topology. Then,
since the first and second terms on the above bound approach zero as
by the weak convergence
and as
by the weak convergence
. Hence,
as
so that the distribution of
can be approximated by that of
for sufficiently large stochastic dimension
d and intensity parameter
. The statement of this theorem holds for any zero-mean jumps with symmetric density and
. □
6. Weak Convergence XC,d ⟹ XC and XB,d, XC,d ⟹ XB
Denote by and the solutions of an SDE with Poisson and Gaussian white noise inputs assumed to be defined on a probability space . As previously, these inputs are the formal derivatives of the compound Poisson and Brownian motion processes and have the same first two moments. Let and be the solutions of the SDE under consideration with and in place of C and B. Note that the change from the white noise input to an FD model may require modifying the SDE by a correction term. Since and have continuous paths, the solutions and are also continuous so that the paths of these four processes are in . This space also contains the paths of B and . However, the paths of C and are in .
Theorem 6. If an SDE defines a continuous I/O map and the conditions of Theorems 1–5 are satisfied, then as , as and as , so that as , as and as in distribution.
Proof. The target solutions and to B and C and their FD versions, i.e., the solutions and to the inputs and , are measurable functions from to the measure space . Under the conditions of Theorems 1–5, we have and as , as and as .
Since the I/O map defined by the SDE under consideration is continuous by assumption, the modes of convergence in the input space are preserved in the output space by the continuous mapping theorem [
10] (Theorem 18.1), i.e.,
and
as
,
as
and
as
. Heuristically, the continuity of the I/O map defined by an SDE requires that solutions to two inputs that are close to each other are also close in the sense of the sup metric of
for processes with continuous paths and the Skorohod metric of
for processes with jumps. Conditions for the continuity of this map for processes with continuous paths are in [
12] (Theorem 6.13) and result from the theory of ODEs [
15] (Chap. 6). They require the continuity of the drift and diffusion coefficients and of their derivatives.
The latter convergence follows by arguments as in Theorem 5. We need to show that as for any with no atoms on its boundary , where and are the probability measures induced by and on . With the notation , we have since so that as and so that as . The weak convergence of the above processes implies the convergence in distribution of their extremes by the continuous mapping theorem. □
Note that the weak convergence of as , as and as implies the convergence of the FDDs of to those as , the FDDs of to those of as and the FDDs of to those of as , so that the FDDs of and can be approximated by those of and or for sufficiently large values of the parameters d and .
The practical implications are that
the distributions of functionals of
can be approximated by the corresponding functionals of
whose paths result from paths of
by using integration algorithms for ordinary differential equations (ODEs), e.g., the MATLAB ode45-function, and
the same integration algorithms can be used to estimate the distributions of functionals of solutions to linear forms of GWN and PWN processes. There is no need for specialized integration algorithms such as in [
6,
7] to generate approximate paths of
. The generation of surrogates
of
whose properties match to any accuracy the properties of this process uses standard integration algorithms for ODEs.
7. Numerical Illustrations
Three examples are presented. The first constructs FD models for the compound Poisson and Brownian motion processes and estimates the distributions of extremes of these processes from paths of their FD models. The second and the third examples deal with SDEs with additive and multiplicative Poisson and Gaussian white noise inputs. Statistics of their solutions are estimated from paths of the corresponding FD solutions, which can be obtained by employing available integration algorithms for ODEs, e.g., the MATLAB ode45-function.
7.1. Compound Poisson and Brownian Motion Processes
We have seen that the FD models
in (
7) converge weakly to
C as
(Theorem 2) and to
B as
(Theorem 5) so that statistics of functionals of
C and
B can be approximated by those of corresponding functional of
. The following illustrations are for the time interval
, stochastic dimension
and independent zero-mean Gaussian jumps
with variance
so that
. The expressions of the eigenvalues and eigenfunctions of the correlation function of
B and
C are in (
4). The estimates are based on 100,000 independent paths of
C,
B and of their FD models.
The top-left, top-right and bottom-left panels of
Figure 1 show four paths of
C and
with solid and dotted lines for
, 10 and 100 and stochastic dimension
. Samples of the random coefficients of
have been calculated from (
6). The paths of
capture the trend of the corresponding paths of
C even for these low stochastic dimensions. The bottom-right panel shows four paths of
B and of its FD model
with solid and dotted lines. The FD model
of
B is given by (
7) with random coefficients in (
6). The FD paths trace closely the target paths. The plots in the bottom-left and right panels of this figure suggest that the paths of
C are similar to those of the Brownian motion for a sufficiently large intensity
of the Poisson process
N. The above comments on the relationship between paths of
,
C and
B are based on visual observations. We have not proved that, e.g., the paths of
C approach the paths of
B as
.
The top-left, top-right and bottom-left panels of
Figure 2 display estimates of the probabilities
and
with solid and dashed lines for
, 10 and 100 (top-left, top-right and bottom-left panels) and of
and
with solid and dashed lines (bottom-right panel). The stochastic dimension of the FD models
and
is
. The estimates are based on 100,000 independent paths of
C,
,
B and
. The probabilities are shown in logarithmic scale. The plots suggest that FD estimates of extremes for the stochastic dimension
are satisfactory. That the FD estimates
of
are most accurate for
may be explained by the fact that the target process
C has on average only
jumps in
and the FD models depends on five random variables. Note also that for
the probabilities
and
and the probabilities
of
nearly coincide in agreement with Theorems 4 and 5.
The heavy solid lines in the panels of
Figure 3 display the distribution of
. We use this extreme random variable as quantity of interest since its distribution is know. It has the form
where
denotes the distribution of the standard Gaussian variable
and
denotes the first time when
B exceeds
x in
. The first equality holds since
and
are equivalent events. For the second equality, note that
and
by the symmetry of the Brownian motion process. We have
, which gives the stated result. The dashed line in the right panel is
for
. The plot suggests that
is an accurate surrogate for the target probability
. The dashed and dotted lines in the left panel are estimates of
for
and 10 with stochastic dimension
. The estimates approach the probability
as
increases in agreement to Theorem 5. We have not increase
d since this stochastic dimension seems to be sufficiently large. The probabilities in this figure are shown in the logarithmic scale.
Figure 3.
Probability (heavy solid lines) and estimates of (left panel, dashed and dotted lines for and 10) and of (right panel, dashed line) for . All probabilities are in logarithmic scale.
Figure 3.
Probability (heavy solid lines) and estimates of (left panel, dashed and dotted lines for and 10) and of (right panel, dashed line) for . All probabilities are in logarithmic scale.
7.2. Additive White Noise
Let
and
be real-valued processes defined by the stochastic differential equations
where
and the jumps of
C are such that
C and
B have the same first two moments. If the two equations have the same initial condition assumed to be independent of
C and
B, then
and
also have the same first two moments. Denote by
and
the solutions of the above equations with
and
in place of
C and
B.
According to our theoretical arguments (Theorems 1–4), the FD models and converge weakly to the Brownian motion and the compound Poisson processes B and C as . Since the I/O maps defined by the above equations are continuous, the weak convergences and imply and as by Theorem 6. This means that the distributions of and can be approximated by those of and for a sufficiently large d. Moreover, the distribution of can be approximated by that of for a sufficiently large stochastic dimension d and intensity parameter .
The following numerical results are for
,
and
. The estimates are based on 100,000 independent paths of
B,
C,
and
. The heavy solid and dashed lines in
Figure 4 are estimates of the probabilities
and
while the dotted and the thin continuous lines are estimates of
and
. The intensity of the Poisson process in the top panels is
. As expected, responses to Poisson and Gaussian white noise inputs differ. These plots also show that the estimates of the probabilities
and
improve with
d. The bottom panels show that, for
, the probabilities
and
can be substituted for each other in agreement to Theorems 4–6. Also, for a sufficiently large
and
d,
can be used as a surrogate for
and
. The probabilities in this figure are displayed in the logarithmic scale.
7.3. Multiplicative Noise
Let
denote the geometric Brownian motion process defined by the Itô stochastic differential equation
with solution
for the initial state
, where
c and
are real constants. Its FD version
is the solution of the Stratonovich SDE
where
is an FD model of the Brownian motion
B, the symbol ∘ indicates that the equation has to be interpreted in the Stratonovich sense and dots above
and
denote differentiation with respect to time. The drift of this equation is that of (
10) modified by the Wong–Zakai correction term [
13] (Sect. 4.7.1.2). Its solution results by following the rules of the classical calculus and has the expression
Since
converges almost surely (a.s.) to
B in the metric of the space of real-valued continuous functions [
12] (Theorem 5.17) and the I/O map is continuous,
a.s. in the metric of this space as
. This means that paths and extremes of
can be used as surrogates for those of
provided that the stochastic dimension
d is sufficiently large.
Let
be
in (
11) with
C in place of
B, i.e.,
where
C denotes the compound Poisson process in (
1) with jumps
. Since the continuous maps
in (
11) and
in (
14) have the same form and
as
, we have
as
by the continuous mapping theorem. By analogy with the SDE of
, it is tempting to assume that
satisfies the SDE
, where
denotes the left limit of
X at time
t. It turns out that
is the solution of a different SDE.
The SDE satisfied by
results from the multivariate Itô formula, see [
16] (Sect. 5.3) and [
17] (Theorem 33, p. 74), applied to its definition in (
14). Since
is a function of time
t and the compound Poisson process
, the expression of the difference
has three types of terms. The first type of terms involve integrals whose integrands are partial derivatives of
with respect to
t and
; the second type of terms consists of integrals whose integrators are the continuous parts of the quadratic variations
,
and
, which are zero, where
I denotes the identity function; and the third is a summation related to the jumps of
and
C, i.e.,
where
is the jump of
C at time
s and
is the left limit of
C at time
s. Since
only at the jump times
of
C, we have
so that the above integral equation becomes
The definition of
in (
14) gives
since
so that
where
is a compound Poisson process with jumps
at the jump times
of
C. Then,
satisfies the stochastic integral equation
or, equivalently, the stochastic integral equation
where
constitutes the (asymptotic) compensated version of
since
The differential versions of the above integral equations have the forms
which differ from
suggested by intuition. The estimates of the probability
in
Figure 5 have been obtained from solutions of the differential equations of
. They have been validated by using the definition of
in (
14) and paths of the compound Poisson process
C.
Consider now the process
defined by
where
is an FD model of
C. The differentiation of (
15), which is performed by following the rules of the classical calculus, gives
, which has the form of the differential equation of
in (
12). Note that the convergence
implies
as
by the continuous mapping theorem and that
as
by Theorem 6.
The plots of
Figure 5 are for
,
,
, integration time step
and 100,000 independent paths of
,
,
and
. The top and bottom panels are for
and 20. The left and right panels are for
and 20. The heavy solid and dashed lines are the probabilities
and
. Their FD approximations
and
are displayed in heavy dotted and thin solid lines. The logarithmic scale is used for all probabilities.
The plots are consistent with Theorems 4–6. The top panels show that extremes of differ from those of , an expected result since is small so that Theorem 4 predicting that C is a surrogate of B does not apply. The increase of the stochastic dimension from to shows that the extremes of and better approximate the corresponding extremes of and in agreement with Theorems 2 and 6. The improvement of the FD estimates is more pronounced for the estimates of . The bottom panels suggest that is sufficiently large in this example such that the distributions of extremes of and are similar and that these extremes can be approximated by those of the FD models and in agreement with Theorems 5 and 6. The increase of the stochastic dimension from to improves slightly the performance of the estimates of the extremes of the FD models.
7.4. Relationship to Current Integration Algorithms
We examine three aspects of the proposed and the current methods for integrating SDEs with GWN and PWN inputs. It is not possible to rate the performance of these methods precisely since it depends on the type of the posed SDE and the quantities of interest, e.g., solution moments, marginal distributions, or extremes. We only present features and limitations of these methods.
Computational speed: It is difficult to make a general statement on the computational efficiency of the proposed and current integration algorithms. The Euler integration scheme of the current methods can be implemented directly for SDEs with GWN. However, an Euler-like integration scheme requires extensive preparation for solving SDEs with PWN. Moreover, the integration time step of these schemes needs to be sufficiently small such the probability of having two or more Poisson jumps in a single time step be nearly zero. This means that the computational time for SDEs subjected to PWN inputs with frequent jumps can be significant since the required integration time step has to be very small.
The implementation of the proposed methods requires first to construct FD models for the Brownian motion and the compound Poisson processes in (7). The basis functions of these FD models are available analytically and samples of their random coefficients result by, e.g., projecting paths of the Brownian motion and the compound Poisson processes on the basis functions. The generation of paths of these processes and their projection on basis functions involve elementary calculations. Paths of FD solutions are delivered by standard ODE algorithms. Note that the estimates of the distribution of extremes of FD models of compound Poisson process in
Figure 2 are accurate for a broad range of Poisson intensities and the same stochastic dimension.
Model dimension: We have proved the convergence of the distributions of functionals of FD solutions to those of target solutions as
. The rate of convergence would be required to determine the model dimension
d such that the error does not exceed a specified value. Since we do not have the convergence rate, we estimate the distribution of, e.g., the extreme random variable
, for several increasing values of the stochastic dimension
d and approximate the distribution of
by the smallest
d beyond which the FD-based distribution changes insignificantly, see
Figure 4. The starting valued of
d for this iteration can be that for which the FD input models contain most energy of the processes they represent. We also note that the stochastic dimension of the current integration methods is given by the number
n of the time steps and that
n is much larger than the stochastic dimension
d of the proposed method. Moreover, we have obtained accurate solutions for low stochastic dimensions, as seen in
Figure 1,
Figure 2,
Figure 3,
Figure 4 and
Figure 5.
Scalability: If the solution X of the posed SDE is a vector-valued process and the input consists of several Brownian motions and/or compound Poisson processes, the implementation of the proposed integration algorithm is conceptually similar. The simplest method is to construct FD models as in (7) for the individual components of the input, which may or may not have the same stochastic dimensions. The relationships between the components of the FD models are captured by the dependence between the random coefficients of the FD components. Once the input FD models have been constructed, ODE solvers can be used as previously to generate paths of the FD solutions.
We conclude this subsection by mentioning that the proposed method gives conditions under which the distributions of extreme solutions of SDEs can be approximated by those of corresponding FD solutions. This is essential for applications since the distribution of quantities of interest such as the random variable , which is rarely available analytically and cannot be obtained numerically, can be approximated by the distribution of the corresponding FD extreme , which can be estimated from FD solution paths generated by standard numerical algorithms. In contrast, the construction of such estimates from the solutions of current methods require to postulate the behavior of the solution between the times of the recurrence formulas, which is unknown.
8. Conclusions
A method has been developed for integrating stochastic differential equations (SDEs) with Gaussian (GWN) and Poisson (PWN), which is conceptually different from the current integration methods. As for the current methods, the GWN and the PWN inputs are interpreted as the formal derivatives of the Brownian motion and compound Poisson processes. The current methods solve discrete time versions of the posed SDEs by using different recurrence formulas for Gaussian and Poisson white noises. In contrast, the proposed method solves the posed SDEs for finite dimensional (FD) models of the compound Poisson and Brownian motion processes, i.e., finite sums of d deterministic functions of time, referred to as basis functions, weighted by random coefficients, by using a single algorithm for both types of noises. The number d of random coefficients of the FD input models gives their stochastic dimension.
The implementation of the proposed method requires to first construct FD models for the Brownian motion and the compound Poisson processes. The construction involves elementary calculations since the basis functions of the models are available analytically, samples of their random coefficients can be obtained by projecting Brownian and Compound Poisson paths on the basis functions and efficient algorithms are available for generating large sets of paths of these processes.
Standard ODE solvers have been employed to calculate paths of the solutions of the posed SDEs from paths of the FD input models, referred to as FD solutions. It was shown that statistics of continuous functionals of the FD solutions can be used as surrogates for those of the target solutions under some conditions provided that the stochastic dimension is sufficiently large. This is a notable feature of the method since the distributions of functionals of solutions of SDEs with GWN and PWN are rarely available analytically and cannot be obtained numerically, while the distributions of corresponding functionals of FD solutions can be estimated from their paths, which can be generated by standard numerical methods. The implementation and the performance of the proposed method based on FD input models have been illustrated by examples involving compound Poisson and Brownian motion processes, SDEs with additive GWN and PWN, and SDEs with multiplicative GWN and PWN. The performance of the proposed method is remarkable and consistent with the theoretical results in the paper.