Statistical inference for spatial statistics defined in the Fourier domain

Μέγεθος: px
Εμφάνιση ξεκινά από τη σελίδα:

Download "Statistical inference for spatial statistics defined in the Fourier domain"

Transcript

1 Statistical inference for spatial statistics defined in the Fourier domain Suhasini Subba Rao Department of Statistics, Texas A&M University, College Station, U.S.A. May 3, 07 Abstract A class of Fourier based statistics for irregular spaced spatial data is introduced, examples include, the Whittle likelihood, a parametric estimator of the covariance function based on the L -contrast function and a simple nonparametric estimator of the spatial autocovariance which is a non-negative function. The Fourier based statistic is a quadratic form of a discrete Fourier-type transform of the spatial data. Evaluation of the statistic is computationally tractable, requiring Onb operations, where b are the number of Fourier frequencies used in the definition of the statistic and n is the sample size. The asymptotic sampling properties of the statistic are derived using both increasing domain and fixed domain spatial asymptotics. These results are used to construct a statistic which is asymptotically pivotal. Keywords and phrases: Fixed and increasing domain asymptotics, irregular spaced locations, quadratic forms, spectral density function, stationary spatial random fields. Introduction In recent years irregular spaced spatial data has become ubiquitous in several disciplines as varied as the geosciences to econometrics. The analysis of such data poses several challenges which do not arise in data which is sampled on a regular lattice. A major obstacle is the computational costs when dealing with large irregular sampled data sets. If spatial data are sampled on a regular lattice then algorithms such as the Fast Fourier transform can be employed to reduce the computational burden see, for example, Chen, Hurvich, & Lu, 006.

2 Unfortunately, such algorithms have little benefit if the spatial data are irregularly sampled. To address this issue, within the spatial domain, several authors, including, Vecchia, 988, Cressie & Huang, 999, Stein, Chi, & Welty, 004, have proposed estimation methods which are designed to reduce the computational burden. In contrast to the above references, Fuentes, 007 and Matsuda & Yajima, 009 argue that working within the frequency domain often simplifies the computational burden. Both authors focus on parametric estimation using a Whittle-type likelihood. Fuentes, 007 assumes that the irregular spaced data can be embedded on a grid and the missing mechanism is deterministic and locally smooth. A possible drawback of this construction, is that the local smooth assumption will not hold if the locations are extremely irregular. Therefore Matsuda & Yajima, 009 propose a Whittle likelihood approach to parameter estimation which takes into account the irregular nature of the locations. The focus of most Fourier domain estimators have been on the Whittle likelihood the exception being the recent paper by Bandyopadhyay, Lahiri, & Norman, 05, which we discuss later. In this paper we argue that several estimators, both parametric and nonparametric can be defined within the Fourier domain. For example, within the Fourier domain, we propose a nonparametric, non-negative definite estimator of the spatial covariance. Nonparametric estimators of the spatial autocovariance are often defined using kernel smoothing methods see Hall, Fisher, & Hoffman, 994 or the empirical variogram see Cressie, 993. However, these raw covariance estimators may not be non-negative functions, and a second step is required, which involves taking the Fourier transform of a finite discretisation of the sample autocovariance, setting negative values to zero and inverting back, to ensure that the resulting estimator is a non-negative function. In contrast, by defining the covariance estimator within the Fourier domain the estimator is guaranteed to be a non-negative definite function. The purpose of this paper is two fold. The first is to demonstrate that several parameters can be estimated within the Fourier domain. quadratic forms of irregular sampled spatial processes. The second is to obtain a comprehensive understanding of In order to define estimators within the Fourier domain we adopt the approach pioneered by Matsuda & Yajima, 009 and Bandyopadhyay & Lahiri, 009 who assume that the irregular locations are independent, identically distributed random variables thus allowing the data to be extremely irregular and define the irregular sampled discrete Fourier transform DFT as J n ω d/ n n Zs j expis jω,. j where s j /, / d denotes the spatial locations observed in the space /, / d and {Zs j } denotes the spatial random field at these locations. It s worth mentioning a similar transformation on irregular sampled data goes back to Masry, 978, who defines the

3 discrete Fourier transform of Poisson sampled continuous time series. Using this definition, Matsuda & Yajima, 009 define the Whittle likelihood by taking the weighted integral of the periodogram, J n ω. Of course, in practice the weighted integral needs to be approximated by a Riemann sum. Indeed in Remark, Matsuda & Yajima, 009, suggest using the frequency grid {ω k πk/; k Z d } when constructing the Whittle likelihood. No justification is given for this discretisation. However, their observation has insight. We prove that this transformation is optimal for most estimators defined within the Fourier domain. Motivated by the integrated Whittle likelihood, our aim is to consider estimators with the form g θ ω J n ω dω. Such quantities have been widely studied in time series, dating as far back as Parzen, 957, but has received very little attention in the spatial literature. In practice this integral cannot be evaluated, and needs to be approximated by a Riemann sum Q a,, g θ ; 0 d k,...,k d a g θ ω,k J n ω,k. where {ω,k πk/, k k,..., k d, a k i a} is the frequency grid over which the sum is evaluated. In terms of computation, evaluation of {J n ω,k ; k k,..., k d, k j a,..., a} requires Oa d n operations. However, once {J n ω,k } has been evaluated the evaluation of Q a,, g θ ; 0 only requires Oa d operations. As far as we are aware there exists no results on the sampling properties of the general quadratic form defined in.. To derive the asymptotic sampling properties of Q a,, g θ ; 0 we will work under two asymptotic frameworks that are commonly used in spatial statistics. Our main focus will be the increasing domain framework, introduced in Hall & Patil, 994 see also Hall et al., 994 and used in, for example, Lahiri, 003, Matsuda & Yajima, 009, Bandyopadhyay & Lahiri, 009, Bandyopadhyay et al., 05 and Bandyopadhyay & Subba Rao, 07. This is where the number of observed locations n as the size of the spatial domain we usually assume d /n 0. We also analyze the sampling properties of Q a,, g θ ; 0 within the fixed-domain framework where is kept fixed but the number of locations, n grows considered in Stein, 999, Stein, 994, Zhang, 004 and Zhang & Zimmerman, 005. The sampling properties of Q a,, g θ ; 0 differ according to the framework used. We show in Sections 3 and 4 that Q a,, g θ ; 0 is a consistent estimator of the functional Ig θ ; a as and, where I g θ ; a g π d θ ωfωdω..3 πa/,πa/ d However, the choice of frequency grid ω,k plays a vital role in the rate of convergence. In 3

4 particular, we show that EQ a,, g θ ; 0 I g θ ; a log + O + + n and { O d > varq a,, g θ ; 0 O d..4 Therefore, under suitable conditions on g θ, Q a,, g θ ; 0 P I g θ ; if a/ as a n, and. To understand the influence the user chosen frequency grid has on the sampling properties, we show that the asymptotic limit of d varq a,, g θ ; 0 will always be the same for all as. On the other hand, using a frequency grid which is coarser than {πk/; k Z d } leads to an estimator with a larger bias and variance. Thus balancing efficiency with computational burden, in general, {J n ω,k } k Z d is the optimal transformation of the spatial data into the frequency domain. As mentioned above Bandyopadhyay et al., 05 also use the Fourier domain for spatial inference, however their objectives are very different to those in this paper. Bandyopadhyay et al., 05 show that the transformations {J n ω,k } k are asymptotically independent if / 0 as this corresponds to a very coarse frequency grid. Based on this property they use Q a,, g; 0, where is such that / 0 as and, to construct the empirical likelihood. The justification for their construction is that the distribution of the resulting empirical likelihood is asymptotically pivotal as. The sampling properties of Q a,, g; 0 are not derived in Bandyopadhyay et al., 05. However, it is clear from.4, that using a frequency grid where << leads to an estimator that is not optimal in the mean squared sense. Since Q a,, g; 0 is optimal when using the frequency grid, in Section 4 we focus on deriving the sampling properties of Q a,, g θ ; 0. We consider the slightly more general statistic Q a,, g θ ; r g d θ ω,k J n ω,k J n ω,k+r, r Z d.5 k,...,k d a and show asymptotic normality of Q a,, g θ ; r when the random field is stationary and Gaussian and obtain the second order properties of Q a,, g θ ; r when the random field is stationary but not necessarily Gaussian. The sampling properties of Q a,, g θ ; 0 when the domain is kept fixed are considered in Section 4.4. The variance of Q a,, g θ ; 0 is usually difficult to directly estimate. However, in Section 5 we show that if the locations are independent, uniformly distributed random variables, then {Q a,, g θ ; r} forms a near 4

5 uncorrelated sequence whose variance is asymptotically equivalent to Q a,, g θ ; 0. More precisely, if Q a,, g θ ; 0 is real we define the the studentized statistic T S Q a,,g θ ; 0 Ig θ ; a, r S Q a,,g θ ; r S for some fixed set S Z d /{0}. We show that T D S t S as, where t S denotes a t-distribution with S degrees of freedom and S denotes the cardinality of S. We now summarize the paper. In Section we state the assumptions required in this paper and the sampling properties of the Fourier transform {J n ω,k }. In Section.3, we use these properties to motivate examples of estimators which have the form Q a,, g θ ; 0. In Section 3 we summarize the sampling properties of {Q a,, g θ ; 0}. In Section 4 we focus on Q a,, g θ ; r and these results are used to study the sampling properties of T S in Section 5. Q a,, g θ ; 0 is a quadratic form of an irregular sampled spatial process and as far as we are aware there exists very few results on the moment and sampling properties of such quadratic forms. The purpose of the supplementary material, Subba Rao, 07b, is to take a few steps in this direction. Many of these results build on the work of Kawata, 959 and may be of independent interest. A simulation study to illustrate the performance of the nonparametric non-negative definite estimator of the spatial covariance is given in Appendix J, Subba Rao, 07b. Assumptions and Examples. Assumptions and notation In this section we state the required assumptions and notation. This section can be skipped on first reading. We observe the spatial random field {Zs; s R d } at the locations {s j } n j where s j /, / d. Throughout this paper we will use the following assumptions on the spatial random field. Assumption. Spatial random field i {Zs; s R d } is a second order stationary random field with mean zero and covariance function cs s covzs, Zs s, s. We define the spectral density function as fω cs exp is ωds R d and cs π d fω expis ωdω. R d ii {Zs; s R d } is a stationary Gaussian random field. 5

6 We require the following definitions. For some finite 0 < C < and δ > 0, let { C s, β δ s.. C s δ s > Let β δ s d j β δs j. For sequences, we define ξ η j CIj 0 + Ij 0 j η for some finite constant C and I denotes the indicator function. To minimise notation we will often use a k a to denote the multiple sum a k a... a k d a. Let and denote the l -norm and l -norm of a vector, respectively. Let RX and IX denote the real and imaginary parts of X. We make heavy use of the sinc function which is defined as sincω sinω ω d and Sincω sincω j.. j Define the triangle kernel, T : R R where T u u for u, and zero elsewhere and the d-dimensional triangle kernel T u d j T u j. We use the notation {ω,k πk/; k Z d } for a general frequency grid. If >, we say the frequency grid is fine. Conversely, if <, we say the frequency grid is coarse. Further, as mentioned in the introduction using is optimal, therefore to reduce notation we let {ω k πk/; k Z d }. We adopt the assumptions of Hall & Patil, 994, Matsuda & Yajima, 009 and Bandyopadhyay & Lahiri, 009 and assume that {s j } are iid random variables with density d h, where h : /, /d R. Assumption. Non-uniform sampling The locations {s j } are independent distributed random variables on /, / d, where the density of {s j } is h, and h admits the d Fourier representation hu j Z d γ j expiπj u, where j Z d γ j < such that γ j C d i ξ +δj i for some δ > 0. This assumption is satisfied if the second derivative of h is bounded on the d-dimensional torus /, / d. Remark. If h is such that sup s /,/ d m +...,m dhs,...,s d < 0 m i but h s m... s m d d is not continuous on the d-dimensional torus /, / d then γ j C d i ξ j i and the above condition will not be satisfied. However, this assumption can be induced by tapering the observations such that Zs j is replaced with Zs j, where Zs j ts j Zs j, ts d i ts i and t is a weight function which has a bounded second derivative, t / t/ 0 and t / t / 0. By using Zs j instead of Zs j, in all the derivations below we replace the density hs with tshs. 6 This means the results now rely on the

7 Fourier coefficients of tshs, which decay at the rate /,/ d tshs expiπj sds C d i ξ j i, and thus the above condition is satisfied. Note that Matsuda & Yajima, 009, Definition, uses a similar data-tapering scheme to induce a similar condition. The case that the locations follow a uniform distribution is an example of a distribution which satisfies Assumption.. It gives rise to several elegant simplifications. Thus we state the uniform case as a separate assumption. Assumption.3 Uniform sampling The locations {s j } are independent uniformly distributed random variables on /, / d. Many of the results in this paper use that the locations follow a random design. This helps in understand the sampling properties of these complex estimators. However, it can mask the approximation errors when replacing sums by integrals and the role that the sample size n plays in these approximations. To get some idea of these approximations when the domain is kept fixed but n we will, on occassion, treat the locations as deterministic and make the following assumption. Assumption.4 Near lattice locations for d Let {s n,j ; j,..., n} denote the locations. The number of locations n in such a way that n n s n,j+ s n,j O j j, n n sn,j+ s n,j O n where {s n,j } j denotes the order statistics corresponding {s n,j } j. The integrated periodogram Q a,, g; 0 resembles the integrated periodogram estimator commonly used in time series see for example, Walker, 964, Hannan, 97, Dunsmuir, 979, Dahlhaus & Janas, 996, Can, Mikosch, & Samorodnitsky, 00 and Niebuhr & Kreiss, 04. However, there are some fundamental differences, between time series estimators and Q a,, g; 0 which makes the analysis very different. Unlike regularly spaced or near regularly spaced data, truely irregular sampling means that the DFT can estimate high frequencies, without the curse of aliasing a phenomena which was noticed as early as Shapiro & Silverman, 960 and Beutler, 970. In this case, if the function g θ, in the definition of Q a,, g θ ; 0 is bounded, there s no need for the frequency grid to be bounded, and a can be magnitudes larger than. Below we state assumptions on the function g θ and the frequency grid. 7

8 Assumption.5 Assumptions on g θ and the size of frequency grid Suppose Q a,, g θ ; r d k a g θ ω,k J n ω,k J n ω,k+r i If g θ is not a bounded function over R d but sup ω C,C d g θ ω <, then we must restrict the frequency grid {ω,k ; a k,..., k d a} to lie in C, C d thus a C. Further we assume for all j d, sup ω C,C d g θω ω j <. ii If sup ω R d g θ ω <, then the frequency grid can be unbounded in the sense that a/ as a and. Further we assume for all j d, sup ω R d g θω ω j <. The same assumptions apply to the bias corrected version of Q a,, g; 0 which is defined in Section 3. Assumption.6 Conditions on the spatial process a cs β +δ s. Required for the bounded frequency grid, to obtain the covariance of {J n ω,k } k. b For some δ > 0, fω β +δ ω. Required for the unbounded frequency grid - using this assumption instead of a in the case of an bounded frequency grid leads to slightly larger errors bounds in the derivation of the mean and variance of Q a,, g; r. This assumption is also used to obtain the CLT result for both the bounded and unbounded frequency grids. c For all j d and some δ > 0, the partial derivatives satisfy fω ω j β +δ ω. We use this condition to approximate sums with integral for both the bounded and unbounded frequency grids. It is also used to make a series of approximations to derive the limiting variance of Q a,, g; r in the case that the frequency grid is unbounded. d fω d For some δ > 0, ω,..., ω d β +δ ω. Required only in the proof of Theorem 4.iib. e For some δ > 0, fω β +δ ω. Required only for the fixed domain asymptotics. Remark. Assumption.6a is satisfied by a wide range of covariance functions. Examples include: i The Wendland covariance, since its covariance is bounded and has a compact support. 8

9 ii The Matern covariance, which for ν > 0 is defined as c ν s s ν K ν s K ν is the modified Bessel function of the second kind; see Stein, 999. To see why, we note that if ν > 0 then c ν s is a bounded function. Furthermore, for large s, c ν s C ν s ν 0.5 exp s as s where C ν is a finite constant. Thus by using the inequality d / s + s s d s + s s d s + s s d we can show c ν s β +δ s for any δ > 0. Remark.3 Assumption.6b,c,d appears quite technical, but it is satisfied by a wide range of spatial covariance functions. For example, the spectral density of the Matern covariance defined in Remark. is f ν ω ν Γν+ d π d/ + ω ν+d/ see Stein, 999, page 49. It is straightforward to show that this spectral density satisfies Assumption.6b,c,d, noting that the δ used to define β +δ will vary with ν, dimension d and order of derivative. If the spatial random field is non-gaussian we require the following assumptions on the higher order cumulants. Assumption.7 Non-Gaussian random fields {Zs; s R d } is a fourth order stationary spatial random field, in the sense that EZs 0, covzs, Zs cs s, cumzs, Zs, Zs 3 κ s s, s s 3 and cumzs, Zs, Zs 3, Zs 4 κ 4 s s, s s 3, s s 4, for some functions κ 3 and κ 4 and all s,..., s 4 R d. We define the fourth order spectral density as f 4 ω, ω, ω 3 R 3d κ 4 s, s, s 3 exp i 3 j s jω j dω dω dω 3. We assume that for some δ > 0 the spatial tri-spectral density function is such that f 4 ω, ω, ω 3 β +δ ω β +δ ω β +δ ω 3 and f 4ω,...,ω 3d ω j β +δ ω β +δ ω β +δ ω 3.. Properties of Fourier transforms In this section we briefly summarize some of the characteristics of the Fourier transforms J n ω,k. These results will be used in the construction of several estimators. Theorem. Increasing domain asymptotics Let us suppose that {Zs; s R d } is a stationary spatial random field whose covariance function defined in Assumption.i satisfies Assumption.6a for some δ > 0. Furthermore, the locations {s j } satisfy Assumption.. Then we have cov J n ω k, J n ω k γ, γ k k f ω k + c0γ k k d + O n where the bounds are uniform in k, k Z d and γ, γ r j Z d γ j γ r j.,.3 9

10 Further, suppose Assumption.6c holds and that γ j d i ξ +δj i for some δ > 0. If > fine frequency grid is used, then cov J n ω,k, J n ω,k f ω,k π j + j k k PROOF See Appendix A, Subba Rao, 07b. j,j Z d γ j γ j Sinc d +O n + log..4 Comparing.3 with.4 we see that if k and k are such that max ω,k ω,k < then there is a high amount of correlation between the Fourier transforms. On the other hand if max ω,k ω,k as, the correlation declines. This means if the frequency grid is very coarse, << as considered in Bandyopadhyay & Lahiri, 009 and Bandyopadhyay et al., 05 the DFTs are almost uncorrelated. On the other hand, if the frequency grid is very fine, >> see.4 frequencies which are close to each other are highly correlated. These observations suggest that estimators based on J n ω,k don t gain in efficiency when > but there will be a loss in efficiency when <. We show this heuristic to be true in Section 3. The results in the above theorem give the limit within the increasing domain framework. In Theorem G., Subba Rao, 07b, we obtain the properties of J n ω,k within the fixed domain framework, where is kept fixed but n. The expressions are long, but we summarize the most relevant parts in the remark below. Remark.4 Fixed domain asymptotics i Let k u iπk u A cu exp du,.5, d T where T is the d-dimensional triangle kernel. Using Theorem G.iii, Subba Rao, 07b, under Assumption.3 locations are uniformly distributed we have var J πk n A k + d c0. n Therefore if the sampling frequency,, is chosen such that, then d A k are the Fourier coefficients of T u cu defined on the domain /, / d. In Section.3 we show that this fixed domain approximation can, in some cases, be used to obtain unbiased estimators. ii If the locations are not uniformly distributed, then by keeping fixed and using Theorem G.i we see that var J πk n is not a separable function of the spatial spectral density and the Fourier coefficients of the random design. Whereas the approximation 0

11 of var J πk n as given in Theorem. is a separable function of the spatial spectral density and spatial design. Using the separable approximation as the basis of an estimation scheme is simpler than using the exact, but non-separable formula. Remark.5 We observe from Theorems. that in the increasing domain framework J n ω,k is an estimator of the spectral density function, fω,k whereas within the fixed domain framework J n ω,k is an estimator of the Fourier coefficient A k/. However, if R d fω dω < and the ratio k/ is kept fixed then A k fω,k as..3 Examples of estimators defined within the Fourier domain Many parameters or quantities of interest can be written as a linear functional involving the spectral density function f. In Theorem. and Remark.5 we showed that if is large and the design of locations uniform then EJ n ω,k fω,k if the design is not uniform then there will be an additional multiplicative constant. Motivated by this observation, in this section we consider estimators or criterions which take the form.5. If the locations follow a uniform distribution then for some of the examples below it is possible to reduce the fixed domain bias in the estimator..3. The Whittle likelihood Suppose the stationary spatial process {Zs; s R d } has spectral density f θ0 ω and corresponding covariance c θ0 s where θ 0 is unknown but belongs to the compact parameter space Θ. Matsuda & Yajima, 009 propose using the integrated Whittle likelihood to estimate θ 0. More precisely, they define the Whittle likelihood as L I,n θ, η log f θ ω + η + J nω dω, f θ ω + η and use θ, η arg min θ,η L n θ, η as an estimator of θ and η where η is an estimator of the ridge effect. Of course, this integral cannot be evaluated in practice and a Riemann sum approximation is necessary. Using {ω k πk/; k k,..., k d, C k j C} we approximate the integral with the sum L S,n θ, η d k a log f θ ω k + η + J nω k. f θ ω k + η A heuristic motivation for the above likelihood is that in the case the locations are uniformly distributed then {J n ω k } are near uncorrelated random variables with asymptotic variance f θ0 ω k +η 0. If J n ω k were Gaussian, uncorrelated random variables with variance f θ0 ω k + η 0 then L S,n θ, η would be the true likelihood. The choice of a C is necessary where

12 C does not depend on, since f θ ω 0 as ω for any norm, thus the discretized Whittle likelihood is only well defined over a bounded frequency grid. The choice of C is tied to how fast the tails in the parametric class of spectral density functions {f θ ; θ Θ} decay to zero. If either Assumption.3 or.4 is satisfied, then we observe from Remark.4 that A k ; θ 0 is a better approximation of varj n ω than f θ0 ω k where A is defined in.5. Therefore if Assumption.3 or.4 is satisfied, a better finite sample approximation can be obtained by using θ arg min L S,n θ as an estimator of θ, where L S,n θ, η d k a and A k ; θ, d T u cθ u exp.3. The spectral density estimator k log A ; θ + η J n ω k + k A ; θ + η iπk u du..6 We recall from Theorem. that varj n ω k γ, γ 0 fω k. Since f is locally constant in a neighbourhood of ω and motivated by spectral methods in time series we use f,n ω as a nonparametric estimator of f or a constant multiple of it, where f,n ω / k / W b ω ω k J n ω k b d Q a,,w b, 0, W b ω b d d j W ω j and W : /, / R is a spectral window. In this case we b set the number of frequencies a /, and Assumption.5i is satisfied..3.3 A nonparametric non-negative definite estimator of the spatial covariance In this section we propose a nonparametric estimator of the covariance. The estimator is based on the representation cu π d R d fω expiω udω. Since the expectation of J n ω k is approximately fω k, to estimate the spatial covariance we propose approximating the above integral with a sum and the spectral density with the absolute square of the Fourier transform. However, using the frequency grid ω k πk is problematic outside the region /, / d. Instead, we propose using a finer grid to estimate the covariance, namely c,n u d k a J n ω,k expiu ω,k u, d

13 where. In this case, a a can be chosen such that a/ as a and thus Assumption.5ii is satisfied. A disadvantage with the above raw estimator of the covariance is that there is no guarantee that it yields a non-negative definite spatial auto-covariance function. However, this can easily be remedied by multiplication of c,n u with the triangle kernel. precisely, we define the estimator ĉ,n u u T c,n u More where T u d j T u j and. This covariance estimator has the advantage that it is zero outside the region, d. Moreover, ĉ,n u is a non-negative definite sequence. To show this result, we use that the Fourier transform of the triangle kernel, T u is sinc ω. Thus the Fourier transform of ĉ,n u is f ω, d ĉ,n u exp iω udu d d k a J n ω,k Sinc ω,k ω. Clearly, f ω 0, therefore, the estimator {ĉ,n u} is a non-negative definite function and thus a valid covariance function. In Appendix J, Subba Rao, 07b, we illustrate the performance of the nonparametric non-negative definite estimator of the spatial covariance with some simulations..3.4 A nonlinear least squares estimator of a parametric covariance function We recall that the Whittle likelihood can only be defined on a bounded frequency grid. This can be an issue if the observed locations are dense on the spatial domain and thus contain a large amount of high frequency information which would be missed by the Whittle likelihood. An alternative method for parameter estimation of a spatial process is to use a different loss function. Motivated by Rice, 979, the discussion on the Whittle estimator in Section.3. and Theorem. we define the quadratic loss function L n θ Jn ω d k γ, γ 0 f θ ω k, k a and let θ n arg min θ Θ L n θ or equivalently solve θ L n θ 0, where θ L n θ γ, γ 0 d θ f θ ω k { J n ω k γ, γ 0 f θ ω k } k a γ, γ 0 Q a,, θ f θ ; 0 γ, γ 0 d 3 f θ ω k θ f θ ω k. k a

14 It is well known that the distributional properties of a quadratic loss function are determined by its first derivative. In particular, the asymptotic sampling properties of θ n are determined by Q a,, θ f ; θ; 0. In this case a can be such that a/ as and Assumption.5ii is satisfied. An estimator of γ, γ 0 is given in Remark 4.. Note that in the definition of L n θ, γ, γ 0 can be replaced with σ, in which case one is estimating a multiple of f θ0 ω. If either Assumption.3 or.4 is satisfied then we can replace f θ ω k with A k ; θ, to obtain a better fixed domain approximation. 3 A summary of the sampling properties of Q a,, g; 0 In this section we consider the sampling properties of Q a,, g; 0 for the general frequency grid {ω,k πk }. The proof and more general results can be found in Appendix D, Subba Rao, 07b. To simplify notation in this section we mainly consider the case that the locations are uniformly distributed. Lemma 3. Suppose Assumptions.i,.3 and.6a,c or b,c hold. Let Ig; a and A be defined as in.3 and.5 respectively. Then E Q a,, g; 0 c d k a πk k g A + c0d n d k a gω,k 3. where c nn /. If we let, then E Q a,, g; 0 c I g; a + c0d n d PROOF See Appendix A, Subba Rao, 07b. k a log gω,k + O We observe an exact expression for the expectation of Q a,, g; 0 is in terms of the Fourier coefficients A k/. However, an approximation of the expection of Q a,, g; 0 within the increasing domain framework is in terms of an integral of the spectral density function. We apply the above results to some of the examples considered in the previous section. The results are given in the general case that the locations are random variables but not necessarily uniformly distributed see Theorem 4. and Lemma A. for the details. Example 3. i The Whittle likelihood Under Assumption., using Theorems. and 4

15 4., within the increasing domain asymptotics framework we have E L S,n θ, η π d a/,a/ d log f θ ω + η + γ, γ 0 f θ0 ω + γ 0 η 0 f θ ω + η dω + O where f θ0 denotes the true spectral density, η 0 d n c0; θ 0 note that η 0 O d /n with cs; θ 0 the corresponding spatial covariance. Assuming Assumption.3 holds, within the fixed domain framework the expectation of.6 is EL S,n θ, η d k a k log A ; θ + η A k + ; θ 0 a d k A ; θ + η + O, n where in the above error bound we use that the tails of A k/; θ decay at the rate d i ξ k i., ii The nonparametric covariance Within the increasing domain framework and using Lemma A.ii, Subba Rao, 07b, for u min, /, min, / d we have log E c,n u γ, γ 0 cu + O +, and Eĉ,n u γ, γ 0 T ṷcu + O T ṷ log + where γ, γ 0 is defined in Theorem.. In order to understand the properties of c,n u within the fixed domain framework we assume that Assumption.3 holds. If and u, then by using Lemma 3. we have E c,n u d T k A k u cu + O exp iu ω,k + O n +, a n + a where we recall T denotes the triangle kernel. In Lemma 3. we observe the bias c0d a n d k a gω,k. It can be removed by using a bias corrected version of Q a,, g; 0 Q a,, g; 0 d k a gω,k J n ω,k d d n k a gω,k n n Zs j. j 3.3 For the remainder of this section we focus on this bias corrected estimator. The analogous result for Q a,, g; 0 can be found in Appendix H, Subba Rao, 07b. 5

16 We show in Appendix D, Subba Rao, 07b that in the case that {Zu; u R d } is a Gaussian stationary spatial process a var Qa,, g; 0 C Sinc d kπ k,...,k d a where a C fω gω + gωg ω dω. 3.4 π d πa/,πa/ d Observe that the rate of convergence of var Qa,, g; 0 is determined by k,...,k d a Sinc kπ d i k i a sinc k iπ. It is this term along with the following result which gives the crucial insight into the rate of convergence for different frequency grids {ω,k }. If a then < sinc kπ Z k O > and further, if / then k sinc kπ see Appendix D, Subba Rao, 07b for the proof. This result implies that { var Q O < a,, g; 0 d O. d In other words, the frequency grid ω,k πk or finer will yield a rate of convergence of O d and var Q a,, g; 0 d C a. However a coarse frequency grid ω,k πk where < will yield a slower rate of convergence of O d. In the theorem below we make this precise. For the following theorem we consider general stationary spatial random fields, this requires the following definition a D gω π d gω f 4 ω, ω, ω dω dω. πa/,πa/ d This term arises if the spatial random field is non-gaussian. / Z, 3.5 Theorem 3. Suppose Assumptions.i,.,.5i or ii,.6b,c and.7 hold. Let C and D be defined as in 3.4 and 3.5 respectively. 6

17 i If a fine frequency grid is used < then a d d var Qa,, g; 0 C d ii If a coarse frequency grid is used d var Q a,, g; 0 C a k a k a then Sinc kπ + D a Sinc kπ + + O l a,, d a l D + O a,, where l a,, is defined in D.6, Appendix D, Subba Rao, 07b. PROOF See Appendix D, Subba Rao, 07b. As mentioned above, one important implication of the above result is that the rate of convergence depends on whether the frequency grid is coarser or finer than /, where is the length of the spatial domain. In terms of the asymptotic sampling properties see Lemma 3. and Theorem 3. there seems to be little benefit using a very fine frequency grid, as it does not reduce the bias or variance but is computationally costly. We observe that if the spatial process is non-gaussian then an additional term, D a/, involving the fourth order cumulant of the spatial process, arises. However, if the frequency grid is extremely coarse in the sense that / as and, then D a/ is asymptotic negligible compared with the leading term which is a function of the spectral density. For example, if / Z + then d var Q a,, g; 0 C a + O l a,, + d. d Thus if / as and and gω g ω we have verified condition C.4 in Bandyopadhyay et al., 05; var a k a gω,k J n ω,k a k a gω,k fω,k P, which is required for their proposed spatial spectral empirical likelihood methodology. Therefore a very coarse grid has the advantage that the term D is negligible. However, we see from Lemma 3. and Theorem 3. that the disadvantage is that there is a substantial increase in both variance and bias. Since the grid, ω k πk/, yields optimal samping properties in Section 4 we focus on deriving sampling properties of Q a, g; r, where Q a, g; r gω d k J n ω k J n ω k+r n k,...,k d a 7 k a gω k n n Zs j e is j ωr. j 3.6

18 4 Sampling properties of Q a, g; r In this section we show that under the increasing domain framework Q a, g; r defined 3.6 is a consistent estimator of Ig; a or some multiple of it, where Ig; a is defined in.3. The sampling properties in the fixed domain framework are given in Section The expectation of Q a, g; r We start with the expectation of Q a, g; r. We show if sup ω R d gω <, the choice of a does not play a significant role in the asymptotic properties of Q a, g; r. If a >>, the analysis of Q a, g; r requires more delicate techniques. We start by stating some pertinent features in the analysis of Qa, g; r, which gives a flavour of our approach. Q a, g; r as a quadratic form it is straightforward to show that E Qa, g; r c h k a s By writing gω k d /,/ d cs s expiω ks s is ω r h s ds ds, 4. where c nn /n. The proof of Theorem. is based on making a change of variables v s s and then systematically changing the limits of the integral. This method can be applied to the above, if a is such that the ratio a/ is fixed for all. However, if the frequency grid a/, a/ d is allowed to grow with, applying this brute force method to E Qa, g; r has the disadvantage that it aggregrates the errors within the sum of E Qa, g; r. Instead, to further the analysis, we replace cs s by its spectral representation cs s fω expiω π R s d d s dω and focus on the case that the sampling design is uniform; hs/ d I /,/ s later we consider general sampling densities. This reduces the first term in E Qa, g; r to the Fourier transforms of step functions, which is the product of sinc functions. Specifically, we obtain E Qa, g; r c π d c π d k a ω gω k fωsinc R + kπ d d R d SincySincy + rπ k a ω Sinc + k + rπ dω gω k f y ω k where the last line above is due to a change of variables y ω + kπ. Since the spectral density function is absolutely integrable it is clear that a d k a gω kf y ω k is uniformly bounded over y and that E Qa, g; r is finite for all. Furthermore, if f y ω k were replaced with f ω k, then what remains in the integral are two shifted sinc functions, 8 dy,

19 which is zero if r Z d /{0}, i.e. where E Qa, g; r c SincySincy + rπ π d R d R c SincySincy + rπ π d R d d k a d k a gω k f ω k dy + R, gω k f y ω k f ω k dy. In the following theorem we show that under certain conditions on f, R is asymptotically negligible. Theorem 4. Let Ig; be defined as in.3. Throughout the theorem we suppose Assumptions.i and.3 hold. Let br denote the number of zero values in r. i If Assumptions.5i and.6a,c hold, then we have { O r Z d /{0} E Qa, g; r d br I g; C + O r 0 4. ii Suppose Assumptions.5ii holds and a Assumption.6b holds, then sup a E Qa, g; r <. b Assumption.6b,c,d holds, then we have { O d br E Qa, g; r d br j log + log m j I g; a + O log + n r Z d /{0} r 0. where {m,..., m d br } is the subset of non-zero values in r r,..., r d. c If only Assumption.6b,c holds, then the O d br d br j log + log m j term in b is replaced with the slower rate O log + log + r. Note that the above bounds for b and c are uniform in a. PROOF See Appendix A, Subba Rao, 07b. We observe that if r 0, then Q a, g; r is estimating zero as. It would appear that Q a, g; r when r 0 does not contain any useful information, however in Section 5 we show how these terms can be used to estimate nuisance parameters. 9

20 In order to analyze E Qa, g; r in the case that the locations are not from a uniform distribution we return to 4. and replace cs s and h by their Fourier representations E Qa, g; r c y γ π d j γ j gω d k f ω k SincySincy + r j j πdy. j,j Z k a This representation allows us to use similar techniques to those used in the uniform sampling case to prove the following result. Theorem 4. Let Ig; be defined as in.3. Suppose Assumptions.i and. hold. i If in addition Assumptions.5i and.6a,c hold, then we have E Qa, g; r γ, γ r I g; a + O, O is uniform over r Z d. ii If in addition Assumptions.5ii and.6b,c hold, then we have E Qa, g; r γ, γ r I g; a log + log + r + O. PROOF See Appendix A, Subba Rao, 07b. We observe that by applying Theorem 4. to the case that h is uniform using that γ 0 else γ j 0 gives E Qa, g; r O for r 0. Hence, in the case that the sampling is uniform, Theorems 4. and 4. give similar results, though the bounds in Theorem 4. are sharper. Remark 4. Estimation of j Z d γ j The above lemma implies that E Qa, g; 0 γ, γ 0 I g; a. Therefore, to estimate I g; a we require an estimator of γ, γ0. To do this, we recall that γ, γ 0 j Z γ j d /,/ d h ω dω. Therefore one method for estimating the above integral is to define a grid on /, / d and estimate h at each point, then to take the average squared over the grid see Remark, Matsuda & Yajima, 009. An alternative, computationally simpler method, is to use the method proposed in Gine & Nickl, 008. That is, use γ, sj s j γ 0 K, nn b b j <j n 0

21 as an estimator of γ, γ 0, where K : /, / d R is a kernel function. Note that multiplying the above kernel with exp iω rs j results in an estimator of γ, γ r. In the case d and under certain regularity conditions, Gine & Nickl, 008 show if the bandwidth b is selected in an appropriate way then γ, γ 0 attains the classical On / rate under suitable regularity conditions see, also, Bickel & Ritov, 988 and Laurent, 996. It seems plausible a similar result holds for d > though we do not prove it here. Therefore, an estimator of I g; a is Qa, g; r/ γ, γ The covariance and asymptotic normality In the previous section we showed that the expectation of Q a, g; r depends only on the number of frequencies a through the limit of the integral Ig; a if sup ωrd gω <. In this section, we show that a plays a mild role in the higher order properties of Q a, g; r. We focus on the case that the random field is Gaussian and later describe how the results differ in the case that the random field is non-gaussian. Theorem 4.3 Suppose Assumptions.,. hold. Let U r, r ; ω r, ω r and U r, r ; ω r, ω r be defined as in equation C., Subba Rao, 07b. i If Assumption.5i and.6a,c also hold. Then uniformly for all 0 r, r C, we have d cov Qa, g; r, Q a, g; r U r, r ; ω r, ω r + O + d n and d cov Qa, g; r, Q a, g; r U r, r ; ω r, ω r + O + d n ii If Assumption.5ii and.6b also hold. Then d sup var Qa, g; r < a,r with d /n c where 0 c < as and n. iii If Assumption.5ii and.6b,c also hold. Then uniformly for all 0 r, r C a for some finite constant C we have d cov Qa, g; r, Q a, g; r U r, r ; ω r, ω r + Ol,a,n d cov Qa, g; r, Q a, g; r U r, r ; ω r, ω r + Ol,a,n,

22 where log a + log l,a,n log a + d n. 4.3 PROOF See Appendix C, Subba Rao, 07b. We now briefly discuss the above results. From Theorem 4.3ii we see that Q a, g; r is a mean squared consistent estimator of γ, γ r Ig; a, i.e. E Q a, g; r γ, γ r Ig; a O d + log + n as a and. In order to obtain an explicit expression for the variance additional conditions are required. In particular, Theorem 4.3iii states that if the frequency grid is unbounded we require some additional conditions on the spectral density function and some mild constraints on the rate of growth of the frequency domain a. More precisely, a should be such that a O k for some k <. Remark 4. Selecting a in practice The above gives theoretical guidelines. In practice, if sup ω R d gω < we suggest plotting J n ω k against ω k. J n ω k will drop close to zero for large ω k see Figure, Section J, Subba Rao, 07b. Thus a should be chosen such that it lies after this point. The precise value does not matter too much as the results are not too sensitive to the choice of a. The expressions for cov d cov Qa, g; r, Q a, g; r see equation C., Subba Rao, 07b are unwieldy, however, some simplifications can be made if r << and r <<. Corollary 4. Suppose Assumptions.,.5 and.6a,c or.6b,c hold. Then U r, r ; ω r, ω r Γ r r C + O ε r,r U r, r ; ω r, ω r Γ r +r C + O ε r,r 4.4 where Γ r j +j +j 3 +j 4 r γ j γ j γ j3 γ j4, ε r,r r + r C C π d π d π a/,a/ d fω and gω + gωg ω dω π a/,a/ d fω gωg ω + gωgω dω. Recall that C C a/ where C is defined in 3.4. In the following theorem we derive bounds for the cumulants of Qa, g; r, which are subsequently used to show asymptotical normality of Q a, g; r.

23 Theorem 4.4 Suppose Assumptions.,.,.5 and.6b hold. Then for all q 3 and uniform in r,..., r q Z d we have if d n log d a cum q Qa, g, r,..., Q a, g, r q 0 as n, a and. PROOF See Section E, Subba Rao, 07b. log dq a O dq 4.5 From the above theorem we see that if d 0 and n log d a log a/ / 0 as, n and a, then we have dq/ cum q Q a, g, r,..., Q a, g, r q 0 for all q 3. Using this result we show asymptotic normality of Q a, g, r. Theorem 4.5 Suppose Assumptions.,.,.5 and.6b,c hold. Let C and C, be defined as in Corollary 4.. Under these conditions we have d/ / R Qa, g, r γ, γ r Ig; a I Qa, g, r γ, γ r Ig; a D N 0, I, where RΓ 0 C + Γ r C IΓ r C IΓ r C RΓ 0 C Γ r C with log a / 0 and d /n 0 as, n and a. PROOF See Appendix E, Subba Rao, 07b. It is likely that the above result also holds when the assumption of Gaussianity of the spatial random field is relaxed and replaced with the conditions stated in Theorem 4.6 below together with some mixing-type assumptions. We leave this for future work. However, in the following theorem, we obtain an expression for the variance of Q a, g; r for non-gaussian random fields. Theorem 4.6 Let us suppose that {Zs; s R d } is a fourth order stationary spatial random field that satisfies Assumption.i,.,.5,.7 and.6a,c or.6b,c are satisfied. If r, r <<, then we have d cov Qa, g; r, Q a, g; r Γ r r C + D + O l,a,n + ad n + ε r,r d cov Qa, g; r, Q a, g; r Γ r +r C + D + O l,a,n + ad + ε n r,r, 3

24 where C and C are defined as in Corollary 4. and D gω π d gω f 4 ω, ω, ω dω dω π a/,a/ d D gω π d gω f 4 ω, ω, ω dω dω. π a/,a/ d PROOF See Appendix C, Subba Rao, 07b. We observe that to ensure the term ad n 0 we need to choose a such that a d on / d. In contrast for Gaussian random fields a O k for some k < was sufficient for obtaining an expression for the variance and asymptotic normality. 4.3 Mixed Domain verses Pure Increasing Domain asymptotics The asymptotics in this paper are mainly done using mixed domain asymptotics, that is, as the domain, the number of locations observed grows at a faster rate than, in other words d /n 0 as n. However, as rightly pointed out by a referee, for a given application it may be difficult to disambiguate Mixed Domain MD from the Pure Increasing Domain PID set-up, where d /n c 0 < c <. We briefly discuss how the results change under PID asymptotics and the implications of this. We find that the results point to a rather intriguing difference for spatial processes that are Gaussian and non-gaussian. In the case that spatial process is Gaussian, using both MD and PID asymptotics we have d var Q a, g; r O see Theorem 4.3i. Furthermore, an asymptotic expression for the variance is d var Q a, g; r Γ 0 C + E + O l,a,n + ε r,r where E O d /n is a function of the spectral density; this term is not asymptotically negligible under PID asymptotics. From the above we see that if we choose a such that a O k for some < k < then similar results as those stated in Sections 4. and 4. hold under PID asymptotics. In the case that the process is non-gaussian, using Theorem 4.6 we have d var Q a, g; r Γ 0 C + D + E + F + O l,a,n + ad n + ε r,r, where F O d /n is a function of the fourth order spectral density function. However, there arises an additional term Oa d /n. a d n From the proof of Theorem 4.6, we see if as a,, n, then d var Q a, g; r is not bounded. Thus, the number of frequencies, a, should be such that a d /n 0. In the case of MD asymptotics, we choose 4

25 a such that a d /n 0 and log 3 a/ 0. Under these two conditions the frequency grid can be unbounded and grow at the rate a/ as. However, under PID asymptotics where On /d in order to ensure that a d /n O we require a On /d O. This constrains the frequency grid to be bounded. To summarize, in the case that the spatial process is non-gaussian and n O d in order that var Q a, g; r 0 as, the frequency grid must be bounded or a coarser frequency grid ω,k where > used see Section Fixed domain asymptotics We now turn our attention to asymptotic sampling properties of Q a, g; 0 when the domain is kept fixed but the number of sampling locations n. In order to simplify notation we consider the case d. We will assume the locations, {s n,j }, lie close to a lattice and satisfy Assumption.4. It is clear that as n the Fourier transform J n ω k can be approximated by the Fourier transform over the continuum J k / Zs exp / / πiks ds. Thus asymptotic expressions for the mean and variance of Q a, g; 0, where is fixed but n are in terms of the covariances of {J k }k Z. In Appendix G, Subba Rao, 07b we show that k k var J A k k and cov J, J k k + k k B B πk k where k A u k cue πiu/ du and B 0 πku cu sin du 4.6 These expression are used to prove the following result. Theorem 4.7 Suppose Assumptions.,.4 and.6e hold. letting n we have E Qa, g; 0 k a k g ω k A + O Then keeping fixed but k + gω k n k a 4.7 5

26 and if sup ω R gω < var Qa, g; 0 k,k a 4 g ω k g ω k B k, k + O n + a log a + n a 4.8 where B k, k { Ik 0A 0 + Ik 0A k + B π k k k k k π k k B k B k + π k +k B k + B k k k and A and B are defined in 4.6. PROOF See Appendix G, Subba Rao, 07b. From the above result we see that if sup ω R gω < and the number of terms in the definition of Qa, g; 0, grows at a sufficiently slow rate as n then Q a, g; 0 is asymptotically an unbiased estimator of k Z gω ka k and the variance bounded which fits with the conclusions of Theorem 4.3ii. We now consider a special example of an estimator defined within the frequency domain and later compare it with the Gaussian maximum likelihood estimator for the same problem. More precisely, we consider the case that the covariance of a spatial Gaussian process is σ cu where cu is known but σ is unknown and our aim is to estimate σ. Let A k cu u / expπiku/du. Since E J nω k σ A k + On + k it seems natural to use σ as an estimator of σ, where σ a k J n ω k A k. Note σ corresponds to the Whittle likelihood estimator of σ when c is known. Using Theorem 4.7, equation 4.7 we have E σ σ + O n a k + k. Hence, if a is chosen such that the error above goes to zero as n then σ is asymptotically an unbiased estimator of σ. Now we evaluate its variance. By using Corollary G., Subba Rao, 07b it can be shown that var σ a k B k, k A k + a k k k k + 6 B k, k A k A k + O a 6 n + a3 n. 4.9

27 But here we run into a problem. One would expect that if a is chosen such that a 3 /n 0 as a and n, then var σ Oa. This is true for the first term on the right hand side of the above, but it is not necessarily true for the second term, which for most covariances will remain of order O for all a. The problem is that A k is a continuous function on the torus,, thus for large k A k decays at the rate k. On the other hand B k /, k / is a function of k k B B 0 k k k + k cu sin πu cos πu du. For most covariances c0 c, consequently, using integration by parts we see that B k B k k k a faster rate of convergence is not possible. Applying these bounds to 4.9 gives var σ O. Thus even as n and a, σ is not a mean squared consistent estimator of σ. One exception is when cu c u for all u 0, /, in this case B k 0 for all k and var σ a. Therefore, in general, it seems that we cannot consistently estimate σ using a Fourier domain approach. We conjecture that the only transformation of the data that will consistently estimate σ is a transformation with the eigenfunctions associated with the covariance operator c. In contrast, Zhang, 004 and Zhang & Zimmerman, 005 showed that if the maximum likelihood were used to estimate σ in a Gaussian random field with covariance σ c where c is a known Matern covariance function, then even within the fixed domain framework σ can be consistently estimated. This demonstrates that there exists situations where there are clear gains by working within the likelihood framework if the correct distribution is specified. However, if the true covariance is cu cu; θ and θ is also unknown, then even within the Gaussian likelihood framework one cannot consistently estimate σ and θ. 5 A studentized Q a, g; 0-statistic The expression for the variance Q a, g; 0 given in the examples above, is rather unwieldy and difficult to estimate directly. In this section we describe a simple method for estimating the variance of Q a, g; 0 under the assumption the locations are uniformly distributed. This estimator is used to obtain a simple studentized statistic for Q a, g; 0. We assume in this section that Q a, g; 0 is a real random variable. Our approach is motivated by the method of orthogonal samples for time series proposed in Subba Rao, 07a, where the idea is to define a sample which by construction shares some of the properties as the estimator of interest. In this section we show that { Q a, g; r; r 0} is an orthogonal sample associated with Q a, g; r. 7

Other Test Constructions: Likelihood Ratio & Bayes Tests

Other Test Constructions: Likelihood Ratio & Bayes Tests Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :

Διαβάστε περισσότερα

2 Composition. Invertible Mappings

2 Composition. Invertible Mappings Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,

Διαβάστε περισσότερα

Example Sheet 3 Solutions

Example Sheet 3 Solutions Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note

Διαβάστε περισσότερα

Statistical Inference I Locally most powerful tests

Statistical Inference I Locally most powerful tests Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided

Διαβάστε περισσότερα

4.6 Autoregressive Moving Average Model ARMA(1,1)

4.6 Autoregressive Moving Average Model ARMA(1,1) 84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this

Διαβάστε περισσότερα

ST5224: Advanced Statistical Theory II

ST5224: Advanced Statistical Theory II ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known

Διαβάστε περισσότερα

6.3 Forecasting ARMA processes

6.3 Forecasting ARMA processes 122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear

Διαβάστε περισσότερα

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS

CHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =

Διαβάστε περισσότερα

Every set of first-order formulas is equivalent to an independent set

Every set of first-order formulas is equivalent to an independent set Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent

Διαβάστε περισσότερα

Lecture 34 Bootstrap confidence intervals

Lecture 34 Bootstrap confidence intervals Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α

Διαβάστε περισσότερα

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit

Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal

Διαβάστε περισσότερα

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.

Απόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ. Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action

Διαβάστε περισσότερα

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

Fourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)

Διαβάστε περισσότερα

Partial Differential Equations in Biology The boundary element method. March 26, 2013

Partial Differential Equations in Biology The boundary element method. March 26, 2013 The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet

Διαβάστε περισσότερα

EE512: Error Control Coding

EE512: Error Control Coding EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3

Διαβάστε περισσότερα

derivation of the Laplacian from rectangular to spherical coordinates

derivation of the Laplacian from rectangular to spherical coordinates derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used

Διαβάστε περισσότερα

Lecture 21: Properties and robustness of LSE

Lecture 21: Properties and robustness of LSE Lecture 21: Properties and robustness of LSE BLUE: Robustness of LSE against normality We now study properties of l τ β and σ 2 under assumption A2, i.e., without the normality assumption on ε. From Theorem

Διαβάστε περισσότερα

Problem Set 3: Solutions

Problem Set 3: Solutions CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C

Διαβάστε περισσότερα

Math221: HW# 1 solutions

Math221: HW# 1 solutions Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin

Διαβάστε περισσότερα

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)

Phys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required) Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts

Διαβάστε περισσότερα

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1

Econ 2110: Fall 2008 Suggested Solutions to Problem Set 8  questions or comments to Dan Fetter 1 Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test

Διαβάστε περισσότερα

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:

HOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch: HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying

Διαβάστε περισσότερα

Estimation for ARMA Processes with Stable Noise. Matt Calder & Richard A. Davis Colorado State University

Estimation for ARMA Processes with Stable Noise. Matt Calder & Richard A. Davis Colorado State University Estimation for ARMA Processes with Stable Noise Matt Calder & Richard A. Davis Colorado State University rdavis@stat.colostate.edu 1 ARMA processes with stable noise Review of M-estimation Examples of

Διαβάστε περισσότερα

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions

SCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)

Διαβάστε περισσότερα

Homework 3 Solutions

Homework 3 Solutions Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For

Διαβάστε περισσότερα

ECE598: Information-theoretic methods in high-dimensional statistics Spring 2016

ECE598: Information-theoretic methods in high-dimensional statistics Spring 2016 ECE598: Information-theoretic methods in high-dimensional statistics Spring 06 Lecture 7: Information bound Lecturer: Yihong Wu Scribe: Shiyu Liang, Feb 6, 06 [Ed. Mar 9] Recall the Chi-squared divergence

Διαβάστε περισσότερα

forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with

forms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We

Διαβάστε περισσότερα

Uniform Convergence of Fourier Series Michael Taylor

Uniform Convergence of Fourier Series Michael Taylor Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula

Διαβάστε περισσότερα

Section 8.3 Trigonometric Equations

Section 8.3 Trigonometric Equations 99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.

Διαβάστε περισσότερα

Concrete Mathematics Exercises from 30 September 2016

Concrete Mathematics Exercises from 30 September 2016 Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)

Διαβάστε περισσότερα

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β

3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β 3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle

Διαβάστε περισσότερα

Problem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.

Problem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ. Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +

Διαβάστε περισσότερα

Approximation of distance between locations on earth given by latitude and longitude

Approximation of distance between locations on earth given by latitude and longitude Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth

Διαβάστε περισσότερα

C.S. 430 Assignment 6, Sample Solutions

C.S. 430 Assignment 6, Sample Solutions C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order

Διαβάστε περισσότερα

Matrices and Determinants

Matrices and Determinants Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z

Διαβάστε περισσότερα

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science.

Bayesian statistics. DS GA 1002 Probability and Statistics for Data Science. Bayesian statistics DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Frequentist vs Bayesian statistics In frequentist

Διαβάστε περισσότερα

Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013

Jesse Maassen and Mark Lundstrom Purdue University November 25, 2013 Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering

Διαβάστε περισσότερα

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018

SCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018 Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Chapter 6: Systems of Linear Differential. be continuous functions on the interval Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations

Διαβάστε περισσότερα

Second Order Partial Differential Equations

Second Order Partial Differential Equations Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y

Διαβάστε περισσότερα

Exercises to Statistics of Material Fatigue No. 5

Exercises to Statistics of Material Fatigue No. 5 Prof. Dr. Christine Müller Dipl.-Math. Christoph Kustosz Eercises to Statistics of Material Fatigue No. 5 E. 9 (5 a Show, that a Fisher information matri for a two dimensional parameter θ (θ,θ 2 R 2, can

Διαβάστε περισσότερα

Introduction to the ML Estimation of ARMA processes

Introduction to the ML Estimation of ARMA processes Introduction to the ML Estimation of ARMA processes Eduardo Rossi University of Pavia October 2013 Rossi ARMA Estimation Financial Econometrics - 2013 1 / 1 We consider the AR(p) model: Y t = c + φ 1 Y

Διαβάστε περισσότερα

Solutions to Exercise Sheet 5

Solutions to Exercise Sheet 5 Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

Areas and Lengths in Polar Coordinates Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the

Διαβάστε περισσότερα

Μηχανική Μάθηση Hypothesis Testing

Μηχανική Μάθηση Hypothesis Testing ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider

Διαβάστε περισσότερα

Congruence Classes of Invertible Matrices of Order 3 over F 2

Congruence Classes of Invertible Matrices of Order 3 over F 2 International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and

Διαβάστε περισσότερα

Section 7.6 Double and Half Angle Formulas

Section 7.6 Double and Half Angle Formulas 09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)

Διαβάστε περισσότερα

Srednicki Chapter 55

Srednicki Chapter 55 Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third

Διαβάστε περισσότερα

DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C

DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C DERIVATION OF MILES EQUATION FOR AN APPLIED FORCE Revision C By Tom Irvine Email: tomirvine@aol.com August 6, 8 Introduction The obective is to derive a Miles equation which gives the overall response

Διαβάστε περισσότερα

Areas and Lengths in Polar Coordinates

Areas and Lengths in Polar Coordinates Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the

Διαβάστε περισσότερα

5.4 The Poisson Distribution.

5.4 The Poisson Distribution. The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable

Διαβάστε περισσότερα

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +

k A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R + Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b

Διαβάστε περισσότερα

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3

Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all

Διαβάστε περισσότερα

Reminders: linear functions

Reminders: linear functions Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U

Διαβάστε περισσότερα

10.7 Performance of Second-Order System (Unit Step Response)

10.7 Performance of Second-Order System (Unit Step Response) Lecture Notes on Control Systems/D. Ghose/0 57 0.7 Performance of Second-Order System (Unit Step Response) Consider the second order system a ÿ + a ẏ + a 0 y = b 0 r So, Y (s) R(s) = b 0 a s + a s + a

Διαβάστε περισσότερα

Solution Series 9. i=1 x i and i=1 x i.

Solution Series 9. i=1 x i and i=1 x i. Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x

Διαβάστε περισσότερα

New bounds for spherical two-distance sets and equiangular lines

New bounds for spherical two-distance sets and equiangular lines New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a

Διαβάστε περισσότερα

Probability and Random Processes (Part II)

Probability and Random Processes (Part II) Probability and Random Processes (Part II) 1. If the variance σ x of d(n) = x(n) x(n 1) is one-tenth the variance σ x of a stationary zero-mean discrete-time signal x(n), then the normalized autocorrelation

Διαβάστε περισσότερα

The Simply Typed Lambda Calculus

The Simply Typed Lambda Calculus Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and

Διαβάστε περισσότερα

6.1. Dirac Equation. Hamiltonian. Dirac Eq.

6.1. Dirac Equation. Hamiltonian. Dirac Eq. 6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2

Διαβάστε περισσότερα

Homework 8 Model Solution Section

Homework 8 Model Solution Section MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx

Διαβάστε περισσότερα

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max

Διαβάστε περισσότερα

Lecture 12: Pseudo likelihood approach

Lecture 12: Pseudo likelihood approach Lecture 12: Pseudo likelihood approach Pseudo MLE Let X 1,...,X n be a random sample from a pdf in a family indexed by two parameters θ and π with likelihood l(θ,π). The method of pseudo MLE may be viewed

Διαβάστε περισσότερα

Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1

Main source: Discrete-time systems and computer control by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a

Διαβάστε περισσότερα

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)

2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p) Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok

Διαβάστε περισσότερα

Fractional Colorings and Zykov Products of graphs

Fractional Colorings and Zykov Products of graphs Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is

Διαβάστε περισσότερα

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1

Practice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1 Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the

Διαβάστε περισσότερα

Second Order RLC Filters

Second Order RLC Filters ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor

Διαβάστε περισσότερα

PARTIAL NOTES for 6.1 Trigonometric Identities

PARTIAL NOTES for 6.1 Trigonometric Identities PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot

Διαβάστε περισσότερα

D Alembert s Solution to the Wave Equation

D Alembert s Solution to the Wave Equation D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique

Διαβάστε περισσότερα

Quadratic Expressions

Quadratic Expressions Quadratic Expressions. The standard form of a quadratic equation is ax + bx + c = 0 where a, b, c R and a 0. The roots of ax + bx + c = 0 are b ± b a 4ac. 3. For the equation ax +bx+c = 0, sum of the roots

Διαβάστε περισσότερα

Theorem 8 Let φ be the most powerful size α test of H

Theorem 8 Let φ be the most powerful size α test of H Testing composite hypotheses Θ = Θ 0 Θ c 0 H 0 : θ Θ 0 H 1 : θ Θ c 0 Definition 16 A test φ is a uniformly most powerful (UMP) level α test for H 0 vs. H 1 if φ has level α and for any other level α test

Διαβάστε περισσότερα

Potential Dividers. 46 minutes. 46 marks. Page 1 of 11

Potential Dividers. 46 minutes. 46 marks. Page 1 of 11 Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and

Διαβάστε περισσότερα

Lecture 2. Soundness and completeness of propositional logic

Lecture 2. Soundness and completeness of propositional logic Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness

Διαβάστε περισσότερα

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω

ω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω 0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +

Διαβάστε περισσότερα

CRASH COURSE IN PRECALCULUS

CRASH COURSE IN PRECALCULUS CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter

Διαβάστε περισσότερα

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------

Inverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- ----------------- Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin

Διαβάστε περισσότερα

Math 6 SL Probability Distributions Practice Test Mark Scheme

Math 6 SL Probability Distributions Practice Test Mark Scheme Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry

Διαβάστε περισσότερα

Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices

Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Optimal Parameter in Hermitian and Skew-Hermitian Splitting Method for Certain Two-by-Two Block Matrices Chi-Kwong Li Department of Mathematics The College of William and Mary Williamsburg, Virginia 23187-8795

Διαβάστε περισσότερα

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER

ORDINAL ARITHMETIC JULIAN J. SCHLÖDER ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.

Διαβάστε περισσότερα

The challenges of non-stable predicates

The challenges of non-stable predicates The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates

Διαβάστε περισσότερα

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?

ANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =? Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least

Διαβάστε περισσότερα

6. MAXIMUM LIKELIHOOD ESTIMATION

6. MAXIMUM LIKELIHOOD ESTIMATION 6 MAXIMUM LIKELIHOOD ESIMAION [1] Maximum Likelihood Estimator (1) Cases in which θ (unknown parameter) is scalar Notational Clarification: From now on, we denote the true value of θ as θ o hen, view θ

Διαβάστε περισσότερα

= λ 1 1 e. = λ 1 =12. has the properties e 1. e 3,V(Y

= λ 1 1 e. = λ 1 =12. has the properties e 1. e 3,V(Y Stat 50 Homework Solutions Spring 005. (a λ λ λ 44 (b trace( λ + λ + λ 0 (c V (e x e e λ e e λ e (λ e by definition, the eigenvector e has the properties e λ e and e e. (d λ e e + λ e e + λ e e 8 6 4 4

Διαβάστε περισσότερα

ECE Spring Prof. David R. Jackson ECE Dept. Notes 2

ECE Spring Prof. David R. Jackson ECE Dept. Notes 2 ECE 634 Spring 6 Prof. David R. Jackson ECE Dept. Notes Fields in a Source-Free Region Example: Radiation from an aperture y PEC E t x Aperture Assume the following choice of vector potentials: A F = =

Διαβάστε περισσότερα

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions

Coefficient Inequalities for a New Subclass of K-uniformly Convex Functions International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for

Διαβάστε περισσότερα

SOME PROPERTIES OF FUZZY REAL NUMBERS

SOME PROPERTIES OF FUZZY REAL NUMBERS Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical

Διαβάστε περισσότερα

w o = R 1 p. (1) R = p =. = 1

w o = R 1 p. (1) R = p =. = 1 Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:

Διαβάστε περισσότερα

A Note on Intuitionistic Fuzzy. Equivalence Relation

A Note on Intuitionistic Fuzzy. Equivalence Relation International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com

Διαβάστε περισσότερα

Instruction Execution Times

Instruction Execution Times 1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables

Διαβάστε περισσότερα

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in

Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that

Διαβάστε περισσότερα

ENGR 691/692 Section 66 (Fall 06): Machine Learning Assigned: August 30 Homework 1: Bayesian Decision Theory (solutions) Due: September 13

ENGR 691/692 Section 66 (Fall 06): Machine Learning Assigned: August 30 Homework 1: Bayesian Decision Theory (solutions) Due: September 13 ENGR 69/69 Section 66 (Fall 06): Machine Learning Assigned: August 30 Homework : Bayesian Decision Theory (solutions) Due: Septemer 3 Prolem : ( pts) Let the conditional densities for a two-category one-dimensional

Διαβάστε περισσότερα

Chapter 6: Systems of Linear Differential. be continuous functions on the interval

Chapter 6: Systems of Linear Differential. be continuous functions on the interval Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations

Διαβάστε περισσότερα

Bounding Nonsplitting Enumeration Degrees

Bounding Nonsplitting Enumeration Degrees Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,

Διαβάστε περισσότερα

Pg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is

Pg The perimeter is P = 3x The area of a triangle is. where b is the base, h is the height. In our case b = x, then the area is Pg. 9. The perimeter is P = The area of a triangle is A = bh where b is the base, h is the height 0 h= btan 60 = b = b In our case b =, then the area is A = = 0. By Pythagorean theorem a + a = d a a =

Διαβάστε περισσότερα

Finite difference method for 2-D heat equation

Finite difference method for 2-D heat equation Finite difference method for 2-D heat equation Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen

Διαβάστε περισσότερα

Section 9.2 Polar Equations and Graphs

Section 9.2 Polar Equations and Graphs 180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify

Διαβάστε περισσότερα

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM

SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max

Διαβάστε περισσότερα

DiracDelta. Notations. Primary definition. Specific values. General characteristics. Traditional name. Traditional notation

DiracDelta. Notations. Primary definition. Specific values. General characteristics. Traditional name. Traditional notation DiracDelta Notations Traditional name Dirac delta function Traditional notation x Mathematica StandardForm notation DiracDeltax Primary definition 4.03.02.000.0 x Π lim ε ; x ε0 x 2 2 ε Specific values

Διαβάστε περισσότερα

Numerical Analysis FMN011

Numerical Analysis FMN011 Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =

Διαβάστε περισσότερα