Derivative based global sensitivity
|
|
- Abigail Townsend
- 6 years ago
- Views:
Transcription
1 Ttle: Dervatve based global senstvty measures Name: Sergeï Kucherenko 1 and Bertrand Iooss 2,3 Affl./Addr. 1: Imperal College London London, SW7 2AZ, UK E-mal: s.kucherenko@mperal.ac.uk Affl./Addr. 2: EDF R&D 6 qua Water, Chatou, France arxv: v3 [math.st] 22 Jul 2015 E-mal: bertrand.ooss@edf.fr Affl./Addr. 3: Insttut de Mathématques de Toulouse Unversté Paul Sabater 118 route de Narbonne, Toulouse, France Dervatve based global senstvty measures Abstract The method of dervatve based global senstvty measures (DGSM) has recently become popular among practtoners. It has a strong lnk wth the Morrs screenng method and Sobol senstvty ndces and has several advantages over them. DGSM are very easy to mplement and evaluate numercally. The computatonal tme requred for numercal evaluaton of DGSM s generally much lower than that for estmaton of Sobol senstvty ndces. Ths paper presents a survey of recent advances n DGSM concernng lower and upper bounds on the values of Sobol total senstvty ndces S tot. Usng these bounds t s possble n most cases to get a good practcal estmaton of the values of S tot. Several examples are used to llustrate an applcaton of DGSM.
2 Keywords: Senstvty analyss, Sobol ndces, Morrs method, Model dervatves, DGSM, Poncaré nequalty 2 Introducton Global senstvty analyss (SA) offers a comprehensve approach to the model analyss. Unlke local SA, global SA methods evaluate the effect of a factor whle all other factors are vared as well and thus they account for nteractons between varables and do not depend on the choce of a nomnal pont. Revews of dfferent global SA methods can be found n Saltell et al [30] and Sobol and Kucherenko [37]. The method of global senstvty ndces suggested by Sobol [33, 34], and then further developed by Homma and Saltell [11] s one of the most effcent and popular global SA technques. It belongs to the class of varance-based methods. These methods provde nformaton on the mportance of dfferent subsets of nput varables to the output varance. There are two types of Sobol senstvty ndces: the man effect ndces, whch estmate the ndvdual contrbuton of each nput parameter to the output varance, and the total senstvty ndces, whch measure the total contrbuton of a sngle nput factor or a group of nputs. The total senstvty ndces are used to dentfy non-mportant varables whch can then be fxed at ther nomnal values to reduce model complexty. Ths approach s known as factors fxng settng [30]. For hgh-dmensonal models the drect applcaton of varance-based global SA measures can be extremely tmeconsumng and mpractcal. A number of alternatve SA technques have been proposed. One of them s the screenng method by Morrs [21]. It can be regarded as global as the fnal measure s obtaned by averagng local measures (the elementary effects). Ths method s consderably cheaper than the varance based methods n terms of computatonal tme. The Morrs method can be used for dentfyng unmportant varables. However, the Morrs
3 3 method has two man drawbacks. Frstly, t uses random samplng of ponts from the fxed grd (levels) for averagng elementary effects whch are calculated as fnte dfferences wth the ncrement delta comparable wth the range of uncertanty. For ths reason t can not correctly account for the effects wth characterstc dmensons much less than delta. Secondly, t lacks the ablty of the Sobol method to provde nformaton about man effects (contrbuton of ndvdual varables to uncertanty) and t can t dstngush between low and hgh order nteractons. Ths paper presents a survey of dervatve based global senstvty measures (DGSM) and ther lnk wth Sobol senstvty ndces. DGSM are based on averagng local dervatves usng Monte Carlo or Quas Monte Carlo samplng methods. Ths technque s much more accurate than the Morrs method as the elementary effects are evaluated as strct local dervatves wth small ncrements compared to the varable uncertanty ranges. Local dervatves are evaluated at randomly or quas randomly selected ponts n the whole range of uncertanty and not at the ponts from a fxed grd. The so-called alternatve global senstvty estmator defned as a normalzed ntegral of partal dervatves was frstly ntroduced by Sobol and Gershman [36]. Kucherenko et al [17] ntroduced some other DGSM and coned the acronym DGSM. They showed that DGSM can be seen as the generalzaton of the Morrs method [21]. Kucherenko et al [17] also establshed emprcally the lnk between DGSM and Sobol senstvty ndces. They showed that the computatonal cost of numercal evaluaton of DGSM can be much lower than that for estmaton of Sobol senstvty ndces. Sobol and Kucherenko [38] proved theoretcally that, n the cases of unformly and normally dstrbuted nput varables, there s a lnk between DGSM and the Sobol total senstvty ndex S tot for the same nput. They showed that DGSM can be used as an upper bound on total senstvty ndex S tot. Small values of DGSM mply small
4 S tot, and hence unessental factors x. However, rankng nfluental factors usng DGSM can be smlar to that based on S tot only for the case of lnear and quas-lnear models. For hghly non-lnear models two rankngs can be very dfferent. They also ntroduced modfed DGSM whch can be used for both a sngle nput and groups of nputs [39]. From DGSM, Kucherenko and Song [16] have also derved lower bounds on total senstvty ndex. Lambon et al [19] extended results of Sobol and Kucherenko for models wth nput varables belongng to the general class of contnuous probablty dstrbutons. In the same framework, Roustant et al [28] have defned crossed-dgsm, based on second-order dervatves of model output, n order to bound the total Sobol ndces of an nteracton between two nputs. All these DGSM measures can be appled for problems wth a hgh number of nput varables to reduce the computatonal tme. Indeed, the numercal effcency of the DGSM method can be mproved by usng the automatc dfferentaton algorthm for calculaton DGSM as was shown n Kparssdes et al [15]. However, the number of requred functon evaluatons stll remans to be proportonal to the number of nputs. Ths dependence can be greatly reduced usng an approach based on algorthmc dfferentaton n the adjont or reverse mode [9] ( Varatonal Methods). It allows estmatng all dervatves at a cost at most 4-6 tmes of that for evaluatng the orgnal functon [13]. Ths paper s organsed as follows: the Morrs method and DGSM are frstly descrbed n the followng secton. Sobol global senstvty ndces and useful relatonshps are then ntroduced. Therefore, DGSM-based lower and uppers bounds on total Sobol senstvty ndces for unformly and normally dstrbuted random varables are presented, followed by DGSM for groups of varables and ther lnk wth total Sobol senstvty ndces. Another secton presents the upper bounds results n the general case of varables wth contnuous probablty dstrbutons. Then, computatonal costs 4
5 5 are consdered, followed by some test cases whch llustrate an applcaton of DGSM and ther lnks wth total Sobol senstvty ndces. Fnally, conclusons are presented n the last secton. From Morrs method to DGSM Bascs of the Morrs method The Morrs method s tradtonally used as a screenng method for problems wth a hgh number of varables for whch functon evaluatons can be CPU-tme consumng (see Desgn of Experments for Screenng). It s composed of ndvdually randomzed one-factor-at-a-tme (OAT) experments. Each nput factor may assume a dscrete number of values, called levels, whch are chosen wthn the factor range of varaton. The senstvty measures proposed n the orgnal work of Morrs [21] are based on what s called an elementary effect. It s defned as follows. The range of each nput varable s dvded nto p levels. Then the elementary effect (ncremental rato) of the -th nput factor s defned as [ ( G x EE (x ) = 1,..., x 1, x +, x +1,..., xd) G (x ) ], (1) where s a predetermned multple of 1/(p-1) and pont x = (x 1,..., x d ) Hd s such that x + 1. One can see that the elementary effect are fnte dfference approxmatons of the model dervatve wth respect to x and usng a large perturbaton step. The dstrbuton of elementary effects EE s obtaned by randomly samplng R ponts from H d. Two senstvty measures are evaluated for each factor: µ an estmate of the mean of the dstrbuton EE, and σ an estmate of the standard devaton of EE. A hgh value of µ ndcates an nput varable wth an mportant overall nfluence
6 6 on the output. A hgh value of σ ndcates a factor nvolved n nteracton wth other factors or whose effect s nonlnear. The computatonal cost of the Morrs method s N F = R (d+1 ). The revsed verson of the EE (x ) measure and a more effectve samplng strategy, whch allows a better exploraton of the space of the uncertan nput factors was proposed by Campolongo et al [3]. To avod the cancelng effect whch appears n non-monotonc functons Campolongo et al [3] ntroduced another senstvty measure µ based on the absolute value of EE (x ): EE (x ). It was also notced that µ has smlartes wth the total senstvty ndex S tot n that t can gve a rankng of the varables smlar to that based on the S tot but no formal proof of the lnk between µ and S tot was gven [3]. Fnally, other extensons of the ntal Morrs method have been ntroduced for the second-order effects analyss [2] [4] [6], for the estmaton of Morrs measures wth any-type of desgn [26] [32] and for buldng some 3D Morrs graph [26]. The local senstvty measure Consder a dfferentable functon G (x), where x = (x 1,..., x d ) s a vector of nput varables defned n the unt hypercube H d (0 x 1, = 1,..., d). Local senstvty measures are based on partal dervatves E (x ) = G(x ) x. (2) Ths measure E s the lmt verson of the elementary effect EE defned n (2) when tends to zero. It s ts generalzaton n ths sense. In SA, usng the partal dervatve G / x s well known as a local method (see Varatonal Methods). In ths paper, the goal s to take advantage of ths nformaton n global SA. The local senstvty measure E (x ) depends on a nomnal pont x and t changes wth a change of x. Ths defcency can be overcome by averagng E (x ) over
7 the parameter space H d. Ths s done just below, allowng to defne new senstvty measures, called DGSM for Dervatve-based Global Senstvty Measures. 7 DGSM for unformly dstrbuted varables Assume that G/ x L 2. Three dfferent DGSM measures are defned: where m > 0 s a constant, and ν = w (m) = H d ( ) 2 G(x) dx, (3) H d x m x G(x) x dx, (4) ς = 1 ( ) 2 G(x) x (1 x ) dx. (5) 2 H x d DGSM for randomly dstrbuted varables Consder a functon G (X 1,..., X d ), where X 1,..., X d are ndependent random varables, defned n the Eucldan space R d, wth cumulatve densty functons (cdfs) F 1 (x 1 ),..., F d (x d ). The followng DGSM was ntroduced n Sobol and Kucherenko [38]: ( ) [ 2 ( G(x) ) ] 2 G(x) ν = df (x) = E, (6) x x R d wth F the jont cdf. A new measure s also ntroduced: ( ) G(x) G(x) w = df (x) = E. (7) R x d x In (3) and (6), ν s n fact the mean value of ( G/ x ) 2. In the followng and n practce, t wll be the most useful DGSM. Sobol global senstvty ndces Defntons The method of global senstvty ndces developed by Sobol (see Varance-based Senstvty Analyss: Theory and Estmaton Algorthms) s based on ANOVA decom-
8 poston [10]. Consder a square ntegrable functon G(x) defned n the unt hypercube H d. It can be expanded n the followng form 8 G(x) = g 0 + g (x ) + <j g j (x, x j ) g 12...d (x 1, x 2,..., x d ). (8) Ths decomposton s unque f condtons satsfed. Here 1 1 < < s d. 1 0 g 1... s dx k = 0 for 1 k s, are The varances of the terms n the ANOVA decomposton add up to the total varance of the functon d V = where V 1... s = s=1 1 0 d g s (x 1,..., x s )dx 1,..., x s 1 < < s V 1... s, are called partal varances. Sobol defned the global senstvty ndces as the ratos S 1... s = V 1... s /V. All S 1... s are non negatve and add up to one: d S + =1 S j + j S jk... + S 1,2,...,d = 1. j k Sobol also defned senstvty ndces for subsets of varables. Consder two complementary subsets of varables y and z: x = (y, z). Let y = (x 1,..., x m ), 1 1 <... < m d, K = ( 1,..., m ). The varance correspondng to the set y s defned as V y = m V 1... s. s=1 ( 1 < < s) K V y ncludes all partal varances V 1, V 2,..., V 1... s such that ther subsets of ndces ( 1,..., s ) K.
9 The total senstvty ndces were ntroduced by Homma and Saltell [11]. The 9 total varance V tot y s defned as V tot y = V V z. V tot y conssts of all V 1... s such that at least one ndex p K whle the remanng ndces can belong to the complmentary to K set K. The correspondng global senstvty ndces are defned as S y = V y /V, S tot y = Vy tot /V. The mportant ndces n practce are S and S tot, = 1,..., d: S = V /V, S tot = V tot /V. (9) (10) Ther values n most cases provde suffcent nformaton to determne the senstvty of the analyzed functon to ndvdual nput varables. Varance-based methods generally requre a large number of functon evaluatons (see Varance-based Methods: Theory and Algorthms) to acheve reasonable convergence and can become mpractcal for large engneerng problems. Useful relatonshps To present further results on lower and upper bounds of S tot, new notatons and useful relatonshps have to be frstly presented. Denote u (x) the sum of all terms n the ANOVA decomposton (8) that depend on x : u (x) = g (x ) + d j=1,j From the defnton of ANOVA decomposton t follows that g j (x, x j ) + + g 12 d (x 1,, x d ). (11) H d u (x)dx = 0. (12)
10 It s obvous that 10 G x = u x. (13) Denote z = (x 1,..., x 1, x +1,..., x d ) the vector of all varables but x, then x (x, z) and G(x) G(x, z). The ANOVA decomposton of G(x) (8) can be presented n the followng form G(x) = u (x, z) + v(z), where v(z) s the sum of terms ndependent of x. Because of (12) t s easy to show that v(z) = 1 0 G(x)dx. Hence u (x, z) = G(x) 1 0 G(x)dx. (14) Ths equaton can be found n Lambon [18]. The total partal varance V tot can be computed as V tot = u 2 (x)dx = H d u 2 (x, z)dx dz. H d Then the total senstvty ndex S tot (10) s equal to S tot = 1 V H d u 2 (x)dx. (15) A frst drect lnk between total Sobol senstvty ndces and partal dervatves Consder contnuously dfferentable functon G(x) defned n the unt hypercube H d =[0, 1] d. Ths secton presents a theorem that establshes lnks between the ndex S tot and the lmtng values of G/ x. In the case when y = (x ), Sobol -Jansen formula [14][35][31] for D tot can be rewrtten as D tot = 1 2 H d 0 where x o = (x 1,..., x 1, x, x +1,..., x n ). Theorem 1. Assume that c G x 1 [ ( x )] 2 G (x) G dxdx, (16) C, then
11 Proof: Consder the ncrement of G (x) n (16): 11 c 2 12V Stot C2 12V. (17) ( x ) G (x) G = G (ˆx) x (x x ), (18) where ˆx s a pont between x and x. Substtutng (18) nto (16) leads to V tot = 1 2 H d 1 0 ( G (ˆx) x In (19) c 2 ( G/ x ) 2 C 2 whle the remanng ntegral s ) 2 (x x ) 2 dxdx. (19) (x x ) 2 dx dx = 1 6. Thus obtaned nequaltes are equvalent to (17). Consder the functon G = g 0 +c(x 1/2). In ths case C = c, V = 1/12 and S tot = 1 and the nequaltes n (17) become equaltes. DGSM-based bounds for unformly and normally dstrbuted varables In ths secton, several theorems are lsted n order to defne useful lower and upper bounds of the total Sobol ndces. The proofs of these theorems come from prevous works and papers and are not recalled here. Two cases are consdered: varables x followng unform dstrbutons and varables x followng Gaussan dstrbutons. The general case wll be seen n a subsequent secton. Unformly dstrbuted varables Lower bounds on S tot Theorem 2. There exsts the followng lower bound between DGSM (3) and the Sobol total senstvty ndex:
12 12 (H d [G (1, z) G (0, z)] [G (1, z) + G (0, z) 2G (x)] dx ) 2 4ν V < S tot (20) Proof: The proof of ths Theorem s gven n Kucherenko and Song [16] and s based on equaton (15) and a Cauchy-Schwartz nequalty appled on u (x) u (x) dx. H x d The lower bound number number one (LB1) s defned as [G (1, z) G (0, z)] [G (1, z) + G (0, z) 2G (x)] dx (H ) 2 d. 4ν V Theorem 3. There exsts the followng lower bound, denoted γ(m), between DGSM (4) and the Sobol total senstvty ndex: γ(m) = (2m + 1) [ ] 2 (G(1, z) G(x)) dx w (m+1) H d (m + 1) 2 V < S tot. (21) Proof: The proof of ths Theorem n gven n Kucherenko and Song [16] and s based on equaton (15) and a Cauchy-Schwartz nequalty appled on x m u (x)dx. H d In fact, Theorem 3 gves a set of lower bounds dependng on parameter m. The value of m at whch γ(m) attans ts maxmum s of partcular nterest. Further, star ( ) s used to denote such a value m: m = arg max(γ(m)). γ(m ) s called the lower bound number two (LB2): γ(m ) = (2m + 1) [ ] 2 (G(1, z) G(x)) dx w (m +1) H d (m + 1) 2 V (22) The maxmum lower bound LB* s defned as LB* = max(lb1,lb2). (23) Both lower and upper bounds can be estmated by a set of dervatve based measures: Υ = {ν, w (m), ζ }, m > 0. (24)
13 13 Upper bounds on S tot Theorem 4. There exsts the followng upper bound between DGSM (3) and the Sobol total senstvty ndex: S tot ν π 2 V. (25) Proof: The proof of ths Theorem n gven n Sobol and Kucherenko [38]. It s based on nequalty: 1 and relatonshps (13) and (15). 0 u 2 (x) dx 1 π ( ) 2 u dx x Consder the set of values ν 1,..., ν d, 1 d. One can expect that smaller ν correspond to less nfluental varables x. Ths mportance crteron s smlar to the modfed Morrs mportance measure µ, whose lmtng values are µ = H d G(x) x dx. From a practcal pont of vew the crtera µ and ν are equvalent: they are evaluated by the same numercal algorthm and are lnked by relatons ν Cµ and µ ν. The rght term n (25) s further called the upper bound number one (UB1). Theorem 5. There exsts the followng upper bound between DGSM (5) and the Sobol total senstvty ndex: S tot Proof: The followng nequalty [10] s used: ς V. (26) ( 1 u 2 dx 0 ) 2 udx x(1 x)u 2 dx. (27) The nequalty s reduced to an equalty only f u s constant. Assume that u s gven by (11), then 1 0 udx = 0. From (27), equaton (26) s obtaned.
14 Further ς /D s called the upper bound number two (UB2). Note that 1 2 x (1 x ) for 0 x 1 s bounded: x (1 x ) 1/8. Therefore, 0 ς ν /8. 14 Normally dstrbuted varables Lower bound on S tot Theorem 6. If X s normally dstrbuted wth a mean µ and a fnte varance σ 2, there exsts the followng lower bound between DGSM (7) and the Sobol total senstvty ndex: σ 4 (µ 2 + σ2 )V w2 S tot. (28) Proof: Usng the equaton (15) and Cauchy-Schwartz nequalty appled on x u (x)df (x) R d (wth F the jont cdf), Kucherenko and Song [16] gve the proof of ths nequalty when µ = 0 (omttng to menton ths condton). The general proof, obtaned by Pett [25], s gven below. Consder a unvarate functon g(x), wth X a normally dstrbuted varable wth mean µ, fnte varance σ 2 and cdf F. Wth adequate condtons on g, the followng equalty s obtaned by ntegratng by parts: DGSM wrtes E[g (X)] = = 1 [ σ g(x) exp 2π [ g (x)df (x) = 1 σ 2π (x µ)2 2σ 2 ]] σ 2π = 1 xg(x)df (x) µ σ 2 g (x) exp [ g(x) x µ σ 2 g(x)df (x). (x µ)2 2σ 2 exp [ ] dx ] (x µ)2 dx 2σ 2 In ths equaton, replacng g(x) by u (x) wth x normally dstrbuted, the w G(x) u (x) w = df (x) = df (x) = 1 R x d R x d σ 2 R d x u (x)df (x), because R d u (x)df (x) = 0 (due to the ANOVA decomposton condton). Moreover, the Cauchy-Schwartz nequalty appled on R d x u (x)df (x) gves
15 [ ] 2 x u (x)df (x) x 2 df (x) [u (x)] 2 df (x). R d R d R d 15 Combnng the two latter equatons leads to the expresson w 2 1 σ 4 (µ 2 + σ 2 )V S tot, whch s equvalent to Eq. (28). Upper bounds on S tot The followng Theorem 7 s a generalzaton of Theorem 1. Theorem 7. If X has a fnte varance σ 2 and c G x C, then σ 2 c 2 V Stot σ2 C 2 V. (29) The constant factor σ 2 cannot be mproved. Theorem 8. If X s normally dstrbuted wth a fnte varance σ 2, there exsts the followng upper bound between DGSM (6) and the Sobol total senstvty ndex: S tot σ2 V ν. (30) The constant factor σ 2 cannot be reduced. Proof: The proofs of these Theorems are presented n Sobol and Kucherenko [38]. DGSM-based bounds for groups of varables Let x = (x 1,..., x d ) be a pont n the d dmensonal unt hypercube wth Lebesgue measure dx = dx 1 dx d. Consder an arbtrary subset of the varables y = (x 1,..., x s ), s d, and the set of remanng complementary varables z, so that x = (y, z), dx = dy dz. Further all the ntegrals are wrtten wthout ntegraton lmts, by assumng that each ntegraton varable vares ndependently from 0 to 1.
16 16 Consder the followng DGSM τ y : τ y = s ( ) 2 G (x) 1 3x p + 3x 2 p dx. (31) 6 p=1 x p Theorem 9. If G (x) s lnear wth respect to x 1,..., x s, then V tot y = τ y, or n other words S tot y = τ y V. Theorem 10. The followng general nequalty holds: V tot y words S tot y 24 π 2 V τ y. ( 24 / π 2) τ y, or n other Proof: The proofs of these Theorems are gven n Sobol and Kucherenko [39]. The second theorem shows that small values of τ y mply small values of S tot y and ths allows dentfcaton of a set of unessental factors y (usually defned by a condton of the type S tot y < ɛ, where ɛ s small). Importance crteron τ Consder the one dmensonal case when the subset y conssts of only one varable y = (x ), then measure τ y = τ has the form ( ) 2 G (x) 1 3x + 3x 2 τ = dx. (32) x 6 It s easy to show that ν /24 τ ν /6. From UB1 t follows that S tot 24 π 2 V τ. (33) Thus small values of τ mply small values of S tot, that are characterstc for non mportant varables x. At the same tme, the followng corollary s obtaned from Theorem 9: f G (x) depends lnearly on x, then S tot than ν. = τ /V. Thus τ s closer to V tot Note that the constant factor 1/π 2 n (25) s the best possble. But n the general nequalty for τ (33) the best possble constant factor s unknown. There s a general lnk between mportance measures τ, ς and ν :
17 17 τ = ς ν, then ς = 1 6 ν τ. Normally dstrbuted random varables Consder ndependent normal random varables X 1,..., X d wth parameters (µ, σ ) =1...d. Defne τ as [ ( G τ = 1 ) ] 2 (x) 2 E (x x ) 2. x The expectaton over x can be computed analytcally. Then [ ( G τ = 1 ) ] 2 (x) 2 E (x µ ) 2 + σ 2. x 2 Theorem 11. If X 1,..., X d are ndependent normal random varables, then for an arbtrary subset y of these varables, the followng nequalty s obtaned: S tot y 2 V τ y. Proof: The proof s gven n Sobol and Kucherenko [39]. DGSM-based upper bounds n the general case As prevously, consder the functon G (X 1,..., X d ), where X 1,..., X d are ndependent random varables, defned n the Eucldan space R d, wth cdfs F 1 (x 1 ),..., F d (x d ). Assume further that each X admts a probablty densty functon (pdf), denoted by f (x ). In the followng, all the ntegrals are wrtten wthout ntegraton lmts. The developments n ths secton are based on the classcal L 2 -Poncaré nequalty: G(x) 2 df (x) C(F ) G(x) 2 df (x) (34)
18 where F s the jont cdf of (X 1,..., X d ). (34) s vald for all functons G n L 2 (F ) such that G(x)dF (x) = 0 and f L 2 (F ). The constant C(F ) n Eq. (34) s called a Poncaré constant of F. In some cases, t exsts and optmal Poncaré constant C opt (F ) whch s the best possble constant. In measure theory, the Poncaré constants are expressed as a functon of so-called Cheeger constants [1] whch are used for SA n Lambon et al [19] (see Roustant et al [28] for more detals). A connecton between total ndces and DGSM has been establshed by Lambon et al [19] for varables wth contnuous dstrbutons (called Boltzmann probablty measures n ther paper). Theorem 12. Let F and f be respectvely the cdf and the pdf of X, the followng nequalty s obtaned: S tot wth ν the DGSM defned n Eq. (6) and [ C(F ) = 4 18 C(F ) ν, (35) V sup x R ] 2 mn (F (x), 1 F (x)). (36) f (x) Proof: Ths result comes from the drect applcaton of the L 2 -Poncaré nequalty (34) on u (x) (see Eq. (11)). In Lambon et al [19] and Roustant et al [28], the partcular case of log-concave probablty dstrbuton has been developed. It ncludes classcal dstrbutons as for nstance the normal, exponental, Beta, Gamma and Gumbel dstrbutons. In ths case, the constant wrtes C(F ) = 1 f ( m ) 2 (37) wth m the medan of the dstrbuton F. Ths allows to obtan analytcal expressons for C(F ) n several cases [19]. In the case of a log-concave truncated dstrbuton on [a, b], the constant wrtes [28] ( ( )) 2 (F (b) F (a)) 2 F (a) + F (b) /f q (38) 2
19 wth q ( ) the quantle functon of X. Table 1 gves some examples of Poncaré constants for several well-known and often used probablty dstrbutons n practce. 19 Dstrbuton Poncaré constant Optmal constant Unform U[a b] (b a) 2 /π 2 yes Normal N (µ, σ 2 ) σ 2 yes 4 Exponental E(λ), λ > 0 λ 2 yes ( ) 2 2β Gumbel G(µ, β), scale β > 0 no log 2 [ ] 2λ(log 2) (1 k)/k 2 Webull W(k, λ), shape k 1, scale λ > 0 no k Table 1. Poncaré constants for a few probablty dstrbutons. For studyng second-order nteractons, Roustant et al [28] have derved a smlar to (35) nequalty based on the squared crossed dervatves of the functon. Assumng that second-order dervatves of G are n L 2 (F ), t uses the so-called crossed-dgsm ( ) 2 2 G(x) ν j = df (x), (39) x x j ntroduced by Fredman and Popescu [7]. An nequalty lnk s made wth an extenson of the total Sobol senstvty ndces to general sets of varables (called superset mportance or total nteracton ndex) proposed by Lu and Owen [20]. In the case of a par of varables {X, X j }, the superset mportance s defned as V super j = I {,j} V I. (40) The estmaton methods of ths total nteracton ndex have also been studed by Fruth et al [8]. Theorem 13. For all pars {, j} (1 < j d), V j V super j C(F )C(F j )ν j. (41) These nequaltes wth the correspondng Sobol ndces wrte
20 S j 20 S super j C(F )C(F j ) ν j. (42) V Roustant et al [28] have shown on several examples how to apply ths result n order to detect pars of nputs that do not nteract together (see also Muehlenstaedt et al [22] and Fruth et al [8] whch use Sobol ndces). Computatonal costs All DGSM can be computed usng the same set of partal dervatves G(x), = x G(x) 1,..., d. Evaluaton of can be done analytcally for explctly gven easly- x dfferentable functons or numercally: G(x ) x = [ G ( x 1,..., x 1, x + δ, x +1,..., x n) G (x ) ] δ. (43) Ths s called a fnte-dfference scheme (see Varatonal Methods) wth δ whch s a small ncrement. There s a smlarty wth the elementary effect formula (2) of the Morrs method whch s however computed wth large. In the case of straghtforward numercal estmatons of all partal dervatves (43) and computaton of ntegrals usng MC or QMC methods, the number of requred functon evaluatons for a set of all nput varables s equal to N(d + 1), where N s a number of sampled ponts. Computng LB1 also requres values of G (0, z), G (1, z), whle computng LB2 requres only values of G (1, z). In total, numercal computaton of LB* for all nput varables would requre N LB* G = N(d + 1) + 2Nd = N(3d + 1) functon evaluatons. Computaton of all upper bounds requre N UB G = N(d+1) functon evaluatons. Ths s the same number that the number of functon evaluatons requred for computaton of S tot whch s NG S = N(d + 1) [31]. However, the number of sampled ponts N needed to acheve numercal convergence can be dfferent for DGSM and S tot. It s generally lower for the case of
21 21 DGSM. Moreover, the numercal effcency of the DGSM method can be sgnfcantly ncreased by usng algorthmc dfferentaton n the adjont (reverse) mode [9] (see also Varatonal Methods). Ths approach allows estmatng all dervatves at a cost ndependent of d, at most 4-6 tmes of that for evaluatng the orgnal functon G(x) [13]. Test cases In ths secton, three test cases are consdered, n order to llustrate applcaton of DGSM and ther lnks wth S tot. Example 1. Consder a lnear wth respect to x functon: G(x) = a(z)x + b(z). For ths functon S = S tot, V tot = 1 a 2 (z)dz, ν = a 2 (z)dz, LB1 = 12 ) H d 1 H (H d 1 (a 2 (z) 2a 2 2 (z)x d ) dzdx 4V = 0 and γ(m) = (2m + ( 1)m2 a(z)dz ) 2 H d 1. A maxmum value of γ(m) s attaned at m =3.745, whle γ (m ) = ( 2 a H 2 (z)dz 4(m + 2) 2 (m + 1) 2 V d 1 a(z)dz). The V lower and upper bounds are LB* 0.48S tot, UB1 1.22S tot. UB2 = 1 1 a(z) 2 dz = 12V S tot. For ths test functon UB2 < UB1. Example 2. Consder the so-called g-functon whch s often used n global SA for llustraton purposes: G(x) = d v, where v = 4x 2 + a 1 + a, a ( = 1,..., d) are constants. It s easy to see that for ths functon g (x ) = (v 1), u (x) = (v 1) d j=1,j v j and as a result LB1=0. The total d ( varance s V = /3 ). The analytcal values of S (1 + a j ) 2, S tot and LB2 are gven n Table 2. j=1 =1 0
22 22 Table 2. The analytcal expressons for S, S tot and LB2 for g-functon. S 1/3 (1 + a ) 2 V S tot 1/3 (1+a ) 2 d j=1,j V ( ) 1 + 1/3 (1+a j) 2 γ(m) [ (2m + 1) 1 4(1 (1/2)m+1 ) m+2 (1 + a ) 2 (m + 1) 2 V ] 2 By solvng equaton dγ(m) dm = 0, m =9.64 and γ(m ) = It s n- (1 + a ) 2 V terestng to note that m does not depend on a, = 1, 2,..., d and d. In the extreme cases: f a for all, γ(m ) S tot (4/3) d 1, S S tot UB2 are gven n Table 3. γ(m ) S tot 1 (4/3) 0.257, S S tot 1, whle f a 0 for all,. The analytcal expresson for Stot d 1, UB1 and Table 3. The analytcal expressons for S tot, UB1 and UB2 for g-functon. 1/3 (1+a ) 2 d j=1,j S tot UB1 UB2 ( ) 1 + 1/3 (1+a j) 16 d 2 j=1,j 4 d j=1,j V ( ) 1 + 1/3 (1+a j) 2 (1 + a ) 2 π 2 V ( ) 1 + 1/3 (1+a j) 2 3(1 + a ) 2 V For ths test functon Stot UB1 = π2 48, S tot UB2 = 1 4, hence UB2 UB1 = π2 12 < 1. Values of S, S tot, UB1, UB2 and LB2 for the case of a=[0,1,4.5,9,99,99,99,99], d=8 are gven n Table 4 and shown n Fg. 1. One can see that the knowledge of LB2 and UB1 allows to rank correctly all the varables n the order of ther mportance. Table 4. Values of LB*, S, S tot, UB1 and UB1. Example 2, a=[0,1,4.5,9,99,99,99,99], d =8. x 1 x 2 x 3 x 4 x 5...x 8 LB* S S tot UB UB Example 3. Consder the reduced Morrs test functon wth four nputs [3]:
23 23 Fg. 1. Values of S, S tot, LB2 and UB1 for all nput varables. Example 2 wth a = [0, 1, 4.5, 9, 99, 99, 99, 99], d = 8. f(x) = b x + b j x x j + b jk x x j x k (44) =1 j j k wth b =, b j =, b j4 = The ndces b jk k 4 are null. The four nput varables x ( = 1,..., 4) follow unform dstrbuton on [0, 1]. Sobol ndces are computed va the Monte-carlo scheme of Saltell [29] (usng two ntal matrces of sze 10 5 ), whle DGSM are computed wth Monte-Carlo samplng of sze n (usng dervatves computng by fnte dfferences (43) wth δ = 10 5 ), wth n rangng from 20 to 500, Fgure 2 shows that DGSM bounds UB1 are greater than the total Sobol ndces S T (for = 1, 2, 3, 4) as expected, except for n < 30 whch s a too small sample sze. For small S T, UB1 s close to the S T value. It confrms that DGSM bounds are frst useful for screenng exercses. Other numercal tests nvolvng non-unform and non-normal dstrbutons for the nputs can be found n Lambon et al [19] and Fruth et al [8].
24 24 Fg. 2. For the 4 nput varables of the reduced Morrs test functon: Convergence of the DGSM bound estmates (sold lnes) n functon of the sample sze and comparson to theoretcal values of total Sobol ndces S T (dashed lnes). Conclusons Ths paper has shown that usng lower and upper bounds based on DGSM s possble n most cases to get a good practcal estmaton of the values of S tot at a fracton of the CPU cost for estmatng S tot. Upper and lower bounds can be estmated usng MC/QMC ntegraton methods usng the same set of partal dervatve values. Most of the applcatons show that DGSM can be used for fxng unmportant varables and subsequent model reducton because small values of DGSM mply small values of S tot. In a general case varable rankng can be dfferent for DGSM and varance based methods but for lnear functon and product functon, DGSM can gve the same varable rankng as S tot.
25 25 Engneerng applcatons of DGSM can be found for nstance n Kparssdes et al [15] and Rodrguez-Fernandez et al [27] for bologcal systems modelng, Patell et al [24] for structural mechancs, Iooss et al [12] for an aquatc prey-predator model, Pett [25] for a rver flood model and Touzany and Busby [41] for an hydrogeologcal smulator of the ol ndustry. One of the man prospect n practcal stuatons s to use algorthmc dfferentaton n the reverse (adjont) mode on the numercal model, allowng to estmate effcency all partal dervatves of ths model (see Varatonal Methods). In ths case, the cost of DGSM estmatons would be ndependent of the number of nput varables. Obtanng global senstvty nformaton n a reasonable cpu tme cost s therefore possble even for large-dmensonal model (several tens and spatally dstrbuted nputs n the recent and poneerng attempt of Pett [25]). When the adjont model s not avalable, the DGSM estmaton remans a problem n hgh dmenson and novel deas have to be explored [23] [24]. Couplng DGSM wth nonparametrc regresson technques or metamodel-based technque (see Metamodel-based senstvty analyss: Polynomal chaos expansons and Gaussan processes) s another research prospect as frst shown by Sudret and Ma [40] and De Lozzo and Marrel [5]. The authors would lke to thank Prof. I. Sobol, Dr. S. Song, S. Pett, Dr. M. Lambon, Dr. O. Roustant and Prof. F. Gamboa for ther contrbutons to ths work. One of the authors (SK) gratefully acknowledges the fnancal support by the EPSRC grant EP/H03126X/1. References 1. Bobkov SG (1999) Isopermetrc and analytc nequaltes for log-concave probablty measures. The Annals of Probablty 27(4): Campolongo F, Braddock R (1999) The use of graph theory n the senstvty analyss of model output: a second order screenng method. Relablty Engneerng and System Safety 64:1 12
26 26 3. Campolongo F, Carbon J, Saltell A (2007) An effectve screenng desgn for senstvty analyss of large models. Envronmental Modellng and Software 22: Cropp R, Braddock R (2002) The new Morrs method: an effcent second-order screenng method. Relablty Engneerng and System Safety 78: De Lozzo M, Marrel A (2015) Estmaton of the dervatve-based global senstvty measures usng a Gaussan process metamodel. Submtted 6. Fédou JM, Rendas MJ (2015) Extendng Morrs method: dentfcaton of the nteracton graph usng cycle-equtable desgns. Journal of Statstcal Computaton and Smulaton 85: Fredman J, Popescu B (2008) Predctve Learnng va Rule Ensembles. The Annals of Appled Statstcs 2(3): Fruth J, Roustant O, Kuhnt S (2014) Total nteracton ndex: A varance-based senstvty ndex for second-order nteracton screenng. Journal of Statstcal Plannng and Inference 147: Grewank A, Walther A (2008) Evaluatng dervatves: Prncples and technques of automatc dfferentaton. SIAM Phladelpha 10. Hardy G, Lttlewood J, Polya G (1973) Inequaltes. Cambrdge Unversty Press, Second edton 11. Homma T, Saltell A (1996) Importance measures n global senstvty analyss of non lnear models. Relablty Engneerng and System Safety 52: Iooss B, Popeln AL, Blatman G, Crc C, Gamboa F, Lacaze S, Lambon M (2012) Some new nsghts n dervatve-based global senstvty measures. In: Proceedngs of the PSAM11 ESREL 2012 Conference, Helsnk, Fnland, pp Jansen K, Leovey H, Nube A, Grewank A, Mueller-Preussker M (2014) A frst look of quas-monte Carlo for lattce feld theory problems. Computer Physcs Communcaton 185: Jansen M (1999) Analyss of varance desgns for model output. Computer Physcs Communcaton 117: Kparssdes A, Kucherenko S, Mantalars A, Pstkopoulos E (2009) Global senstvty analyss challenges n bologcal systems modelng. Journal of Industral and Engneerng Chemstry Research 48: Kucherenko S, Song S (2015) Dervatve-based global senstvty measures and ther lnk wth Sobol senstvty ndces. In: Cools R, Nuyens D (eds) Proceedngs of the Eleventh Internatonal Conference on Monte Carlo and Quas-Monte Carlo Methods n Scentfc Computng (MCQMC 2014), Sprnger-Verlag,, Leuven, Belgum
27 Kucherenko S, Rodrguez-Fernandez M, Panteldes C, Shah N (2009) Monte carlo evaluaton of dervatve-based global senstvty measures. Relablty Engneerng and System Safety 94: Lambon M (2013) New way of estmatng total senstvty ndces. In: Proceedngs of the 7th Internatonal Conference on Senstvty Analyss of Model Output (SAMO 2013), Nce, France 19. Lambon M, Iooss B, Popeln AL, Gamboa F (2013) Dervatve-based global senstvty measures: general lnks wth sobol ndces and numercal tests. Mathematcs and Computers n Smulaton 87: Lu R, Owen A (2006) Estmatng mean dmensonalty of analyss of varance decompostons. Journal of the Amercan Statstcal Assocaton 101(474): Morrs M (1991) Factoral samplng plans for prelmnary computatonal experments. Technometrcs 33: Muehlenstaedt T, Roustant O, Carraro L, Kuhnt S (2012) Data-drven Krgng models based on FANOVA-decomposton. Statstcs & Computng 22: Patell E, Pradlwarter H (2010) Monte Carlo gradent estmaton n hgh dmensons. Internatonal Journal for Numercal Methods n Engneerng 81: Patell E, Pradlwarter HJ, Schuëller GI (2010) Global senstvty of structural varablty by random samplng. Computer Physcs Communcatons 181: Pett S (2015) Analyse de sensblté globale du module MASCARET par l utlsaton de la dfférentaton automatque. Rapport de stage de fn d études de Supélec, EDF R&D, Chatou, France 26. Pujol G (2009) Smplex-based screenng desgns for estmatng metamodels. Relablty Engneerng and System Safety 94: Rodrguez-Fernandez M, Banga J, Doyle F (2012) Novel global senstvty analyss methodology accountng for the crucal role of the dstrbuton of nput parameters: applcaton to systems bology models. Internatonal Journal of Robust Nonlnear Control 22: Roustant O, Fruth J, Iooss B, Kuhnt S (2014) Crossed-dervatve-based senstvty measures for nteracton screenng. Mathematcs and Computers n Smulaton 105: Saltell A (2002) Makng best use of model evaluatons to compute senstvty ndces. Computer Physcs Communcaton 145:
28 Saltell A, Ratto M, Andres T, Campolongo F, Carbon J, Gatell D, Salsana M, Tarantola S (2008) Global senstvty analyss - The prmer. Wley 31. Saltell A, Annon P, Azzn I, Campolongo F, Ratto M, Tarantola S (2010) Varance based senstvty analyss of model output. Desgn and estmator for the total senstvty ndex. Computer Physcs Communcaton 181: Santago J, Corre B, Claeys-Bruno M, Sergent M (2012) Improved senstvty through Morrs extenson. Chemometrcs and Intellgent Laboratory Systems 113: Sobol I (1990) Senstvty estmates for non lnear mathematcal models (n Russan). Matematcheskoe Modelrovane 2: Sobol I (1993) Senstvty estmates for non lnear mathematcal models. Mathematcal Modellng and Computatonal Experments 1: Sobol I (2001) Global senstvty ndces for non lnear mathematcal models and ther Monte Carlo estmates. Mathematcs and Computers n Smulaton 55: Sobol I, Gershman A (1995) On an alternatve global senstvty estmators. In: Proceedngs of SAMO 1995, Belgrate, pp Sobol I, Kucherenko S (2005) Global senstvty ndces for non lnear mathematcal models. Revew. Wlmott Magazne 1: Sobol I, Kucherenko S (2009) Dervatve based global senstvty measures and ther lnks wth global senstvty ndces. Mathematcs and Computers n Smulaton 79: Sobol I, Kucherenko S (2010) A new dervatve based mportance crteron for groups of varables and ts lnk wth the global senstvty ndces. Computer Physcs Communcatons 181: Sudret B, Ma CV (2015) Computng dervatve-based global senstvty measures usng polynomal chaos expansons. Relablty Engneerng and System Safety 134: Touzany S, Busby D (2014) Screenng method usng the dervatve-based global senstvty ndces wth applcaton to reservor smulator. Ol & Gas Scence and Technology Rev IFP Energes nouvelles 69:
ARTICLE IN PRESS. Available online at Mathematics and Computers in Simulation xxx (2009) xxx xxx
Avalable onlne at wwwscencedrectcom Mathematcs and Computers n Smulaton xxx 29 xxx xxx Dervatve based global senstvty measures and ther lnk wth global senstvty ndces IM Sobol a, S Kucherenko b, a Insttute
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationStatistical tools to perform Sensitivity Analysis in the Context of the Evaluation of Measurement Uncertainty
Statstcal tools to perform Senstvty Analyss n the Contet of the Evaluaton of Measurement Uncertanty N. Fscher, A. Allard Laboratore natonal de métrologe et d essas (LNE) MATHMET PTB Berln nd June Outlne
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationHongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)
ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationComparison of Regression Lines
STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationUncertainty as the Overlap of Alternate Conditional Distributions
Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationJoint Statistical Meetings - Biopharmaceutical Section
Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationAdaptive Reduction of Design Variables Using Global Sensitivity in Reliability-Based Optimization
Adaptve Reducton of Desgn Varables Usng Global Senstvty n Relablty-Based Optmzaton Nam H. Km * and Haoyu Wang Dept. of Mechancal & Aerospace Engneerng, Unversty of Florda, Ganesvlle, Florda, 326 Nestor
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationBayesian predictive Configural Frequency Analysis
Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationComputation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models
Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,
More informationMultivariate Ratio Estimator of the Population Total under Stratified Random Sampling
Open Journal of Statstcs, 0,, 300-304 ttp://dx.do.org/0.436/ojs.0.3036 Publsed Onlne July 0 (ttp://www.scrp.org/journal/ojs) Multvarate Rato Estmator of te Populaton Total under Stratfed Random Samplng
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Experment-I MODULE VII LECTURE - 3 ANALYSIS OF COVARIANCE Dr Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Any scentfc experment s performed
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationCokriging Partial Grades - Application to Block Modeling of Copper Deposits
Cokrgng Partal Grades - Applcaton to Block Modelng of Copper Deposts Serge Séguret 1, Julo Benscell 2 and Pablo Carrasco 2 Abstract Ths work concerns mneral deposts made of geologcal bodes such as breccas
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More information/ n ) are compared. The logic is: if the two
STAT C141, Sprng 2005 Lecture 13 Two sample tests One sample tests: examples of goodness of ft tests, where we are testng whether our data supports predctons. Two sample tests: called as tests of ndependence
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationU-Pb Geochronology Practical: Background
U-Pb Geochronology Practcal: Background Basc Concepts: accuracy: measure of the dfference between an expermental measurement and the true value precson: measure of the reproducblty of the expermental result
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationComments on Detecting Outliers in Gamma Distribution by M. Jabbari Nooghabi et al. (2010)
Comments on Detectng Outlers n Gamma Dstrbuton by M. Jabbar Nooghab et al. (21) M. Magdalena Lucn Alejandro C. Frery September 17, 215 arxv:159.55v1 [stat.co] 16 Sep 215 Ths note shows that the results
More informationStatistical inference for generalized Pareto distribution based on progressive Type-II censored data with random removals
Internatonal Journal of Scentfc World, 2 1) 2014) 1-9 c Scence Publshng Corporaton www.scencepubco.com/ndex.php/ijsw do: 10.14419/jsw.v21.1780 Research Paper Statstcal nference for generalzed Pareto dstrbuton
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationResearch Article An Extension of Stolarsky Means to the Multivariable Case
Internatonal Mathematcs and Mathematcal Scences Volume 009, Artcle ID 43857, 14 pages do:10.1155/009/43857 Research Artcle An Extenson of Stolarsky Means to the Multvarable Case Slavko Smc Mathematcal
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationConjugacy and the Exponential Family
CS281B/Stat241B: Advanced Topcs n Learnng & Decson Makng Conjugacy and the Exponental Famly Lecturer: Mchael I. Jordan Scrbes: Bran Mlch 1 Conjugacy In the prevous lecture, we saw conjugate prors for the
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationANOMALIES OF THE MAGNITUDE OF THE BIAS OF THE MAXIMUM LIKELIHOOD ESTIMATOR OF THE REGRESSION SLOPE
P a g e ANOMALIES OF THE MAGNITUDE OF THE BIAS OF THE MAXIMUM LIKELIHOOD ESTIMATOR OF THE REGRESSION SLOPE Darmud O Drscoll ¹, Donald E. Ramrez ² ¹ Head of Department of Mathematcs and Computer Studes
More information