Stationary solutions of linear ODEs with a randomly perturbed system matrix and additive noise

Size: px
Start display at page:

Download "Stationary solutions of linear ODEs with a randomly perturbed system matrix and additive noise"

Transcription

1 Stationary solutions of linear ODEs with a randomly perturbed system matrix and additive noise H.-J. Starkloff a, R. Wunderlich b a Martin-Luther-Universität Halle Wittenberg, Fachbereich für Mathematik und Informatik, 699 Halle (Saale), Germany b Westsächsische Hochschule Zwickau (FH), Fachgruppe Mathematik, PSF 237, 856 Zwickau, Germany Abstract The paper considers systems of linear first-order ODEs with a randomly perturbed system matrix and stationary additive noise. For the description of the long-term behavior of such systems it is necessary to study their stationary solutions. We deal with conditions for the existence of stationary solutions as well as with their representations and the computation of their moment functions. Assuming small perturbations of the system matrix we apply perturbation techniques to find series representations of the stationary solutions and give asymptotic expansions for their first- and second-order moment functions. We illustrate the findings with a numerical example of a scalar ODE, for which the moment functions of the stationary solution still can be computed explicitly. This allows the assessment of the goodness of the approximations found from the derived asymptotic expansions. Keywords: stationary solution, randomly perturbed system matrix, perturbation method, asymptotic expansions, correlation function MSC2 classification scheme numbers: 6G, 93E3

2 258 H.-J. Starkloff, R. Wunderlich Introduction The present paper considers systems of first-order ODEs ż(t,ω) A(ω)z(t,ω) + f(t,ω) (.) for the random function z z(t,ω) on R Ω with values in C n, n N, which is defined on a probability space (Ω, G,P), where G denotes a suitable σ-algebra of subsets of Ω on which a probability measure P is defined. Further, A denotes an n n matrix with random complex entries. The inhomogeneous term contains the random excitation function f(t,ω) defined on R Ω with values in C n. It is assumed that f is strict- and wide-sense stationary, pathwise and mean-square continuous and is independent of A. In technical applications the random inhomogeneous term f is called additive noise. The present paper deals with conditions for the existence of stationary solutions z to (.) as well as their representation and with the computation of their moment functions to given A and f. A random function ξ : R Ω C m, m N, is said to be stationary (in the strict sense) if for every sequence t,...,t N R, N N, the joint distribution of the random vectors ξ(t + τ),...,ξ(t N + τ) is independent of τ R. Further, a random function z(t,ω) is called a stationary solution of (.) if z pathwise satisfies Eq. (.) and if (z,f) is a stationary random function, i.e., z and f are stationarily related. The above problem arises e.g. in the investigation of the long-term behaviour of the response of discrete vibration systems with permanently acting random external excitations (see Soong, Grigoriu [6], Preumont [6] and [7, 3, 4]). Moreover equations of this type arise as result of the semi-discretization of some kinds of partial differential equations (PDEs) with respect to the spatial variables using finite difference or finite element methods. For PDEs describing random heat propagation in heterogeneous media (see e.g. [4]) the random matrix A represents a random spatially varying heat conductivity while the random process f represents random external heat fluxes on the boundary, heat sources or ambient temperatures. For PDEs describing random vibrations of continuous vibration systems we refer to [, ]. In this case the matrix A represents a random spatially varying bending stiffness and f describes external excitations. Especially in the mathematical modelling of vibration phenomena the modal analysis and the use of so-called modal coordinates leads to equations of type (.) with complex state variables and parameters. Therefore we consider this general case throughout this paper and mention that the real-valued case is contained as a special case. In the case of a non-random matrix A the stability of this matrix, i.e., all eigenvalues of A possess strictly negative real parts, guarantees that a unique stationary solution exists and solutions to initial value problems for Eq. (.) converge for t to this stationary solution (see Arnold, Wihstutz [2], Bunke [3], p. 45ff). For the computation of moment functions of the stationary solution there exist numerous methods, see e.g. Soong, Grigoriu [6], Preumont [6], [7, 3, 4]. In general, these methods can not be applied to the present case of a randomly perturbed matrix.

3 Stationary solutions of linear ODEs with a randomly perturbed system matrix 259 The paper is organized as follows. Section 2 gives an explicit analytic representation of the stationary solution of Equation (.) and proves its uniqueness. This representation is the starting point of the computation of first- and second-order moment functions for the stationary solution in Section 3. Decomposing the random parameters involved in (.) into their respective means and centered fluctuation terms the stationary solution can be decomposed in a similar way. Using this decomposition Subsection 3. gives general representations of the considered moment functions. It turns out that an explicit evaluation of the derived formulas is possible only in a very limited number of special cases. Therefore we present in Subsection 3.2 an approximate computation applying perturbation techniques and derive the leading as well as first (non-zero) correction terms of the corresponding expansions. These expansion terms are evaluated explicitly in Section 4. Thereby we restrict to a class of Equation (.) for which the correlation function of the stationary solution in the case of an unperturbed matrix A is exponentially decaying. Finally Section 5 presents some numerical results for the case of a scalar Equation (.) with real random parameters. This is one of the rare cases where the moment functions can be computed explicitly and we can study the goodness of the approximations using the perturbation techniques. Throughout the paper we use the following notation. For a vector x C n and a matrix M C n n we denote by x the norm of x and by M some matrix norm of M which is compatible with the chosen vector norm, i.e., there holds the relation Mx M x for all x C n. If not specified otherwise the vector norm. can be chosen arbitrarily. With x and M we denote the adjoint vector and matrix. The expectation w.r.t. the probability measure P is denoted by E {.}, the conditional expectation by E {..} and the conditional probability by P{..}. For random vectors ξ (ω), ξ 2 (ω) with values in C n the covariance matrix is denoted by cov(ξ,ξ 2 ) E {(ξ E {ξ })(ξ 2 E {ξ 2 }) } and for a stationary random vector function y(t,ω), t R, with values in C n the correlation function is defined as R yy (τ) cov(y(t),y(t + τ)), τ R. 2 Stationary solution In this section we give an explicit analytic representation of the stationary solution of Equation (.) and prove its uniqueness. This representation is the starting point of the computation of first- and second-order moment functions for the stationary solution in Section 3. First we provide the corresponding result for the case of a non-random matrix A which is known from the literature. (see e.g. Bunke [3], Theorem 3.5, p. 45ff; Arnold, Wihstutz [2]) Workshop Stochastische Analysis

4 26 H.-J. Starkloff, R. Wunderlich Lemma 2. Assuming a stationary, a.s. pathwise and mean-square continuous excitation function f and a non-random stable matrix A, i.e., all eigenvalues of A possess negative real parts, then the linear first-order system possesses the unique stationary solution z(t,ω) t ż(t,ω) Az(t,ω) + f(t,ω) e A(t u) f(u,ω)du in the a.s. pathwise as well as means-square sense. e Au f(t u,ω)du (2.) If the matrix A is random and stochastically independent of the excitation function f a similar result can be derived (see also Khasminskij [5]). Theorem 2.2 Assuming a stationary, a.s. pathwise and mean-square continuous excitation function f and a random matrix A with E { A 2 } <, which is a.s. stable and independent of f, then the first-order system (.) possesses the unique stationary solution z(t,ω) in the a.s. pathwise as well as means-square sense. e A(ω)u f(t u,ω)du (2.2) Proof. The assumptions on A and f ensure that the integral in (2.2) exists and is well-defined in the a.s. pathwise as well as mean-square sense. Obviously, z(t,ω) given in (2.2) satisfies Eq. (.), i.e., z is a solution in the a.s. pathwise as well as means-square sense. In order to prove that z(t,ω) is a stationary solution of Eq. (.), one has to show that for arbitrary N N, t,...,t N R and arbitrary Borel sets B,...,B N of C 2n the probability of the events C s G defined by C s : N { } (z(ti + s,ω),f(t i + s,ω)) B i i N { ( i does not depend on s, i.e., P(C s ) P(C ). ) } e A(ω)u f(t i + s u,ω)du,f(t i + s,ω) B i, s R, Denote by F A the (n n-dimensional) distribution function of the random matrix A. Then for the probability of the events C s it can be derived P(C s ) E {P{C s A}} P{C s A M}dF A (M). C n n

5 Stationary solutions of linear ODEs with a randomly perturbed system matrix 26 Using that A is independent of f and that e Mu f(t u,ω)du is a stationary solution of (.) for a fixed matrix A(ω) M it follows P{C s A M} which implies P(C s ) ( N { ( P i ( N { ( P i P{C A M}, ) } ) e Mu f(t i + s u,ω)du,f(t i + s,ω) B i ) } ) e Mu f(t i u,ω)du,f(t i,ω) B i C n n P{C A M}dF A (M) E {P{C A}} P(C ) and proves the stationarity of z. In the evaluation of the conditional expectation in the above derivation the random matrix A has been replaced by M which is possible due to the assumed independence of A and f (see e.g. Shiryaev [5], 7, p. 22). It remains to prove the uniqueness of the solution. To this end two stationary solutions z and z 2 of Eq. (.) are considered and it is proven that the difference r z z 2 vanishes a.s. for all t R. Consider initial value problems for functions x on [t, ) Ω, t R, given by ẋ(t,ω) A(ω)x(t,ω) + f(t,ω), x(t,ω) x (ω), possessing for almost all ω Ω the unique solution x(t,ω) e A(ω)(t t) x (ω) + e A(ω)(t u) f(u,ω)du. t t Since z and z 2 satisfy Eq. (.) for all t R they coincide on [t, ) with the solutions of the above initial value problem with initial values x (ω) z (t,ω) and x (ω) z 2 (t,ω), respectively. For the difference r z z 2 it holds for t [t, ) r(t,ω) z (t,ω) z 2 (t,ω) e A(ω)(t t ) (z (t,ω) z 2 (t,ω)). Since t can be chosen arbitrarily it holds There hold the following assertions r(t) e A(t s) r(s), for all s,t R with s t. (2.3) A(t s) a.s.. e for s, since A is assumed to be a.s. stable. Workshop Stochastische Analysis

6 262 H.-J. Starkloff, R. Wunderlich 2. r(s) is stochastically bounded, i.e., supp( r(s) > c) for c, which follows s R from the relation P( r(s) > c) P( z (s) z 2 (s) > c) P( z (s) + z 2 (s) > c) ( P z (s) > c ) ( + P z 2 (s) > c ) ( 2 2 P z () > c ) ( + P z 2 () > c ) s R, 2 2 c where the stationarity of z and z 2 has been used. Hence supp( r(s) > c) s R for c. 3. e A(t s) r(s) P for s, since for any random function M : R Ω C n n with M(s) > a.s. for arbitrary c > and ε > it holds P ( M(s) r(s) > ε ) P ( M(s) r(s) > ε ) ({ ε } { ε }) P r(s) > M(s) M(s) c + ({ ε } { ε }) P r(s) > M(s) M(s) > c ( ε ) P M(s) c + P( r(s) > c). Since r(s) is stochastically bounded it holds δ > c c δ such that P( r(s) > c δ ) < δ 2. Moreover with M(s) e A(t s) it follows ε >, c δ > s such that s s and it yields ( ε ) P M(s) c δ ( P M(s) ε ) ( P e A(t s) ε ) δ c δ c δ 2 ε >, δ > s such that s s it holds P ( e A(t s) r(s) > ε ) < δ which proves the above assertion. Relation (2.3) and assertion 3) imply r(t) a.s. t R, i.e., z and z 2 coincide which proves the uniqueness of the stationary solution.

7 Stationary solutions of linear ODEs with a randomly perturbed system matrix Moment functions of the stationary solution 3. Decomposition of the stationary solution For the subsequent investigation of stationary solutions of Eq. (.) we require that the assumptions of Theorem 2.2 are fulfilled and we consider the decomposition of the inhomogeneous term f(t,ω) f + f(t,ω) into the non-random constant mean f and the random fluctuation term f(t,ω). This random process is stationary, pathwise and mean-square continuous, its correlation function coincides with the correlation function of f. Substituting the decomposition f(t,ω) f + f(t,ω) of the excitation function into the representation (2.2) of the stationary solution z of system (.) the following representation of z can be derived z(t,ω) ẑ(ω) + z(t,ω) where ẑ(ω) and z(t, ω) e A(ω)u f du A (ω) f e A(ω)u f(t u,ω)du. Here, the random vector ẑ can be considered as the response of the system to the mean excitation f and the random process z as the response to the random fluctuations of the excitation f. Theorem 2.2 implies that z is the stationary solution of the system z(t,ω) A(ω) z(t,ω) + f(t,ω). (3.) Lemma 3. Under the assumptions of Theorem 2.2 it holds E { z(t)}. Proof. It holds E { z(t)} } E {e Au f(t u) du. For the integrand it can be derived } E {e Au f(t u) E { e Au} } E { f(t u) since A and f are independent and f has zero mean. This implies E { z(t)}. The next theorem states a decomposition of first- and second-order moment functions of the stationary solution z to system (.) which is helpful for the subsequent computation of moment functions of z. Workshop Stochastische Analysis

8 264 H.-J. Starkloff, R. Wunderlich Theorem 3.2 Let A possess finite second-order moments and let the assumptions of Theorem 2.2 be fulfilled. Then for the mean and the correlation function of the stationary solution z of system (.) it holds E {z(t)} E {ẑ} E { A } f (3.2) and R zz (τ) cov(ẑ,ẑ) + R ez ez (τ). (3.3) Proof. Using the decomposition z ẑ + z introduced above it follows E {z(t)} E {ẑ} + E { z(t)}. Since A possesses finite second-order moments E {A } exists and for the first term it holds E {ẑ} E {A } f while Lemma 3. implies that the second term vanishes. This proves Eq. (3.2). To prove Eq. (3.3) again the decomposition z ẑ + z is used. It holds R zz (τ) cov(z(t),z(t + τ)) cov(ẑ,ẑ) + cov( z(t), z(t + τ)) + cov( z(t),ẑ) + cov(ẑ, z(t + τ)) cov(ẑ,ẑ) + R ez ez (τ), since the two last covariances vanish because of cov( z(t),ẑ) E { z(t) ẑ } E { z(t)}e{ẑ } EE { z(t)ẑ A} E {ẑ } E {E { z(t) A} ẑ } { } } E e Au E { f(t u) A du ẑ. Here it has been used that ẑ A f is A-measurable and that f is centered and independent of A. Analogously cov(ẑ, z(t + τ)) can be proven. The above theorem shows that the influence of the random parameters A and f on the moments of z can be separated. The mean Ez depends only on the distribution of A via E {A } and linearly on the mean excitation f. For a centered excitation f, i.e., for f, the stationary solution is centered, too. The correlation function R zz (τ) can be decomposed into the covariance of ẑ and the correlation function of z. The first term cov(ẑ,ẑ) is invariant w.r.t. τ and depends only on the distribution of A and on f. It vanishes in case of a centered excitation f. The second term R ez ez (τ) depends on the distributions of A and the fluctuating part f of the excitation but not on the mean excitation f. The explicit computation of the mean of z requires the computation of E {A }, i.e., the mean of the inverse of A. In the multi-dimensional case this is often very cumbersome

9 Stationary solutions of linear ODEs with a randomly perturbed system matrix 265 or even impossible. The same holds for the computation of { cov(ẑ,ẑ) E A f f A } Eẑ (Eẑ). For the correlation function of z it holds { R ez ez (τ) E { z(t) z (t + τ)} E E { e Au R ef e f (τ + u v)e A v } dudv, e Au f(t } u) f (t + τ v)e A v dudv where the independence of A and f had been used. It can be seen that the evaluation R ez ez (τ) requires only second-order moments of f but the complete distribution of A, since it is involved in the matrix exponentials. In general, an explicit computation of expectations of these matrix exponentials fails. Remark 3.3 Another way for the computation of the above correlation function makes use of conditional expectations w.r.t. the random matrix A. This approach might be useful for the computation of approximations of the correlation function R ez ez (τ) based on Monte-Carlo simulations. It holds R ez ez (τ) EE { z(t) z (t + τ) A } { e Au f(t } u) f (t + τ v)e A v dudv A M df A (M) C n n E C n n E { C n n R M ez ez(τ)df A (M) e M u f(t } u) f (t + τ v)e M v dudv df A (M) where F A (.) denotes the distribution function of the random matrix A and { Rez M ez(τ) E e M u f(t } u) f (t + τ v)e M v dudv e M u R ef e f (τ + u v)e M v dudv denotes the correlation function of the stationary solution of z M z + f, i.e., a system with a non-random matrix M. In the evaluation of the conditional expectation in the above derivation the random matrix A has been replaced by M which is possible due to the assumed independence of A and f (see e.g. Shiryaev [5], 7, p. 22). For special choices of the correlation function of the fluctuating part f of the excitation (e.g. weakly or exponential correlated) it is possible to simplify the above double integral and to find explicit representations or power series expansions (see Soong, Grigoriu [6], [7, 8, 2] ). Workshop Stochastische Analysis

10 266 H.-J. Starkloff, R. Wunderlich In many cases only partial information about the distribution of the random parameters (e.g. only first- and second-order moments) is available. Therefore, in the next section approximate representations of the moments of z in terms of first- and second-order moments of A and f are derived by applying perturbation methods. 3.2 Perturbation methods This section deals with the approximative computation of the mean and the correlation function of the stationary solution z of Eq. (.). The main idea of the approximation is the decomposition of the random matrix A(ω) into its constant mean  and a random fluctuating part which is scaled by a non-negative perturbation parameter η, i.e., it is set A(ω)  + ηc(ω), with η. We consider the random matrix A as a perturbation of the constant matrix Â. The desired moments of z are expanded in powers of η and for sufficiently small values of η the appropriately truncated power series can be used as approximations of the exact moments functions. If in Eq. (.) the random matrix A is replaced by its mean while the excitation term f remains unchanged the system ẏ(t,ω) Ây(t,om) + f(t,ω) (3.4) arises. We call the above system the unperturbed system since it contains the unperturbed matrix Â. From Lemma 2. it is known that y(t,ω) e b Au f(t u,ω)du is the unique stationary solution of Eq. (3.4) since A and consequently  E {A} is a stable matrix. If in addition to the random matrix A(ω) also the random inhomogeneous term f(t,ω) is replaced by its constant mean, we get the so-called averaged system ẋ(t) Âx(t) + f. (3.5) This is a non-random system possessing the trivial stationary solution x(t)  f which is non-random and does not depend on t. We note that a non-random function is stationary only if it is a constant function. The mean of stationary solution y of the unperturbed system (3.4) coincides with the solution of the averaged problem (3.5), i.e., it holds E {y(t)} e b Au E {f(t u)}du  f x.

11 Stationary solutions of linear ODEs with a randomly perturbed system matrix 267 The so-called averaging problem arises if one compares the solution x of the above averaged system with the average of the stationary solution of the original system (.). We will come back to this problem in Remark 3.5 below. For the existence and uniqueness of the stationary solution z the matrix A(ω)  + ηc(ω) is supposed to be stable and for the existence of first- and second-order moments of z finite second-order moments of the inverse matrix A (ω) are required. It is noted, that the latter condition implies the existence of first-order moments of A (ω). In order to check these conditions in terms of the perturbation parameter η it is assumed that  EA is a stable matrix which implies the existence of Â. Moreover it is assumed that the matrix C is bounded, i.e., there exists a positive real number c such that C(ω) c a.s.. Then for sufficiently small η > the matrix A(ω)  + ηc(ω) is stable and its inverse possesses finite second-order moments. Define η S : sup{η > :  + ηc(ω) is a.s. stable} η M : sup{η > : E { (  + ηc) 2 } < } then for η < η S the matrix A is stable and for η < η M its inverse possesses finite second-order moments. It is noted that the a.s. boundedness of the matrix C implies the existence of first- and second-order moments of C as well as of A  + ηc Moments of ẑ For the evaluation of Formulas (3.2) and (3.3) the mean and the covariance of ẑ A f are required. Substituting the representation A  + ηc the inverse of A can be represented using a Neumann series A which is convergent for η < ( + ηc) (Â(I + ηâ C)) (  C) p η p Â, (3.6) p  C a.s.. Let η N : sup{η > : η <  C(ω) a.s.}, then the inequality  C  C c  leads to the lower bound η N c A b for the radius of convergence of the Neumann series. The next theorem provides expansions of the first- and second-order moments of ẑ including the leading terms and the first correction terms which are of order η 2. Workshop Stochastische Analysis

12 268 H.-J. Starkloff, R. Wunderlich Theorem 3.4 For η < min{η S,η M } there hold the following expansions for η ( { ) E {ẑ} I +  E C C }η 2 x + o(η 2 ) (3.7) where x  f. and cov(ẑ,ẑ)  E {Cxx C } η 2 + o(η 2 ) (3.8) Proof. The Neumann series expansion (3.6) for A yields for η ẑ A f (I  Cη + ( C) 2 η 2 + o(η 2 )) f ) (I  Cη + ( C) 2 η 2 x + o(η 2 ) (3.9) For η < min{η S,η M } the moments E {ẑ} and cov(ẑ,ẑ) are well-defined and from Eq. (3.9) it follows ( { ) E {ẑ} I  E {C} η +  E C C }η 2 x + o(η 2 ) ( { } ) I +  E C C η 2 x + o(η 2 ) since E {C}. This proves (3.7). The proof of Eq. (3.8) uses the relation cov(ẑ,ẑ) E {(ẑ E {ẑ})(ẑ E {ẑ}) } and the expansion ( ) ẑ E {ẑ} I  Cη + o(η) x (x + o(η))  Cxη + o(η) which follows from (3.7) and (3.9). It results cov(ẑ,ẑ)  E {Cxx C } η 2 + o(η 2 ). Remark 3.5 With the help of the above theorem there can be given an answer (in an approximative sense) to the so-called averaging problem which consists in the computation of the difference between the average of the stationary solution E {z(t)} and the stationary solution x of the averaged equation (3.5). While for systems with a nonrandom linear operator both quantities coincide this is in general not the case for systems containing random operators or nonlinearities. It holds { } E {z(t)} x E {ẑ} x  E C C η 2 x + o(η 2 ).

13 Stationary solutions of linear ODEs with a randomly perturbed system matrix Correlation function of z The evaluation of Formula (3.3) for the correlation function of z requires the computation of the correlation function of z which is the stationary solution of system (3.). To find an expansion of the latter correlation function in powers of η the function z is represented as a power series z(t,ω) p ζ(t,ω)η p (3.) p with respect to the parameter η. The coefficients ζ, ζ,... can be found by substituting series (3.) into Eq. (3.) and equating the coefficients of the powers of η. First, this procedure is carried out formally. A verification of the results is given afterwards. The substitution of series (3.) into Eq. (3.) gives p ζ(t,ω)η p ( + ηc(ω)) p ζ(t,ω)η p + f(t,ω). p p For the coefficients p ζ it results an infinite sequence of linear first-order systems ζ  ζ + f p ζ  p ζ + C p ζ, p. According to Lemma 2. for the above linear systems with the non-random matrix  stationary solutions can be found recursively as follows ζ(t,ω) p ζ(t,ω) e b Au f(t u,ω)du (3.) e b Au C(ω) p ζ(t u,ω)du, p, which imply the following explicit representation of p ζ in terms of ζ p ζ(t,ω) R p + p k ( ) Au e b k C(ω) ζ(t u... u p,ω)du...du p, p. After the investigation of the coefficients of the perturbation series conditions for the convergence of series (3.) will be determined. We use the assumption on the stability of A which implies the stability of Â, i.e., it possesses eigenvalues with strictly negative Au real parts, only. Then positive real numbers λ and v exist such that e b v e λ u for all u. Further, it will be used that the random matrix C is a.s. bounded and that the function f is pathwise continuous on R. As an additional condition we impose the pathwise boundedness of f. Workshop Stochastische Analysis

14 27 H.-J. Starkloff, R. Wunderlich Theorem 3.6 Let the following assumptions be fulfilled. the matrix  is stable, there exist positive real numbers λ and v such that Au e b v e λu for u, 2. f is stationary, with a.s. continuous and bounded paths, there exists a positive random variable f (ω) such that f(t,ω) f (ω), t R, a.s., 3. there exists a positive real number c such that C(ω) c a.s.. Then the series p ζ(t) η p with coefficients p ζ(t) given in (3.) converges almost surely p with respect to ω and uniformly with respect to t R for η < η P : λ v c. Proof. In a first step by means of mathematical induction it is proven that q ζ(t) is bounded by q ζ(t) v f λ ( ) q v c t R, q,,...,a.s.. (3.2) We start with q where it holds ζ(t) Au e b f(t u)du and ζ(t) Au e b λ f(t u) du f e b Au du t R,a.s.. (3.3) Using assumption it follows Au e b du v e λ u du v λ. (3.4) Applying inequalities (3.3) and (3.4) it results ζ(t) v f λ v f λ ( ) v c t R,a.s.. Now assuming the assertion (3.2) is valid for q p the assertion for q p + will be proven. For p+ ζ(t), it follows p+ ζ(t) e Au b C p ζ(t u) du Au e b C p ζ(t u) du, (3.5) t R, a.s.. Using relation (3.2) for p ζ, relation (3.4) and C c it follows p+ ζ(t) v λ c vf λ λ ( ) p v c v ( ) p+ f v c t R,a.s. λ λ λ

15 Stationary solutions of linear ODEs with a randomly perturbed system matrix 27 and the assertion (3.2) is proven. From inequality (3.2) it results for the perturbation series p ζ(t) η p p ζ(t) η p v f ( ) p v c η t R,a.s.. λ λ p p Since the majorizing series converges for v c η λ <, a sufficient condition for the convergence of perturbation series (3.) is η < η P λ p v c. Remark 3.7 If in addition to the stability of the matrix  (see assumption in Theorem 3.6) the diagonalizability of  is supposed as an additional technical condition then the positive numbers λ and v can be further specified. Let there exists a representation  VΛV with a matrix Λ diag(λ,...,λ n ), containing the eigenvalues of  on its diagonal and a regular matrix V. Because of the stability of  the eigenvalues satisfy the relation Re [λ i ] <, i,...,n. The above representation of  yields Au e b V e Λu V V V e Λu. It holds cond(v) V V where cond(.) denotes the condition number of a matrix. If moreover the matrix norm is set to be column-sum, spectral or row-sum norm denoted by.,. 2 or., respectively, then it holds for the diagonal matrix e Λu e Λu,2, max e λ iu e max Re[λ i ] u min Re[λ i ] u i e i. i Au Hence the positive numbers λ and v involved in the inequality e b v e λu,,2, for all u R, can be chosen as λ min i Re [λ i ] and v cond,2, (V). For other matrix norms the number v has to be modified. If the matrix V can be chosen as a unitary matrix then in case of the spectral norm it holds v cond 2 (V) V 2 V 2. Assumption 2 of Theorem 3.6 on the pathwise boundedness of the random process f excludes e.g. Gaussian processes from the consideration. On the other hand the positive random variable f (ω) which bounds f(t,ω) is not involved in the definition of the bound η P for the radius of convergence. Next we show that assumption 2 can be relaxed by requiring the boundedness of f(t) in the mean-square sense. This property is fulfilled for stationary mean-square continuous random processes. Then it is possible to prove a similar convergence statement in the mean-square sense (see Theorem 3.8 below). The Workshop Stochastische Analysis

16 272 H.-J. Starkloff, R. Wunderlich class of mean-square bounded processes contains the pathwise bounded processes but also Gaussian processes. Let Q Q(Ω, G,P; C n ) be the space of random vectors with values in C n and finite second-order moments equipped with the the norm ξ Q (E { ξ 2} ) 2, where ξ Q is a random vector and. denotes some norm in C n. The space Q is known to be complete. For the convergence of a sequence (ξ m ) in the mean-square sense it is necessary and sufficient that (ξ m ) is fundamental. Moreover if ξ m Q c m with c m R, m N and c m < then ξ m converges in the mean-square sense. m m Now we formulate the announced convergence theorem. Theorem 3.8 Let the following assumptions be fulfilled. the matrix  is stable, there exist positive real numbers λ and v such that Au e b v e λu for u, 2. f is stationary, mean-square and pathwise continuous on R and there exists a positive real number f such that f(t) f, t R, Q 3. there exists a positive real number c such that C(ω) c a.s.. p Then the series p ζ(t) η p with coefficients p ζ(t) given in (3.) converges in the meansquare sense with respect to ω and uniformly with respect to t R for η < η P : λ v c. Proof. As in the proof of Theorem 3.6 we use the mathematical induction to prove that q ζ(t) Q is bounded by q ζ(t) Q v f λ ( ) q v c t R, q,,.... (3.6) λ For a non-random matrix M and a random vector ξ Q there holds the relation Mξ 2 Q E { Mξ 2} E { M 2 ξ 2} M 2 E { ξ 2} M 2 ξ 2 Q, hence we have Mξ Q M ξ Q. For q the above relation yields ζ(t) Q Au e b f(t u) du f Q e b Au du t R.

17 Stationary solutions of linear ODEs with a randomly perturbed system matrix 273 Applying inequality (3.4) to the integral on the right hand side it results ζ(t) Q v f λ v f λ ( ) v c t R. Now assuming the assertion (3.2) is valid for q p the assertion for q p + will be proven. For p+ ζ(t), it follows p+ ζ(t) Q e Au b C p ζ(t u) du e Au b C p ζ(t u) du Q Q Au e b C p ζ(t u) Q du Au e b ( E { C 2 p ζ(t u) 2}) 2 du Au e b c p ζ(t u) Q du t R. Using relation (3.6) for p ζ and relation (3.4) it follows p+ ζ(t) Q v λ c vf λ and the assertion (3.6) is proven. λ ( ) p v c v ( ) p+ f v c t R From inequality (3.6) it results for the perturbation series p ζ(t) η p p ζ(t) Q η p v f ( ) p v c η t R. λ p Q p λ p λ Since the majorizing series converges for v c η λ <, a sufficient condition for the meansquare convergence of perturbation series (3.) is η < η P λ The a.s. convergence of the series ζ(t) p ζ(t) η p for η < η P which follows from p λ λ v c. Theorem 3.6 is the key result of the proof of the following theorem. Theorem 3.9 Let f(t,ω) be a stationary and an a.s. pathwise as well as mean-square continuous random function. Further, let A(ω)  + ηc(ω) be a random matrix which is independent of f and  E {A} is assumed to be a stable matrix. Finally, let the assumptions of Theorem 3.6 be fulfilled and let η S > be such that for η < η S the matrix A(ω) is a.s. stable. Then for η < η S Equation (3.) z(t,ω) A(ω) z(t,ω) + f(t,ω) Workshop Stochastische Analysis

18 274 H.-J. Starkloff, R. Wunderlich possesses the unique stationary solution z(t,ω) e A(ω)u f(t u,ω)du which admits for η < min{η S,η P } a representation as perturbation series z(t) p ζ(t) η p with coefficients p ζ given in (3.). p Proof. First, we prove that for η < η P the perturbation series ζ(t) p p ζ(t)η p is a stationary process and stationarily related to f. Following the lines of the proof of Theorem 3 in our paper [9] by means of mathematical induction it can be deduced that for all N,,... the processes f, ζ,..., N ζ as well as the processes f and N p ζ η p are stationarily related. From Theorem 3.6 it is known that for η < η P the series N p ζ(t) η p converges for N almost surely with respect to ω and uniformly with respect to t R. Consequently, the limit ζ(t) p ζ(t) η p is stationarily related to f. p Now, it suffices to prove that ζ satisfies Equation (3.) for η < min{η S,η P } since due to Theorem 2.2, Eq. (3.) possesses a unique stationary solution. Therefore, if ζ satisfies (3.) then it coincides with the stationary solution z given above. In order to show that ζ satisfies Eq. (3.) it is first proven that the representation ζ(t) p ζ(t) η p is valid for η < η P. To this end the uniform convergence of the formal p ( differentiated series d p ζ(t) η p) for η < min{η dt S,η P } is checked. Using representation p (3.) of the coefficients p ζ formal differentiation leads to ( d ) p ζ(t) η p dt p p ζ(t) η p p  ζ + f + p p p ( p ζ(t) + C p ζ(t)) η p ( + ηc) p ζ(t)η p + f(t). (3.7) The uniform convergence of the series on the right hand side for η < min{η S,η P } follows immediately from Theorem 3.6. Moreover, from the above relation it follows ζ(t) Aζ + f, i.e., ζ satisfies Eq. (3.) for η < min{η S,η P }. p

19 Stationary solutions of linear ODEs with a randomly perturbed system matrix 275 The series expansion of z given in Theorem 3.9 can be used to find expansions of the correlation function of z in powers of η. Using z ζ + ζη + 2 ζη 2 + o(η 2 ) leads to the following result. Theorem 3. Let E { A 2 } <. Then under the assumptions of Theorem 3.9 the correlation function of z(t) e Au f(t u)du for η < ηs possesses the expansion for η R ez ez (τ) Rζ ζ(τ) + (R2ζ ζ(τ) + Rζ ζ(τ) + Rζ 2 ζ(τ))η 2 + o(η 2 ), uniformly for all τ R where R2ζ ζ(τ) Rζ ζ(τ) { } Au e b Au E Ce b 2 C Rζ ζ(τ + u + u 2 )du du 2, e b Au E { CRζ ζ(τ + u u 2 )C } e b A u 2 du du 2 and Rζ 2 ζ(τ) R 2ζ ζ ( τ). Proof. The assumption E { A 2 } < ensures that the correlation function R ez ez (τ) exists and is well-defined. From the perturbation series representation of z given in Theorem 3.9 it follows z(t) ζ(t) + ζ(t)η + 2 ζ(t)η 2 + o(η 2 ) uniformly for all t R and R ez ez (τ) Rζ ζ(τ) + ( Rζ ζ(τ) + Rζ ζ(τ) ) η + ( R2ζ ζ(τ) + Rζ ζ(τ) + Rζ 2 ζ(τ) ) η 2 + o(η 2 ) (3.8) uniformly for all τ R. Recalling representations (3.) for ζ, ζ and 2 ζ, i.e., ζ(t) ζ(t) 2 ζ(t) e b Au f(t u)du, e b Au C ζ(t u)du and e b Au C ζ(t u)du e b Au Ce b Au 2 C ζ(t u u 2 )du du 2, and using the independence of C and f, } E {C} and E { f(t) it follows E { ζ(t) } E { ζ(t) } E {2 ζ(t) } } e Au b E { f(t u) du, e b Au E {C} E { ζ(t u) } du and { } Au e b Au E Ce b 2 C E { ζ(t u u 2 ) } du du 2. Workshop Stochastische Analysis

20 276 H.-J. Starkloff, R. Wunderlich Then for the correlation functions involved in (3.8) in the coefficient of η it can be derived Rζ ζ(τ) E { ζ(t) ζ (t + τ) } { } E e Au b C ζ(t u)du ζ (t + τ) e b Au E {C} E { ζ(t u) ζ (t + τ) } du and analogously Rζ ζ(τ) while for the correlation functions involved in the coefficient of η 2 it holds R2ζ ζ(τ) E {2 ζ(t) ζ (t + τ) } { } Au E e b Au Ce b 2 C ζ(t u u 2 )du du 2 ζ (t + τ) and e b Au E { } Au Ce b 2 C { } Au e b Au E Ce b 2 C Rζ ζ(τ) E { ζ(t) ζ (t + τ) } { ( E e Au b C ζ(t u)du Since for t,t 2 R it follows E { ζ(t u u 2 ) ζ (t + τ) } du du 2 Rζ ζ(τ + u + u 2 )du du 2 ) } e Au b C ζ(t + τ u)du e b Au E { C ζ(t u ) ζ (t + τ u 2 )C } e b A u 2 du du 2. E { C ζ(t ) ζ (t 2 )C } E E { C ζ(t ) ζ (t 2 )C C } Rζ ζ(τ) E { CE { ζ(t ) ζ (t 2 ) C } C } E { CE { ζ(t ) ζ (t 2 ) } C } E { CRζ ζ(t 2 t )C } e b Au E { CRζ ζ(τ + u u 2 )C } e b A u 2 du du 2. Remark 3. If the distribution of the random matrix C is symmetric w.r.t. then it can be shown, that there vanish all terms of the expansion for the correlation function corresponding to odd powers of η. In this case the remainder term in the above theorem is of order o(η 3 ) instead of o(η 2 ).

21 Stationary solutions of linear ODEs with a randomly perturbed system matrix 277 The above theorem allows an approximate computation of the correlation function of z in terms of the second-order moments of the random matrix C and the correlation function of ζ which is the stationary solution of the linear system ζ  ζ + f. Here, the system matrix  is non-random and standard procedures for the computation of the correlation function of ζ can be applied. The correlation function of ζ coincides with the correlation function of the stationary solution y of system (3.4) since the excitation terms differ only by the constant vector f. 4 Computation of expansion terms This section deals with procedures for an efficient computation of the expansion terms for the mean and the correlation function of the stationary solution z. Based on the decomposition z(t,ω) ẑ + z(t,ω) Theorem 3.2 shows that Ez(t) Eẑ and R zz (τ) cov(ẑ,ẑ) + R ez ez (τ). For the moments on the right hand sides Theorems 3.4 and 3. provide the leading and the first non-zero correction terms of expansions in powers of η where the representation A(ω)  + ηc(ω) has been used. While the correction terms of the expansions for Eẑ and cov(ẑ,ẑ) allow a straightforward computation as linear combinations of the covariances of the entries of C the situation in the case of R ez ez (τ) is more complicated. Here, the computation of the correction term requires the evaluation of double integrals containing the covariances of C, the correlation function of f and matrix exponentials of the form e b Au. A numerically efficient computation of these double integrals is possible for the special case of a diagonal matrix Â, i.e., Â Λ diag(λ,...,λ n ), then it holds e b Au diag(e λ u,...,e λnu ). In the general case Eq. (.) can be transformed into a system with a diagonal matrix provided  is diagonalizable. Using the substitution z Vz where V is such that  VΛV from Eq. (.) it follows that z satisfies ż V ( + ηc)vz + V f (Λ + ηc )z + f, (4.) where C V CV and f V f. The moments of C and f are obtained from the corresponding moments of C and f, it holds Ef V Ef, R f f (τ) V R ff (τ)v, EC E {C (C ) } and V E {CVV C }V while the moments of z can be found from the moments of z by Ez V Ez and R zz (τ) V R z z (τ) V. Therefore the subsequent computation of expansion terms can be restricted to the case of a diagonal matrix Â. Workshop Stochastische Analysis

22 278 H.-J. Starkloff, R. Wunderlich Corollary 4. Let the assumptions of Theorem 2.2 applied to Eq. (4.) ż (Λ + ηc)z + f, be fulfilled. Then for η < min{η S,η M } there hold the following expansions for η ( { n } Ez Eẑ I + E {C ik C kj } η )x 2 + o(η 2 ) λ i λ k ij k { n and cov(ẑ, ẑ) E { } } C ik C jl xk x l η 2 + o(η 2 ), λ i λ j ij where x Λ f. k,l Proof. Applying Theorem 3.4 to Eq. (4.) it follows Ez Eẑ ( I + Λ E { CΛ C } η 2) x + o(η 2 ) and cov(ẑ,ẑ) Λ E {Cxx C }Λ η 2 + o(η 2 ), from which the assertions follow immediately. For the correlation function of z Theorem 3. gives for η < η S and τ R the expansion for η R ez ez (τ) Rζ ζ(τ) + (R2ζ ζ(τ) + Rζ ζ(τ) + Rζ 2 ζ(τ))η 2 + o(η 2 ), where R2ζ ζ(τ) e Λu E { Ce Λu 2 C } Rζ ζ(τ + u + u 2 )du du 2, Rζ ζ(τ) e Λu E { CRζ ζ(τ + u u 2 )C } e Λ u 2 du du 2 and Rζ 2 ζ(τ) R 2ζ ζ ( τ). For the explicit computation of the expansion terms it is necessary to prescribe a certain form of the correlation function R ζ ζ (τ). Here it is assumed that it holds R ζ ζ (τ) m Q r e Πrτ for τ ρ r (τ) with ρ r (τ) e Π rτ Q r for τ < r (4.2) where m N and for r,...,m the Q r are some non-negative definite and Hermitian n n-matrices and Π r diag(π r,...,π rn ) with Re [π ri ] <.

23 Stationary solutions of linear ODEs with a randomly perturbed system matrix 279 This type of correlation function arises e.g. if the correlation function of f is chosen to be R ef e f (τ) Le Γτ, τ, where L is some non-negative definite and Hermitian matrix and Γ diag(γ,...,γ n ) with Re [γ i ] <, i...,n. Then for τ it can be derived R ζ ζ (τ) Q e Λ τ + Q 2 e Γτ, with some matrices Q and Q 2 depending on L,Λ and Γ whose sum Q +Q 2 forms the covariance matrix of ζ. It is noticed that for a δ-correlated excitation f with the correlation function R ef e f (τ) L δ(τ) one obtains for τ R ζ ζ (τ) Q e Λ τ with Q { Lij λ i + λ j }i,j,...,n and for a weakly correlated excitation the above exponential type correlation function arises in the terms of the expansion of Rζ ζ(τ) in powers of the correlation length (see [7] and [7, 8]). The subsequent evaluations of the entries of the matrix-valued functions R2ζ ζ(τ), Rζ ζ(τ) and Rζ 2 ζ(τ) are given for τ. For negative τ the property R ξ ξ 2 (τ) R ξ 2 ξ ( τ) can be used.. It holds for i,j,...,n R2 ζ i ζ j (τ) where J,rijkl (τ) l m n e λ iu { { E Ce Λu 2 C } } m ρ il rlj (τ + u + u 2, )du du 2 n l r k,l e λ iu r n E {C ik C kl } e λ ku 2 m k r n E {C ik C kl }J,rijkl (τ), e λ iu +λ k u 2 ρ rlj (τ + u + u 2 )du du 2, ρ rlj (τ + u + u 2 )du du 2 R ζ i 2 ζ j (τ) R2 ζ j ζ i ( τ) m n E { } C jk C kl J,rjikl ( τ) r k,l Workshop Stochastische Analysis

24 28 H.-J. Starkloff, R. Wunderlich and R ζ i ζ j (τ) where J 2,rijkl (τ) e λ iu m r k,l { e λ iu [E C }] m ρ r (τ + u u 2 )C e λ ju 2 du du 2 r ij n E { } m C ik C jl ρ rkl (τ + u u 2 ) e λ ju 2 du du 2 k,l r n E { } C ik C jl J2,rijkl (τ), e λ iu +λ j u 2 ρ rkl (τ + u u 2 )du du 2. Using that the entries of ρ r (τ) {ρ rij (τ)} i,j,...,n given in (4.2) can be represented as Q rij e π rjτ for τ ρ rij (τ) Q rji e π riτ for τ <. the terms J and J 2 can be computed explicitly. First, J is evaluated, it holds J,rijkl (τ) e λ iu +λ k u 2 ρ rlj (τ + u + u 2 )du du 2 Q rlj e λ iu +λ k u 2 +π rj (τ+u +u 2 ) du du 2 Q rlj e π rjτ e (λ i+π rj )u du e (λ k+π rj )u 2 du 2, J,rijkl (τ) Q rlj (λ i + π rj )(λ k + π rj ) eπ rjτ. (4.3) Here, the stability of Λ, i.e., Re [λ i ] <, Re [πri i ] < for all r,i and the property τ + u + u 2 for τ has been used. Next, J,rijkl ( τ) is evaluated. In this case it is necessary to split the integral according

25 Stationary solutions of linear ODEs with a randomly perturbed system matrix 28 to the sign of the argument of ρ. The substitution v u and w τ +u +u 2 leads to J,rijkl ( τ) e λ iv+λ k (τ+w v) ρ rlj (w)dw dv v τ e λ kτ e (λ i λ k )v e λ kw ρ rlj (w)dw dv where I,rijkl (τ) v τ e λ kτ (I,rijkl (τ) + I 2,rijkl (τ) + I 3,rijkl (τ)) τ e (λ i λ k )v e λ kw ρ rlj (w)dw dv I 2,rijkl (τ) I 3,rijkl (τ) τ v τ e (λ i λ k )v e (λ i λ k )v e λ kw ρ rlj (w)dw dv e λ kw ρ rlj (w)dw dv. τ v τ For I it follows by using the substitution w w and ρ rlj ( w) ρ rjl (w) Q rjl e π rl w I,rijkl (τ) τ τ v e (λ i λ k )v e λ kw ρ rjl (w )dw dv τ Q rjl e (λ i λ k )v τ v e (π rl λ k )w dw dv Q rjl τ e (λ i λ k )v G(τ v, π rl,λ k )dv with G(s, α, β) For λ k π rl then it holds I,rijkl (τ) s Q rjl π rl λ k e (α β)v dv τ Q [ rjl e (π rl λ k )τ π rl λ k { α β( e (α β)s ) for α β s for α β. e (λ i λ k )v ( e (π rl λ k )(τ v) ) dv τ e (λ i π rl )v dv τ ] e (λ i λ k )v dv (4.4) Q rjl π rl λ k [ e (π rl λ k )τ G(τ,λ i,π rl ) G(τ,λ i,λ k ) ]. Workshop Stochastische Analysis

26 282 H.-J. Starkloff, R. Wunderlich τ In case of λ k π rl it follows I,rijkl (τ) Q rjl e (λ i λ k )v (τ v)dv. If moreover λ k λ i then it holds I,rijkl (τ) Q rjl τ it follows [ τ ( I,rijkl (τ) Q rjl e (λ i λ k )τ ) λ i λ k τ (τ v)dv Q rjl τ 2 2 while for λ k λ i ] e (λ i λ k )v v dv [ τ ( Q rjl e (λ i λ k )τ ) e(λi λk)v v τ + λ i λ k λ i λ k λ i λ k τ ] e (λ i λ k )v dv Q [ rjl τ ( e (λ i λ k )τ ) e (λ i λ k )τ ( τ + e (λ i λ k )τ )] λ i λ k λ i λ k Q rjl (G(τ,λ i,λ k ) τ). λ i λ k Summarizing, the integral I can be represented as Q rjl ( π rl λ k e (π rl λ k )τ G(τ,λ i,π rl ) G(τ,λ i,λ k ) ) for λ k π rl Q I,rijkl (τ) rjl λ i λ k (G(τ,λ i,λ k ) τ) for λ k π rl, λ k λ i. τ Q 2 rjl for λ 2 k π rl λ i (4.5) The integral I 2 can be evaluated as follows I 2,rijkl (τ) τ e (λ i λ k )v Q rlj and for I 3 one obtaines I 3,rijkl (τ) e (λ i λ k )v τ e (λ i λ k )v e λ kw ρ rlj (w)dw dv e λ kw ρ rlj (w)dw dv e (λ k+π rj )w dw dv Q rlj λ k + π rj G(τ,λ i,λ k ) Q rlj τ v τ e (λ i λ k )v e (λ k+π rj )w dw dv τ Q rlj λ k + π rj τ v τ e (λ i λ k )v e (λ k+π rj )(v τ) dv Q rlje (λ k+π rj )τ Q rlj (λ k + π rj )(λ i + π rj ) e(λ i λ k )τ. λ k + π rj τ e (λ i+π rj )v dv

27 Stationary solutions of linear ODEs with a randomly perturbed system matrix 283 Summarizing, the integral J,rijkl ( τ) is given by J,rijkl ( τ) e λkτ (I,rijkl (τ) + I 2,rijkl (τ) + I 3,rijkl (τ)) ( e λ kτ I,rijkl (τ) + Q ( rlj e (λi λk)τ )) G(τ,λ i,λ k ), (4.6) λ k + π rj λ i + π rj where I is defined in (4.5) and G in (4.4). Finally, J 2,rijkl (τ) is evaluated, it holds J 2,rijkl (τ) e λ iu +λ j u 2 ρ rkl (τ + u u 2 )du du 2. As in the case of the evaluation of J for negative τ it is necessary to split the integral according to the sign of the argument of ρ. The substitution v u and w τ +u u 2 leads to J 2,rijkl (τ) v+τ e λ iv+λ j (τ+v w) ρ rkl (w)dw dv e λ jτ e (λ i+λ j )v v+τ e λ jw ρ rkl (w)dw dv where I 4,rijkl (τ) e λ jτ (I 4,rijkl (τ) + I 5,rijkl (τ)) e (λ i+λ j )v e λ jw ρ rkl (w)dw dv I 5,rijkl (τ) e (λ i+λ j )v v+τ e λ jw ρ rkl (w)dw dv. Using ρ rkl (w) ρ rlk ( w) Q rlk e π rkw for w < it follows e λ jw ρ rkl (w)dw Q rlk and I 4,rijkl (τ) e (λ i+λ j )v e (λ j+π rk )w dw Q rlk λ j + π rk e λ jw ρ rkl (w)dw dv Q rlk (λ i + λ j )(π rk + λ j ). Workshop Stochastische Analysis

28 284 H.-J. Starkloff, R. Wunderlich For the evaluation of I 5 the substitution of ρ rkl (w) Q rkl e π rlw for w yields v+τ e λ jw ρ rkl (w)dw Q rkl For π rl λ j then it can be derived v+τ e (π rl λ j )w dw Q rkl π rl λ j ( e (π rl λ j )(v+τ) ) for π rl λ j Q rkl (v + τ) for π rl λ j. I 5,rijkl (τ) : e (λ i+λ j )v v+τ e λ jw ρ rkl (w)dw dv Q [ rkl e (π rl λ j )τ π rl λ j Q [ rkl π rl λ j λ i + λ j e (λ i+π rl )v dv λ i + π rl e (π rl λ j )τ ] ] e (λ i+λ j )v dv while for π rl λ j it holds I 5,rijkl (τ) Q rkl Summarizing it follows e (λ i+λ j )v (v + τ)dv Q rkl e (λ i+λ j )v v dv τ λ i + λ j ( Q rkl (λ i + λ j ) τ ) Q ( rkl ) τ. 2 λ i + λ j λ i + λ j λ i + λ j J 2,rijkl (τ) e λjτ (I 4,rijkl (τ) + I 5,rijkl (τ)) ( e λ Q ) jτ rlk (λ i + λ j )(π rk + λ j ) + I 5,rijkl(τ) ( ) Q rkl π rl λ j λ i +λ j λ i +π rl e (π rl λ j )τ for π rl λ j with I 5,rijkl (τ) ( ). Q rkl τ for π λ i +λ j λ i +λ rl λ j j (4.7) Corollary 4.2 Let the assumptions of Theorem 3. applied to z (Λ + ηc) z + f,

29 Stationary solutions of linear ODEs with a randomly perturbed system matrix 285 be fulfilled and R ζ ζ (τ) be of the form (4.2). Then the correlation function of the stationary solution z for η < η S and τ, i,j,...,n, possesses the expansion for η R ezi ez j (τ) m n [Q rij e πrjτ + η 2 r k,l ( E {C ik C kl } J,rijkl (τ) +E { } C jk C kl J,rjikl ( τ) + E { } )] C ik C jl J2,rijkl (τ) + o(η 2 ), where J and J 2 are given in (4.3), (4.6) and (4.7). 5 Numerical results In this section the results of the preceding sections are applied to the special case of a real and scalar equation (.) which arises for n and real-valued random parameters. Thus A(ω) a(ω) is a real-valued random variable and the excitation f(t,ω) is a scalar real-valued random process. As before the random parameters are decomposed, i.e., a(ω) â + ηc(ω) and f(t,ω) f + f(t,ω), with Ea â, Ef(t) f, a centered random variable c(ω) and a centered process f(t,ω). Then Eq. (.) reads as ż(t,ω) (â + ηc(ω)) z(t,ω) + f(t,ω). (5.) The random variable c is assumed to be a.s. bounded, i.e., c(ω) c where for convenience it is set c. The stability condition for A(ω) a(ω) â + ηc(ω) is satisfied for a(ω) < a.s., i.e., for η < η S ba c â. In this case Eq. (5.) possesses the unique stationary solution z(t, ω) with ẑ(ω) and z(t, ω) e a(ω)u f(t u,ω)du ẑ(ω) + z(t,ω) e a(ω)u f du a (ω) f e a(ω)u f(t u,ω)du. Due to Theorem 3.2 the mean and the correlation function of z are given by E {z(t)} E {ẑ} E { a } f and R zz (τ) D 2 ẑ + R ez ez (τ), (5.2) where D 2 ẑ cov(ẑ,ẑ) denotes the variance of ẑ. In the considered special case it is possible to compute these moments explicitly in terms of the mean and the correlation function of f and the distribution of c. In order to perform Workshop Stochastische Analysis

30 286 H.-J. Starkloff, R. Wunderlich numerical experiments which compare these exact moments with approximations from the perturbation approach it is assumed that c is uniformly distributed on [, ], then a is uniformly distributed on [â η,â+η] and we have the following probability density functions p c (s) { for s [, ] 2 else and p a (s) { 2η for s [â η,â + η] else Moreover it is assumed that f possesses the exponentially decaying correlation function R ff (τ) R ef e f (τ) σ 2 e γ τ, σ >,γ < 2â, where σ denotes the standard deviation of f and γ is a parameter describing the decay of the correlation function of f. It is noted that we impose instead of γ < the stronger condition γ < 2â in order to simplify the subsequent calculations. This condition ensures that γ does not coincide with the parameter a [â η,â+η] (2â, ) since η < η S â. First- and second-order moments of ẑ exist if E {a 2 } <. This condition is fulfilled for η < η M â η S since E { a 2} ba+η ba η ba+η s p a(s)ds 2 ba η (â + η) 2 p a(s)ds If a is uniformly distributed on [â η,â + η] for η < η M it holds Eẑ E { a } f f ba+η ba η s p a(s)ds f 2η (â + η) 2. ba+η ba η s ds f 2η ln â η â + η, (5.3) Eẑ 2 f 2 ba+η s p a(s)ds f 2 2η f 2 2η ba η 2 ba+η ba η s 2ds ( â η ) f 2 â + η â 2 η 2, and D 2 ẑ Eẑ 2 (Eẑ) 2 f 2( â 2 η â η 2 4η 2 ln2 â + η ). (5.4) For the correlation function of z it holds R ez ez (τ) R ez ez ( τ) and for τ it can be evaluated as follows { } R ez ez (τ) E { z(t) z(t + τ)} E e au f(t u )e au 2 f(t + τ u2 )du du 2 E { e a(u +u 2 ) } R ef e f (τ + u u 2 )du du 2,.

31 Stationary solutions of linear ODEs with a randomly perturbed system matrix 287 where the independence of a and f has been applied. Using the substitution v u, w τ + u u 2 and the assumption of an exponential decaying correlation function, i.e., R ef e f (τ) σ 2 e γ τ, it follows R ez ez (τ) v+τ v+τ ba+η E { e a(τ+2v w)} R ef e f (w)dw dv p a (x)e x(τ+2v w) σ 2 e γ w dxdw dv ba η σ 2 ba+η ba η p a (x)e xτ J(x)dx where J(x) : e 2xv e (γ+x)w dw + v+τ e (γ x)w dw dv [ e 2xv γ + x + ( e (γ x)(v+τ) )] dv γ x [ ] 2γ e 2xv γ 2 x + e(γ x)τ 2 γ x e(γ x)v dv γ x(γ 2 x 2 ) e(γ x)τ γ 2 x 2. Hence R ez ez (τ) σ 2 ba+η ba η [ p a (x) γ x(γ 2 x 2 ) exτ ] dx. γ 2 x 2eγτ If additionally a is uniformly distributed on [â η,â + η] we have R ez ez (τ) where I (τ) : σ2 2η γ ba+η ba η x(γ 2 x 2 ) exτ dx ba+η ba η dx γ 2 x 2eγτ σ2 2η [γi (τ) e γτ I 2 ] (5.5) ba+η ba η e xτ x(γ 2 x 2 ) dx and I 2 : ba+η ba η γ 2 x 2 dx. Workshop Stochastische Analysis

Some stability results of parameter identification in a jump diffusion model

Some stability results of parameter identification in a jump diffusion model Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Numerical methods for American options

Numerical methods for American options Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment

More information

Fuzzy Differential Systems and the New Concept of Stability

Fuzzy Differential Systems and the New Concept of Stability Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

Lecture 13 Linear quadratic Lyapunov theory

Lecture 13 Linear quadratic Lyapunov theory EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time

More information

VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS

VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled

More information

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties: THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces

More information

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

More information

Statistical Machine Learning

Statistical Machine Learning Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes

More information

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point

More information

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 425, PRACTICE FINAL EXAM SOLUTIONS. MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

More information

Parabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation

Parabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation 7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity

More information

SF2940: Probability theory Lecture 8: Multivariate Normal Distribution

SF2940: Probability theory Lecture 8: Multivariate Normal Distribution SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,

More information

A characterization of trace zero symmetric nonnegative 5x5 matrices

A characterization of trace zero symmetric nonnegative 5x5 matrices A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the

More information

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails 12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint

More information

Estimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia

Estimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia Estimating the Degree of Activity of jumps in High Frequency Financial Data joint with Yacine Aït-Sahalia Aim and setting An underlying process X = (X t ) t 0, observed at equally spaced discrete times

More information

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d). 1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction

More information

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem

More information

Finite dimensional C -algebras

Finite dimensional C -algebras Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n

More information

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

More information

ARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida

ARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida ARBITRAGE-FREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic

More information

OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS

OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek

More information

Inner products on R n, and more

Inner products on R n, and more Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

15.062 Data Mining: Algorithms and Applications Matrix Math Review

15.062 Data Mining: Algorithms and Applications Matrix Math Review .6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

More information

CHAPTER IV - BROWNIAN MOTION

CHAPTER IV - BROWNIAN MOTION CHAPTER IV - BROWNIAN MOTION JOSEPH G. CONLON 1. Construction of Brownian Motion There are two ways in which the idea of a Markov chain on a discrete state space can be generalized: (1) The discrete time

More information

Lecture 7: Finding Lyapunov Functions 1

Lecture 7: Finding Lyapunov Functions 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

ANALYZING INVESTMENT RETURN OF ASSET PORTFOLIOS WITH MULTIVARIATE ORNSTEIN-UHLENBECK PROCESSES

ANALYZING INVESTMENT RETURN OF ASSET PORTFOLIOS WITH MULTIVARIATE ORNSTEIN-UHLENBECK PROCESSES ANALYZING INVESTMENT RETURN OF ASSET PORTFOLIOS WITH MULTIVARIATE ORNSTEIN-UHLENBECK PROCESSES by Xiaofeng Qian Doctor of Philosophy, Boston University, 27 Bachelor of Science, Peking University, 2 a Project

More information

ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS

ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute

More information

Lecture 13: Martingales

Lecture 13: Martingales Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of

More information

MATHEMATICAL METHODS OF STATISTICS

MATHEMATICAL METHODS OF STATISTICS MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS

More information

Variance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers

Variance Reduction. Pricing American Options. Monte Carlo Option Pricing. Delta and Common Random Numbers Variance Reduction The statistical efficiency of Monte Carlo simulation can be measured by the variance of its output If this variance can be lowered without changing the expected value, fewer replications

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

University of Lille I PC first year list of exercises n 7. Review

University of Lille I PC first year list of exercises n 7. Review University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients

More information

Numerical Methods for Differential Equations

Numerical Methods for Differential Equations Numerical Methods for Differential Equations Chapter 1: Initial value problems in ODEs Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

Notes on Symmetric Matrices

Notes on Symmetric Matrices CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.

More information

Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

More information

CITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION

CITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August

More information

Section 4.4 Inner Product Spaces

Section 4.4 Inner Product Spaces Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer

More information

1 Short Introduction to Time Series

1 Short Introduction to Time Series ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The

More information

POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS

POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting

More information

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they

More information

Factorization Theorems

Factorization Theorems Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

Chapter 2: Binomial Methods and the Black-Scholes Formula

Chapter 2: Binomial Methods and the Black-Scholes Formula Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the

More information

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let H and J be as in the above lemma. The result of the lemma shows that the integral Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

More information

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied

More information

Hedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15

Hedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15 Hedging Options In The Incomplete Market With Stochastic Volatility Rituparna Sen Sunday, Nov 15 1. Motivation This is a pure jump model and hence avoids the theoretical drawbacks of continuous path models.

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization 7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

More information

Time Series Analysis

Time Series Analysis Time Series Analysis Autoregressive, MA and ARMA processes Andrés M. Alonso Carolina García-Martos Universidad Carlos III de Madrid Universidad Politécnica de Madrid June July, 212 Alonso and García-Martos

More information

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

SF2940: Probability theory Lecture 8: Multivariate Normal Distribution

SF2940: Probability theory Lecture 8: Multivariate Normal Distribution SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2014 Timo Koski () Mathematisk statistik 24.09.2014 1 / 75 Learning outcomes Random vectors, mean vector, covariance

More information

Tools for the analysis and design of communication networks with Markovian dynamics

Tools for the analysis and design of communication networks with Markovian dynamics 1 Tools for the analysis and design of communication networks with Markovian dynamics Arie Leizarowitz, Robert Shorten, Rade Stanoević Abstract In this paper we analyze the stochastic properties of a class

More information

Some probability and statistics

Some probability and statistics Appendix A Some probability and statistics A Probabilities, random variables and their distribution We summarize a few of the basic concepts of random variables, usually denoted by capital letters, X,Y,

More information

Lecture 3: Linear methods for classification

Lecture 3: Linear methods for classification Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,

More information

LECTURE 15: AMERICAN OPTIONS

LECTURE 15: AMERICAN OPTIONS LECTURE 15: AMERICAN OPTIONS 1. Introduction All of the options that we have considered thus far have been of the European variety: exercise is permitted only at the termination of the contract. These

More information

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i. Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

More information

A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS

A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of

More information

Continuity of the Perron Root

Continuity of the Perron Root Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

More information

8.1 Examples, definitions, and basic properties

8.1 Examples, definitions, and basic properties 8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.

More information

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.

More information

7: The CRR Market Model

7: The CRR Market Model Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The Cox-Ross-Rubinstein

More information

ORDINARY DIFFERENTIAL EQUATIONS

ORDINARY DIFFERENTIAL EQUATIONS ORDINARY DIFFERENTIAL EQUATIONS GABRIEL NAGY Mathematics Department, Michigan State University, East Lansing, MI, 48824. SEPTEMBER 4, 25 Summary. This is an introduction to ordinary differential equations.

More information

On the D-Stability of Linear and Nonlinear Positive Switched Systems

On the D-Stability of Linear and Nonlinear Positive Switched Systems On the D-Stability of Linear and Nonlinear Positive Switched Systems V. S. Bokharaie, O. Mason and F. Wirth Abstract We present a number of results on D-stability of positive switched systems. Different

More information

A simple criterion on degree sequences of graphs

A simple criterion on degree sequences of graphs Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

1 Norms and Vector Spaces

1 Norms and Vector Spaces 008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

More information

3. Regression & Exponential Smoothing

3. Regression & Exponential Smoothing 3. Regression & Exponential Smoothing 3.1 Forecasting a Single Time Series Two main approaches are traditionally used to model a single time series z 1, z 2,..., z n 1. Models the observation z t as a

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +... 6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

More information

Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions

Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,

More information

Stochastic Inventory Control

Stochastic Inventory Control Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the

More information

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in

More information

Corrected Diffusion Approximations for the Maximum of Heavy-Tailed Random Walk

Corrected Diffusion Approximations for the Maximum of Heavy-Tailed Random Walk Corrected Diffusion Approximations for the Maximum of Heavy-Tailed Random Walk Jose Blanchet and Peter Glynn December, 2003. Let (X n : n 1) be a sequence of independent and identically distributed random

More information

α = u v. In other words, Orthogonal Projection

α = u v. In other words, Orthogonal Projection Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

More information

ASEN 3112 - Structures. MDOF Dynamic Systems. ASEN 3112 Lecture 1 Slide 1

ASEN 3112 - Structures. MDOF Dynamic Systems. ASEN 3112 Lecture 1 Slide 1 19 MDOF Dynamic Systems ASEN 3112 Lecture 1 Slide 1 A Two-DOF Mass-Spring-Dashpot Dynamic System Consider the lumped-parameter, mass-spring-dashpot dynamic system shown in the Figure. It has two point

More information

Markov random fields and Gibbs measures

Markov random fields and Gibbs measures Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

More information

Mathematical Finance

Mathematical Finance Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation

More information

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors

More information

Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem

Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Gagan Deep Singh Assistant Vice President Genpact Smart Decision Services Financial

More information

Minimizing the Number of Machines in a Unit-Time Scheduling Problem

Minimizing the Number of Machines in a Unit-Time Scheduling Problem Minimizing the Number of Machines in a Unit-Time Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.bas-net.by Frank

More information

POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS

POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting

More information