E-optimal approximate block designs for treatment-control comparisons

Size: px
Start display at page:

Download "E-optimal approximate block designs for treatment-control comparisons"

Transcription

1 E-optimal approximate block designs for treatment-control comparisons Samuel Rosa 1 1 Faculty of Mathematics, Physics and Informatics, Comenius University in Bratislava, Slovakia We study E-optimal block designs for comparing a set of test treatments with a control treatment. We provide the complete class of all E-optimal approximate block designs and we show that these designs are characterized by simple linear constraints. Employing the provided characterization, we obtain a class of E-optimal exact block designs with unequal block sizes for comparing test treatments with a control. Keywords: Optimal design, Block design, Approximate design, Control treatment, E-optimality 1 Introduction Consider a blocking experiment for comparing a set of test treatments with a control. As noted in [4], the experimental objective of comparing the test treatments with a control arises, for instance, in screening experiments or in experiments in which it is desired to assess the relative performance of new test treatments with respect to the standard treatment. Such objective is also quite natural for medical studies involving placebo (e.g., see [12], [11]). Formally, we have Y j = µ + τ i(j) + θ k(j) + ε j, j = 1,..., n, where µ is the overall mean, τ i is the effect of the i-th treatment (0 i v), θ k is the effect of the k-th block (1 k d), and the random errors ε 1,..., ε n are uncorrelated, with zero mean and variance σ 2 <. Treatment 0 denotes the control, and the test treatments are numbered 1,..., v. By τ, we denote the vector of treatment effects and by θ the vector of block effects. The assumed objective of the experiment is to estimate the comparisons of the test treatments with the control τ i τ 0 (1 i v) or comparisons with the control in short. Let Q := ( 1 v, I v ) T, where 1 v is the column vector of ones of Corresponding author: samuel.rosa@fmph.uniba.sk

2 PPP S. Rosa length v and I v is the identity matrix. Then, the experimental objective can be expressed as the estimation of Q T τ. There is a large amount of literature on optimal exact designs for test treatment-control comparisons, mostly considering the A- and M V -optimality criteria; for a survey, see [4] or [5]. The E-optimality criterion also received some attention; see [6], [8], [7]. In this paper, we provide the class of all E-optimal approximate block designs for comparisons with the control. Based on the obtained class of optimal approximate designs, we provide a class of E-optimal exact designs, which extends the known results on E-optimality to the case of unequal block sizes. 1.1 Experimental design An exact design ξ e determines in each block the numbers of trials that are performed with the various treatments. Thus, ξ e can be expressed as a function ξ e : {0,..., v} {1,..., d} {0, 1, 2,..., n} such that i,k ξ e(i, k) = n. The value ξ e (i, k) determines the number of trials performed with treatment i in block k. Suppose that the blocks 1,..., d have pre-specified non-zero sizes m 1,..., m d. We denote the class of all block designs for v + 1 treatments and d blocks of sizes m = (m 1,..., m d ) T by D(v, d, m). An approximate design (or simply a design) is a function ξ : {0,..., v} {1,..., d} [0, 1], such that i,k ξ(i, k) = 1. The value ξ(i, k) represents the proportion of all trials that are performed with treatment i in block k. For a given design ξ, let us denote the design matrix X(ξ) := (ξ(i, k)) i,k, let r(ξ) := X(ξ)1 d be the vector of total treatment proportions and let s(ξ) := X T (ξ)1 v be the vector of relative block sizes. Because we consider non-zero block sizes, we always have s(ξ) > 0. The information matrix of a design ξ for estimating all pairwise comparisons of treatments is M(ξ) := diag(r(ξ)) X(ξ)diag 1 (s(ξ))x T (ξ), where diag 1 (s(ξ)) := diag(s 1 1 (ξ),..., s 1 d (ξ)). The parameter system QT τ is said to be estimable under an approximate design ξ if C(Q) C(M(ξ)), where C denotes the column space. In such a case, we say that ξ is feasible and we have rank(m(ξ)) = v. The information matrix N(ξ) := (Q T M (ξ)q) 1 of a feasible design ξ for estimating Q T τ is obtained by deleting the first row and column of M(ξ) (see [1], [3]). Let us partition X(ξ) as X T (ξ) = (z(ξ), Z T (ξ)), where z(ξ) is a d 1 vector; i.e., Z(ξ) = (ξ(i, k)) i>0,k. Then, the information matrix for comparing the test treatments with the control is N(ξ) = diag(r 1 (ξ),..., r v (ξ)) Z(ξ)diag 1 (s(ξ))z T (ξ). (1) Note that N(ξ) is proportional to the inverse of the covariance matrix of the

3 E-optimal block designs for treatment-control comparisons PPP least squares estimator of τ 1 τ 0,..., τ v τ 0. A design is said to be Ψ-optimal if it minimizes Ψ(N(ξ)) for some function Ψ. We say that a design ξ that satisfies ξ(i, k) = r i s k is a product design of r and s. We denote such design as ξ = r s. 2 E-optimality We denote the largest (smallest) eigenvalue of a symmetric matrix A by λ max (A) (λ min (A)). A design is E-optimal if it minimizes λ max (N 1 (ξ)) or, equivalently, if it maximizes λ min (N(ξ)). Such a design minimizes the maximum variance for the linear combinations i>0 x iτ i ( i>0 x i)τ 0 over all normalized x R v. In the following theorem, we provide the complete characterization of E- optimal block designs for comparing the test treatments with the control: an approximate design ξ is E-optimal for the comparisons with the control if and only if (i) in each block, ξ assigns one half of the trials to the control and (ii) ξ is equireplicated in the test treatments. Theorem 1. An approximate block design ξ is E-optimal for the comparisons with the control if and only if it satisfies ξ(0, k) = s k(ξ) 2 and r 1 (ξ) =... = r v (ξ) = 1 2v. (2) Proof. Let ξ be E-optimal. From Theorems 1 and 6 of [10] it follows that an E-optimal design must satisfy r 0 (ξ) = 1/2 and r i (ξ) = 1/(2v) for i > 0, and that the optimal value of λ min (N(ξ)) is λ min = 1/(4v). Moreover, λ min (N(ξ)) = min x T N(ξ)x 1 x T x=1 v 1T v N(ξ)1 v ( ) = 1 d 1 r i (ξ) v s i>0 k (ξ) ( ξ(i, k)) 2 k=1 i>0 = 1 2v 1 d (q k ) 2 v s k (ξ), k=1 where q k := i>0 ξ(i, k) (1 k d). Because k ξ(0, k) = 1/2, we have k q k = 1/2. Therefore, for fixed s(ξ), the following holds (which can be seen by finding the minimum of the function on the left-hand side): d k=1 q 2 k s k (ξ) d (s k (ξ)/2) 2 = 1 s k (ξ) 4, k=1

4 PPP S. Rosa i\k /6 1/6 1/12 1/12 1 1/6 1/ /12 1/12 1/12 Table 1: E-optimal approximate block design ξ for comparing two test treatments with the control in 4 blocks of relative sizes s = (1/3, 1/3, 1/6, 1/6) T. The value on position (i, k) represents ξ(i, k). using the fact that k s k(ξ) = 1. The inequality is attained as equality if and only if q k = s k (ξ)/2 for all k = 1,..., d. Hence, λ min (N(ξ)) 1 2v 1 4v = 1 4v = λ min. (3) Since ξ is E-optimal, the inequality is attained as equality, and thus ξ(1, k) = s k (ξ)/2 for all k = 1,..., d. For the converse part, let ξ satisfy (2). Then, ξ is connected (see [2]) and therefore feasible. Moreover, Z T (ξ)1 v = s(ξ)/2 and Z(ξ)1 d = (2v) 1 1 v. Therefore, N(ξ)1 v = 1 2v 1 v 1 2 Z(ξ)diag 1 (s(ξ))s(ξ) = 1 2v 1 v 1 2 Z(ξ)1 d. Thus, N(ξ)1 v = [1/(2v) 1/(4v)]1 v = (4v) 1 1 v. That is, λ = 1/(4v) is an eigenvalue of N(ξ) corresponding to the eigenvector 1 v. Therefore, it suffices to prove that λ is the smallest eigenvalue of N(ξ). Let N(ξ) = (n ij ) i,j. We note that n ij 0 for i j. Using an argument similar to that in Theorem 3.1 of [6], let x be an eigenvector of N(ξ). Let us denote the eigenvalue that corresponds to x as λ. By multiplying x by an appropriate constant, we obtain max j x j = 1. Thus, x j 1 for all 1 j v. Let i be the index that satisfies x i = 1. Then, by multiplying x by ±1, we obtain x i = 1. Now, we can write (N(ξ)x) i = n ii x i + j i n ij x j n ii + j i n ij = (N(ξ)1 v ) i, where the inequality follows from n ij 0 for j i, and x j 1 for 1 j v. Because (N(ξ)x) i = λx i = λ and (N(ξ)1 v ) i = λ, we have λ λ for any eigenvalue λ. Table 1 gives an E-optimal block design provided by Theorem 1. Theorem 1 is a generalization of Theorems 1 and 2 of [11], where E-optimal block designs

5 E-optimal block designs for treatment-control comparisons PPP i\k Table 2: Exact block design ξ e for given block sizes m = (2, 2, 4) T, which is E-optimal for comparing two test treatments with the control. The value on position (i, k) represents ξ e (i, k). for comparisons with the placebo (control) for specific experimental settings are provided. 3 Exact Designs For a strictly convex criterion, the only optimal approximate block designs are product designs with optimal treatment proportions (see [10]). For example, for given relative block sizes s, the product design ξ = r s, where r 0 = v 1 v 1, r 1 =... = r v = v 1 v(v 1), is the single A-optimal, as well as the single MV -optimal design, see [3], [10]. It is rather difficult to obtain optimal or efficient exact designs from such designs, e.g., by rounding methods (see Chapter 12 of [9]). However, since E-optimality lacks strict convexity, the class of E-optimal designs is richer, and efficient exact designs can be obtained by the rounding methods more easily. Moreover, this allows for a simple construction of optimal exact designs for a wide range of experimental settings. We easily obtain the following theorem that provides a class of E-optimal exact designs for unequal block sizes. Theorem 2. If there exists an exact design ξe D(v, d, m) that satisfies ξe(0, k) = m k /2, 1 k d, and ξe is equireplicated in the test treatments, then ξe is E-optimal for test treatment-control comparisons in D(v, d, m). Proof. The approximate version ξ e /n of ξ e is in fact an E-optimal approximate design, because it satisfies the conditions of Theorem 1. Then, ξ e is clearly an E-optimal exact design, because the class of approximate designs is a relaxation of the class of the normalized exact designs ξ e /n. Theorem 2 generalizes Theorem 3.1 of [6], which provides E-optimal block designs for blocks of equal size, to blocks of unequal sizes. An E-optimal design given by Theorem 2 is provided in Table 2.

6 PPP S. Rosa Acknowledgements: This work was supported by the Slovak Scientific Grant Agency [grant VEGA 1/0521/16]. References [1] R. E. Bechhofer and A. C. Tamhane. Incomplete block designs for comparing treatments with a control: General theory. Technometrics, 23(1):45 57, [2] J. A. Eccleston and A. Hedayat. On the theory of connected designs: characterization and optimality. Ann. Stat., 2(6): , [3] A. Giovagnoli and H. P. Wynn. Schur-optimal continuous block designs for treatments with a control. In L. M. Le Cam and R. A. Olshen, editors, Proceedings of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer, pages , California, Wadsworth. [4] A. S. Hedayat, M. Jacroux, and D. Majumdar. Optimal designs for comparing test treatments with controls. Stat. Sci., 3(4): , [5] D. Majumdar. Optimal and efficient treatment-control designs. In S. Ghosh and C. R. Rao, editors, Handbook of statistics 13: Design and Analysis of Experiments, pages North Holland, Amsterdam, [6] D. Majumdar and W. I. Notz. Optimal incomplete block designs for comparing treatments with a control. Ann. Stat., 11(1): , [7] J. P. Morgan and X. Wang. E-optimality in treatment versus control experiments. J. Stat. Theory Pract., 5(1):99 107, [8] W. I. Notz. Optimal designs for treatment-control comparisons in the presence of two-way heterogeneity. J. Stat. Plan. Infer., 12:61 73, [9] F. Pukelsheim. Optimal design of experiments. SIAM, Philadelphia, [10] S. Rosa and R. Harman. Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects. Stat. Pap., 57(4): , [11] S. Rosa and R. Harman. Optimal approximate designs for comparison with control in dose-escalation studies. TEST, 2017 (to appear). [12] S. J. Senn. Statistical Issues in Drug Development. Wiley, Chichester, 1997.

Designs for Multiple Comparisons of Control versus Treatments

Designs for Multiple Comparisons of Control versus Treatments Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 3 (018), pp. 393-409 Research India Publications http://www.ripublication.com Designs for Multiple Comparisons of Control

More information

Optimal experimental design, an introduction, Jesús López Fidalgo

Optimal experimental design, an introduction, Jesús López Fidalgo Optimal experimental design, an introduction Jesus.LopezFidalgo@uclm.es University of Castilla-La Mancha Department of Mathematics Institute of Applied Mathematics to Science and Engineering Books (just

More information

Stochastic Design Criteria in Linear Models

Stochastic Design Criteria in Linear Models AUSTRIAN JOURNAL OF STATISTICS Volume 34 (2005), Number 2, 211 223 Stochastic Design Criteria in Linear Models Alexander Zaigraev N. Copernicus University, Toruń, Poland Abstract: Within the framework

More information

Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties

Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties HONGQUAN XU Department of Statistics, University of California, Los Angeles, CA 90095-1554, U.S.A. (hqxu@stat.ucla.edu)

More information

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION CHAPTER 3 CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION 3.1 Introduction 3.2 Historical Review 3.3 Preliminary Results 3.4 Construction of RG Designs using a BIB design with b

More information

A-optimal diallel crosses for test versus control comparisons. Summary. 1. Introduction

A-optimal diallel crosses for test versus control comparisons. Summary. 1. Introduction A-otimal diallel crosses for test versus control comarisons By ASHISH DAS Indian Statistical Institute, New Delhi 110 016, India SUDHIR GUPTA Northern Illinois University, Dekal, IL 60115, USA and SANPEI

More information

Universal Optimality of Balanced Uniform Crossover Designs

Universal Optimality of Balanced Uniform Crossover Designs Universal Optimality of Balanced Uniform Crossover Designs A.S. Hedayat and Min Yang Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago Abstract Kunert (1984)

More information

arxiv: v1 [stat.co] 7 Sep 2017

arxiv: v1 [stat.co] 7 Sep 2017 Computing optimal experimental designs with respect to a compound Bayes risk criterion arxiv:1709.02317v1 [stat.co] 7 Sep 2017 Radoslav Harman, and Maryna Prus September 8, 2017 Abstract We consider the

More information

UNIVERSAL OPTIMALITY OF BALANCED UNIFORM CROSSOVER DESIGNS 1

UNIVERSAL OPTIMALITY OF BALANCED UNIFORM CROSSOVER DESIGNS 1 The Annals of Statistics 2003, Vol. 31, No. 3, 978 983 Institute of Mathematical Statistics, 2003 UNIVERSAL OPTIMALITY OF BALANCED UNIFORM CROSSOVER DESIGNS 1 BY A. S. HEDAYAT AND MIN YANG University of

More information

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Statistica Sinica 12(2002), 905-916 QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Kashinath Chatterjee, Ashish Das and Aloke Dey Asutosh College, Calcutta and Indian Statistical Institute,

More information

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS CHAPTER 4 CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS 4.1 Introduction 4.2 Historical Review 4.3 Preliminary Results 4.4 Methods of Construction of SRG Designs 4.4.1 Construction using BIB Designs with

More information

PROBABILITY AND STATISTICS Vol. III - Statistical Experiments and Optimal Design - Andrej Pázman STATISTICAL EXPERIMENTS AND OPTIMAL DESIGN

PROBABILITY AND STATISTICS Vol. III - Statistical Experiments and Optimal Design - Andrej Pázman STATISTICAL EXPERIMENTS AND OPTIMAL DESIGN STATISTICAL EXPERIMENTS AND OPTIMAL DESIGN Andrej Pázman Comenius University, Bratislava, Slovakia Keywords: Experiment design, linear statistical model, nonlinear regression, least squares, information

More information

Matrices: 2.1 Operations with Matrices

Matrices: 2.1 Operations with Matrices Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,

More information

A-efficient balanced treatment incomplete block designs

A-efficient balanced treatment incomplete block designs isid/ms/2002/25 October 4, 2002 http://www.isid.ac.in/ statmath/eprints A-efficient balanced treatment incomplete block designs Ashish Das Aloke Dey Sanpei Kageyama and Kishore Sinha Indian Statistical

More information

Construction of Pair-wise Balanced Design

Construction of Pair-wise Balanced Design Journal of Modern Applied Statistical Methods Volume 15 Issue 1 Article 11 5-2016 onstruction of Pair-wise Balanced Design Rajarathinam Arunachalam Manonmaniam Sundaranar University, arrathinam@yahoo.com

More information

Balanced Treatment-Control Row-Column Designs

Balanced Treatment-Control Row-Column Designs International Journal of Theoretical & Applied Sciences, 5(2): 64-68(2013) ISSN No. (Print): 0975-1718 ISSN No. (Online): 2249-3247 Balanced Treatment-Control Row-Column Designs Kallol Sarkar, Cini Varghese,

More information

ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE

ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE Sankhyā : The Indian Journal of Statistics 999, Volume 6, Series B, Pt. 3, pp. 488 495 ON D-OPTIMAL DESIGNS FOR ESTIMATING SLOPE By S. HUDA and A.A. AL-SHIHA King Saud University, Riyadh, Saudi Arabia

More information

2. Matrix Algebra and Random Vectors

2. Matrix Algebra and Random Vectors 2. Matrix Algebra and Random Vectors 2.1 Introduction Multivariate data can be conveniently display as array of numbers. In general, a rectangular array of numbers with, for instance, n rows and p columns

More information

4. Algebra and Duality

4. Algebra and Duality 4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone

More information

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs DOI:.55/bile-5- Biometrical Letters Vol. 5 (5), No., - X - -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs Ryszard Walkowiak Department

More information

Some Construction Methods of Optimum Chemical Balance Weighing Designs I

Some Construction Methods of Optimum Chemical Balance Weighing Designs I Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 4(6): 778-783 Scholarlin Research Institute Journals, 3 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

Spectral Clustering. Guokun Lai 2016/10

Spectral Clustering. Guokun Lai 2016/10 Spectral Clustering Guokun Lai 2016/10 1 / 37 Organization Graph Cut Fundamental Limitations of Spectral Clustering Ng 2002 paper (if we have time) 2 / 37 Notation We define a undirected weighted graph

More information

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We

More information

EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS

EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS Statistica Sinica 18(2008), 135-154 EXACT OPTIMAL DESIGNS FOR WEIGHTED LEAST SQUARES ANALYSIS WITH CORRELATED ERRORS Holger Dette, Joachim Kunert and Andrey Pepelyshev Ruhr-Universität Bochum, Universität

More information

OPTIMAL DESIGNS FOR COMPLETE INTERACTION. By Rainer Schwabe. Freie Universitat Berlin

OPTIMAL DESIGNS FOR COMPLETE INTERACTION. By Rainer Schwabe. Freie Universitat Berlin 1 OPTIMAL DESIGNS FOR COMPLETE INTERACTION STRUCTURES By Rainer Schwabe Freie Universitat Berlin In linear models with complete interaction structures product type designs are shown to be q -optimal for

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize

More information

D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors

D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors Journal of Data Science 920), 39-53 D-Optimal Designs for Second-Order Response Surface Models with Qualitative Factors Chuan-Pin Lee and Mong-Na Lo Huang National Sun Yat-sen University Abstract: Central

More information

Optimization Theory. A Concise Introduction. Jiongmin Yong

Optimization Theory. A Concise Introduction. Jiongmin Yong October 11, 017 16:5 ws-book9x6 Book Title Optimization Theory 017-08-Lecture Notes page 1 1 Optimization Theory A Concise Introduction Jiongmin Yong Optimization Theory 017-08-Lecture Notes page Optimization

More information

Statistics & Data Sciences: First Year Prelim Exam May 2018

Statistics & Data Sciences: First Year Prelim Exam May 2018 Statistics & Data Sciences: First Year Prelim Exam May 2018 Instructions: 1. Do not turn this page until instructed to do so. 2. Start each new question on a new sheet of paper. 3. This is a closed book

More information

Exact optimal designs for weighted least squares analysis with correlated errors

Exact optimal designs for weighted least squares analysis with correlated errors Exact optimal designs for weighted least squares analysis with correlated errors Holger Dette Ruhr-Universität Bochum Fakultät für Mathematik 44780 Bochum, Germany e-mail: holger.dette@rub.de Joachim Kunert

More information

Some Construction Methods of Optimum Chemical Balance Weighing Designs II

Some Construction Methods of Optimum Chemical Balance Weighing Designs II Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 5(): 39-44 Scholarlin Research Institute Journals, 4 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

A Study on Minimal-point Composite Designs

A Study on Minimal-point Composite Designs A Study on Minimal-point Composite Designs by Yin-Jie Huang Advisor Ray-Bing Chen Institute of Statistics, National University of Kaohsiung Kaohsiung, Taiwan 8 R.O.C. July 007 Contents Introduction Construction

More information

Optimal designs for estimating the slope of a regression

Optimal designs for estimating the slope of a regression Optimal designs for estimating the slope of a regression Holger Dette Ruhr-Universität Bochum Fakultät für Mathematik 4480 Bochum, Germany e-mail: holger.dette@rub.de Viatcheslav B. Melas St. Petersburg

More information

Fixed Effects, Invariance, and Spatial Variation in Intergenerational Mobility

Fixed Effects, Invariance, and Spatial Variation in Intergenerational Mobility American Economic Review: Papers & Proceedings 2016, 106(5): 400 404 http://dx.doi.org/10.1257/aer.p20161082 Fixed Effects, Invariance, and Spatial Variation in Intergenerational Mobility By Gary Chamberlain*

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 436 01 874 887 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Maximal determinant

More information

MATH 4211/6211 Optimization Constrained Optimization

MATH 4211/6211 Optimization Constrained Optimization MATH 4211/6211 Optimization Constrained Optimization Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 Constrained optimization

More information

Optimal Blocking by Minimizing the Maximum Within-Block Distance

Optimal Blocking by Minimizing the Maximum Within-Block Distance Optimal Blocking by Minimizing the Maximum Within-Block Distance Michael J. Higgins Jasjeet Sekhon Princeton University University of California at Berkeley November 14, 2013 For the Kansas State University

More information

Approximate Optimal Designs for Multivariate Polynomial Regression

Approximate Optimal Designs for Multivariate Polynomial Regression Approximate Optimal Designs for Multivariate Polynomial Regression Fabrice Gamboa Collaboration with: Yohan de Castro, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre Universität Potsdam 16th of February

More information

Minimax design criterion for fractional factorial designs

Minimax design criterion for fractional factorial designs Ann Inst Stat Math 205 67:673 685 DOI 0.007/s0463-04-0470-0 Minimax design criterion for fractional factorial designs Yue Yin Julie Zhou Received: 2 November 203 / Revised: 5 March 204 / Published online:

More information

A71-A REENT DISC OVERIES ON A-OPTIMAL DESIGNS FOR COMPARING 1/1 TES TR EATMENTS MIT (U) ILLINOIS UNIV AT CHICAGO CIRCLE STATISTICAL LAB A S

A71-A REENT DISC OVERIES ON A-OPTIMAL DESIGNS FOR COMPARING 1/1 TES TR EATMENTS MIT (U) ILLINOIS UNIV AT CHICAGO CIRCLE STATISTICAL LAB A S A71-A174 945 REENT DISC OVERIES ON A-OPTIMAL DESIGNS FOR COMPARING 1/1 TES TR EATMENTS MIT (U) ILLINOIS UNIV AT CHICAGO CIRCLE STATISTICAL LAB A S NEDAVAT ET AL JUN 86 UNCLASSIFIED TR-86-4AFOSR-T - ia-8-03853f/g

More information

Tropical Optimization Framework for Analytical Hierarchy Process

Tropical Optimization Framework for Analytical Hierarchy Process Tropical Optimization Framework for Analytical Hierarchy Process Nikolai Krivulin 1 Sergeĭ Sergeev 2 1 Faculty of Mathematics and Mechanics Saint Petersburg State University, Russia 2 School of Mathematics

More information

Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015

Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic

More information

On construction of constrained optimum designs

On construction of constrained optimum designs On construction of constrained optimum designs Institute of Control and Computation Engineering University of Zielona Góra, Poland DEMA2008, Cambridge, 15 August 2008 Numerical algorithms to construct

More information

Linear programs, convex polyhedra, extreme points

Linear programs, convex polyhedra, extreme points MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear

More information

Principal Component Analysis (PCA) Our starting point consists of T observations from N variables, which will be arranged in an T N matrix R,

Principal Component Analysis (PCA) Our starting point consists of T observations from N variables, which will be arranged in an T N matrix R, Principal Component Analysis (PCA) PCA is a widely used statistical tool for dimension reduction. The objective of PCA is to find common factors, the so called principal components, in form of linear combinations

More information

OPTIMAL DESIGNS FOR GENERALIZED LINEAR MODELS WITH MULTIPLE DESIGN VARIABLES

OPTIMAL DESIGNS FOR GENERALIZED LINEAR MODELS WITH MULTIPLE DESIGN VARIABLES Statistica Sinica 21 (2011, 1415-1430 OPTIMAL DESIGNS FOR GENERALIZED LINEAR MODELS WITH MULTIPLE DESIGN VARIABLES Min Yang, Bin Zhang and Shuguang Huang University of Missouri, University of Alabama-Birmingham

More information

Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs

Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs arxiv:0907.052v stat.me 3 Jul 2009 Satoshi Aoki July, 2009 Abstract We present some optimal criteria to

More information

Multivariate Statistical Analysis

Multivariate Statistical Analysis Multivariate Statistical Analysis Fall 2011 C. L. Williams, Ph.D. Lecture 4 for Applied Multivariate Analysis Outline 1 Eigen values and eigen vectors Characteristic equation Some properties of eigendecompositions

More information

AP-Optimum Designs for Minimizing the Average Variance and Probability-Based Optimality

AP-Optimum Designs for Minimizing the Average Variance and Probability-Based Optimality AP-Optimum Designs for Minimizing the Average Variance and Probability-Based Optimality Authors: N. M. Kilany Faculty of Science, Menoufia University Menoufia, Egypt. (neveenkilany@hotmail.com) W. A. Hassanein

More information

A-optimal designs for generalized linear model with two parameters

A-optimal designs for generalized linear model with two parameters A-optimal designs for generalized linear model with two parameters Min Yang * University of Missouri - Columbia Abstract An algebraic method for constructing A-optimal designs for two parameter generalized

More information

Example: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma

Example: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma 4-1 Algebra and Duality P. Parrilo and S. Lall 2006.06.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone of valid

More information

Balanced Nested Designs and Balanced n-ary Designs

Balanced Nested Designs and Balanced n-ary Designs Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki

More information

Efficient algorithms for calculating optimal designs in pharmacokinetics and dose finding studies

Efficient algorithms for calculating optimal designs in pharmacokinetics and dose finding studies Efficient algorithms for calculating optimal designs in pharmacokinetics and dose finding studies Tim Holland-Letz Ruhr-Universität Bochum Medizinische Fakultät 44780 Bochum, Germany email: tim.holland-letz@rub.de

More information

Comparison of prediction quality of the best linear unbiased predictors in time series linear regression models

Comparison of prediction quality of the best linear unbiased predictors in time series linear regression models 1 Comparison of prediction quality of the best linear unbiased predictors in time series linear regression models Martina Hančová Institute of Mathematics, P. J. Šafárik University in Košice Jesenná 5,

More information

STAT 830 Hypothesis Testing

STAT 830 Hypothesis Testing STAT 830 Hypothesis Testing Richard Lockhart Simon Fraser University STAT 830 Fall 2018 Richard Lockhart (Simon Fraser University) STAT 830 Hypothesis Testing STAT 830 Fall 2018 1 / 30 Purposes of These

More information

UCLA Department of Statistics Papers

UCLA Department of Statistics Papers UCLA Department of Statistics Papers Title An Algorithm for Constructing Orthogonal and Nearly Orthogonal Arrays with Mixed Levels and Small Runs Permalink https://escholarship.org/uc/item/1tg0s6nq Author

More information

CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization

CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization CSCI 1951-G Optimization Methods in Finance Part 10: Conic Optimization April 6, 2018 1 / 34 This material is covered in the textbook, Chapters 9 and 10. Some of the materials are taken from it. Some of

More information

Exploratory Factor Analysis: dimensionality and factor scores. Psychology 588: Covariance structure and factor models

Exploratory Factor Analysis: dimensionality and factor scores. Psychology 588: Covariance structure and factor models Exploratory Factor Analysis: dimensionality and factor scores Psychology 588: Covariance structure and factor models How many PCs to retain 2 Unlike confirmatory FA, the number of factors to extract is

More information

ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES. 1. Introduction

ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES. 1. Introduction Acta Math. Univ. Comenianae Vol. LXV, 1(1996), pp. 129 139 129 ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES V. WITKOVSKÝ Abstract. Estimation of the autoregressive

More information

information matrix can be defined via an extremal representation. For rank

information matrix can be defined via an extremal representation. For rank Metrika manuscript No. (will be inserted by the editor) Information matrices for non full rank subsystems Pierre Druilhet 1, Augustyn Markiewicz 2 1 CREST-ENSAI, Campus de Ker Lann, Rue Blaise Pascal,

More information

DIAGNOSTICS FOR STRATIFIED CLINICAL TRIALS IN PROPORTIONAL ODDS MODELS

DIAGNOSTICS FOR STRATIFIED CLINICAL TRIALS IN PROPORTIONAL ODDS MODELS DIAGNOSTICS FOR STRATIFIED CLINICAL TRIALS IN PROPORTIONAL ODDS MODELS Ivy Liu and Dong Q. Wang School of Mathematics, Statistics and Computer Science Victoria University of Wellington New Zealand Corresponding

More information

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming

More information

1 Directional Derivatives and Differentiability

1 Directional Derivatives and Differentiability Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=

More information

Conjugate Gradient (CG) Method

Conjugate Gradient (CG) Method Conjugate Gradient (CG) Method by K. Ozawa 1 Introduction In the series of this lecture, I will introduce the conjugate gradient method, which solves efficiently large scale sparse linear simultaneous

More information

ROI ANALYSIS OF PHARMAFMRI DATA:

ROI ANALYSIS OF PHARMAFMRI DATA: ROI ANALYSIS OF PHARMAFMRI DATA: AN ADAPTIVE APPROACH FOR GLOBAL TESTING Giorgos Minas, John A.D. Aston, Thomas E. Nichols and Nigel Stallard Department of Statistics and Warwick Centre of Analytical Sciences,

More information

Chapter 4: Factor Analysis

Chapter 4: Factor Analysis Chapter 4: Factor Analysis In many studies, we may not be able to measure directly the variables of interest. We can merely collect data on other variables which may be related to the variables of interest.

More information

Total Least Squares Approach in Regression Methods

Total Least Squares Approach in Regression Methods WDS'08 Proceedings of Contributed Papers, Part I, 88 93, 2008. ISBN 978-80-7378-065-4 MATFYZPRESS Total Least Squares Approach in Regression Methods M. Pešta Charles University, Faculty of Mathematics

More information

Lecture 32: Asymptotic confidence sets and likelihoods

Lecture 32: Asymptotic confidence sets and likelihoods Lecture 32: Asymptotic confidence sets and likelihoods Asymptotic criterion In some problems, especially in nonparametric problems, it is difficult to find a reasonable confidence set with a given confidence

More information

. a m1 a mn. a 1 a 2 a = a n

. a m1 a mn. a 1 a 2 a = a n Biostat 140655, 2008: Matrix Algebra Review 1 Definition: An m n matrix, A m n, is a rectangular array of real numbers with m rows and n columns Element in the i th row and the j th column is denoted by

More information

By Ming-Chung Chang and Ching-Shui Cheng Academia Sinica and University of California, Berkeley

By Ming-Chung Chang and Ching-Shui Cheng Academia Sinica and University of California, Berkeley Submitted to the Annals of Statistics A BAYESIAN APPROACH TO THE SELECTION OF TWO-LEVEL MULTI-STRATUM FACTORIAL DESIGNS By Ming-Chung Chang and Ching-Shui Cheng Academia Sinica and University of California,

More information

STAT 830 Hypothesis Testing

STAT 830 Hypothesis Testing STAT 830 Hypothesis Testing Hypothesis testing is a statistical problem where you must choose, on the basis of data X, between two alternatives. We formalize this as the problem of choosing between two

More information

Notes on Linear Algebra and Matrix Theory

Notes on Linear Algebra and Matrix Theory Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a

More information

Lecture 23: UMPU tests in exponential families

Lecture 23: UMPU tests in exponential families Lecture 23: UMPU tests in exponential families Continuity of the power function For a given test T, the power function β T (P) is said to be continuous in θ if and only if for any {θ j : j = 0,1,2,...}

More information

Limiting behavior of the central path in semidefinite optimization

Limiting behavior of the central path in semidefinite optimization Limiting behavior of the central path in semidefinite optimization M. Halická E. de Klerk C. Roos June 11, 2002 Abstract It was recently shown in [4] that, unlike in linear optimization, the central path

More information

On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control

On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control On the conservative multivariate multiple comparison procedure of correlated mean vectors with a control Takahiro Nishiyama a a Department of Mathematical Information Science, Tokyo University of Science,

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016 U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest

More information

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x =

Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1. x 2. x = Linear Algebra Review Vectors To begin, let us describe an element of the state space as a point with numerical coordinates, that is x 1 x x = 2. x n Vectors of up to three dimensions are easy to diagram.

More information

arxiv: v1 [stat.me] 10 Jul 2009

arxiv: v1 [stat.me] 10 Jul 2009 6th St.Petersburg Workshop on Simulation (2009) 1091-1096 Improvement of random LHD for high dimensions arxiv:0907.1823v1 [stat.me] 10 Jul 2009 Andrey Pepelyshev 1 Abstract Designs of experiments for multivariate

More information

- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs

- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs

More information

Optimal Fractional Factorial Plans for Asymmetric Factorials

Optimal Fractional Factorial Plans for Asymmetric Factorials Optimal Fractional Factorial Plans for Asymmetric Factorials Aloke Dey Chung-yi Suen and Ashish Das April 15, 2002 isid/ms/2002/04 Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110

More information

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim

More information

Optimum Designs for the Equality of Parameters in Enzyme Inhibition Kinetic Models

Optimum Designs for the Equality of Parameters in Enzyme Inhibition Kinetic Models Optimum Designs for the Equality of Parameters in Enzyme Inhibition Kinetic Models Anthony C. Atkinson, Department of Statistics, London School of Economics, London WC2A 2AE, UK and Barbara Bogacka, School

More information

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min.

Lecture 1. 1 Conic programming. MA 796S: Convex Optimization and Interior Point Methods October 8, Consider the conic program. min. MA 796S: Convex Optimization and Interior Point Methods October 8, 2007 Lecture 1 Lecturer: Kartik Sivaramakrishnan Scribe: Kartik Sivaramakrishnan 1 Conic programming Consider the conic program min s.t.

More information

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent. Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u

More information

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix

More information

A SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE

A SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE K Y B E R N E I K A V O L U M E 4 4 ( 2 0 0 8 ), N U M B E R 2, P A G E S 2 4 3 2 5 8 A SECOND ORDER SOCHASIC DOMINANCE PORFOLIO EFFICIENCY MEASURE Miloš Kopa and Petr Chovanec In this paper, we introduce

More information

New insights into best linear unbiased estimation and the optimality of least-squares

New insights into best linear unbiased estimation and the optimality of least-squares Journal of Multivariate Analysis 97 (2006) 575 585 www.elsevier.com/locate/jmva New insights into best linear unbiased estimation and the optimality of least-squares Mario Faliva, Maria Grazia Zoia Istituto

More information

ON EXACT INFERENCE IN LINEAR MODELS WITH TWO VARIANCE-COVARIANCE COMPONENTS

ON EXACT INFERENCE IN LINEAR MODELS WITH TWO VARIANCE-COVARIANCE COMPONENTS Ø Ñ Å Ø Ñ Ø Ð ÈÙ Ð Ø ÓÒ DOI: 10.2478/v10127-012-0017-9 Tatra Mt. Math. Publ. 51 (2012), 173 181 ON EXACT INFERENCE IN LINEAR MODELS WITH TWO VARIANCE-COVARIANCE COMPONENTS Júlia Volaufová Viktor Witkovský

More information

Sharpening the Karush-John optimality conditions

Sharpening the Karush-John optimality conditions Sharpening the Karush-John optimality conditions Arnold Neumaier and Hermann Schichl Institut für Mathematik, Universität Wien Strudlhofgasse 4, A-1090 Wien, Austria email: Arnold.Neumaier@univie.ac.at,

More information

EECS 275 Matrix Computation

EECS 275 Matrix Computation EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 6 1 / 22 Overview

More information

Dense LU factorization and its error analysis

Dense LU factorization and its error analysis Dense LU factorization and its error analysis Laura Grigori INRIA and LJLL, UPMC February 2016 Plan Basis of floating point arithmetic and stability analysis Notation, results, proofs taken from [N.J.Higham,

More information

Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½

Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ University of Pennsylvania ScholarlyCommons Statistics Papers Wharton Faculty Research 1998 Asymptotic Nonequivalence of Nonparametric Experiments When the Smoothness Index is ½ Lawrence D. Brown University

More information

A New Combined Approach for Inference in High-Dimensional Regression Models with Correlated Variables

A New Combined Approach for Inference in High-Dimensional Regression Models with Correlated Variables A New Combined Approach for Inference in High-Dimensional Regression Models with Correlated Variables Niharika Gauraha and Swapan Parui Indian Statistical Institute Abstract. We consider the problem of

More information

Optimal designs for rational regression models

Optimal designs for rational regression models Optimal designs for rational regression models Holger Dette, Christine Kiss Ruhr-Universität Bochum Fakultät für Mathematik 44780 Bochum, Germany holger.dette@ruhr-uni-bochum.de tina.kiss12@googlemail.com

More information

M M Cross-Over Designs

M M Cross-Over Designs Chapter 568 Cross-Over Designs Introduction This module calculates the power for an x cross-over design in which each subject receives a sequence of treatments and is measured at periods (or time points).

More information

http://www.math.uah.edu/stat/hypothesis/.xhtml 1 of 5 7/29/2009 3:14 PM Virtual Laboratories > 9. Hy pothesis Testing > 1 2 3 4 5 6 7 1. The Basic Statistical Model As usual, our starting point is a random

More information

Critical Reading of Optimization Methods for Logical Inference [1]

Critical Reading of Optimization Methods for Logical Inference [1] Critical Reading of Optimization Methods for Logical Inference [1] Undergraduate Research Internship Department of Management Sciences Fall 2007 Supervisor: Dr. Miguel Anjos UNIVERSITY OF WATERLOO Rajesh

More information

On the Behavior of Information Theoretic Criteria for Model Order Selection

On the Behavior of Information Theoretic Criteria for Model Order Selection IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 8, AUGUST 2001 1689 On the Behavior of Information Theoretic Criteria for Model Order Selection Athanasios P. Liavas, Member, IEEE, and Phillip A. Regalia,

More information

Optimal discrimination designs

Optimal discrimination designs Optimal discrimination designs Holger Dette Ruhr-Universität Bochum Fakultät für Mathematik 44780 Bochum, Germany e-mail: holger.dette@ruhr-uni-bochum.de Stefanie Titoff Ruhr-Universität Bochum Fakultät

More information

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012. Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems

More information