THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS
|
|
- Jade Harmon
- 6 years ago
- Views:
Transcription
1 THE EFFICIENCIES OF THE SPATIAL MEDIAN AND SPATIAL SIGN COVARIANCE MATRIX FOR ELLIPTICALLY SYMMETRIC DISTRIBUTIONS BY ANDREW F. MAGYAR A issertation submitte to the Grauate School New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the egree of Doctor of Philosophy Grauate Program in Statistics Written uner the irection of Davi E. Tyler an approve by New Brunswick, New Jersey May, 01
2 ABSTRACT OF THE DISSERTATION The Efficiencies of the Spatial Meian an Spatial Sign Covariance Matrix for Elliptically Symmetric Distributions by Anrew F. Magyar Dissertation Director: Davi E. Tyler The spatial meian an spatial sign covariance matrix SSCM are popularly use robust alternatives for estimating the location vector an scatter matrix when outliers are present or it is believe the ata arises from some istribution that is not multivariate normal. When the unerlying istribution is an elliptical istribution, it has been observe that these estimators perform better uner certain scatter structures. This issertation is a etaile stuy of the efficiencies of the spatial meian an the SSCM uner the elliptical moel, in particular the epenence of their efficiencies on the population scatter matrix. For the spatial meian, it is shown this estimator is asymptotically most efficient compare to the MLE for the location vector when the population scatter matrix is proportional to the ientity matrix. Furthermore, it is possible to construct an affinely equivariant version of the spatial meian that is asymptotically more efficient than the spatial meian. Asymptotic relative efficiencies of these two estimators are calculate to emonstrate how inefficient the spatial meian can be as the unerlying scatter structure becomes more elliptical. A simulation experiment is carrie out to provie evience of analogous result for finite samples. When the goal is estimating ii
3 eigenprojection matrices, it is proven that uner the elliptical moel the eigenprojection estimates obtaine from the Tyler matrix are asymptotically more efficient than those corresponing to the SSCM. Calculations of asymptotic relative efficiencies are presente to emonstrate the loss of efficiency in using eigenprojection estimates of the SSCM as oppose to the Tyler matrix, particularly when the scatter structure of the ata is far from spherical. To assess the performance of these estimators in the finite sample setting, the notion of principal angles is use to efine a means to compare eigenprojection estimators. Using this concept, simulations are implemente that support finite sample results similar to those for the asymptotic case. The implications of the above results are iscusse, particularly in the application of principal component analysis. Future research irections are then propose. iii
4 Acknowlegements First an foremost, I woul like to acknowlege my octoral avisor, Dr. Davi E. Tyler, for mentoring me throughout my grauate stuies. Not only has he introuce me to the fiel of robust statistics but also provie me with a topic that I have enjoye researching these last few years. This issertation coul not have been complete without his guiance. Seconly, I woul like to acknowlege the entire Statistics Department at Rutgers University for giving me the chance to pursue grauate stuies an embarking me on an interesting an rewaring career. My time here has enable me to evelop my love of mathematics an apply it to a fiel that I have grown to love equally. It was a privilege to stuy uner such an outstaning faculty, each of whom has helpe me in some capacity whether it be acaemically, intellectually or professionally. I woul also like to acknowlege Dr. Daniel Ocone from the Department of Mathematics as well as Dr. Richar McLean from the Department of Economics, both of whom I was fortunate to have ha the opportunity to learn uner their tutelage. Aitionally, I woul like to acknowlege my high-school mathematics teacher, Micheal O Boyle, who sparke the fire of curiosity for mathematics an the esire to pursue it further. Lastly, I woul like to thank all my family an friens, both those from before grauate school an those I met uring my time at Rutgers. I am truly blesse to have such a collection of people in my life. You have all provie me with a neee escape from work an a means to simply enjoy life in your company. iv
5 Deication This issertation is eicate to the two people whose love an support has helpe me evelop into the person I am toay, my parents. To my mother, Dorothea, from whom I inherite the abilities necessary to pursue a career in the fiel of statistics an see this eneavor through. To my father, Ruolph, who always encourage me to o what mae me happy. While wors alone cannot escribe all that you have one for me, I have only these two to express my appreciation, Thank You. -Any v
6 Table of Contents Abstract ii Acknowlegements iv Deication v List of Figures ix 1. Preliminary Material Introuction Spherically an Elliptically Symmetric Distributions Multivariate Estimation an Equivariance The Goal of this Dissertation The Spatial Meian Introuction The Spatial Meian Theoretical Results Efficiency an Relative Efficiency of Location Estimators The Asymptotic Efficiency of the Spatial Meian The Oracle Spatial Meian an Affine Spatial Meian Asymptotic Efficiency Calculations Finite Sample Performance Finite Sample Theory Results Bivariate Distributions Trivariate Distributions vi
7 10 Dimensional Distributions Appenix The Influence Function an Asymptotic Variance-Covariance Matrix of M-estimators of Location The Asymptotic Variance-Covariance of the Spatial Meian The Asymptotic Variance-Covariance of the Oracle Spatial Meian Proof of Theorem Simulation Results The Spatial Sign Covariance Matrix Introuction Tyler s Scatter Matrix Spatial Sign Covariance Matrix Theoretical Results Optimality of the Tyler Matrix uner the Elliptical Moel Asymptotic Calculations Finite Sample Performance Finite Sample Theory Results Appenix Asymptotic Distribution of Eigenprojections an Eigenvectors of a Scatter Estimate Tyler s Scatter Matrix The Spatial Sign Covariance Matrix Asymptotic Calculations Conclusion Implications Future Work References vii
8 Vita viii
9 List of Figures.1. Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R 3 : Λ 0 = iag 1, 1, r Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R 3 : Λ 0 = iag 1, r, r Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R Finite Sample Efficiencies of Affine Spatial Meians to the Oracle Spatial Meian for the Bivariate Spherical Normal Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Bivariate Normal Finite Sample Efficiencies of Affine Spatial Meians to the Oracle Spatial Meian for the Bivariate Spherical t Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Bivariate t Finite Sample Efficiencies of the Affine Spatial Meian using Dümbgen s matrix to the Oracle Spatial Meian for the Bivariate Spherical Cauchy an Slash Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Bivariate Cauchy Finite Sample Efficiencies of Affine Spatial Meians to the Oracle Spatial Meian for the Trivariate Spherical Normal an Cauchy ix
10 .1. Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Trivariate Normal an Cauchy - I Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Trivariate Normal an Cauchy - II Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Trivariate Normal an Cauchy - III Finite Sample Efficiencies of Affine Spatial Meians to the Oracle Spatial Meian for the Spherical Normal an Cauchy in R Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Normal an Cauchy in R 10 - I Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Normal an Cauchy in R 10 - II Finite Sample Efficiencies of the Spatial Meian to the Oracle Spatial Meian for the Normal an Cauchy in R 10 - III Asymptotic Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R Asymptotic Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R Asymptotic Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R Finite Sample Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R Finite Sample Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R x
11 3.6. Finite Sample Relative Efficiencies of the Eigenprojection Estimate of the SSCM to the Corresponing Eigenprojection Estimate of the Tyler Matrix in R xi
12 1 Chapter 1 Preliminary Material 1.1 Introuction Many proceures in multivariate statistics make the assumption that the ata arises as realizations from some multivariate normal istribution. A multivariate normal istribution is entirely specifie by two parameters, its population mean vector an population covariance matrix, commonly symbolize by the Greek letters µ an Σ respectively. Most multivariate methos involve inference on one or both of these parameters with either one or both being assume unknown. Thus it is often necessary to obtain estimates of these parameters from the observe ata. The most popularly use estimators of µ an Σ are the sample mean vector an sample covariance matrix. Unfortunately, when the ata eviates from the assumption of multivariate normality the reliability of these estimators, an any metho that relies on them, is compromise. For instance, the presence of outliers in the ata coul have a significant impact on these estimates; extreme observations ten to pull the sample mean vector away from µ an towars themselves. Their effect on the sample covariance matrix is ouble in that they effect the sample mean vector use in calculating the sample covariance matrix as well as possibly biasing the estimate variation in their particular irection thus not giving an accurate estimate of Σ. One attempt to aress these short-comings is to implement methos from nonparametric statistics. Non-parametric proceures make minimal or no assumptions about the unerlying istribution from which the ata arises. Consequently, their performance oes not epen on the unerlying istribution hence will still prouces reliable results. However, when the ata oes inee come from a multivariate normal istribution, proceures involving estimation of µ an or Σ with the sample mean an
13 sample covariance matrix often rastically out-perform any non-parametric proceure. Recall that in this situation, the sample mean vector an sample covariance matrix are functions of the complete, sufficient statistics thus contain the most information about the parameters µ an Σ. For this reason, alternative approaches have been taken to evelop reliable proceures without sacrificing performance; robust statistics is one such instance. As oppose to assuming the ata is from one particular istribution or iscaring istributional assumptions altogether, robust statistics consiers methos evelope for a family of istributions. Because of this, these methos will prouce reliable results an perform well for all istributions within the class they were evelope for. In robust multivariate statistics, consierable attention is given to the stuy of proceures uner the assumption the ata comes from some elliptically symmetric istribution or elliptical istribution. This family of istributions is one generalization of the multivariate normal istribution. The characterization of an elliptical istribution involves specifying parameters that act as generalizations of µ an Σ; these are the location vector an scatter matrix respectively an are represente with the same symbols. Similar to before, one or both of these parameters is assume unknown an must be estimate from the ata. Several estimators of location an scatter have been propose to estimate the location vector an scatter matrix. Perhaps the most natural are the maximum likelihoo estimators MLE s for µ an Σ assuming the ata comes from a particular elliptical istribution. As a extension of these estimators, Maronna [3] evelope M-estimators of location an scatter. Inepenently, Huber [14] evelope an even broaer class of estimators using arguments base on the concept of affine equivariance. 1. Spherically an Elliptically Symmetric Distributions Elliptically symmetric istributions have playe a central role in the evelopment of robust multivariate statistics by serving as alternatives to the multivariate normal istribution with which to stuy the robustness properties of multivariate methos. Elliptical istributions arise by taking affine transformations of spherically symmetric
14 3 istributions. A multivariate ranom vector, z R, is sai to be spherically symmetric or spherical about the origin, 0, if z Qz for any orthogonal matrix Q. The istribution of a spherically symmetric ranom variable will be enote by G. If the measure inuce by G is absolutely continuous with respect to Lebesgue measure in R, then there exists a probability ensity function for the ranom vector z of the form C g, g z = C g, g z t z where g is a fixe Lebesgue integrable function in R an C g, is a constant epening on both g an that ensures that the expression is inee a ensity i.e. integrates to 1 in R ; that is C g, = g z t z z R In this form, the motivation of the name spherically symmetric is obvious in that the contours of equal ensity are concentric hyper-spheres in R. The vector 0 serves not only as the point of symmetry for the concentric hyper-spheres, but is also the mean vector if the istribution has finite first moments. If in aition the istribution has finite secon moments, the covariance matrix of the istribution is proportional to the ientity matrix I. If the ranom vector z R is spherically symmetric, then for any nonsingular matrix, M, an vector µ R, the vector x = Mz + µ is sai to be elliptically istribute in -imensions with parameters µ an Σ = MM t. When a ranom vector x R has an elliptical istribution it will be notate x E µ, Σ; G; this istribution will be referre to as F. If the measure inuce by F is absolutely continuous with respect to Lebesgue measure in R, then x has a ensity, enote f, that is given by 1 f x; µ, Σ, g = C g, et Σ 1/ g x µ Σ 1 = C g, et Σ 1/ g x µ t Σ 1 x µ
15 4 where x A = x t Ax. Analogously, the name elliptically symmetric originates from the fact the contours of equal ensity are concentric hyper-ellipsois in R, namely the hyper-ellipsoi given by the equation x µ t Σ 1 x µ = c. Similarly, the parameter µ is the location vector an correspons to the center of symmetry of the hyper-ellipsois an also the mean vector when the istribution has finite first moments. The parameter Σ is referre to as the scatter matrix since it etermines the sprea an orientation of the concentric hyper-ellipsois. In general, the istribution nee not have finite secon moments, but in cases where it oes Σ is also referre to as the pseuocovariance matrix since the covariance matrix of the istribution is then proportional to Σ. Note, in general the scatter matrix is not well-efine within the class of elliptical istributions. For a given elliptical istribution, the function g s can be replace with the function g c s = c g cs. It is possible to impose restrictions on the function g s to eliminate any ambiguities such as take the constant c such that g c s has covariance matrix given by I, however, will not be necessary for aims of this issertation. Necessarily, a scatter matrix is symmetric an positive efinite. Recall from linear algebra that any symmetric, positive efinite matrix has a spectral ecomposition unique up to multiplication of the eigenvectors by ±1. For the matrix Σ, let λ 1 λ λ enote its eigenvalues an p 1,..., p enote an orthonormal set of eigenvectors with p i belonging to the eigenspace corresponing to λ i. Let the eigenprojection associate with the eigenvalue λ i be enote P i. Recall this is an projection matrix in to the eigenspace corresponing to the eigenvalue λ i, enote P i. For repeate eigenvalues i.e. an eigenvalue with algebraic multiplicity greater than 1, then the imension of the corresponing eigenspace the geometric multiplicity coul also be greater than 1. Suppose λ j = λ j+1 = = λ j+k 1 = λ. In this is instance the notation P λ an P λ will be use to enote the corresponing eigenprojection an eigenspace associate with the eigenvalue λ. Any pair of orthonormal vectors that span P λ coul be taken for p j,..., p j+k 1. If a given eigenvalue, say λ ι, has geometric multiplicity 1, then the eigenvector p ι is uniquely efine up to multiplication by ±1. Defining the matrices P = [p 1,..., p ] an Λ = iag λ 1,..., λ, then one can write Σ = PΛP t. Using the spectral ecomposition, it is possible to efine the unique, symmetric, positive efinite
16 5 square root of Σ to be Σ 1/ = PΛ 1/ P t, where Λ 1/ = iag λ 1,..., λ. There is a useful representation for any spherical istribution that will be utilize on several occasions in the proceeing chapters. Every spherical istribution in R has a stochastic representation of the form z R G u with R G an u inepenent. R G is a nonnegative ranom variable referre to as the raial component of z an u is a ranom vector that is uniformly istribute on S, the unit hyper-sphere in R. This implies that if x E µ, Σ; G, then it has stochastic representation x R G Mu + µ, where M is any matrix such that MM t = Σ. One such choice is M = Σ 1/. If x 1,..., x n is an i.i.. sample from some elliptical istribution E µ, Σ; G, this will be referre to as the elliptical moel. 1.3 Multivariate Estimation an Equivariance Intimately connecte with elliptical istributions is the concept of affine equivariance. The location vector an scatter matrix for elliptical istributions are affinely equivariant; that is if x E µ, Σ; G, then the ranom vector x = Ax + b will also be elliptically istribute with x E µ, Σ ; G where µ = Aµ + b an Σ = AΣA t for any non-singular, matrix A an b R. Because of this property, when it is assume that ata arises from an elliptical istribution, it is natural to consier estimators of µ an Σ that possess the property of affine equivariance. That is, if x 1,..., x n yiels estimates of the location vector an scatter matrix µ n an Σ n respectively, then the estimators obtaine for the transforme ata x i = Ax i + b, i = 1,..., n, will be µ n = A µ n + b an Σ n = A Σ n A t. M-estimators are examples of affinely equivariant estimators of location an scatter. However, in [3] the author showe the breakown points of affinely equivariant M-estimators is at most 1/ + 1. Consequently, much work has been on the evelopment of high breakown affinely equivariant estimates such as the minimum volume ellipsoi estimate MVE an minimum covariance eterminant estimate MCD [31], S-estimates [9] & [18], projection base estimates [10], [5] & [37], CM-estimates [16], MM-estimates [3] & [37], τ-estimates [19], an one-step versions of these estimates [0]. Unfortunately, high breakown affinely equivariant estimators ten to
17 6 be computationally intensive, especially for large an n; current algorithms are only approximate an probabilistic in nature. Another pitfall of affinely equivariant estimators is that when n <, any affinely equivariant estimate of location an scatter reuce to the sample mean vector an sample covariance matrix respectively, the latter being singular in this situation [38]. Consequently, these short-comings have le to the evelopment of methos that iscar the property of affine equivariance. To the goal of the previous paragraph, one such approach has been to evelop estimators that are only orthogonally equivariant. Estimators of the location vector an scatter matrix are sai to be orthogonally equivariant if the ata x 1,..., x n yiel estimates µ n an Σ n respectively, then the estimates obtaine for the transforme ata x i = Qx i + b, i = 1,..., n will be µ n = Q µ n + b an Σ n = Q Σ n Q t for any, orthogonal matrix Q an b R. Orthogonal transformations are special cases of affine transformations, thus an analogous result hols for the parameters µ an Σ uner the class of elliptical istributions. When consiering the class of elliptical istributions, a benefit of using affinely equivariant estimators of location an scatter is that the form of the influence function can be erive by just consiering the spherical case. Furthermore, the efficiencies of such estimators oes not epen on either µ or Σ. These properties o not carry over to estimators that lack the property of affine equivariance. On the contrary, uner elliptical moels it has been observe that non-affinely equivariant estimators perform better uner certain scatter structure than for others. Unfortunately, this fact is usually ignore when eciing which estimator to use. Using these estimators is rather Procrustean in that they are favoring certain scatter structures over others; to a egree this is letting the metho etermine the moel. 1.4 The Goal of this Dissertation As mentione in section 1.4, the performance of non-affinely equivariant estimators uner the elliptical moel is epenent on Σ. One popular metho for evaluating the performance of as estimator is to stuy the variability with which the estimator measure
18 7 the parameter of interest. While the nature of the parameter ictates the criterion of interest, it usually involves the variances or variance-covariance matrix of the estimators being stuie. Naturally, the evaluation of the performance necessitates some sort of benchmark or alternative metho that achieves the same goal, thus usually estimators are stuie in reference to competing estimators. The evaluation of estimators via the prior paraigm is the basis of a notion calle efficiency. This issertation will stuy the efficiencies of two popularly use orthogonally equivariant estimators uner elliptical moels an their epenencies on Σ. The two consiere are the estimators of location an scatter, the spatial meian an the spatial sign covariance matrix SSCM respectively. These will be aresse in separate parts; the spatial meian being iscusse in Chapter II whereas the SSCM in Chapter III. The concept of efficiency for location an scatter estimates will be efine more explicitly in the subsequent sections. The efficiencies will be consiere in both the asymptotic an finite sample cases. For both estimators, uner elliptical moels it will be shown that these estimators are asymptotically most efficient when the unerlying scatter structure of the ata is spherically symmetric. Simulation results will be presente in the finite sample case to support an analogous hypothesis. Technical etails of proofs omitte from the boy of the issertation will be presente in two separate appenices at the ens of chapters an 3. The first part of chapter 4 will iscuss the implications of the above finings in robust Principal Component Analysis PCA, a commonly use imension reuction technique with broa applications [7], [8], [1], [17] & []. The issertation will conclue with a iscussion of future research irections.
19 8 Chapter The Spatial Meian.1 Introuction For estimating the location parameter of multivariate ata, the spatial meian is a commonly use robust alternative to the sample mean vector when it is believe that the ata being analyze either contains outlying observations or comes from a istribution that is not multivariate normal. Since the estimation of the spatial meian oes not require an estimate of the scatter matrix in its calculation, the spatial meian has the ae benefit that it exists even when the sample size is less than imension thus making it a popular estimator of the location parameter for sparse ata. However, unlike the sample mean vector, the spatial meian is not affinely equivariant but only equivariant uner translations, rescaling an orthogonal transformations. Because of this property, the spatial meian is commonly use in orthogonally equivariant multivariate methos that require estimation of a location parameter as an intermeiary such as principle component analysis PCA. The reason the spatial meian lacks the property of affine equivariance is that in its calculation it own-weighs observations in terms of their Eucliean istances as oppose to their Mahalanobis istance from the estimate center of the ata. Thus in the the setting where the ata is assume to arise from some elliptical istribution, one might conjecture that the spatial meian is less efficient in situations where the istribution is not spherical. This chapter is broken own into the following sections. In section, the spatial meian is iscusse an it is shown that the estimating equation for it is simply the MLE for µ when the istribution for the elliptical moel is a spherical Laplace Double Exponential istribution. In section 3, the main theoretical results are presente. The first subsection iscusses the concept of relative efficiency an efficiency of a vector
20 9 estimator, both for finite samples an asymptotically. It is then shown that for the class of elliptically symmetric istributions, the spatial meian is asymptotically most efficient when Σ I, that is the istribution is in fact spherically symmetric. In aition, it is possible for one to construct an affinely equivariant version of the spatial meian that has the same asymptotic istribution as the spatial meian at spherical symmetry but is asymptotically more efficient than the spatial meian for all nonspherical elliptical istributions. Lastly, some calculations are presente to emonstrate the severity of the asymptotic inefficiencies. Section 4 carries out a simulation stuy of the efficiencies of the spatial meian for finite samples. The first subsection contains theoretical results neee to carry out the simulations an escribes how they were implemente. The secon subsection contains the results an iscussion.. The Spatial Meian Given a multivariate ata set, x 1,..., x n, in R, the spatial meian is the vector µ SM that satisfies the following objective function n µ SM = argmin η R x i η..1 Recall in the univariate case, = 1, above reuces to an expression whose solution is given by the sample meian of the ataset. Consequently, the spatial meian can be thought of as one possible generalization of the meian to the multivariate case. i=1 Perhaps the earliest reference of the spatial meian was in [4]. In the literature, the spatial meian is also referre to as the meian centre or L 1 meian since the minimization of the objective function involves minimizing the sum of the L 1 norms to the observations [13]. Brown [5] stuie the asymptotic efficiency of the spatial meian for the bivariate normal istribution as well as for stanar multivariate normal istributions in imensions greater than. The objective function in..1 has no explicit solution, however, it was shown to be uniquely efine when > [15] & [7]. The spatial meian is a special case of a monotonic M-estimate of multivariate location an thus can be compute via a simple re-iterate least squares IRLS algorithm [43].
21 10 In [39], the authors propose a useful moification to improve the prior algorithm. A summary of the spatial meian can be foun in [8]. As mentione in the introuction, the spatial meian is not affinely equivariant, but only equivariant uner orthogonal transformations, rescaling as well as translations. That is, for any b R, c R an orthogonal matrix Q, if the ata is transforme as x i = cqx i + b for i = 1,..., n, then the spatial meian transforms as µ SM = cq µ SM + b. Referring back to the theory of maximum likelihoo estimation, the sample meian is the MLE of the location parameter when the ata comes from a Laplace istribution. Analogously, the spatial meian arises as the MLE when the ata comes from an elliptical Laplace istribution with Σ I. Recall the ensity function of the multivariate Laplace istribution with location vector µ an scatter matrix Σ is given by f x; µ, Σ, g L = π/ Γ Γ / et Σ 1/ exp x µ t Σ 1 x µ Given n observations, the likelihoo function is then given by L µ, Σ; X, g L = = et Σ 1/ exp x i µ t Σ 1 x i µ n π / Γ Γ / i=1 n π / Γ et Σ 1/ exp Γ / n i=1 x i µ t Σ 1 x i µ If Σ were known a priori, then maximizing the above likelihoo entails maximizing the argument in the exponential, which is the same as minimizing the sum. Hence the the MLE for µ is n µ Σ = argmin η R x i η Σ 1 If Σ = σ I, then the estimating equation for µ σ I woul yiel the same solution as equation..1, that is µ σ I = µ SM. This characterization will be utilize in establishing the theoretical results to follow. i=1
22 11.3 Theoretical Results.3.1 Efficiency an Relative Efficiency of Location Estimators When sampling from elliptical istributions, it was conjecture in the introuction that the spatial meian is asymptotically most efficient when Σ is proportional to the ientity matrix. The spatial meian is intene to give an estimate of the location vector, thus before proving the aforementione result it is necessary to iscuss the notions of efficiency an relative efficiency for vector estimators both in the finite sample case an asymptotically. Let θ n an θ n be two ifferent unbiase estimators of the vector parameter θ base ] ] on samples of size n. Let = V ar [ θn = V ar [ θn, assuming θ V θn n an an V θn θ n have finite secon moments. In this situation, comparing the estimators θ n an θ n reuces to a comparison of how they estimate linear combinations of the parameter being estimate, that is a t θ for some a R. The natural estimators for a t θ are a t θn ] ] an a t θn with variances given by V ar [a t θn = a t a an V ar [a V θn t θn = a t a V θn respectively. Since a t θ is a univariate parameter, convention is to focus on the ratio of variances, a t V θn a/a t V θn a. Comparison of θ n to θ n involves locating the vector a such that ratio a t V θn a/a t V θn a is maximal or minimal. Results from linear algebra gives that the value of the ratio at its minimum/maximum is the same as the smallest/largest eigenvalue of the matrix V 1 θ n V θn with the vector a giving the minimum/maximum being the corresponing eigenvector of the aforementione matrix. Comparing efficiencies in the asymptotic sense is analogous to the finite sample case. For the asymptotic case, assume θ n an θ n are n consistent, that is n θn θ D Norm 0, AV θ, n θn θ D Norm 0, AV θ where AV θ an AV θ are the asymptotic variance-covariance matrix of the estimators θ n an θ n respectively. For any a R, it follows that n a t θn a t θ D Norm 0, a t AV θa, n a t θn a t θ D Norm 0, a t AV θa
23 1 Again the focus will be on the ratio a t AV θa/a t AV θa for a R. This value of this ratio at its minimum/maximum equals the smallest/largest eigenvalue of the matrix AV 1 θ AV θ with the vector a being the corresponing eigenvectors of the aforementione matrix. Provie the istribution is such that the asymptotic version of the multivariate information inequality hols, the MLE of θ is the best one can o, hence one is often intereste in the asymptotic efficiency of an estimator relative to the MLE. The asymptotic variance-covariance matrix of the MLE of θ is given by the inverse of the Fisher information matrix, enote I θ. Thus one has AV θ I 1 θ where refers to the usual partial orering of symmetric matrices. Recall for two symmetric matrices, A an B, > is a partial orering of these matrices such that A B A > B if an only if A B is positive semi-efinite efinite. The asymptotic efficiency of an estimator is efine to be a AE θ t I 1 θ a = max a R As mentione above, the value of AE θ a t AV θa is given by the largest eigenvalue of the matrix AV 1 θ I 1 θ with a being the corresponing eigenvector..3. The Asymptotic Efficiency of the Spatial Meian Let x E µ, Σ; G be a ranom vector that is absolutely continuous with respect to Lebesgue measure. The Fisher information matrix for µ for a fixe Σ an G is given by I µ; Σ, G = 1 α G Σ 1 where α G = E [ u R G] 1 is a scalar that epens only on G with u s = sg s /g s [30]. Let µ be any estimator of µ. By the asymptotic version of the information inequality one has that AV µ I 1 µ; Σ, G = α G Σ. It is shown in section.5. of the appenix that the asymptotic variance-covariance matrix of the spatial meian uner the elliptical moel is given below as
24 13 AV SM Σ, G = β G PV Λ P t where β G = 1/E [1/R G ] an V Λ = iag ν 1 Λ,..., ν Λ with νi Λ = [ E [ E λ i u,i Λ 1/ u 3 λ i u,i Λ 1/ u ] 1 Λ 1/ u I ] an u,i representing the i th component of the ranom unit vector u. For the family of elliptical istributions E µ, Σ; G with fixe G further suppose that the following conitions are also satisfie Conitions i E [1/R G ] > 0 an ii g is boune. The following theorem formally states that for any family of elliptical istributions with fixe G that satisfies the conition given above, the asymptotic efficiency of the spatial meian is uniquely maximize at a spherically symmetric member of this family, Theorem Let x 1,..., x n represent an i.i.. sample from E µ, Σ; G that satisfies conitions Then with equality holing if an only if Σ I. AE µ SM ; σ I, G AE µ SM ; Σ, G Proof. See section.5.4 of the appenix..3.3 The Oracle Spatial Meian an Affine Spatial Meian As mentione in the introuction to this chapter, the calculation of the spatial meian involves own-weighing observations in terms of their Eucliean istances as oppose to their Mahalanobis istance from the estimate center of the ata. Consequently, uner the elliptical moel one might surmise that an estimator that oes the latter
25 14 woul work better in the case when Σ I. The following estimator oes just the above. Consier the situation that Σ is known an not proportional to I, efine, n µ OSM = µ Σ = argmin η R x i η Σ 1 Note that this is the MLE for µ when sampling from an elliptical Laplace istribution when Σ is known; this follows from the likelihoo function compute in section. Denote this estimator as the oracle spatial meian since it requires knowing the scatter i=1 matrix of the ata a priori. It is shown in section.5.3 of the appenix that the asymptotic variance-covariance matrix of the oracle spatial meian is given by AV µosm Σ, G = 1 β G Σ As allue to, one might suspect that for elliptical istributions, this estimator for µ is more efficient than the spatial meian. This is state in the following theorem, Theorem Let x 1,..., x n represent an i.i.. sample from E µ, Σ; G that satisfies conitions Then AV µosm Σ, G < AV µsm Σ, G unless Σ I in which case equality hols. Proof. From the theory of maximum likelihoo estimation, for the case when the particular istribution is the elliptical Laplace istribution, i.e. G = G L, then AV µosm Σ, G L < AV µsm Σ, G L unless µ OSM an µ SM are asymptotically equivalent. However in the proof of Theorem 3.3.1, when Σ I then AV µsm Σ, G Σ whereas AV µosm Σ, G L is. Thus µ ASM an µ SM have ifferent asymptotic variancecovariance matrices in this instance, thus strict inequality hols when Σ I. It follows that AV µosm Σ, G L = 1 β G L Σ < β G L PV Λ P t = AV µsm Σ, G L Canceling β G L from both sies gives then multiplying by β G gives
26 15 AV µosm Σ, G = 1 β G Σ < β G PV Λ Pt = AV µsm Σ, G the esire result. When Σ I, then µ OSM = µ SM, thus the two estimators will have the same asymptotic variance-covariance matrix, hence equality hols. QED In practice Σ is not known, however, can be estimate from the ata. Let Σ n be an affinely equivariant estimate of Σ base on a sample of size n. Replacing Σ with Σ n in the efinition of the oracle spatial meian yiels an affinely equivariant estimate of the location parameter, that is µ ASM = µ Σn = argmin η R n i=1 x i η Σ 1 n Refer to this estimator as an affinely equivariant spatial meian base on the scatter estimate Σ n, or simply an affine spatial meian. If the elliptical istribution uner consieration is such that Σ n = Σ + O P n 1/.3.1 then it follows by theorem 3 of [9] that n µ Σn µ OSM P 0, thus n µ Σn µ D Norm 0, AV µ Σ Σ, G where AV µ Σ Σ, G = AV µosm Σ, G. This leas to the following corollary to Theorem Corollary Let x 1,..., x n be a ranom sample from E µ, Σ; G such that conitions 3..1 are satisfie. For any affinely equivariant estimate of scatter Σ n, such that Σ n = Σ + O P n 1/, it follows AV µ Σ G < AV µsm G, Σ unless Σ I in which case equality hols.
27 16 This corollary states that the spatial meian is asymptotically inamissible over the class of elliptical istributions. Note however for a particular estimator of scatter, this result hols true only when the conitions in equation.3.1 are met. For instance, if Σ n is the sample covariance matrix, then this result hols only if the elliptical istribution has finite fourth moments. However, for a broa class of M-estimates of multivariate scatter efine in [3], the conition in equation.3.1 hols without any further assumptions on G..3.4 Asymptotic Efficiency Calculations In the previous section, it was mentione that the oracle spatial meian an affine spatial meian are asymptotically equivalent provie that Σ n = Σ + O P n 1/. Furthermore, uner the elliptical moel it was shown that both of these were asymptotically more efficient at estimating the µ than the spatial meian. To unerstan more precisely how inefficient the spatial meian can be compare to either of the aforementione estimators uner the elliptical moel, the asymptotic relative efficiency of the spatial meian relative to the oracle spatial meian will be compute uner various imensions an scatter structures. As will be seen, the values of the asymptotic efficiencies will not epen on the particular elliptical istribution. The results in section 3. an 3.3 give, AV µosm Σ, G = 1 β G Σ an AV µ SM Σ, G = β G PV Λ P t with V Λ = iag ν1 Λ,..., ν Λ where [ ] λ E i u,i νi Λ 1/ u Λ = [ ] E λ i u,i 1 I Λ 1/ u 3 Λ 1/ u Since AV µsm Σ, G has the same eigenvectors as Σ, the asymptotic relative efficiency of µ SM to µ OSM reuces to a comparison of the eigenvalues of AV µosm Σ, G an AV µsm Σ, G corresponing to the same eigenvectors. Thus without loss of generality one can reuce consieration to the simple case where P = I. As a consequence of this
28 17 simplification there is a convenient interpretation of the aforementione comparison of eigenvalues. For uncorrelate scatter structure, the eigenvalues of the asymptotic variance-covariance matrix correspon to the variances of the estimate components. Thus a comparison of the eigenvalues reuces to a comparison of the variability with which each estimator estimates the components of µ, i.e. the asymptotic relative efficiency for the components of the spatial meian to the oracle spatial meian. The asymptotic relative efficiency of each component can be compute an is equal to [ AV µλ Λ, G ] i ARE i µ SM, µ OSM ; Λ, G = [ AV µsm Λ, G] i Note that for the expression νi Λ, one has = 1 λ i ν i Λ ν i c Λ = = = = [ ] c E λ i u,i cλ 1/ u [ ] E c λ i u,i 1 I cλ 1/ u 3 cλ 1/ u [ ] c E λ i u,i c Λ 1/ u [ ] E c λ i u,i 1 I c 3 Λ 1/ u 3 c Λ 1/ u [ ] λ E i u,i Λ 1/ u [ ] E λ i u,i 1 I c Λ 1/ u 3 c Λ 1/ u [ ] λ E i u,i Λ 1/ u [ ] 1 E c λ i u,i 1 I Λ 1/ u 3 Λ 1/ u = c ν i Λ thus ARE i c Λ = 1 c λ i c ν i Λ = 1 λ i ν i Λ = ARE i Λ this implies the size parameter oes not matter in the calculation of the asymptotic relative efficiency. Define r i = λ i λ 1, that is r i is the ratio of the scale of the largest
29 18 ARE of Component ARE of Component r_ r_ Figure.1: Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R component to the scale of the i th component. Consequently, when consiering the asymptotic efficiency of each component one can take the case when the scale of the largest component is fixe; for simplicity assume it is equal to 1. Consier the situation Σ = Λ 0 = iagλ,..., λ, r λ,......, r λ where 0 r }{{}}{{} Using the results in section.5.4 of the appenix, it follows from Lemma 5..3 that the efficiency of the any of the first 1 components is given by ARE 1 r = F1 1, 1 ; + ; 1 r F 1 1, 1 ; + ; 1 r The efficiency of the last 1 components is given by ARE 1 r = F1 1, 1 ; + ; 1 r F 1 1, 1 ; + ; 1 r where F 1 a, b; c; k = B 1 b, c b 1 0 xb 1 1 x c b 1 1 kx a x is the Gauss hypergeometric function. efficiencies of each component as a function of r. Starting with two imensions, plotte in Figure.1 are the For the component associate with the higher scale, the spatial meian oes not o
30 19 ARE of Components 1& ARE of Component r_ r_3 Figure.: Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R 3 : Λ 0 = iag 1, 1, r much worse than the oracle spatial meian in estimating this component, even in the most extreme cases when Λ is nearly singular. However, for the component associate with the smaller scale, the asymptotic relative efficiency of the spatial meian to the oracle spatial meian is quite low when r is small inicating the rastic inferiority of the precision with which the spatial meian estimates this component compare to the oracle spatial meian. For three imensions, perhaps the most interesting scatter structures are those in which two of the λ s are equal, that is λ 1 = λ or λ = λ 3. The first case correspons to r = 1, the efficiency for each of the components as a function of r is given in Figure., For the secon case, r = r 3 = r. Presente in Figure.3 are the asymptotic efficiencies of the components as a function of r. In both cases note that the efficiency for the larger components of the spatial meian relative to the oracle spatial meian is still relatively high even for nearly singular scatter structures. However for the smaller components as the scatter structure gets more singular, the relative efficiencies iminish rastically. Of the two situations, the scenario with which λ = λ 3 is the most eleterious on the relative efficiencies of the
31 0 ARE of Component ARE of Components & r r Figure.3: Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R 3 : Λ 0 = iag 1, r, r components. As the imension increases, the number of possible scatter structures to consier greatly increases. The last imension examine will be = 10 uner the following scatter structures, Λ 1 = iag1, r, r, r, r, r, r, r, r, r Λ = iag1, 1, r, r, r, r, r, r, r, r Λ 3 = iag1, 1, 1, 1, 1, r, r, r, r, r Λ 4 = iag1, 1, 1, 1, 1, 1, 1, 1, r, r Λ 5 = iag1, 1, 1, 1, 1, 1, 1, 1, 1, r In an 3 imensions, it was always that case the components associate with the larger scale ha higher efficiencies. However, this is not true in general. In fact it is not only the scale that affects the efficiency of a given component, but also the number of components that have scales of similar magnitues. Presente in Figure.4 are the efficiencies of the components for scatter structures given above.
32 1 ARE of Component LAMBDA_1 ARE of Components ARE of Components 1& LAMBDA_ ARE of Components ARE of Components LAMBDA_3 ARE of Components ARE of Components LAMBDA_4 ARE of Components 9& ARE of Components LAMBDA_5 ARE of Component LAMBDA_1 LAMBDA_ LAMBDA_3 LAMBDA_4 LAMBDA_5 Figure.4: Asymptotic Relative Efficiencies of the Spatial Meian to the Oracle Spatial Meian in R 10 As the number of components with larger scales increases, the efficiencies of all the components, not just the ones with the larger scales, improves. This was also the case in three imensions. Also of note, for scatter structures Λ 1 an Λ, there are values of r in which the efficiencies are slightly higher for the components with the smaller scales, whereas for the rest of the scatter structures Λ the efficiencies are always higher for the components with the larger scales..4 Finite Sample Performance.4.1 Finite Sample Theory For elliptical istributions it was proven that asymptotically, one can always fin a more efficient estimator than the spatial meian by using an affinely equivariant version of it. In section 3.5, exactly how asymptotically inefficient the spatial meian is compare to the oracle spatial meian or affine spatial meian was consiere uner various imensions an scatter structures. However, for finite samples, working out the exact istribution of the aforementione estimators is intractable, thus one must resort to simulations in orer to ascertain the efficiencies. For finite samples, there are two factors that must be consiere when comparing the efficiency of the spatial meian to an affinely equivariant version. The first is how the efficiency is affecte by the fact
33 one is estimating Σ with an affinely equivariant estimator of it. Asymptotically, this was shown not to matter provie the estimator of scatter converges in probability to Σ, however, for finite samples how one estimates Σ will be of consequence. The secon consieration is how much efficiency is lost by sacrificing affine equivariance for only orthogonal equivariance an oes this epen on the particular affine equivariant estimator of Σ. It will be shown that these two factors can be consiere separately. To this en the following theorem is neee. The proof is relegate to section.5.5. of the appenix. Theorem Let x 1,..., x n represent an i.i.. sample from E µ, Σ; G. Let λ 1 > λ > > λ m be the istinct eigenvalues of Σ where m is the number of mutually orthogonal eigenspaces of Σ. For any orthogonally equivariant estimator of µ base on a sample of size n, µ n, with variance-covariance matrix V n µ = V ar [ µ n ], the following are true, 1 V n µ an Σ have the same eigenspaces; consequently they have the same eigenprojections an/or eigenvectors. Let λ 1,n λ,n λ,n, enote the eigenvalues of V n µ. It follows the eigenspace associate with λ i,n is the same that is associate with λ i. Consequently, λ i,n = λ j,n if an only if λ i = λ j. Proof. See section.5.5 of the appenix. The above theorem, couple with affine equivariance arguments, implies that when sampling from an elliptical istribution, the variance-covariance matrix of the oracle spatial meian, affine spatial meian an spatial meian have the following forms, provie they exist,
34 3 V n µ Σ = α n G Σ, V n µ Σ = β Σn G Σ, V n µ SM = PV n Λ; G P t with α n G being a positive scalar that epens only on n an G whereas β Σn G epens on n, G an the choice of scatter estimator, Σ n. The matrix V n Λ; G is a iagonal an epens on n, G an Λ, that is V n Λ; G = iag ν 1,n Λ; G,..., ν,n Λ; G. As a consequence of the fact that the variance-covariance matrix of the oracle an affine spatial meian are both proportional to Σ, the finite sample relative efficiency of µ Σn to µ Σ reuces to a scalar quantity, namely RE n µ Σ, µ Σ = αn G /β Σn G. Furthermore, since the variance-covariance matrix of the spatial meian has the same eigenvectors as Σ, the finite sample relative efficiency of µ SM to either µ Σ to µ Σ reuces to a comparison of eigenvalues of variance-covariance matrices corresponing to the same eigenvectors. Thus without loss of generality one can reuce consieration to the simple case where P = I. This simplification yiels the same convenient interpretation as it i for comparing the asymptotic efficiencies in the previous section, namely the comparison of the eigenvalues reuces to a comparison of the variability with which each estimator estimates the components of µ, i.e. the finite sample relative efficiency for the components of the spatial meian to an affine spatial meian. This can be expresse as, RE i,n µ SM, µ Σn = β Σn G λ j ν j,n Λ; G = α n G λ i ν i,n Λ; G β Σn G α n G = RE i,n µ SM, µ Σ RE n µ Σ, µ Σ for i = 1,...,. Note that RE i,n µ SM, µ Σ only epens on n, Σ an G, but not the choice of estimator use for Σ. For a fixe n an G, this reflects how the relative efficiency of the j th components is effecte by the fact Σ is not proportional to the ientity matrix. The term RE n µ Σ, µ Σ epens only on n, Σn an G, thus can be viewe as a measure of how the relative efficiency of the components is affecte by the choice of the scatter estimate, Σ n. For the simulations, four elliptical istributions will be consiere: the normal, Cauchy, t 3 an slash istributions; the reaer is referre to [41]. The imensions being
Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More information19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control
19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationSeparation of Variables
Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical
More informationA Modification of the Jarque-Bera Test. for Normality
Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam
More informationTable of Common Derivatives By David Abraham
Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec
More informationNOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,
NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which
More informationLogarithmic spurious regressions
Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate
More informationEIGEN-ANALYSIS OF KERNEL OPERATORS FOR NONLINEAR DIMENSION REDUCTION AND DISCRIMINATION
EIGEN-ANALYSIS OF KERNEL OPERATORS FOR NONLINEAR DIMENSION REDUCTION AND DISCRIMINATION DISSERTATION Presente in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Grauate
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationMulti-View Clustering via Canonical Correlation Analysis
Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in
More informationSelf-normalized Martingale Tail Inequality
Online-to-Confience-Set Conversions an Application to Sparse Stochastic Banits A Self-normalize Martingale Tail Inequality The self-normalize martingale tail inequality that we present here is the scalar-value
More informationProblem Sheet 2: Eigenvalues and eigenvectors and their use in solving linear ODEs
Problem Sheet 2: Eigenvalues an eigenvectors an their use in solving linear ODEs If you fin any typos/errors in this problem sheet please email jk28@icacuk The material in this problem sheet is not examinable
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More informationChapter 6: Energy-Momentum Tensors
49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.
More informationRobustness and Perturbations of Minimal Bases
Robustness an Perturbations of Minimal Bases Paul Van Dooren an Froilán M Dopico December 9, 2016 Abstract Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationEuler equations for multiple integrals
Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationLECTURE NOTES ON DVORETZKY S THEOREM
LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationTutorial on Maximum Likelyhood Estimation: Parametric Density Estimation
Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationOn conditional moments of high-dimensional random vectors given lower-dimensional projections
Submitte to the Bernoulli arxiv:1405.2183v2 [math.st] 6 Sep 2016 On conitional moments of high-imensional ranom vectors given lower-imensional projections LUKAS STEINBERGER an HANNES LEEB Department of
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationMath Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors
Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+
More informationMulti-View Clustering via Canonical Correlation Analysis
Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationMath 1B, lecture 8: Integration by parts
Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores
More informationInfluence of weight initialization on multilayer perceptron performance
Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationA Note on Exact Solutions to Linear Differential Equations by the Matrix Exponential
Avances in Applie Mathematics an Mechanics Av. Appl. Math. Mech. Vol. 1 No. 4 pp. 573-580 DOI: 10.4208/aamm.09-m0946 August 2009 A Note on Exact Solutions to Linear Differential Equations by the Matrix
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More information6 General properties of an autonomous system of two first order ODE
6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x
More informationANALYSIS OF A GENERAL FAMILY OF REGULARIZED NAVIER-STOKES AND MHD MODELS
ANALYSIS OF A GENERAL FAMILY OF REGULARIZED NAVIER-STOKES AND MHD MODELS MICHAEL HOLST, EVELYN LUNASIN, AND GANTUMUR TSOGTGEREL ABSTRACT. We consier a general family of regularize Navier-Stokes an Magnetohyroynamics
More informationChaos, Solitons and Fractals Nonlinear Science, and Nonequilibrium and Complex Phenomena
Chaos, Solitons an Fractals (7 64 73 Contents lists available at ScienceDirect Chaos, Solitons an Fractals onlinear Science, an onequilibrium an Complex Phenomena journal homepage: www.elsevier.com/locate/chaos
More informationMulti-View Clustering via Canonical Correlation Analysis
Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu
More informationarxiv: v1 [hep-lat] 19 Nov 2013
HU-EP-13/69 SFB/CPP-13-98 DESY 13-225 Applicability of Quasi-Monte Carlo for lattice systems arxiv:1311.4726v1 [hep-lat] 19 ov 2013, a,b Tobias Hartung, c Karl Jansen, b Hernan Leovey, Anreas Griewank
More informationSlide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13)
Slie10 Haykin Chapter 14: Neuroynamics (3r E. Chapter 13) CPSC 636-600 Instructor: Yoonsuck Choe Spring 2012 Neural Networks with Temporal Behavior Inclusion of feeback gives temporal characteristics to
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationTHE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE
Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationLecture 2: Correlated Topic Model
Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationMonotonicity of facet numbers of random convex hulls
Monotonicity of facet numbers of ranom convex hulls Gilles Bonnet, Julian Grote, Daniel Temesvari, Christoph Thäle, Nicola Turchi an Florian Wespi arxiv:173.31v1 [math.mg] 7 Mar 17 Abstract Let X 1,...,
More informationStable and compact finite difference schemes
Center for Turbulence Research Annual Research Briefs 2006 2 Stable an compact finite ifference schemes By K. Mattsson, M. Svär AND M. Shoeybi. Motivation an objectives Compact secon erivatives have long
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationarxiv: v1 [math.mg] 10 Apr 2018
ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic
More informationInverse Theory Course: LTU Kiruna. Day 1
Inverse Theory Course: LTU Kiruna. Day Hugh Pumphrey March 6, 0 Preamble These are the notes for the course Inverse Theory to be taught at LuleåTekniska Universitet, Kiruna in February 00. They are not
More informationA LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM
Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationSINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
Communications on Stochastic Analysis Vol. 2, No. 2 (28) 289-36 Serials Publications www.serialspublications.com SINGULAR PERTURBATION AND STATIONARY SOLUTIONS OF PARABOLIC EQUATIONS IN GAUSS-SOBOLEV SPACES
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationRobust Low Rank Kernel Embeddings of Multivariate Distributions
Robust Low Rank Kernel Embeings of Multivariate Distributions Le Song, Bo Dai College of Computing, Georgia Institute of Technology lsong@cc.gatech.eu, boai@gatech.eu Abstract Kernel embeing of istributions
More informationOptimized Schwarz Methods with the Yin-Yang Grid for Shallow Water Equations
Optimize Schwarz Methos with the Yin-Yang Gri for Shallow Water Equations Abessama Qaouri Recherche en prévision numérique, Atmospheric Science an Technology Directorate, Environment Canaa, Dorval, Québec,
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationTransmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency
Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More informationAn Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More information1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.
Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency
More informationCapacity Analysis of MIMO Systems with Unknown Channel State Information
Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationMODELLING DEPENDENCE IN INSURANCE CLAIMS PROCESSES WITH LÉVY COPULAS ABSTRACT KEYWORDS
MODELLING DEPENDENCE IN INSURANCE CLAIMS PROCESSES WITH LÉVY COPULAS BY BENJAMIN AVANZI, LUKE C. CASSAR AND BERNARD WONG ABSTRACT In this paper we investigate the potential of Lévy copulas as a tool for
More informationResearch Article When Inflation Causes No Increase in Claim Amounts
Probability an Statistics Volume 2009, Article ID 943926, 10 pages oi:10.1155/2009/943926 Research Article When Inflation Causes No Increase in Claim Amounts Vytaras Brazauskas, 1 Bruce L. Jones, 2 an
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationG4003 Advanced Mechanics 1. We already saw that if q is a cyclic variable, the associated conjugate momentum is conserved, L = const.
G4003 Avance Mechanics 1 The Noether theorem We alreay saw that if q is a cyclic variable, the associate conjugate momentum is conserve, q = 0 p q = const. (1) This is the simplest incarnation of Noether
More informationCharacterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Characterizing Real-Value Multivariate Complex Polynomials an Their Symmetric Tensor Representations Bo JIANG Zhening LI Shuzhong ZHANG December 31, 2014 Abstract In this paper we stuy multivariate polynomial
More informationInternational Journal of Pure and Applied Mathematics Volume 35 No , ON PYTHAGOREAN QUADRUPLES Edray Goins 1, Alain Togbé 2
International Journal of Pure an Applie Mathematics Volume 35 No. 3 007, 365-374 ON PYTHAGOREAN QUADRUPLES Eray Goins 1, Alain Togbé 1 Department of Mathematics Purue University 150 North University Street,
More informationarxiv:hep-th/ v1 3 Feb 1993
NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,
More informationCOUPLING REQUIREMENTS FOR WELL POSED AND STABLE MULTI-PHYSICS PROBLEMS
VI International Conference on Computational Methos for Couple Problems in Science an Engineering COUPLED PROBLEMS 15 B. Schrefler, E. Oñate an M. Paparakakis(Es) COUPLING REQUIREMENTS FOR WELL POSED AND
More informationNew Statistical Test for Quality Control in High Dimension Data Set
International Journal of Applie Engineering Research ISSN 973-456 Volume, Number 6 (7) pp. 64-649 New Statistical Test for Quality Control in High Dimension Data Set Shamshuritawati Sharif, Suzilah Ismail
More informationON THE OPTIMALITY SYSTEM FOR A 1 D EULER FLOW PROBLEM
ON THE OPTIMALITY SYSTEM FOR A D EULER FLOW PROBLEM Eugene M. Cliff Matthias Heinkenschloss y Ajit R. Shenoy z Interisciplinary Center for Applie Mathematics Virginia Tech Blacksburg, Virginia 46 Abstract
More informationSome vector algebra and the generalized chain rule Ross Bannister Data Assimilation Research Centre, University of Reading, UK Last updated 10/06/10
Some vector algebra an the generalize chain rule Ross Bannister Data Assimilation Research Centre University of Reaing UK Last upate 10/06/10 1. Introuction an notation As we shall see in these notes the
More informationMany problems in physics, engineering, and chemistry fall in a general class of equations of the form. d dx. d dx
Math 53 Notes on turm-liouville equations Many problems in physics, engineering, an chemistry fall in a general class of equations of the form w(x)p(x) u ] + (q(x) λ) u = w(x) on an interval a, b], plus
More informationLecture 1b. Differential operators and orthogonal coordinates. Partial derivatives. Divergence and divergence theorem. Gradient. A y. + A y y dy. 1b.
b. Partial erivatives Lecture b Differential operators an orthogonal coorinates Recall from our calculus courses that the erivative of a function can be efine as f ()=lim 0 or using the central ifference
More informationInterconnected Systems of Fliess Operators
Interconnecte Systems of Fliess Operators W. Steven Gray Yaqin Li Department of Electrical an Computer Engineering Ol Dominion University Norfolk, Virginia 23529 USA Abstract Given two analytic nonlinear
More informationThe Principle of Least Action
Chapter 7. The Principle of Least Action 7.1 Force Methos vs. Energy Methos We have so far stuie two istinct ways of analyzing physics problems: force methos, basically consisting of the application of
More informationFlexible High-Dimensional Classification Machines and Their Asymptotic Properties
Journal of Machine Learning Research 16 (2015) 1547-1572 Submitte 1/14; Revise 9/14; Publishe 8/15 Flexible High-Dimensional Classification Machines an Their Asymptotic Properties Xingye Qiao Department
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More information