Identi ability and interval identi ability of mammillary and catenary compartmental models with some known rate constants

Size: px
Start display at page:

Download "Identi ability and interval identi ability of mammillary and catenary compartmental models with some known rate constants"

Transcription

1 Mathematical Biosciences 167 (2000) 145±161 Identi ability and interval identi ability of mammillary and catenary compartmental models with some known rate constants Paolo Vicini 1, Hsiao-Te Su, Joseph J. DiStefano III * Biocybernetics Laboratory, Departments of Computer Science and Medicine, Boelter Hall 4531 K, University of California at Los Angeles, Los Angeles, CA , USA Received 12 March 1999; received in revised form 13 June 2000; accepted 3 July 2000 Abstract The identi ability problem is addressed for n-compartment linear mammillary and catenary models, for the common case of input and output in the rst compartment and prior information about one or more model rate constants. We rst de ne the concept of independent constraints and show that n-compartment linear mammillary or catenary models are uniquely identi able under n 1 independent constraints. Closed-form algorithms for bounding the constrained parameter space are then developed algebraically, and their validity is con rmed using an independent approach, namely joint estimation of the parameters of all uniquely identi able submodels of the original multicompartmental model. For the noise-free (deterministic) case, the major e ects of additional parameter knowledge are to narrow the bounds of rate constants that remain unidenti able, as well as to possibly render others identi able. When noisy data are considered, the means of the bounds of rate constants that remain unidenti able are also narrowed, but the variances of some of these bound estimates increase. This unexpected result was veri ed by Monte Carlo simulation of several di erent models, using both normally and lognormally distributed data assumptions. Extensions and some consequences of this analysis useful for model discrimination and experiment design applications are also noted. Ó 2000 Elsevier Science Inc. All rights reserved. Keywords: Identi ability; Interval identi ability; Parameter bounds; Mammillary; Catenary; Compartmental model * Corresponding author. Tel.: ; fax: address: joed@cs.ucla.edu (J.J. DiStefano III). 1 Present address: Department of Bioengineering, P.O. Box , University of Washington, Seattle, WA , USA /00/$ - see front matter Ó 2000 Elsevier Science Inc. All rights reserved. PII: S (00)

2 146 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Introduction A problem that commands continuing interest [1] is that of bounding the parameter space for unidenti able, linear, time-invariant multicompartmental models, thereby providing nite ranges for otherwise unidenti able rate constants based on information inherent in the model structure. DiStefano [2] introduced the notions of interval identi ability and quasiidenti ability and derived explicit, computable expressions for nite bounds on the rate constants of general mammillary models of any order, and with all possible rate constants present, for the most common case of input and (noise-free) output in the central compartment. This work was extended, rst for computing the uniquely identi able parameter combinations of the same model class [3], then to similarly general catenary models with input and output in the same compartment [4,5], and then to the noisy data case, for both mammillary and catenary models [6]. Together [2±6] provide closed-form algorithmic solutions for the nite intervals of all k ij for these two model classes, given that no k ij are known or otherwise xed. We call these intervals the unconstrained bounds on the k ij, for reasons clari ed below. Other contributions to this problem area are found in [7], where parameter bounds for two and three compartment mammillary models with input and output in compartment 1 are derived in terms of the parameters of the sum of exponentials responses; more general methods are presented in [8] for localizing parameters of linear compartmental models within bounded regions, and an alternative approach based on Lyapunov functions recently has been proposed [1]. In the current work, we address the common case in which one or more rate constants k ij are known, a likely situation in applications of either of these two model classes, and rst develop conditions under which the other k ij are identi able. For example, a priori information often indicates that, for some i, compartment i has no leak: in this case, k 0i ˆ 0, but this does not necessarily assure (structural) identi ability of the model. In brief, we use the following de nitions of identi ability notions: a parameter (e.g. rate constant k ij ) of a model M is unidenti able if there exist an uncountably in nite number of solutions for k ij from the model equations, with inputs and outputs speci ed in these equations; it is interval-identi able if it is unidenti able but can be bounded within a nite interval from the same model equations and inequality relations on the parameters (e.g. k ij > 0; i 6ˆ j). The parameter k ij is identi able if one or more distinct solutions exist from the same equations; it is uniquely identi able if only one such solution exists. The whole model M is unidenti able if any one k ij is unidenti able; and identi able/uniquely identi able if all k ij are identi able/uniquely identi able. In general, in the absence of noise in the data, the original (unconstrained) bounds shrink when one or more constraints are applied, thereby re ecting the increased available information, consistent with intuition. The reduced range or bounds in this case are termed the constrained range or bounds. For the noisy data case, our results are consistent for the mean of the bounds, but ± interestingly ± not for the variance, using conventional assumptions of normality or log-normality of measurements. We have con rmed the validity of our algorithms, and these counterintuitive results, by both Monte Carlo simulation and also using an independent submodel approach [8,9]. The latter applies to a wider class of models, but unfortunately does not provide closed form solutions. The current results provide closure on the deterministic part of the bounding problem for open linear mammillary and catenary compartmental models of any order, with input and output in

3 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± compartment 1, and for all unknown k ij, with any number of k ij known a priori. The overall solution is closed-form and algorithmic and thus can be readily programmed. 2. Catenary and mammillary models Linear catenary and mammillary compartmental models with n compartments and scalar input u t and scalar output y t in the rst compartment are shown in Fig. 1. They can be described in terms of mass ows by dq t ˆ Kq t au t ; q 0 ˆq dt 0 y t ˆcq t ; 1 where q is a n-dimensional vector of compartment masses, a ˆ Š T, where the superscript T indicates transpose, c ˆ 1=V Š; K ˆ k ij Š is the matrix of rate constants, with k ii ˆ Pn jˆ0 k ji; i ˆ 1;...; n; k ij (t 1 units) designates transfer to compartment i from compartment j j 6ˆ i, and V 1 is the volume of distribution of compartment 1. The unit impulse response for either model is a sum of n distinct exponential terms, where A i > 0 and k i < 0 8 i Fig. 1. General catenary (upper) and mammillary (lower) compartmental models with both input and output in compartment 1.

4 148 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 y t ˆXn iˆ1 A i e k it ; t P 0; when k 1i 6ˆ k 1j 8 i; j : i 6ˆ j 6ˆ 1, and k 1i k i1 > 0 8i for the mammillary model, [10, p. 62]; and k i;i 1 k i 1;i > 0 8i for the catenary model [10, p. 63], and all k 0i P 0, with k 0j > 0 for at least one j for both models. In our case, the input/output transfer function is the Laplace transform of (2): H s ˆXn A i ˆ bns n 1 b n 1 s n 2 b 2 s b 1 ; 3 s k iˆ1 i s n a n s n 1 a 2 s a 1 where all of the a i and b i can be evaluated directly from (1) in terms of the k ij, as uniquely identi able parameter combinations, or structural invariants of the model [12]. For the catenary model, these are: k 11 ˆ k 01 k 21 ; k ii ˆ k 0i k i 1;i k i 1;i ; 1 < i < n; 4 k nn ˆ k 0n k n 1;n ; c i ˆ k i 1;i k i;i 1 ; i ˆ 2; 3;...; n: For the mammillary model, the structural invariants are: 2 k 11 ˆ k 01 k 21 k 31 k n1 ; k ii ˆ k 0i k 1i ; 1 < i 6 n c i ˆ k 1i k i1 ; i ˆ 2; 3;...; n: 5 As shown in [3,4], these invariants can be algorithmically derived from the output in three steps y t ; t 2 0; T Š)fA i ; k i g)fa i ; b i g)fk ii ; c i g: In [2±4], nite parameter bounds 8 k ij were determined for both model types, with all k ij > 0 and unknown, and were implemented in the programs MAMPOOL and CATPOOL [3±6]. When some k ij are known or prior estimates are available, the dimensionality of the space of unknown parameters is reduced and the new bounds must satisfy a modi ed set of structural relations, as shown below. In addition, prior parameter values or estimates must be feasible, i.e. they must be consistent with the model structure and output data y t, as described next. 3. The feasible subspace for equality constraints Equality constraints on the rate constants of catenary and mammillary models must satisfy the following conditions: 1. No additional equality constraints are possible for the 1-compartment model, because its single rate parameter is determined uniquely by the available (noise-free) output data y t, for nonzero input and output, as is V 1 ˆ q 0 =y 0, e.g. V 1 ˆ 1=y 0 for a unit impulse input. 2. Speci ed parameter values (or estimates) must fall within their corresponding unconstrained bounds (i.e. bounds for the k ij when none are given a priori).

5 3. Constraints must be independent. As a simple example, the following set of equations for the catenary model: k 11 ˆ k 21 k 01 ; c 2 ˆ k 12 k 21 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± provides unique solutions for all three parameters k 12, k 21, and k 01, when any one of them is given. If there are two con icting constraints among these three variables, then no solution exists. This condition is called independence, and it is formalized below for both model classes. 4. There cannot be more than n 1 independent parameter equality constraints for n-compartment catenary or mammillary models. This is stated and proven as two theorems below. The proofs are based on the fact that there are at most 3n 2 unknowns and 2n 1 equality relations among the parameters. This leaves at most n 1 degrees of freedom in the model, and thus there cannot be more than n 1 constraints without violating the independence condition The catenary model Constraints may be infeasible for a given set of data and thus may yield no solution, e.g., if k 12 ˆ 1 and k 21 ˆ 24 are given, but k 12 k 21 ˆ c 2 ˆ 0:5 is estimated from the input±output data, then we have a contradiction. Constraints can also be redundant, e.g. k 12 ˆ 1 and k 21 ˆ 0:5 and k 12 k 21 ˆ c 2 ˆ 0:5. This motivates the notion of independent constraints. De nition 1. Let P be the set of all of the rate constants in the n-compartment catenary model. Let Q be the set of the constrained rate constants. Then the elements of Q are independent in the catenary model if ji j \ Qj 6 1 8j : 1 6 j 6 n 1orjJ j \ Qj 6 1 8j : 1 6 j 6 n 1 or both, where I j ˆ k 0j ; k j 1 ; j; k j;j 1 8j : 1 6 j 6 n 2; I n 1 ˆ k 0;n 1 ; k 0;n ; k n 1;n ; k n;n 1 and J 1 ˆ fk 01 ; k 02 ; k 12 ; k 21 g; J j ˆ k 0;j 1 ; k j;j 1 ; k j 1;j 8j : 2 6 j 6 n 1: Notice that two slightly di erent schemes, I and J, are used to partition the P set, and that constraints are independent if they satisfy either or both schemes. The proof presented below assumes that constraints satisfy scheme I. The case where scheme J is satis ed can be constructed in a similar manner. Theorem 1. The n-compartment catenary model is uniquely identifiable under n 1 independent constraints.

6 150 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 Proof. We use induction on the following proposition: For 1 < j 6 n 1, with n 1 independent parameter constraints, parameters in S j iˆ1 I i are uniquely identi able. Clearly, this proposition depends on the value of j, where 1 6 j 6 n 1. Let us refer to it as P j. Furthermore, P n 1 implies that the theorem is true. We show P n 1 is true by induction on j. Basis: P 1. Let Q be the set of constrained parameters. Then jqj ˆn 1. By the pigeon hole principle [11], ji j \ Qj ˆ1 8j. In particular, ji 1 \ Qj ˆ1, which implies that one of the k 01, k 12 and k 21 is constrained. Thus, k 01, k 12 and k 21 can be solved from k 11 ˆ k 01 k 21 ; c 2 ˆ k 12 k 21 : Induction step: P j )P j 1 for 1 6 j 6 n 3. By P j, parameters in S j iˆ1 I i are uniquely identi able. In particular, k j;j 1 is uniquely identi able. Since jq \ I j 1 jˆ1, one of k 0;j 1, k j 2;j 1, k j 1;j 2 is constrained. So we can solve for k 0;j 1, k j 2;j 1 and k j 1;j 2 from k j 1;j 1 ˆ k 0;j 1 k j;j 1 k j 2;j 1 ; c j 2 ˆ k j 1;j 2 k j 2;j 1 : By induction, P n 2 is true. To prove P n 1, the same arguments can be applied. By P n 2, parameters in S n 2 iˆ1 I i are uniquely identi able. Speci cally, k n 2;n 1 is uniquely identi- able. Since jq \ I n 1 jˆ1, one of k 0;n 1 ; k 0;n ; k n;n 1 ; k n 1;n is constrained. So k 0;n 1 ; k 0;n ; k n;n 1 ; k n 1;n can be solved via k n 1;n 1 ˆ k 0;n 1 k n 2;n 1 k n;n 1 ; k n;n ˆ k 0;n k n 1;n ; c n ˆ k n 1;n k n;n 1 : Thus, P n 1 is true and the theorem is proven The mammillary model Since mammillary models are structurally identical if peripheral compartments are exchanged or renumbered, some restrictions must be imposed on the labeling before we can prove that a generic model is uniquely identi able under n 1 constraints. We label the peripheral compartments such that k 22 > k 33 > > k nn ; where the k ii are generically distinct. As in the proof for the catenary model, we begin with the notion of independence. De nition 2. Let P be the set of all rate constants in the n-compartment mammillary model. Let Q be the set of constrained parameters. Then the elements of Q are independent in the mammillary model if ji j \ Qj 6 1, where I 1 ˆ fk 01 ; k 02 ; k 12 ; k 21 g; I j ˆ k 0;j 1 ; k 1;j 1 ; k j 1;1 8j : 2 6 j 6 n 1:

7 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Note that n 1 di erent partitioning schemes are obtained for P by grouping k 01 with any one of the I j. We only group k 01 with I 1 here. The proofs for other partitioning schemes are similar. Theorem 2. The n-compartment mammillary model is uniquely identifiable under n 1 independent constraints. Proof. Let Q be the set of constrained variables. Then jqj ˆn 1. By the pigeon hole principle [11], ji j \ Qj ˆ1 8j. For j P 2, this implies that one of the k 0;j 1 ; k 1;j 1, and k j 1;1 is constrained in I j. Thus, these three variables can be found uniquely from k j 1;j 1 ˆ k 0;j 1 k 1;j 1 ; c j 1;j 1 ˆ k 1;j 1 k j 1;1 : Since this is true 8j P 2, all of the parameters except the ones in I 1 are uniquely identi able. Since ji 1 \ Qj ˆ1, it follows that one of the k 01, k 02, k 12, and k 21 is constrained. If k 01 is not constrained, then parameters k 02, k 12, and k 21 can be obtained from k 22 ˆ k 02 k 12 ; c 2 ˆ k 12 k 21 : Since all of the k i1, i 6ˆ 0, are uniquely identi able, one can solve for k 01 from k 11 ˆ k 01 k 21 k n1 : If k 01 is constrained, then it is possible to solve these equations in reverse order. k 21 can be solved for from the last equation above, then one can substitute its value into the previous equation and the remaining rate constants can be solved for recursively. 4. The constrained parameter-bounding algorithms 4.1. The catenary model algorithm For the unconstrained case, the minimum possible value for any k 0j is zero [4]. However, no more than n 1 leaks can be zero at the same time, and this was used in the derivation of the unconstrained algorithm, which used the following recursive relations: ( k 11 k 01 ; i ˆ 1; k i 1;i ˆ k ii c i k 0i ; i ˆ 2;...; n 1; 6 k i;i 1 for the k ij elements in the lower diagonal of the system matrix K in Eq. (1), and ( k i 1;i ˆ k nn k 0n ; i ˆ n; k ii c i 1 k i;i 1 k 0i ; i ˆ n 1;...; 2; for the k ij elements in the upper diagonal. Then, with the leaks k 0i recursively set to zero, the upper bounds on the k i 1;i and k i 1;i were obtained for all i [4]. 7

8 152 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 Now, if one or more rate constants is known, the above equations are still applicable, but algorithmic solution must account for all available information. This is done as follows in the new algorithm: 1. The algorithm for unconstrained catenary models [4] is applied rst, to nd the largest feasible ranges for the k ij, consistent with the model structure and output data. Then all equality constraints for the k ij s are tested for feasibility. If infeasible, the algorithm is terminated. If any parameter in the rst or last compartment is known, the values of the other two are evaluated from k 11 ˆ k 01 k 21 ; c 2 ˆ k 21 k 12 ; for the rst compartment, and 8 k nn ˆ k 0n k n 1;n c n ˆ k n 1;n k n;n 1 ; 9 for the n-th compartment. 2. Eqs. (6) and (7) are solved recursively, substituting the values of known parameters wherever they appear and setting the unconstrained leaks k 0i to zero. This gives the new upper bounds on all rate constants but the leaks. 3. The new lower bounds on all but the leak parameters are then found, as for the unconstrained case, from the structural invariant relations (4): i 1;i ˆ ci i;i 1 ; i ˆ 2;...; n; i 1;i ˆ ci 1 ; i ˆ 1;...; n 1: ki;i 1 max 4. The new upper bounds on the leaks are then found from 01 ˆ k ; 0i 0n ˆ k ii i 1;i kmin i 1;i ; i ˆ 2;...; n 1; ˆ k nn n;n 1 : 5. The new lower bound for each unconstrained leak remains zero, unless the model is uniquely identi able, in which case, the k 0i s are uniquely determined from (11). Remark 1. If there are n 1 independent constraints, then the model is uniquely identi able (Theorem 1) and the algorithm gives kij min kij max 8 i and j. Remark 2. The fairly common case of n 1 leaks set to zero presents some points of interest. The remaining unconstrained leak then attains its maximum value and all parameters attain their minimum or maximum values, as shown in Fig. 2. Conversely, setting any one k 0j to its maximum value is equivalent to setting all other k 0i to zero, and then one equality constraint is enough to make the model uniquely identi able, with all k ij attaining their minimum or maximum values (Fig. 2)

9 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± The mammillary model algorithm This algorithm is somewhat simpler, because the peripheral compartments of the mammillary model are not directly connected with each other. The structural invariant equations associated with peripheral compartment i > 1 are k ii ˆ k 0i k 1i ; 12 c i ˆ k 1i k i1 : By inspection, (12) can be solved for all three variables if any one is known. Furthermore, they do not directly a ect the parameters in other peripheral compartments unless there are n 1 constraints. These observations motivate the following algorithm: 1. The algorithm for unconstrained mammillary models [2,3] is applied rst, to nd the largest feasible ranges for the parameters consistent with the model structure and output data. Then all equality constraints for the k ij s are tested for feasibility. If infeasible, the algorithm is terminated. 2. If any parameter in the set k 0i ; k 1i ; k i1 is known (given), the values of the other two are evaluated from (12). More than one equality constraint supplied by a user could be inconsistent with each other and relations (12). In this case, the algorithm is terminated. 3. If the parameters associated with any compartment i are all unknown, then k1i max calculated from (12) by setting k 0i to zero. 4. i1 Fig. 2. Unique identi ability of the model is achieved when k 0i ˆ k0i max. In this case, k 0j ˆ k0j min ˆ 0 8 i 6ˆ j. and i1, i > 1, is calculated from k 11 ˆ k 01 k 21 k n1 by setting all parameters except k i1 to their minimum, i.e. i1 ˆ k 11 X j1 ; 13 j6ˆi;j6ˆ1 for i > 1. If any k j1 are known 1 6ˆ j 6ˆ i, then their values are simply substituted into (13) to obtain ki1 max. 5. For i > 1, k1i min and k0i max are calculated from structural invariants (12) by setting k i1 to its maximum. 6. If k 01 is unknown, then k01 min ˆ 0 and k01 max is found from 01 ˆ k 11 X j1 : 14 j>1 are Remark 3. If there are n 1 independent constraints, the model is uniquely identi able (Theorem 2), and the algorithm gives kij min kij max 8 i; j.

10 154 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Noisy data and parameter equality constraints: algorithmic approach E ects of noisy output data on unconstrained parameter bounds of catenary and mammillary models were treated in [6], for the measurement model z t i ˆy t i e t i. An asymptotic covariance matrix for the catenary model bound h i T b ˆ n;n 1 kmax n;n 1 15 was computed in terms of the vector of (known) structural invariants p as COV b d ˆob T op COV p ob 16 op in [6], and similarly for the mammillary model. Now, if a parameter is xed, the same procedure applies. Eq. (16) gives the covariance of the bounds on the remaining rate constants, established by reevaluating the elements of the matrix ob=op from these same relationships established in [6] for both mammillary and catenary compartmental models. However, in this case, the element values are determined using the constrained bounds, which are generally di erent than the unconstrained bounds. Also, the covariance matrix is reduced in dimension by two for each known parameter, because ob i op ˆ 0T 17 for each known constraint b i ˆ b min i ˆ b max i and structural invariants p. 6. Joint submodel parameters: another approach In principle, parameter bounds of unidenti able compartmental models can also be computed using an identi able submodels approach [8,9]. We have exploited this idea further here, to lend validity to our primary algorithms. By this approach, the ranges for each of the parameters of the original (unconstrained) unidenti able model are established from the uniquely identi able parameters of particular submodels, which are either minimum or maximum values of the range for a given parameter [9]. Logically, then, the ranges for a constrained model should be determined similarly by joint estimation of the uniquely identi able parameters of the submodels of the constrained structure. Uniquely identi able submodels of unidenti able structures are typically generated by systematically eliminating parameters of the original model until it becomes uniquely identi able [12]. In our case, every unconstrained n-compartment mammillary or catenary model has n uniquely identi able submodels, each obtained by setting all leaks but one to zero, as described earlier, and illustrated for the catenary model in Fig. 2. When parameters are constrained, the number of such submodels is reduced, because leaks then become uniquely identi able and generally di erent from zero. For this reason, the joint regions or ranges of values for the constrained model are typically reduced as well.

11 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Fig. 3. The uniquely identi able submodels of the (a) unconstrained and (b) constrained, with k 12 ˆ 0:28 min 1, 3-compartment mammillary model reported in [6, p. 186]. Numerical estimates for the rate constants are reported in Table 1. To illustrate this, Fig. 3(a) includes all of the uniquely identi able submodel structures of the unconstrained 3-compartment mammillary model with input and output in compartment 1 only. As noted earlier, k 22 > k 33 for these con gurations, thereby maintaining unique identi ability. It is well known that each submodel has a single leak from only one of the three compartments, as noted [8,10]. In Fig. 3(b), suppose k 12 is constrained (given) and nonzero. Then, by Eqs. (13) and (14), either k 01, k 21 and k 02 are uniquely identi able and nonzero, or k 03, k 21 and k 02 are uniquely identi able and non-zero, both as shown. These are the two uniquely identi able submodels of the constrained structure, and parameter bounds of the original constrained structure can therefore be obtained by quantifying these submodels, e.g. by direct estimation with weighted nonlinear least squares. 7. Numerical examples We exercised our new algorithms and compared the results with the corresponding results of Monte Carlo (MC) simulations and the joint submodel parameters approach, applied to numerous mammillary and catenary model examples. MC simulations were implemented in MATLAB [14] with 1000 simulations for each example, using the statistics and distributions noted for each. The uniquely identi able submodel parameters and their statistics were evaluated using the kinetic analysis software SAAM II [15]. Results for four di erent model structures, with two di erent data error types, are given below. For each example case study, analytical, simulated and direct parameter estimation gave results

12 156 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 within a few percent of each other and therefore only one set is given in the gures or tables for each example Four-compartment models with Gaussian measurement errors Example 1. We reexamine the 4-compartment catenary model example presented in [4], previously evaluated with the unconstrained parameter algorithm implemented in the program CATPOOL [4], as shown in Fig. 4(a). Numbers in parentheses are %CVs ( ˆ 100 SD/mean) on the parameter bounds, computed as in [6]. When we constrained one of the k ij : k 43 ˆ 0:006, and analyzed the resulting model using the new algorithm, we got the results depicted in Fig. 4(b). The constrained model remains unidenti able overall, but k 34 and k 04 become uniquely identi able and the new mean parameter bounds for the remaining k ij s are narrower than the unconstrained ones. Note, however, that some parameter-bound variabilities (%CVs) increase, e.g. all %CVs for the k 0i s. Example 2. An unconstrained 4-compartment mammillary model is shown in Fig. 5(a), the same model analyzed in [3]. The new algorithms with k 14 ˆ 0:0014 given yielded Fig. 5(b). As in the catenary example, the model remains unidenti able overall, but with narrower mean bounds on all interval identi able k ij, and all of the parameters associated with compartment 4 are uniquely identi able. However, as with the catenary model example above, some parameter-bound variabilities increase (e.g. all of the k 0i ). Fig. 4. The (a) unconstrained, i.e., all rate constants unknown, and (b) constrained, k 43 ˆ 0:006 min 1, parameter bounds in a 4-compartment catenary model (lower bounds below or on the left of the arrow, upper bounds above or to the right). Rate constant (min 1 ) ranges are shown by arrows and asymptotic %CVs of estimated bounds are given in parentheses. A single number designates a uniquely identi able k ij, with %CV assumed zero when k ij is xed beforehand (as for k 43 in (b)). The sampling schedule for Monte Carlo simulation and parameter estimation for this example was: 0, 0.3, 0.5, 1, 3, 4, 5, 7, 10, 13, 20, 50, 200, 250, 500, 800, 900, 1200 min, in triplicate, and data measurement errors were 5% (CV).

13 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Fig. 5. The (a) unconstrained, i.e., all rate constants unknown, and (b) constrained, k 14 ˆ 0:0014 min 1, parameter bounds in a 4-compartment mammillary model (lower bounds below or on the left of the arrow, upper bounds above or to the right). Rate constant (min 1 ) ranges are shown on the arrows, and asymptotic %CV of estimated bound are given in parentheses. A single number designates a uniquely identi able k ij, with %CV assumed zero when k ij is xed beforehand (as for k 14 in (b)). The sampling schedule for Monte Carlo simulation and parameter estimation for this example is: 0, 0.3, 0.5, 1, 3, 4, 5, 7, 10, 13, 20, 50, 200, 250, 500, 800, 900, 1200 min, in triplicate, and data measurement errors were 5% (CV) Three-compartment models with Gaussian or lognormal errors We applied the new algorithm to two unconstrained 3-compartment mammillary and catenary model examples published earlier in [6, p. 186], each with all k ij and k 0j > 0. Examples 3 and 4. Table 1 is a summary of results for the mammillary model, Table 2 for the catenary model, each unconstrained versus constrained by k 12 ˆ 0:28. For both, measurement errors were Gaussian, with 5% (%CV) errors. Example 5. The catenary model was also run assuming lognormal measurement errors. The results are shown in Table 3. As with Examples 1 and 2, some bound variabilities (shown in %) increased when k 12 was xed in Examples 3±5. In fact, the increase was severalfold for many of the bounds shown in Tables 1±3.

14 158 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 Table 1 Computed parameter bounds and variabilities for the unconstrained and constrained (k 12 ˆ 0:28 min 1 ) 3-compartment mammillary model reported in [6, p. 186] with 5% Gaussian measurement errors Bound Unconstrained case Constrained case Value (min 1 ) SD (min 1 ) CV (%) Value (min 1 ) SD (min 1 ) CV (%) ± ± ± ± Table 2 Computed parameter bounds and variabilities for the unconstrained and constrained (k 12 ˆ 0:28 min 1 ) 3-compartment catenary model of the impulse response reported in [6, p. 186] with 5% Gaussian measurement errors Bound Unconstrained case Constrained case Value (min 1 ) SD (min 1 ) CV (%) Value (min 1 ) SD (min 1 ) CV (%) ± ±

15 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± Table 3 Computed parameter bounds and variabilities for the unconstrained and constrained (k 12 ˆ 0:28 min 1 ) 3-compartment catenary model of the impulse response reported in [6, p. 186] using 5% lognormal measurement errors Bound Unconstrained case Constrained case Value (min 1 ) SD (min 1 ) CV (%) Value (min 1 ) SD (min 1 ) CV (%) ± ± ± ± Discussion One or more rate constants of a compartmental model are often known, typically due to the absence of compartment leaks. All leaks are present, in general, in the context of the most general mammillary and catenary compartment models we treat here. When additional parameter information is available, it should be used in the overall identi ability problem solution, and one would anticipate intuitively that this should reduce the range of computable bounds for parameters that remain unidenti able, just as it might render other parameters or the entire model identi able. This was the motivation for this work, and we found that the resulting algorithms for incorporating parameter equality constraints for catenary and mammillary models consistently reduce the ranges in unidenti able rate constants, in the limit providing equal upper and lower bounds for some k ij s when the additional parameter information renders them identi able. Moreover, we showed that parameter constraints have to satisfy some conditions (namely, independence and feasibility) to be considered acceptable vis a vis the model structure and the information given by the data. Although constraints consistently reduced mean ranges in unidenti able k ij, some parameterbound variabilities increased, especially for the k 0j (leaks). This might be anticipated with variabilities expressed as 100 SD/mean, for k ij with reduced mean ranges. But some SDs also increased. We veri ed this seemingly paradoxical result for each example, by Monte Carlo simulation, as well as for several additional examples. By way of explanation, we refer to Eqs. (16) and (17) for the parameter variances. First, we note that the variance of the structural invariants, VAR(p), is established by the output data. When

16 160 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145±161 some elements of the parameter-bound variances, VAR(b), are zero (for xed k ij s), VAR(p) must nevertheless remain the same. Therefore, other parameter-bound variances might increase, to re ect this conservative feature of the data. For example, suppose estimates of max and k12 min are approximately uncorrelated. Then, for k 22 ˆ k02 max k12 min in Eq. (12), VAR k 22 VAR k02 max VAR k12 min. Also, let VAR k 22 ˆ2 and VAR k02 max ˆVAR kmin 12 ˆ1in the unconstrained case. Then, if k 02 is known, VAR k02 max ˆ0 and thus VAR kmin 12 increases from 1 to 2. If kmax 02 and k12 min estimates were correlated, the variance estimate increase would possibly be smaller, or nonexistent. The parameter equality constraint algorithms developed here are readily extended to the case where ranges of values (or estimates) are available for particular unidenti able k ij s, i.e. ^ ij ^k max ij < k ij < ; i 6ˆ j; j 6ˆ 0 (e.g. con dence limits, etc.), and this range is smaller than the unconstrained range, i.e., if ij < ^k min ij < k ij < ^k max ij < ij ; i 6ˆ j; j 6ˆ 0: 18 In this case, new, approximate range estimates for all parameters other than k ij might be found by min max successively using ^k ij and ^k ij as constraints in the equality constraint algorithms. A model discrimination application of this new algorithm is also suggested by the condition that known values for rate constants must lie within the range determined by the unconstrained algorithm. If the given value falls outside the range, with the data tted well by an output equation like (2), the mammillary or the catenary model structure may be rejected, depending on statistical considerations in the tting procedure [13]. The new algorithms presented here can be readily programmed to provide solutions for all parameter ranges of the two classes of models treated in this paper (open mammillary and catenary models), with any number of k ij xed, for any i and j. Acknowledgements This work was motivated by thyroid hormone metabolism kinetic modeling problems and was supported in part by NIH Grant no. DK References [1] J. Eisenfeld, Partial identi ability of underdetermined compartmental models: a method based on positive linear Lyapunov functions, Math. Biosci. 132 (1996) 111. [2] J.J. DiStefano III, Complete parameter bounds and quasiidenti ability of some unidenti able linear systems, Math. Biosci. 65 (1983) 51. [3] E.M. Landaw, B.C-M. Chen, J.J. DiStefano III, An algorithm for the identi able parameter combinations of the general mamillary compartmental model, Math. Biosci. 72 (1984) 199. [4] B.C-M. Chen, E.M. Landaw, J.J. DiStefano III, Algorithms for the identi able parameter combinations and parameter bounds of unidenti able catenary compartmental models, Math. Biosci. 76 (1985) 59. [5] J.J. DiStefano III, B.C. Chen, E.M. Landaw, Pool size and mass ux bounds and quasiidenti ability conditions for catenary models, Math. Biosci. 88 (1988) 1.

17 P. Vicini et al. / Mathematical Biosciences 167 (2000) 145± [6] R. Lindell, J.J. DiStefano III, E. Landaw, Statistical variability of parameter bounds for n-pool unidenti able mammillary and catenary compartmental models, Math. Biosci. 91 (1988) 175. [7] K.R. Godfrey, Compartmental Models and Their Application, Academic Press, New York, [8] S. Vajda, J.J. DiStefano III, K. Godfrey, J. Fagarasan, Parameter space boundaries for unidenti able compartmental models, Math. Biosci. 97 (1989) 27. [9] C. Cobelli, G. To olo, Theoretical aspects and practical strategies for the identi cation of unidenti able compartmental systems, in: E. Walter (Ed.), Identi ability of Parametric Models, Pergamon, New York, 1987, p. 85. [10] D.H. Anderson, Compartmental Modeling and Tracer Kinetics, Springer, New York, [11] R.A. Brualdi, Introductory Combinatorics, Prentice-Hall, Englewood Cli s, MA, [12] S. Vajda, Structural equivalence of linear systems and compartmental models, Math. Biosci. 55 (1981) 39. [13] E. Landaw, J.J. DiStefano III, Multiexponential, multicompartmental and noncompartmental modeling: physiological data analysis and statistical considerations ± Part II: data analysis and statistical considerations, Am. J. Physiol. 246 (1984) R665. [14] C. Moler, MATLAB ± a mathematical visualization laboratory, in: Digest of Papers: COMPCON Spring 88, 33rd IEEE Computer Society International Conference, IEEE Computer Society Press, Washington, DC, 1988, p [15] P.H.R. Barrett, B.M. Bell, C. Cobelli, H. Golde, A. Schumitzky, P. Vicini, D.M. Foster, SAAM II: simulation, analysis, and modeling software for tracer and pharmacokinetic studies, Metabolism 47 (1998) 484.

IDENTIFIABILITY OF LINEAR COMPARTMENT MODELS: THE SINGULAR LOCUS. 1. Introduction

IDENTIFIABILITY OF LINEAR COMPARTMENT MODELS: THE SINGULAR LOCUS. 1. Introduction IDENTIFIABILITY OF LINEAR COMPARTMENT MODELS: THE SINGULAR LOCUS ELIZABETH GROSS, NICOLETTE MESHKAT, AND ANNE SHIU Abstract. This work addresses the problem of identifiability, that is, the question of

More information

Chapter 2. Dynamic panel data models

Chapter 2. Dynamic panel data models Chapter 2. Dynamic panel data models School of Economics and Management - University of Geneva Christophe Hurlin, Université of Orléans University of Orléans April 2018 C. Hurlin (University of Orléans)

More information

Time Series Models and Inference. James L. Powell Department of Economics University of California, Berkeley

Time Series Models and Inference. James L. Powell Department of Economics University of California, Berkeley Time Series Models and Inference James L. Powell Department of Economics University of California, Berkeley Overview In contrast to the classical linear regression model, in which the components of the

More information

A general procedure for rst/second-order reliability method (FORM/SORM)

A general procedure for rst/second-order reliability method (FORM/SORM) Structural Safety 21 (1999) 95±112 www.elsevier.nl/locate/strusafe A general procedure for rst/second-order reliability method (FORM/SORM) Yan-Gang Zhao*, Tetsuro Ono Department of Architecture, Nagoya

More information

Linear and convolution methods for the analysis of ground and excited state kinetics. Application to the monomer±excimer scheme

Linear and convolution methods for the analysis of ground and excited state kinetics. Application to the monomer±excimer scheme Chemical Physics 26 (2) 41±414 www.elsevier.nl/locate/chemphys Linear and convolution methods for the analysis of ground and excited state kinetics. Application to the monomer±excimer scheme M.N. Berberan-Santos

More information

Linearized methods for ordinary di erential equations

Linearized methods for ordinary di erential equations Applied Mathematics and Computation 104 (1999) 109±19 www.elsevier.nl/locate/amc Linearized methods for ordinary di erential equations J.I. Ramos 1 Departamento de Lenguajes y Ciencias de la Computacion,

More information

7 Semiparametric Methods and Partially Linear Regression

7 Semiparametric Methods and Partially Linear Regression 7 Semiparametric Metods and Partially Linear Regression 7. Overview A model is called semiparametric if it is described by and were is nite-dimensional (e.g. parametric) and is in nite-dimensional (nonparametric).

More information

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den University of Groningen System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)

More information

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M.

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M. Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M. Foster., Ph.D. University of Washington October 18, 2012

More information

GMM-based inference in the AR(1) panel data model for parameter values where local identi cation fails

GMM-based inference in the AR(1) panel data model for parameter values where local identi cation fails GMM-based inference in the AR() panel data model for parameter values where local identi cation fails Edith Madsen entre for Applied Microeconometrics (AM) Department of Economics, University of openhagen,

More information

An algorithm for symmetric generalized inverse eigenvalue problems

An algorithm for symmetric generalized inverse eigenvalue problems Linear Algebra and its Applications 296 (999) 79±98 www.elsevier.com/locate/laa An algorithm for symmetric generalized inverse eigenvalue problems Hua Dai Department of Mathematics, Nanjing University

More information

Notes on Time Series Modeling

Notes on Time Series Modeling Notes on Time Series Modeling Garey Ramey University of California, San Diego January 17 1 Stationary processes De nition A stochastic process is any set of random variables y t indexed by t T : fy t g

More information

Reliability of uncertain dynamical systems with multiple design points

Reliability of uncertain dynamical systems with multiple design points Structural Safety 21 (1999) 113±133 www.elsevier.nl/locate/strusafe Reliability of uncertain dynamical systems with multiple design points S.K. Au, C. Papadimitriou, J.L. Beck* Division of Engineering

More information

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M.

Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M. Noncompartmental vs. Compartmental Approaches to Pharmacokinetic Data Analysis Paolo Vicini, Ph.D. Pfizer Global Research and Development David M. Foster., Ph.D. University of Washington October 28, 2010

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

13 Endogeneity and Nonparametric IV

13 Endogeneity and Nonparametric IV 13 Endogeneity and Nonparametric IV 13.1 Nonparametric Endogeneity A nonparametric IV equation is Y i = g (X i ) + e i (1) E (e i j i ) = 0 In this model, some elements of X i are potentially endogenous,

More information

Linear estimation in models based on a graph

Linear estimation in models based on a graph Linear Algebra and its Applications 302±303 (1999) 223±230 www.elsevier.com/locate/laa Linear estimation in models based on a graph R.B. Bapat * Indian Statistical Institute, New Delhi 110 016, India Received

More information

Further discussion on linear production functions and DEA

Further discussion on linear production functions and DEA European Journal of Operational Research 127 (2000) 611±618 www.elsevier.com/locate/dsw Theory and Methodology Further discussion on linear production functions and DEA Joe Zhu * Department of Management,

More information

NP-hardness of the stable matrix in unit interval family problem in discrete time

NP-hardness of the stable matrix in unit interval family problem in discrete time Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and

More information

c 2005 Society for Industrial and Applied Mathematics

c 2005 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. XX, No. X, pp. XX XX c 005 Society for Industrial and Applied Mathematics DISTRIBUTIONS OF THE EXTREME EIGENVALUES OF THE COMPLEX JACOBI RANDOM MATRIX ENSEMBLE PLAMEN KOEV

More information

R = µ + Bf Arbitrage Pricing Model, APM

R = µ + Bf Arbitrage Pricing Model, APM 4.2 Arbitrage Pricing Model, APM Empirical evidence indicates that the CAPM beta does not completely explain the cross section of expected asset returns. This suggests that additional factors may be required.

More information

Supplemental Material 1 for On Optimal Inference in the Linear IV Model

Supplemental Material 1 for On Optimal Inference in the Linear IV Model Supplemental Material 1 for On Optimal Inference in the Linear IV Model Donald W. K. Andrews Cowles Foundation for Research in Economics Yale University Vadim Marmer Vancouver School of Economics University

More information

Panel Data. March 2, () Applied Economoetrics: Topic 6 March 2, / 43

Panel Data. March 2, () Applied Economoetrics: Topic 6 March 2, / 43 Panel Data March 2, 212 () Applied Economoetrics: Topic March 2, 212 1 / 43 Overview Many economic applications involve panel data. Panel data has both cross-sectional and time series aspects. Regression

More information

Defeasible logic versus Logic Programming without Negation as Failure

Defeasible logic versus Logic Programming without Negation as Failure The Journal of Logic Programming 42 (2000) 47±57 www.elsevier.com/locate/jlpr Defeasible logic versus Logic Programming without Negation as Failure G. Antoniou *, M.J. Maher, D. Billington School of Computing

More information

MATH 320, WEEK 7: Matrices, Matrix Operations

MATH 320, WEEK 7: Matrices, Matrix Operations MATH 320, WEEK 7: Matrices, Matrix Operations 1 Matrices We have introduced ourselves to the notion of the grid-like coefficient matrix as a short-hand coefficient place-keeper for performing Gaussian

More information

Global stabilization of feedforward systems with exponentially unstable Jacobian linearization

Global stabilization of feedforward systems with exponentially unstable Jacobian linearization Global stabilization of feedforward systems with exponentially unstable Jacobian linearization F Grognard, R Sepulchre, G Bastin Center for Systems Engineering and Applied Mechanics Université catholique

More information

Expressions for the covariance matrix of covariance data

Expressions for the covariance matrix of covariance data Expressions for the covariance matrix of covariance data Torsten Söderström Division of Systems and Control, Department of Information Technology, Uppsala University, P O Box 337, SE-7505 Uppsala, Sweden

More information

Chapter 6: Endogeneity and Instrumental Variables (IV) estimator

Chapter 6: Endogeneity and Instrumental Variables (IV) estimator Chapter 6: Endogeneity and Instrumental Variables (IV) estimator Advanced Econometrics - HEC Lausanne Christophe Hurlin University of Orléans December 15, 2013 Christophe Hurlin (University of Orléans)

More information

A formal statistical test for the number of factors in. the approximate factor models

A formal statistical test for the number of factors in. the approximate factor models A formal statistical test for the number of factors in the approximate factor models Alexei Onatski Economics Department, Columbia University September 26, 2006 Abstract In this paper we study i.i.d. sequences

More information

SOLVE LEAST ABSOLUTE VALUE REGRESSION PROBLEMS USING MODIFIED GOAL PROGRAMMING TECHNIQUES

SOLVE LEAST ABSOLUTE VALUE REGRESSION PROBLEMS USING MODIFIED GOAL PROGRAMMING TECHNIQUES Computers Ops Res. Vol. 25, No. 12, pp. 1137±1143, 1998 # 1998 Elsevier Science Ltd. All rights reserved Printed in Great Britain PII: S0305-0548(98)00016-1 0305-0548/98 $19.00 + 0.00 SOLVE LEAST ABSOLUTE

More information

Alternative to Ritt s Pseudodivision for finding the input-output equations in algebraic structural identifiability analysis

Alternative to Ritt s Pseudodivision for finding the input-output equations in algebraic structural identifiability analysis Abstract Alternative to Ritt s Pseudodivision for finding the input-output equations in algebraic structural identifiability analysis Nicolette Meshkat¹*, Chris Anderson², and Joseph J. DiStefano III³

More information

Comment on HAC Corrections for Strongly Autocorrelated Time Series by Ulrich K. Müller

Comment on HAC Corrections for Strongly Autocorrelated Time Series by Ulrich K. Müller Comment on HAC Corrections for Strongly Autocorrelated ime Series by Ulrich K. Müller Yixiao Sun Department of Economics, UC San Diego May 2, 24 On the Nearly-optimal est Müller applies the theory of optimal

More information

Riccati difference equations to non linear extended Kalman filter constraints

Riccati difference equations to non linear extended Kalman filter constraints International Journal of Scientific & Engineering Research Volume 3, Issue 12, December-2012 1 Riccati difference equations to non linear extended Kalman filter constraints Abstract Elizabeth.S 1 & Jothilakshmi.R

More information

Estimating the Number of Common Factors in Serially Dependent Approximate Factor Models

Estimating the Number of Common Factors in Serially Dependent Approximate Factor Models Estimating the Number of Common Factors in Serially Dependent Approximate Factor Models Ryan Greenaway-McGrevy y Bureau of Economic Analysis Chirok Han Korea University February 7, 202 Donggyu Sul University

More information

Inference about Clustering and Parametric. Assumptions in Covariance Matrix Estimation

Inference about Clustering and Parametric. Assumptions in Covariance Matrix Estimation Inference about Clustering and Parametric Assumptions in Covariance Matrix Estimation Mikko Packalen y Tony Wirjanto z 26 November 2010 Abstract Selecting an estimator for the variance covariance matrix

More information

Simple Estimators for Semiparametric Multinomial Choice Models

Simple Estimators for Semiparametric Multinomial Choice Models Simple Estimators for Semiparametric Multinomial Choice Models James L. Powell and Paul A. Ruud University of California, Berkeley March 2008 Preliminary and Incomplete Comments Welcome Abstract This paper

More information

4.3 - Linear Combinations and Independence of Vectors

4.3 - Linear Combinations and Independence of Vectors - Linear Combinations and Independence of Vectors De nitions, Theorems, and Examples De nition 1 A vector v in a vector space V is called a linear combination of the vectors u 1, u,,u k in V if v can be

More information

Re-sampling and exchangeable arrays University Ave. November Revised January Summary

Re-sampling and exchangeable arrays University Ave. November Revised January Summary Re-sampling and exchangeable arrays Peter McCullagh Department of Statistics University of Chicago 5734 University Ave Chicago Il 60637 November 1997 Revised January 1999 Summary The non-parametric, or

More information

2 Interval-valued Probability Measures

2 Interval-valued Probability Measures Interval-Valued Probability Measures K. David Jamison 1, Weldon A. Lodwick 2 1. Watson Wyatt & Company, 950 17th Street,Suite 1400, Denver, CO 80202, U.S.A 2. Department of Mathematics, Campus Box 170,

More information

Lecture 1- The constrained optimization problem

Lecture 1- The constrained optimization problem Lecture 1- The constrained optimization problem The role of optimization in economic theory is important because we assume that individuals are rational. Why constrained optimization? the problem of scarcity.

More information

The Kuhn-Tucker Problem

The Kuhn-Tucker Problem Natalia Lazzati Mathematics for Economics (Part I) Note 8: Nonlinear Programming - The Kuhn-Tucker Problem Note 8 is based on de la Fuente (2000, Ch. 7) and Simon and Blume (1994, Ch. 18 and 19). The Kuhn-Tucker

More information

Structural identifiability of linear mamillary compartmental systems

Structural identifiability of linear mamillary compartmental systems entrum voor Wiskunde en Informatica REPORTRAPPORT Structural identifiability of linear mamillary compartmental systems JM van den Hof Department of Operations Reasearch, Statistics, and System Theory S-R952

More information

Homoskedasticity. Var (u X) = σ 2. (23)

Homoskedasticity. Var (u X) = σ 2. (23) Homoskedasticity How big is the difference between the OLS estimator and the true parameter? To answer this question, we make an additional assumption called homoskedasticity: Var (u X) = σ 2. (23) This

More information

ECON0702: Mathematical Methods in Economics

ECON0702: Mathematical Methods in Economics ECON0702: Mathematical Methods in Economics Yulei Luo SEF of HKU January 12, 2009 Luo, Y. (SEF of HKU) MME January 12, 2009 1 / 35 Course Outline Economics: The study of the choices people (consumers,

More information

Cover page. : On-line damage identication using model based orthonormal. functions. Author : Raymond A. de Callafon

Cover page. : On-line damage identication using model based orthonormal. functions. Author : Raymond A. de Callafon Cover page Title : On-line damage identication using model based orthonormal functions Author : Raymond A. de Callafon ABSTRACT In this paper, a new on-line damage identication method is proposed for monitoring

More information

Math 4377/6308 Advanced Linear Algebra

Math 4377/6308 Advanced Linear Algebra 1.3 Subspaces Math 4377/6308 Advanced Linear Algebra 1.3 Subspaces Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377 Jiwen He, University of Houston

More information

On one-dimensional random fields with fixed end values

On one-dimensional random fields with fixed end values PREM 217 Probabilistic Engineering Mechanics 14 (1999) 31 31 On one-dimensional random fields with fixed end values RP Nordgren*, JP Conte 1 Department of Civil Engineering, Rice University, Houston, TX

More information

We would like to thank Elsevier, the owner of the copyright, for having granted us copyright permission to redistribute the following manuscript:

We would like to thank Elsevier, the owner of the copyright, for having granted us copyright permission to redistribute the following manuscript: We would like to thank Elsevier, the owner of the copyright, for having granted us copyright permission to redistribute the following manuscript: %DUU\5RQDOGDQG5.HOOH\3DFH $0RQWH&DUOR(VWLPDWRURIWKH/RJ

More information

Nonparametric Identi cation and Estimation of Truncated Regression Models with Heteroskedasticity

Nonparametric Identi cation and Estimation of Truncated Regression Models with Heteroskedasticity Nonparametric Identi cation and Estimation of Truncated Regression Models with Heteroskedasticity Songnian Chen a, Xun Lu a, Xianbo Zhou b and Yahong Zhou c a Department of Economics, Hong Kong University

More information

Ross (1976) introduced the Arbitrage Pricing Theory (APT) as an alternative to the CAPM.

Ross (1976) introduced the Arbitrage Pricing Theory (APT) as an alternative to the CAPM. 4.2 Arbitrage Pricing Model, APM Empirical evidence indicates that the CAPM beta does not completely explain the cross section of expected asset returns. This suggests that additional factors may be required.

More information

An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-p M -complementarity problems

An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-p M -complementarity problems Applied Mathematics and Computation 109 (2000) 167±182 www.elsevier.nl/locate/amc An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-p M -complementarity

More information

1 A Non-technical Introduction to Regression

1 A Non-technical Introduction to Regression 1 A Non-technical Introduction to Regression Chapters 1 and Chapter 2 of the textbook are reviews of material you should know from your previous study (e.g. in your second year course). They cover, in

More information

SIMILAR-ON-THE-BOUNDARY TESTS FOR MOMENT INEQUALITIES EXIST, BUT HAVE POOR POWER. Donald W. K. Andrews. August 2011

SIMILAR-ON-THE-BOUNDARY TESTS FOR MOMENT INEQUALITIES EXIST, BUT HAVE POOR POWER. Donald W. K. Andrews. August 2011 SIMILAR-ON-THE-BOUNDARY TESTS FOR MOMENT INEQUALITIES EXIST, BUT HAVE POOR POWER By Donald W. K. Andrews August 2011 COWLES FOUNDATION DISCUSSION PAPER NO. 1815 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS

More information

Gaussian process for nonstationary time series prediction

Gaussian process for nonstationary time series prediction Computational Statistics & Data Analysis 47 (2004) 705 712 www.elsevier.com/locate/csda Gaussian process for nonstationary time series prediction Soane Brahim-Belhouari, Amine Bermak EEE Department, Hong

More information

1 The Multiple Regression Model: Freeing Up the Classical Assumptions

1 The Multiple Regression Model: Freeing Up the Classical Assumptions 1 The Multiple Regression Model: Freeing Up the Classical Assumptions Some or all of classical assumptions were crucial for many of the derivations of the previous chapters. Derivation of the OLS estimator

More information

2 Formulation. = arg = 2 (1)

2 Formulation. = arg = 2 (1) Acoustic di raction by an impedance wedge Aladin H. Kamel (alaahassan.kamel@yahoo.com) PO Box 433 Heliopolis Center 11757, Cairo, Egypt Abstract. We consider the boundary-value problem for the Helmholtz

More information

Identifiability of linear compartmental models

Identifiability of linear compartmental models Identifiability of linear compartmental models Nicolette Meshkat North Carolina State University Parameter Estimation Workshop NCSU August 9, 2014 78 slides Structural Identifiability Analysis Linear Model:

More information

Some inequalities for sum and product of positive semide nite matrices

Some inequalities for sum and product of positive semide nite matrices Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,

More information

3 Random Samples from Normal Distributions

3 Random Samples from Normal Distributions 3 Random Samples from Normal Distributions Statistical theory for random samples drawn from normal distributions is very important, partly because a great deal is known about its various associated distributions

More information

Admission control schemes to provide class-level QoS in multiservice networks q

Admission control schemes to provide class-level QoS in multiservice networks q Computer Networks 35 (2001) 307±326 www.elsevier.com/locate/comnet Admission control schemes to provide class-level QoS in multiservice networks q Suresh Kalyanasundaram a,1, Edwin K.P. Chong b, Ness B.

More information

Epistemic independence for imprecise probabilities

Epistemic independence for imprecise probabilities International Journal of Approximate Reasoning 24 (2000) 235±250 www.elsevier.com/locate/ijar Epistemic independence for imprecise probabilities Paolo Vicig Dipartimento di Matematica Applicata ``B. de

More information

Lecture Notes 1: Vector spaces

Lecture Notes 1: Vector spaces Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector

More information

EEE 303 Notes: System properties

EEE 303 Notes: System properties EEE 303 Notes: System properties Kostas Tsakalis January 27, 2000 1 Introduction The purpose of this note is to provide a brief background and some examples on the fundamental system properties. In particular,

More information

Simplified marginal effects in discrete choice models

Simplified marginal effects in discrete choice models Economics Letters 81 (2003) 321 326 www.elsevier.com/locate/econbase Simplified marginal effects in discrete choice models Soren Anderson a, Richard G. Newell b, * a University of Michigan, Ann Arbor,

More information

Chapter 1. GMM: Basic Concepts

Chapter 1. GMM: Basic Concepts Chapter 1. GMM: Basic Concepts Contents 1 Motivating Examples 1 1.1 Instrumental variable estimator....................... 1 1.2 Estimating parameters in monetary policy rules.............. 2 1.3 Estimating

More information

Fuzzy control of a class of multivariable nonlinear systems subject to parameter uncertainties: model reference approach

Fuzzy control of a class of multivariable nonlinear systems subject to parameter uncertainties: model reference approach International Journal of Approximate Reasoning 6 (00) 9±44 www.elsevier.com/locate/ijar Fuzzy control of a class of multivariable nonlinear systems subject to parameter uncertainties: model reference approach

More information

ECONOMETRICS II (ECO 2401S) University of Toronto. Department of Economics. Spring 2013 Instructor: Victor Aguirregabiria

ECONOMETRICS II (ECO 2401S) University of Toronto. Department of Economics. Spring 2013 Instructor: Victor Aguirregabiria ECONOMETRICS II (ECO 2401S) University of Toronto. Department of Economics. Spring 2013 Instructor: Victor Aguirregabiria SOLUTION TO FINAL EXAM Friday, April 12, 2013. From 9:00-12:00 (3 hours) INSTRUCTIONS:

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries 1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social

More information

Economics 241B Estimation with Instruments

Economics 241B Estimation with Instruments Economics 241B Estimation with Instruments Measurement Error Measurement error is de ned as the error resulting from the measurement of a variable. At some level, every variable is measured with error.

More information

A dynamic tra c equilibrium assignment paradox

A dynamic tra c equilibrium assignment paradox Transportation Research Part B 34 (2) 515±531 www.elsevier.com/locate/trb A dynamic tra c equilibrium assignment paradox Takashi Akamatsu * Department of Knowledge-based Information Engineering, Toyohashi

More information

The generalized order-k Fibonacci Pell sequence by matrix methods

The generalized order-k Fibonacci Pell sequence by matrix methods Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University

More information

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis.

Vector spaces. DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis. Vector spaces DS-GA 1013 / MATH-GA 2824 Optimization-based Data Analysis http://www.cims.nyu.edu/~cfgranda/pages/obda_fall17/index.html Carlos Fernandez-Granda Vector space Consists of: A set V A scalar

More information

A Comparison between Linear and Nonlinear Forecasts for Nonlinear AR Models

A Comparison between Linear and Nonlinear Forecasts for Nonlinear AR Models JOURNAL OF FORECASTING, VOL. 6, 49±508 (997) A Comparison between Linear and Nonlinear Forecasts for Nonlinear AR Models MEIHUI GUO* AND Y. K. TSENG National Sun Yat-sen University, Taiwan, ROC ABSTRACT

More information

Notes on Generalized Method of Moments Estimation

Notes on Generalized Method of Moments Estimation Notes on Generalized Method of Moments Estimation c Bronwyn H. Hall March 1996 (revised February 1999) 1. Introduction These notes are a non-technical introduction to the method of estimation popularized

More information

Math 123, Week 2: Matrix Operations, Inverses

Math 123, Week 2: Matrix Operations, Inverses Math 23, Week 2: Matrix Operations, Inverses Section : Matrices We have introduced ourselves to the grid-like coefficient matrix when performing Gaussian elimination We now formally define general matrices

More information

Lessons in Estimation Theory for Signal Processing, Communications, and Control

Lessons in Estimation Theory for Signal Processing, Communications, and Control Lessons in Estimation Theory for Signal Processing, Communications, and Control Jerry M. Mendel Department of Electrical Engineering University of Southern California Los Angeles, California PRENTICE HALL

More information

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence)

Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector

More information

Thermal analysis of Li 2 O TeO 2 glass

Thermal analysis of Li 2 O TeO 2 glass Journal of Non-Crystalline Solids 271 (2000) 12±17 www.elsevier.com/locate/jnoncrysol Thermal analysis of Li 2 O TeO 2 glass I. Avramov a, *, G. Guinev a, A.C.M. Rodrigues b a Institute of Physical Chemistry,

More information

11. Bootstrap Methods

11. Bootstrap Methods 11. Bootstrap Methods c A. Colin Cameron & Pravin K. Trivedi 2006 These transparencies were prepared in 20043. They can be used as an adjunct to Chapter 11 of our subsequent book Microeconometrics: Methods

More information

The Degree of the Splitting Field of a Random Polynomial over a Finite Field

The Degree of the Splitting Field of a Random Polynomial over a Finite Field The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada fjdixon,danielg@math.carleton.ca

More information

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung Digital Signal Processing, Homework, Spring 203, Prof. C.D. Chung. (0.5%) Page 99, Problem 2.2 (a) The impulse response h [n] of an LTI system is known to be zero, except in the interval N 0 n N. The input

More information

Interactive Interference Alignment

Interactive Interference Alignment Interactive Interference Alignment Quan Geng, Sreeram annan, and Pramod Viswanath Coordinated Science Laboratory and Dept. of ECE University of Illinois, Urbana-Champaign, IL 61801 Email: {geng5, kannan1,

More information

ECONOMETRICS FIELD EXAM Michigan State University May 9, 2008

ECONOMETRICS FIELD EXAM Michigan State University May 9, 2008 ECONOMETRICS FIELD EXAM Michigan State University May 9, 2008 Instructions: Answer all four (4) questions. Point totals for each question are given in parenthesis; there are 00 points possible. Within

More information

UNIFORMLY MOST POWERFUL CYCLIC PERMUTATION INVARIANT DETECTION FOR DISCRETE-TIME SIGNALS

UNIFORMLY MOST POWERFUL CYCLIC PERMUTATION INVARIANT DETECTION FOR DISCRETE-TIME SIGNALS UNIFORMLY MOST POWERFUL CYCLIC PERMUTATION INVARIANT DETECTION FOR DISCRETE-TIME SIGNALS F. C. Nicolls and G. de Jager Department of Electrical Engineering, University of Cape Town Rondebosch 77, South

More information

Structure of the CAPM Covariance Matrix

Structure of the CAPM Covariance Matrix Structure of the CAPM Covariance Matrix James Bridgeman University of Connecticut UConn Actuarial Science Seminar September 10, 2014 (UConn Actuarial Science Seminar) CAPM September 10, 2014 1 / 24 INTENTIONS

More information

QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY

QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics

More information

arxiv:hep-ex/ v1 17 Sep 1999

arxiv:hep-ex/ v1 17 Sep 1999 Propagation of Errors for Matrix Inversion M. Lefebvre 1, R.K. Keeler 1, R. Sobie 1,2, J. White 1,3 arxiv:hep-ex/9909031v1 17 Sep 1999 Abstract A formula is given for the propagation of errors during matrix

More information

On the Power of Tests for Regime Switching

On the Power of Tests for Regime Switching On the Power of Tests for Regime Switching joint work with Drew Carter and Ben Hansen Douglas G. Steigerwald UC Santa Barbara May 2015 D. Steigerwald (UCSB) Regime Switching May 2015 1 / 42 Motivating

More information

Finansiell Statistik, GN, 15 hp, VT2008 Lecture 15: Multiple Linear Regression & Correlation

Finansiell Statistik, GN, 15 hp, VT2008 Lecture 15: Multiple Linear Regression & Correlation Finansiell Statistik, GN, 5 hp, VT28 Lecture 5: Multiple Linear Regression & Correlation Gebrenegus Ghilagaber, PhD, ssociate Professor May 5, 28 Introduction In the simple linear regression Y i = + X

More information

Confidence intervals and the Feldman-Cousins construction. Edoardo Milotti Advanced Statistics for Data Analysis A.Y

Confidence intervals and the Feldman-Cousins construction. Edoardo Milotti Advanced Statistics for Data Analysis A.Y Confidence intervals and the Feldman-Cousins construction Edoardo Milotti Advanced Statistics for Data Analysis A.Y. 2015-16 Review of the Neyman construction of the confidence intervals X-Outline of a

More information

Föreläsning /31

Föreläsning /31 1/31 Föreläsning 10 090420 Chapter 13 Econometric Modeling: Model Speci cation and Diagnostic testing 2/31 Types of speci cation errors Consider the following models: Y i = β 1 + β 2 X i + β 3 X 2 i +

More information

Stochastic Processes

Stochastic Processes Introduction and Techniques Lecture 4 in Financial Mathematics UiO-STK4510 Autumn 2015 Teacher: S. Ortiz-Latorre Stochastic Processes 1 Stochastic Processes De nition 1 Let (E; E) be a measurable space

More information

M. Matrices and Linear Algebra

M. Matrices and Linear Algebra M. Matrices and Linear Algebra. Matrix algebra. In section D we calculated the determinants of square arrays of numbers. Such arrays are important in mathematics and its applications; they are called matrices.

More information

MATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c

MATH 2030: MATRICES. Example 0.2. Q:Define A 1 =, A. 3 4 A: We wish to find c 1, c 2, and c 3 such that. c 1 + c c MATH 2030: MATRICES Matrix Algebra As with vectors, we may use the algebra of matrices to simplify calculations. However, matrices have operations that vectors do not possess, and so it will be of interest

More information

Unsupervised Learning with Permuted Data

Unsupervised Learning with Permuted Data Unsupervised Learning with Permuted Data Sergey Kirshner skirshne@ics.uci.edu Sridevi Parise sparise@ics.uci.edu Padhraic Smyth smyth@ics.uci.edu School of Information and Computer Science, University

More information

MATH 3511 Lecture 1. Solving Linear Systems 1

MATH 3511 Lecture 1. Solving Linear Systems 1 MATH 3511 Lecture 1 Solving Linear Systems 1 Dmitriy Leykekhman Spring 2012 Goals Review of basic linear algebra Solution of simple linear systems Gaussian elimination D Leykekhman - MATH 3511 Introduction

More information

ROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems

ROYAL INSTITUTE OF TECHNOLOGY KUNGL TEKNISKA HÖGSKOLAN. Department of Signals, Sensors & Systems The Evil of Supereciency P. Stoica B. Ottersten To appear as a Fast Communication in Signal Processing IR-S3-SB-9633 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems Signal Processing

More information

THE MINIMAL OVERLAP COST SHARING RULE

THE MINIMAL OVERLAP COST SHARING RULE THE MINIMAL OVERLAP COST SHARING RULE M. J. ALBIZURI*, J. C. SANTOS Abstract. In this paper we introduce a new cost sharing rule-the minimal overlap cost sharing rule-which is associated with the minimal

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

Analytical dynamics with constraint forces that do work in virtual displacements

Analytical dynamics with constraint forces that do work in virtual displacements Applied Mathematics Computation 121 2001) 211±217 www.elsevier.com/locate/amc Analytical dynamics with constraint forces that do work in virtual displacements Robert Kalaba *, Firdaus Udwadia Department

More information