X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs
|
|
- Aileen McCormick
- 6 years ago
- Views:
Transcription
1 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 of Mathematical and Statistical Methods, Poznan University of Life Sciences, Wojska Polskiego 8, 6-67 Poznań, Poland rwal@up.poznan.pl SUMMARY This paper considers block designs and row-column designs where the information matrix C has two different nonzero eigenvalues, one of multiplicity and the other of multiplicity h, where h is the rank of the matrix C. It was found that for each such design there exists a diagonal positive definite matrix X such that the design is X - -balanced. Key words: block design, row-column design, efficiency balance, variance balance, X - -balance. Introduction and notation The subject considered here is the problem of balance in experimental designs, especially in block designs or row-column designs. In the literature there exist two main approaches to the notion of balance: variance balance (cf. Pearce, 975) and efficiency balance (cf. Nigam, 976). In the case of equal replications these approaches are equivalent. Otherwise, a variance-balanced design may not be efficiency-balanced and vice versa. These two approaches are special cases of the definition of X - -balance in block designs; cf. Caliński (977). This definition can be directly applied to row-column designs also. Some partially balanced designs with one treatment distinguished will be discussed. It is assumed that the information matrix C has two different nonzero eigenvalues, one of multiplicity and the other of multiplicity h, where h is the rank of the matrix C. The aim is to show that for each such design, there exists a diagonal positive definite matrix X such that the design is X - -balanced. Moreover, it is shown how to introduce a set of base contrasts which can be estimated with the same variance. Download Date //8 : PM
2 R. Walkowiak.. Block designs Consider a block design with n experimental units grouped in b blocks, in which t treatments are to be compared (n > t). The linear model of observations derived from experiments established in such a design has the form y = ( n, D, ) (,, ) + e, () where is a general parameter, and are bl and tl vectors of block and treatment parameters respectively, n is a vector with all components equal to, D and are nb and nt design matrices for blocks and treatments respectively, and e is an nl vector of random errors, for which we assume that E(e) = and D (e) = I n, where denotes the variance of errors. Making use of the method of least squares estimation, here providing the best linear unbiased estimators for treatment parametric functions, we obtain the following normal equation for the vector : Q D = Q D y, () where Q D = I P D and P D denotes the orthogonal projector on the column space of the matrix D. Commonly, the set of normal equations () is expressed as, C = Q D y, where C denotes the information matrix for, C = r - Nk - N, with N = D being an incidence matrix, r =, and k - = (DD) - ; cf. Caliński (977) or Pearce et al. (97)... Row-column designs If the outcome of the experiment is influenced by, in addition to the test factor (treatment parameters), one confounding factor, we use a block design. If we must eliminate the effects of two confounding factors, a row-column design should be used. In such an design n experimental units are grouped in b rows (blocks) and b columns. Let N, N and N denote the incidence matrices for treatments vs. rows, treatments vs. columns and rows vs. columns. Download Date //8 : PM
3 X - -balance of some partially balanced experimental designs We shall assume that the observations obtained in an experiment carried out in a row-column design are expressed by the model y = ( n, D, D, ) (,,, ) + e, () where is the general parameter,,, and are the b l, b l and tl vectors of row, column and treatment parameters respectively, n is a vector with all components equal to, D, D and are the nb, nb and nt, design matrices respectively for rows, columns and treatments, and e is an nl vector of random errors, for which we assume that E(e) = and D (e) = I n. The relevant set of normal equations for the vector takes the form (), wherein the matrix D is replaced by the partitioned matrix (D : D ) (compare Pearce, 975)... X - -balance of experimental designs. Let X be a real diagonal positive definite tt matrix. Let i and w i denote, respectively, an eigenvalue and the corresponding eigenvector of the matrix C with respect to X, i.e., let Cw i = i Xw i. There exist h (h t l) nonzero eigenvalues of the matrix C with respect to X (see Rao and Mitra 97, Theorems 6.. and 6..). The vectors w i, i =,,..., t, can be chosen such that w i Xw i = and w i Xw j =, where i j. () Because C t =, we can assume that the eigenvector w t takes the form w t t (5) X t t and, consequently, t Xw i = for i =,,, t-. According to Lemma in the paper by Caliński (977), the vectors Xw i, i =,,, h, span the subspace of all estimable treatment contrasts. Since each treatment parameter function s i estimable in the model () or () is a contrast (i.e. s i l t = ), it can be expressed as a linear combination of the basic contrasts Download Date //8 : PM
4 R. Walkowiak w i X, for i =,,, h. (6) The best linear unbiased estimator of the contrast (6) has the form (Caliński, 977, Theorem ) w ' i Xγ = ' (wi Q D y) i, i =,,, h, and its variance is var(w' i Xγ) =, i =,,, h. (7) i With the above considerations, we can formulate a definition of X - -balance for row-column designs, analogous to that formulated by Caliński (977, Definition ) for block designs. Definition. A row-column design is said to be X - -balanced if all X -l -normalized estimable linear functions of treatment parameters s are estimated with the same variance. In fact, two commonly used approaches to balance, namely variance balance and efficiency balance, are special cases of Definition. The former definition, given by Pearce (975), corresponds to the case when X = I t, while the latter, formulated by Nigam (976), refers to the case X = r. Theorem. An experimental design is X - -balanced if and only if the nonzero eigenvalues of the matrix C with respect to X are all equal. (cf. Caliński 977, Theorem ). Results Let the experimental design, a block design or row-column design, be partially balanced with respect to the unit matrix, and its information matrix C have two different nonzero eigenvalues: of multiplicity one and of multiplicity h, where h is the rank of the matrix C. Suppose that the eigenvector corresponds to the eigenvalue, the eigenvectors i, i =,,, h, correspond to the eigenvalue, and the eigenvectors h+,, t correspond to the null eigenvalue, where t is a dimension of the matrix C. Download Date //8 : PM
5 X - -balance of some partially balanced experimental designs 5 Since C t =, we can assume that the eigenvector t takes the form ψ t. (8) t t Let denote a matrix whose columns are eigenvectors of the matrix C, that is, = [,,, t ], (9) and let the i-th element of the j-th eigenvector of the matrix C be denoted as ij. The vectors i are chosen to satisfy the following conditions: (i) i i =, i j = for i, j =,,, t and i j, () (ii) for some natural number k, k t, it holds that k > and kj = for j =,,, h. () With respect to (8), the condition () means that each eigenvector i, i =,,, t, is a contrast. By the condition () one can distinguish the k-th treatment in a set of treatments to be compared. If, for example, the first contrast is a comparison of, say, the l-th object with the others, one can choose k = l. Let X denote the diagonal matrix with x ii =, for i =,,, k-, k+,, t, and x kk = a, where k a ( ) ; () k note that the matrix X can be written as X = I t + (a -)e k e k () where I t is the unit matrix of size t, and e k is its k-th column. Matrix X is positive definite, therefore a > and consequently k () Furthermore, let W denote a matrix of the form W = [w, w,, w h, w h+,, w t ], (5) Download Date //8 : PM
6 6 R. Walkowiak where w X ψ, (6) wi ψ i i =,,, h, (7) w t t t Xt, (8) The other columns of the matrix W, that is, w h+,, w t-, are chosen to satisfy the conditions of X - -ortonormality, i.e. (). Theorem : Let an experimental design, a block design or row-column design, be partially balanced (with respect to I t ) and such that its information matrix C has two different nonzero eigenvalues: of multiplicity one and of multiplicity h, where h is the rank of the matrix C. Then the experimental design is X - -balanced, where the matrix X is defined in () and (). The only non-zero eigenvalue of the matrix C with respect to X is of multiplicity h, and a set of corresponding X-orthonormal eigenvectors of this matrix is described by the equations (5) (8). Proof. Note that due to (), it holds that e k i =, for i =,,, h, and consequently, X i = i for i =,,, h. (9) Hence, for i =,,, h, we have Cw i = C i = i = X i = Xw i. It remains to prove the equality Cw = Xw. In view of () and (), we have X It ekek k Furthermore, by (9) and (6), we obtain () Ce k h ψψ ek ψ ψ i i ek kψ i () Thus, using (6), (), () and the equality ek ψ we obtain k Download Date //8 : PM
7 X - -balance of some partially balanced experimental designs 7 Cw C Ce e ψ k k k ( ) k ψ k ψ ψ Xw. Showing that w is the eigenvector of the matrix C with respect to X corresponding to the eigenvalue completes the proof. Corollary. A set of X - -orthonormal basic contrasts in an experimental design satisfying the conditions of Theorem coincides with the set of I t - orthonormal basic contrasts, where the first contrast is multiplied by. Proof : When I t -orthonormal basic contrasts are the columns of the matrix, given in (9), the set of X - -orthonormal basic contrasts consists of the vectors Xw i, for i =,,, h. From (6), (7) and (), it follows that Xw ψ and Xw i = X i = i for i =,,, h.. Examples.. Block design Block designs which satisfy the requirements of this paper include, for example, the S-type block designs introduced by Pearce (96). In what follows, we refer to the S-type block design with unequal block sizes constructed by Gupta and Kageyama (99). In this design, four test treatments and one control treatment are arranged in blocks, of which are of size and are of size. The test treatments are replicated times, whereas the control treatment is replicated times. The plan of this design is denoted as SRS + R in the tables constructed by Clatworthy (97). Due to the large number of observations (n = 56) we omit both design and incidence matrices. The information matrix C is of the form Download Date //8 : PM
8 R. Walkowiak 8 6,5,5,5,5,5 6,5,5,5,5,5 6,5,5,5,5,5 6,5 8 C, and its eigenvalues are respectively: =, = = = 8, 5 =. The corresponding orthonormal eigenvectors of the matrix C with respect to I 5 are:,,,,. 5 5 () The condition () is satisfied. The first four vectors given in () provide a set of basic estimable contrasts. The variance of the contrast s best linear unbiased estimator, according to the formula (7), is var( ' )=, var( i ' )= 8, i =,,. The vectors () satisfy the conditions () and (), with k =. Thus the matrix X such that the considered design is X - -balanced, according to () and (), takes the form X The eigenvalues of the matrix C with respect to the matrix X are, respectively, = = = = 8, 5 =, and the corresponding orthonormal eigenvectors, by (6), (7) and (8), can be written as: Download Date //8 : PM
9 X - -balance of some partially balanced experimental designs 9, w, w, w, w. 6 5 w The investigated design is X - -balanced, so the basic estimable contrasts,, Xw, Xw, Xw, Xw are estimated with the same variance. According to the formula (7), we get var (w i ' X ) = 8, i =,,,... Row-column design Consider an experiment performed according to a Latin square plan, where the five treatments are arranged in five rows and five columns. Suppose that one observation, as a result of a random event, is lost. Without loss of generality, we can assume that the plan of this experiment is Columns 5 Rows B C D E E A B C D D E A B C C D E A B 5 B C D E A Download Date //8 : PM
10 R. Walkowiak with A, B, C, D and E denoting treatments. In this design, we have r = k = k = [, 5, 5, 5, 5], and the relevant information matrix is C The eigenvalues of the matrix C with respect to the matrix I 5 are: =.75, = = = 5, and 6 =, and the corresponding orthonormal eigenvectors can be written as 5 5. The condition () is satisfied. The vectors i, i =,,, 5, satisfy the conditions () and (), with k =, so the treatment of special attention is that marked A. The matrix X enabling the design to be X - -balanced, according to () and (), takes the form 7 X. The eigenvalues and corresponding X-orthonormal eigenvectors of the matrix C with respect to the matrix X are = = = = 5, 5 =, and Download Date //8 : PM
11 X - -balance of some partially balanced experimental designs 7,75 w, w, w, w w Thus the investigated design is X - -balanced, and the estimable basic contrasts having the form,75 Xw Xw Xw Xw are estimated with the same variance, var (w i ' X ) = 5, i =,,,.. Conclusions We have proved that any block design or row-column design whose information matrix C has two different nonzero eigenvalues can be seen as being X - -balanced for some positive definite diagonal matrix X. The results allow one to construct X - -balanced designs that are not classed as efficiency-balanced or variance-balanced. REFERENCES Caliński T. (977): On the notion of balance in block designs. Recent Developments in Statistics, North-Holland Publishing Company. Clatworthy W.H. (97): Tables of Two-Associate Class Partially Balanced Designs. Applied Mathematics Series 6, National Bureau of Standards, Washington. Gupta S., Kageyama S. (99): Type S designs in unequal blocks. Journal of Combinatorics, Information & System Sciences 8(-): 97-. Nigam A.K. (976): On some balanced row-and-column designs. Sankhya B8: Pearce S.C. (96): Supplemented balance. Biometrica 7(&): 6-7. Pearce S.C. (975): Row and column designs. Appl. Statist. : 6-7. Download Date //8 : PM
12 R. Walkowiak Pearce S. C., Caliński T., Marshall T. F. de C. (97): The basic contrasts of an experimental designs with special reference to the analysis of data. Biometrika 6: 9-6. Raghavarao O., Federer W.T. (975): On connectedness in two-way elimination of heterogeneity designs. Ann. Statist. : Rao C.R., Mitra S.K. (97): Generalized inverse of matrices and its applications. New York, Wiley. Download Date //8 : PM
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 informationUse of α-resolvable designs in the construction of two-factor experiments of split-plot type
Biometrical Letters Vol. 53 206, No. 2, 05-8 DOI: 0.55/bile-206-0008 Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Kazuhiro Ozawa, Shinji Kuriki 2, Stanisław
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationCONSTRUCTION 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 informationREGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS
REVSTAT Statistical Journal Volume 10, Number 3, November 01, 33 333 REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS Author: Ma lgorzata Graczyk Department of Mathematical and Statistical Methods, Poznań
More informationSome 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 informationConstruction of Partially Balanced Incomplete Block Designs
International Journal of Statistics and Systems ISS 0973-675 Volume, umber (06), pp. 67-76 Research India Publications http://www.ripublication.com Construction of Partially Balanced Incomplete Block Designs
More informationj=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 informationOn the eigenvalues of Euclidean distance matrices
Volume 27, N. 3, pp. 237 250, 2008 Copyright 2008 SBMAC ISSN 00-8205 www.scielo.br/cam On the eigenvalues of Euclidean distance matrices A.Y. ALFAKIH Department of Mathematics and Statistics University
More informationSome 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 informationSome Construction Methods of Optimum Chemical Balance Weighing Designs III
Open Journal of Statistics, 06, 6, 37-48 Published Online February 06 in SciRes. http://www.scirp.org/journal/ojs http://dx.doi.org/0.436/ojs.06.6006 Some Construction Meods of Optimum Chemical Balance
More informationLecture 8 : Eigenvalues and Eigenvectors
CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with
More informationSOLUTIONS TO PROBLEMS
Z Z T Z conometric Theory, 1, 005, 483 488+ Printed in the United States of America+ DI: 10+10170S06646660505079 SLUTINS T PRBLMS Solutions to Problems Posed in Volume 0(1) and 0() 04.1.1. A Hausman Test
More informationNOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS
REVSTAT Statistical Journal Volume 3, Number 2, June 205, 9 29 NOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS Authors: Bronis law Ceranka Department of Mathematical
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationHOSTOS COMMUNITY COLLEGE DEPARTMENT OF MATHEMATICS
HOSTOS COMMUNITY COLLEGE DEPARTMENT OF MATHEMATICS MAT 217 Linear Algebra CREDIT HOURS: 4.0 EQUATED HOURS: 4.0 CLASS HOURS: 4.0 PREREQUISITE: PRE/COREQUISITE: MAT 210 Calculus I MAT 220 Calculus II RECOMMENDED
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationinformation 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 informationExample Linear Algebra Competency Test
Example Linear Algebra Competency Test The 4 questions below are a combination of True or False, multiple choice, fill in the blank, and computations involving matrices and vectors. In the latter case,
More informationAnnouncements Monday, November 20
Announcements Monday, November 20 You already have your midterms! Course grades will be curved at the end of the semester. The percentage of A s, B s, and C s to be awarded depends on many factors, and
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationHomework 2. Solutions T =
Homework. s Let {e x, e y, e z } be an orthonormal basis in E. Consider the following ordered triples: a) {e x, e x + e y, 5e z }, b) {e y, e x, 5e z }, c) {e y, e x, e z }, d) {e y, e x, 5e z }, e) {
More informationFinal Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015
Final Review Written by Victoria Kala vtkala@mathucsbedu SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Summary This review contains notes on sections 44 47, 51 53, 61, 62, 65 For your final,
More information. The following is a 3 3 orthogonal matrix: 2/3 1/3 2/3 2/3 2/3 1/3 1/3 2/3 2/3
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. An n n matrix
More informationRelationships Between Planes
Relationships Between Planes Definition: consistent (system of equations) A system of equations is consistent if there exists one (or more than one) solution that satisfies the system. System 1: {, System
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationThe generalized Schur complement in group inverses and (k + 1)-potent matrices
The generalized Schur complement in group inverses and (k + 1)-potent matrices Julio Benítez Néstor Thome Abstract In this paper, two facts related to the generalized Schur complement are studied. The
More informationMatrices: 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 informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationVersal deformations in generalized flag manifolds
Versal deformations in generalized flag manifolds X. Puerta Departament de Matemàtica Aplicada I Escola Tècnica Superior d Enginyers Industrials de Barcelona, UPC Av. Diagonal, 647 08028 Barcelona, Spain
More information18.06SC Final Exam Solutions
18.06SC Final Exam Solutions 1 (4+7=11 pts.) Suppose A is 3 by 4, and Ax = 0 has exactly 2 special solutions: 1 2 x 1 = 1 and x 2 = 1 1 0 0 1 (a) Remembering that A is 3 by 4, find its row reduced echelon
More informationHigh-resolution Parametric Subspace Methods
High-resolution Parametric Subspace Methods The first parametric subspace-based method was the Pisarenko method,, which was further modified, leading to the MUltiple SIgnal Classification (MUSIC) method.
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationMultivariate 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 informationStochastic 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 informationa s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula
Syllabus for Math 308, Paul Smith Book: Kolman-Hill Chapter 1. Linear Equations and Matrices 1.1 Systems of Linear Equations Definition of a linear equation and a solution to a linear equations. Meaning
More informationSupplementary Notes on Linear Algebra
Supplementary Notes on Linear Algebra Mariusz Wodzicki May 3, 2015 1 Vector spaces 1.1 Coordinatization of a vector space 1.1.1 Given a basis B = {b 1,..., b n } in a vector space V, any vector v V can
More informationMath Final December 2006 C. Robinson
Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationNESTED BLOCK DESIGNS
NESTED BLOCK DESIGNS Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi 0 0 rajender@iasri.res.in. Introduction Heterogeneity in the experimental material is the most important problem to be reckoned
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationEK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016
EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016 Answer the questions in the spaces provided on the question sheets. You must show your work to get credit for your answers. There will
More informationCheat Sheet for MATH461
Cheat Sheet for MATH46 Here is the stuff you really need to remember for the exams Linear systems Ax = b Problem: We consider a linear system of m equations for n unknowns x,,x n : For a given matrix A
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationMATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationBalanced 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 informationM340L Final Exam Solutions May 13, 1995
M340L Final Exam Solutions May 13, 1995 Name: Problem 1: Find all solutions (if any) to the system of equations. Express your answer in vector parametric form. The matrix in other words, x 1 + 2x 3 + 3x
More informationLecture 22: Section 4.7
Lecture 22: Section 47 Shuanglin Shao December 2, 213 Row Space, Column Space, and Null Space Definition For an m n, a 11 a 12 a 1n a 21 a 22 a 2n A = a m1 a m2 a mn, the vectors r 1 = [ a 11 a 12 a 1n
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More information18.06 Problem Set 7 Solution Due Wednesday, 15 April 2009 at 4 pm in Total: 150 points.
8.06 Problem Set 7 Solution Due Wednesday, 5 April 2009 at 4 pm in 2-06. Total: 50 points. ( ) 2 Problem : Diagonalize A = and compute SΛ 2 k S to prove this formula for A k : A k = ( ) 3 k + 3 k 2 3 k
More informationBLOCK DESIGNS WITH FACTORIAL STRUCTURE
BLOCK DESIGNS WITH ACTORIAL STRUCTURE V.K. Gupta and Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi - 0 0 The purpose of this talk is to expose the participants to the interesting work on block
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationReduction to the associated homogeneous system via a particular solution
June PURDUE UNIVERSITY Study Guide for the Credit Exam in (MA 5) Linear Algebra This study guide describes briefly the course materials to be covered in MA 5. In order to be qualified for the credit, one
More informationMath 308 Practice Final Exam Page and vector y =
Math 308 Practice Final Exam Page Problem : Solving a linear equation 2 0 2 5 Given matrix A = 3 7 0 0 and vector y = 8. 4 0 0 9 (a) Solve Ax = y (if the equation is consistent) and write the general solution
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationAnnouncements Monday, October 29
Announcements Monday, October 29 WeBWorK on determinents due on Wednesday at :59pm. The quiz on Friday covers 5., 5.2, 5.3. My office is Skiles 244 and Rabinoffice hours are: Mondays, 2 pm; Wednesdays,
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationWeighing matrices and their applications
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1997 Weighing matrices and their applications Christos Koukouvinos Jennifer
More informationLinear Algebra and Dirac Notation, Pt. 2
Linear Algebra and Dirac Notation, Pt. 2 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 2 February 1, 2017 1 / 14
More informationLinear 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(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More informationNotes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
More informationDesigns 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 informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationMath 407: Linear Optimization
Math 407: Linear Optimization Lecture 16: The Linear Least Squares Problem II Math Dept, University of Washington February 28, 2018 Lecture 16: The Linear Least Squares Problem II (Math Dept, University
More information1. Let A = (a) 2 (b) 3 (c) 0 (d) 4 (e) 1
. Let A =. The rank of A is (a) (b) (c) (d) (e). Let P = {a +a t+a t } where {a,a,a } range over all real numbers, and let T : P P be a linear transformation dedifined by T (a + a t + a t )=a +9a t If
More informationProblem 1: Solving a linear equation
Math 38 Practice Final Exam ANSWERS Page Problem : Solving a linear equation Given matrix A = 2 2 3 7 4 and vector y = 5 8 9. (a) Solve Ax = y (if the equation is consistent) and write the general solution
More informationInverse of a Square Matrix. For an N N square matrix A, the inverse of A, 1
Inverse of a Square Matrix For an N N square matrix A, the inverse of A, 1 A, exists if and only if A is of full rank, i.e., if and only if no column of A is a linear combination 1 of the others. A is
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More information0.1 Tangent Spaces and Lagrange Multipliers
01 TANGENT SPACES AND LAGRANGE MULTIPLIERS 1 01 Tangent Spaces and Lagrange Multipliers If a differentiable function G = (G 1,, G k ) : E n+k E k then the surface S defined by S = { x G( x) = v} is called
More informationPositive Definite Matrix
1/29 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Positive Definite, Negative Definite, Indefinite 2/29 Pure Quadratic Function
More information2.1 Gaussian Elimination
2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for
More informationThe Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix
The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix Chun-Yueh Chiang Center for General Education, National Formosa University, Huwei 632, Taiwan. Matthew M. Lin 2, Department of
More informationA property of orthogonal projectors
Linear Algebra and its Applications 354 (2002) 35 39 www.elsevier.com/locate/laa A property of orthogonal projectors Jerzy K. Baksalary a,, Oskar Maria Baksalary b,tomaszszulc c a Department of Mathematics,
More informationElementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.
Elementary Linear Algebra Review for Exam Exam is Monday, November 6th. The exam will cover sections:.4,..4, 5. 5., 7., the class notes on Markov Models. You must be able to do each of the following. Section.4
More informationON THE CONSTRUCTION OF REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS
Colloquium Biometricum 43 3, 3 9 ON THE CONSTRUCTION OF REGUAR A-OPTIMA SPRING BAANCE WEIGHING DESIGNS Bronisław Ceranka, Małgorzata Graczyk Department of Matematical and Statistical Metods Poznań Uniersity
More informationLinear vector spaces and subspaces.
Math 2051 W2008 Margo Kondratieva Week 1 Linear vector spaces and subspaces. Section 1.1 The notion of a linear vector space. For the purpose of these notes we regard (m 1)-matrices as m-dimensional vectors,
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More informationSolutions to Review Problems for Chapter 6 ( ), 7.1
Solutions to Review Problems for Chapter (-, 7 The Final Exam is on Thursday, June,, : AM : AM at NESBITT Final Exam Breakdown Sections % -,7-9,- - % -9,-,7,-,-7 - % -, 7 - % Let u u and v Let x x x x,
More informationVectors 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 informationChapter 3 - From Gaussian Elimination to LU Factorization
Chapter 3 - From Gaussian Elimination to LU Factorization Maggie Myers Robert A. van de Geijn The University of Texas at Austin Practical Linear Algebra Fall 29 http://z.cs.utexas.edu/wiki/pla.wiki/ 1
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationWe showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true.
Dimension We showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true. Lemma If a vector space V has a basis B containing n vectors, then any set containing more
More information