ECON Answers Homework #2

Size: px
Start display at page:

Download "ECON Answers Homework #2"

Transcription

1 ECON 33 - Answers Homework #2 Exercise : Denote by x the number of containers of tye H roduced, y the number of containers of tye T and z the number of containers of tye I. There are 3 inut equations that have to be satised, one for each tye of steel: i Steel s : 2x + 3y + 4z = 29; ii Steel s 2 : x + y + z = 3; iii Steel s 3 : 3x + 2y + z = 6. We end u with a system of 3 linear equations that deend on 3 unknowns, x, y and z. From here, you have 2 main strategies: Gaussian elimination or attemt Cramer's rule. Since the coecient matrix does not have many zeros, it will take some time to calculate its determinant and decide whether we can actually aly Cramer's rule or not. So in this case, I would go with Gaussian elimination. But again, if you refer to calculate the determinant of the coecient matrix it is non-zero here and aly Cramer's rule, this is erfectly valid. Gaussian elimination to solve the above system: x + y + z = 3 2x + 3y + 4z = 29 3x + 2y + z = 6 x + y + z = 3 y = 3 L 2 L 2 2L y 5z = 6 L 3 L 3 3L x + y + z = 3 y/5 + z = 23/5 L 2 L 3 /5 y = 3 L 3 L 2 x = = 2 z = 23/5 3/5 = 20/5 = 4 y = 3 To conclude, 2 containers of tye H, 3 containers of tye T and 4 containers of tye I

2 can be roduced given available steel. Exercise 2: a Denote by x the roduction level of Service, y the roduction level of Electricity and z the roduction level of Oil. There are 3 equations that need to be satised by x, y, z: they describe how each outut is used ithin the closed economy: i Outut Service: x = 0.3x + 0.3y + 0.3z ii Outut Electricity: y = 0.4x + 0.y + 0.5z iii Outut Oil: z = 0.3x + 0.6y + 0.2z We end u with a system of 3 linear equations that deend on 3 unknowns, x, y and z. Recall that this system is homogenous that is once we rewrite it in matrix form, the right-hand side coecient vector is zero. We also know that e.g. this system does not have a unique solution otherwise it would be the trivial one 0,0,0; this also means that the determinant of the coecient matrix is likely zero, and that Gaussian elimination is likely the only method to nd the solutions. Gaussian elimination to solve the above system: x = 0.3x + 0.3y + 0.3z y = 0.4x + 0.y + 0.5z z = 0.3x + 0.6y + 0.2z 0.7x 0.3y 0.3z = 0 0.4x + 0.9y 0.5z = 0 0.3x 0.6y+ 0.8z = 0 x 3/7y 3/7z = 0 L L / y 47z = 0 L 2 40L + 70L 2 5y + 47z = 0 L 3 30L + 70L 3 At this stage, it is imortant to realize that equations 2 and 3 are exactly identical! This is tyical from a system with degree of freedom. We can then eliminate either equation 2 or equation 3, without loosing any information. In other words, we have the 2

3 following system that is exactly equivalent to the revious ones: { x 3/7y 3/7z = 0 L L /0.7 { + 5y 47z = 0 L 2 40L + 70L 2 x = 3/7y + z = 3/747/5z + z = 4/4z y = 47/5z We have found an innite number of solutions that can be written as functions of z as follows: x = 4/7z, y = 47/5z, z is any real number. The system has one degree of freedom. In other words, every time I choose a dierent real number for z, I get a new solution by lugging it x and y. Note that if you exress your solutions as functions of y or z this is erfectly valid too. b If I want to x the roduction level of the industry service to 00, I have xed one degree of freedom of the system and I should nd the unique solution associated with it. Since I have exressed my solutions in a as functions of z, I need to reexress them as functions of x and lug in x = 00 to nd the associated solution: x = 4/7z z = 7/4x y = 47/5z y = 47/5 7/4x = 47/42x z real number x real number Now if I x x = 00, I get the associated unique solution: y = 39950/357.9 and z = 850/ Note that at this nal stage, it is aroriate to rovide an aroximate answer. Exercise 3: a - First, realize that the above model is a Markov chain model with 2 states: delay and no delay. So, in order to answer this question, we rst need to write the associated matrix transition. We call it T and we dene it as: T = Note that the convention I used in the notes is that the rows of T sum to. This is because each row, given the current state, describes the robability of being in either 3

4 state next eriod. More secically, in the matrix I dened above, the rst state is "no delay" and the second one is "delay". The rst row corresonds to what haens when the current state is "no delay": that is, next eriod there is a robability 0.85 of being in the state "no delay" and robability 0.5 of being in the state "delay". - Second, realize that the current state that is at time 0 right before you begin your commute to DT Vancouver is "delay", that is state 2 in my modelization. The associated state vector is then: 0 x 0 = - Third, realize that the eriod of reference is 5 minutes. Hence, in order to answer the question, we have to calculate x 2. We know that: x 2 = x 0T 2 = x 0T T x 2 = [0 ] x 2 = [ ] x 2 = [ ] Hence, the robability that for the next 30 minutes the trac will be delayed is equal to b We are now looking for the steady state of the system. That is, we are looking for the vector π = π N π D such that 2 conditions are satised: i π T = π ii π { 0.85π N π D = π N 0.5π N π D = π D = π N + π D = There are many ways to solve this system. I suggest using π D = π N since we are looking for π N and using one equation of the system to nd π N. The solution is: 4

5 π N = 5/8. To conclude, the robability that the trac will not be delayed in the long run is 5/ c The key assumtion of Markov chains models considered in class is that the transition robabilities are constant. This assumtion is very unlikely to be valid in this roblem. This is related to the fact that trac atterns are not constant during the day. For instance, there is a lot more trac delays between 7-9am than between -3m. Exercise 4: a The exercise rovides you with a candidate for the inverse matrix of I + qj, say M to avoid confusion. So, the only thing you have to do is verify that this candidate does the job: in other words, check 2 requirements, i MI + qj = I and ii I + qjm = I. Then use the fact that the inverse is unique to conclude that this candidate is the actual inverse. We start with requirement i: i MI + qj = I q + nq J I + qj = I 2 + qij + nq JI = I + qj + nq J = I + nq 2 + nq J q 2 = I + nj J 2 + nq Realize that we cannot go further unless we nd J 2 rst. Actually, we would like to nd that J 2 = nj in order to conclude that the candidate satises condition i. By denition, J is a matrix of size n with all its elements equal to. We are looking for the elements i,j for i and j from to n of J 2 : call them b ij to avoid confusion. We will use the formula of the roduct of 2 matrices. We call for now the elements of J a ij and we kee in mind a ij = for i,j from to n. b ij = n a ik a kj = n = n = n k= k= k= 5

6 The above calculation is valid for any i,j from to n, so we conclude that all the elements of J 2 are equal to n; in other words, J 2 = nj. Now back to condition i: it is now easy to conclude that condition i holds, that is:mi + qj = I. For comleteness, we need to check condition ii: ii I + qjm = I + qj q + nq J I = I 2 + qji + nq IJ = I + qj + nq J n + nq J = I And we conclude that the candidate is indeed the inverse of I qj. b Here we have to rove that an equation holds. This equation involves the inverse of C + aj. We do not have much information about C, so we start from the denition of the inverse: C + ajc + aj = I CC + aj + ajc + aj = I C + aj C + aj = I C + aj C + ac + aj J = I Somehow, we also need to use the fact that: JC = CJ = O n. If we remultily by J, we get: And i is roved. JCC + aj + ajjc + aj = JI 0 n + aj 2 C + aj = J anjc + aj = J JC + aj = an J 6

7 If we now ostmultily by J, we get: and ii is roved. C + aj CJ + ac + aj JJ = IJ 0 + ac + aj J 2 = J anc + aj J = J C + aj J = an J 7

ECON 331 Homework #2 - Solution. In a closed model the vector of external demand is zero, so the matrix equation writes:

ECON 331 Homework #2 - Solution. In a closed model the vector of external demand is zero, so the matrix equation writes: ECON 33 Homework #2 - Solution. (Leontief model) (a) (i) The matrix of input-output A and the vector of level of production X are, respectively:.2.3.2 x A =.5.2.3 and X = y.3.5.5 z In a closed model the

More information

Participation Factors. However, it does not give the influence of each state on the mode.

Participation Factors. However, it does not give the influence of each state on the mode. Particiation Factors he mode shae, as indicated by the right eigenvector, gives the relative hase of each state in a articular mode. However, it does not give the influence of each state on the mode. We

More information

Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm

Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Calculus and linear algebra for biomedical engineering Week 3: Matrices, linear systems of equations, and the Gauss algorithm Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen

More information

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space

New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Lesson 6: Linear independence, matrix column space and null space New concepts: Span of a vector set, matrix column space (range) Linearly dependent set of vectors Matrix null space Two linear systems:

More information

CHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit

CHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit Chater 5 Statistical Inference 69 CHAPTER 5 STATISTICAL INFERENCE.0 Hyothesis Testing.0 Decision Errors 3.0 How a Hyothesis is Tested 4.0 Test for Goodness of Fit 5.0 Inferences about Two Means It ain't

More information

ECON Homework #2 - ANSWERS. Y C I = G 0 b(1 t)y +C = a. ky li = M 0

ECON Homework #2 - ANSWERS. Y C I = G 0 b(1 t)y +C = a. ky li = M 0 ECON 331 - Homework #2 - ANSWERS 1. IS-LM model in a closed economy: a Equilibrium in the real goods sector: Y = C + I + G National income = Total planned expenditures. Equilibrium in the monetary sector:

More information

MATH 829: Introduction to Data Mining and Analysis Consistency of Linear Regression

MATH 829: Introduction to Data Mining and Analysis Consistency of Linear Regression 1/9 MATH 829: Introduction to Data Mining and Analysis Consistency of Linear Regression Dominique Guillot Deartments of Mathematical Sciences University of Delaware February 15, 2016 Distribution of regression

More information

PHYS 301 HOMEWORK #9-- SOLUTIONS

PHYS 301 HOMEWORK #9-- SOLUTIONS PHYS 0 HOMEWORK #9-- SOLUTIONS. We are asked to use Dirichlet' s theorem to determine the value of f (x) as defined below at x = 0, ± /, ± f(x) = 0, - < x

More information

This operation is - associative A + (B + C) = (A + B) + C; - commutative A + B = B + A; - has a neutral element O + A = A, here O is the null matrix

This operation is - associative A + (B + C) = (A + B) + C; - commutative A + B = B + A; - has a neutral element O + A = A, here O is the null matrix 1 Matrix Algebra Reading [SB] 81-85, pp 153-180 11 Matrix Operations 1 Addition a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn + b 11 b 12 b 1n b 21 b 22 b 2n b m1 b m2 b mn a 11 + b 11 a 12 + b 12 a 1n

More information

Extension of Minimax to Infinite Matrices

Extension of Minimax to Infinite Matrices Extension of Minimax to Infinite Matrices Chris Calabro June 21, 2004 Abstract Von Neumann s minimax theorem is tyically alied to a finite ayoff matrix A R m n. Here we show that (i) if m, n are both inite,

More information

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.

Correspondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R. 1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo

More information

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points. Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the

More information

substantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari

substantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari Condence tubes for multile quantile lots via emirical likelihood John H.J. Einmahl Eindhoven University of Technology Ian W. McKeague Florida State University May 7, 998 Abstract The nonarametric emirical

More information

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a WHEN IS A MAP POISSON N.G.Bean, D.A.Green and P.G.Taylor Department of Applied Mathematics University of Adelaide Adelaide 55 Abstract In a recent paper, Olivier and Walrand (994) claimed that the departure

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and

More information

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02) Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation

More information

The oerators a and a obey the commutation relation Proof: [a a ] = (7) aa ; a a = ((q~ i~)(q~ ; i~) ; ( q~ ; i~)(q~ i~)) = i ( ~q~ ; q~~) = (8) As a s

The oerators a and a obey the commutation relation Proof: [a a ] = (7) aa ; a a = ((q~ i~)(q~ ; i~) ; ( q~ ; i~)(q~ i~)) = i ( ~q~ ; q~~) = (8) As a s They can b e used to exress q, and H as follows: 8.54: Many-body henomena in condensed matter and atomic hysics Last modied: Setember 4, 3 Lecture. Coherent States. We start the course with the discussion

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Chapter 5 Notes. These notes correspond to chapter 5 of Mas-Colell, Whinston, and Green.

Chapter 5 Notes. These notes correspond to chapter 5 of Mas-Colell, Whinston, and Green. Chater 5 Notes These notes corresond to chater 5 of Mas-Colell, Whinston, and Green. 1 Production We now turn from consumer behavior to roducer behavior. For the most art we will examine roducer behavior

More information

x and y suer from two tyes of additive noise [], [3] Uncertainties e x, e y, where the only rior knowledge is their boundedness and zero mean Gaussian

x and y suer from two tyes of additive noise [], [3] Uncertainties e x, e y, where the only rior knowledge is their boundedness and zero mean Gaussian A New Estimator for Mixed Stochastic and Set Theoretic Uncertainty Models Alied to Mobile Robot Localization Uwe D. Hanebeck Joachim Horn Institute of Automatic Control Engineering Siemens AG, Cororate

More information

Solutions to Problem Set 5

Solutions to Problem Set 5 Solutions to Problem Set Problem 4.6. f () ( )( 4) For this simle rational function, we see immediately that the function has simle oles at the two indicated oints, and so we use equation (6.) to nd the

More information

Module 8. Lecture 3: Markov chain

Module 8. Lecture 3: Markov chain Lecture 3: Markov chain A Markov chain is a stochastic rocess having the roerty that the value of the rocess X t at time t, deends only on its value at time t-1, X t-1 and not on the sequence X t-2, X

More information

1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th

1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th 18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider

More information

Analysis of some entrance probabilities for killed birth-death processes

Analysis of some entrance probabilities for killed birth-death processes Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction

More information

GEF2200 vår 2017 Løsningsforslag sett 1

GEF2200 vår 2017 Løsningsforslag sett 1 GEF2200 vår 2017 Løsningsforslag sett 1 A.1.T R is the universal gas constant, with value 8.3143JK 1 mol 1. R is the gas constant for a secic gas, given by R R M (1) where M is the molecular weight of

More information

Elements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley

Elements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the

More information

dn i where we have used the Gibbs equation for the Gibbs energy and the definition of chemical potential

dn i where we have used the Gibbs equation for the Gibbs energy and the definition of chemical potential Chem 467 Sulement to Lectures 33 Phase Equilibrium Chemical Potential Revisited We introduced the chemical otential as the conjugate variable to amount. Briefly reviewing, the total Gibbs energy of a system

More information

2x2x2 Heckscher-Ohlin-Samuelson (H-O-S) model with factor substitution

2x2x2 Heckscher-Ohlin-Samuelson (H-O-S) model with factor substitution 2x2x2 Heckscher-Ohlin-amuelson (H-O- model with factor substitution The HAT ALGEBRA of the Heckscher-Ohlin model with factor substitution o far we were dealing with the easiest ossible version of the H-O-

More information

Linear Regression and Its Applications

Linear Regression and Its Applications Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start

More information

1 Matrices and Systems of Linear Equations

1 Matrices and Systems of Linear Equations Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation

More information

ute measures of uncertainty called standard errors for these b j estimates and the resulting forecasts if certain conditions are satis- ed. Note the e

ute measures of uncertainty called standard errors for these b j estimates and the resulting forecasts if certain conditions are satis- ed. Note the e Regression with Time Series Errors David A. Dickey, North Carolina State University Abstract: The basic assumtions of regression are reviewed. Grahical and statistical methods for checking the assumtions

More information

CSE 599d - Quantum Computing When Quantum Computers Fall Apart

CSE 599d - Quantum Computing When Quantum Computers Fall Apart CSE 599d - Quantum Comuting When Quantum Comuters Fall Aart Dave Bacon Deartment of Comuter Science & Engineering, University of Washington In this lecture we are going to begin discussing what haens to

More information

Cryptanalysis of Pseudorandom Generators

Cryptanalysis of Pseudorandom Generators CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we

More information

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3 0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial

More information

A Simple Weight Decay Can Improve. Abstract. It has been observed in numerical simulations that a weight decay can improve

A Simple Weight Decay Can Improve. Abstract. It has been observed in numerical simulations that a weight decay can improve In Advances in Neural Information Processing Systems 4, J.E. Moody, S.J. Hanson and R.P. Limann, eds. Morgan Kaumann Publishers, San Mateo CA, 1995,. 950{957. A Simle Weight Decay Can Imrove Generalization

More information

{ sin(t), t [0, sketch the graph of this f(t) = L 1 {F(p)}.

{ sin(t), t [0, sketch the graph of this f(t) = L 1 {F(p)}. EM Solved roblems Lalace & Fourier transform c Habala 3 EM Solved roblems Lalace & Fourier transform Find the Lalace transform of the following functions: ft t sint; ft e 3t cos3t; 3 ft e 3s ds; { sint,

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

CSC165H, Mathematical expression and reasoning for computer science week 12

CSC165H, Mathematical expression and reasoning for computer science week 12 CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml

More information

Availability and Maintainability. Piero Baraldi

Availability and Maintainability. Piero Baraldi Availability and Maintainability 1 Introduction: reliability and availability System tyes Non maintained systems: they cannot be reaired after a failure (a telecommunication satellite, a F1 engine, a vessel

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

Tibor Illes, Jiming Peng 2, Kees Roos, Tamas Terlaky Faculty of Information Technology and Systems Subfaculty of Technical Mathematics and Informatics

Tibor Illes, Jiming Peng 2, Kees Roos, Tamas Terlaky Faculty of Information Technology and Systems Subfaculty of Technical Mathematics and Informatics DELFT UNIVERSITY OF TECHNOLOGY REPORT 98{5 A Strongly Polynomial Rounding Procedure Yielding A Maximally Comlementary Solution for P () Linear Comlementarity Problems T. Illes, J. Peng, C. Roos, T. Terlaky

More information

Introduction to Group Theory Note 1

Introduction to Group Theory Note 1 Introduction to Grou Theory Note July 7, 009 Contents INTRODUCTION. Examles OF Symmetry Grous in Physics................................. ELEMENT OF GROUP THEORY. De nition of Grou................................................

More information

Web-Based Technical Appendix to Measuring Aggregate Price Indexes with Demand Shocks: Theory and Evidence for CES Preferences (Not for Publication)

Web-Based Technical Appendix to Measuring Aggregate Price Indexes with Demand Shocks: Theory and Evidence for CES Preferences (Not for Publication) Web-Based Technical Aendix to Measuring Aggregate Price Indexes with Demand Shocks: Theory and Evidence for CES Preferences (Not for Publication) Stehen J. Redding Princeton University and NBER David E.

More information

Vector, Matrix, and Tensor Derivatives

Vector, Matrix, and Tensor Derivatives Vector, Matrix, and Tensor Derivatives Erik Learned-Miller The purpose of this document is to help you learn to take derivatives of vectors, matrices, and higher order tensors (arrays with three dimensions

More information

Chapter 6. Phillip Hall - Room 537, Huxley

Chapter 6. Phillip Hall - Room 537, Huxley Chater 6 6 Partial Derivatives.................................................... 72 6. Higher order artial derivatives...................................... 73 6.2 Matrix of artial derivatives.........................................74

More information

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review

New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two

More information

ECE 534 Information Theory - Midterm 2

ECE 534 Information Theory - Midterm 2 ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You

More information

Distributed Rule-Based Inference in the Presence of Redundant Information

Distributed Rule-Based Inference in the Presence of Redundant Information istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced

More information

Session 5: Review of Classical Astrodynamics

Session 5: Review of Classical Astrodynamics Session 5: Review of Classical Astrodynamics In revious lectures we described in detail the rocess to find the otimal secific imulse for a articular situation. Among the mission requirements that serve

More information

4. Higher Order Linear DEs

4. Higher Order Linear DEs 4. Higher Order Linear DEs Department of Mathematics & Statistics ASU Outline of Chapter 4 1 General Theory of nth Order Linear Equations 2 Homogeneous Equations with Constant Coecients 3 The Method of

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO MARIA ARTALE AND DAVID A. BUCHSBAUM Abstract. We find an exlicit descrition of the terms and boundary mas for the three-rowed

More information

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu

More information

Math 104B: Number Theory II (Winter 2012)

Math 104B: Number Theory II (Winter 2012) Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums

More information

Scaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling

Scaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling Scaling Multile Point Statistics or Non-Stationary Geostatistical Modeling Julián M. Ortiz, Steven Lyster and Clayton V. Deutsch Centre or Comutational Geostatistics Deartment o Civil & Environmental Engineering

More information

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de

Chater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms

More information

An Improved Calibration Method for a Chopped Pyrgeometer

An Improved Calibration Method for a Chopped Pyrgeometer 96 JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY VOLUME 17 An Imroved Calibration Method for a Choed Pyrgeometer FRIEDRICH FERGG OtoLab, Ingenieurbüro, Munich, Germany PETER WENDLING Deutsches Forschungszentrum

More information

1-way quantum finite automata: strengths, weaknesses and generalizations

1-way quantum finite automata: strengths, weaknesses and generalizations 1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum

More information

B8.1 Martingales Through Measure Theory. Concept of independence

B8.1 Martingales Through Measure Theory. Concept of independence B8.1 Martingales Through Measure Theory Concet of indeendence Motivated by the notion of indeendent events in relims robability, we have generalized the concet of indeendence to families of σ-algebras.

More information

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators

An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical

More information

Section 9.2: Matrices.. a m1 a m2 a mn

Section 9.2: Matrices.. a m1 a m2 a mn Section 9.2: Matrices Definition: A matrix is a rectangular array of numbers: a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn In general, a ij denotes the (i, j) entry of A. That is, the entry in

More information

Real Analysis 1 Fall Homework 3. a n.

Real Analysis 1 Fall Homework 3. a n. eal Analysis Fall 06 Homework 3. Let and consider the measure sace N, P, µ, where µ is counting measure. That is, if N, then µ equals the number of elements in if is finite; µ = otherwise. One usually

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

Feedback-error control

Feedback-error control Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller

More information

On the Joint Distribution Of Sel φ (E/Q) and Sel φ (E /Q) in Quadratic Twist Families

On the Joint Distribution Of Sel φ (E/Q) and Sel φ (E /Q) in Quadratic Twist Families On the Joint Distribution Of Sel φ E/Q and Sel φ E /Q in Quadratic Twist Families Daniel Kane and Zev Klagsbrun Introduction Recently, there has a lot of interest in the arithmetic statistics related to

More information

MA2501 Numerical Methods Spring 2015

MA2501 Numerical Methods Spring 2015 Norwegian University of Science and Technology Department of Mathematics MA2501 Numerical Methods Spring 2015 Solutions to exercise set 3 1 Attempt to verify experimentally the calculation from class that

More information

Bayesian Spatially Varying Coefficient Models in the Presence of Collinearity

Bayesian Spatially Varying Coefficient Models in the Presence of Collinearity Bayesian Satially Varying Coefficient Models in the Presence of Collinearity David C. Wheeler 1, Catherine A. Calder 1 he Ohio State University 1 Abstract he belief that relationshis between exlanatory

More information

Math Camp Notes: Linear Algebra II

Math Camp Notes: Linear Algebra II Math Camp Notes: Linear Algebra II Eigenvalues Let A be a square matrix. An eigenvalue is a number λ which when subtracted from the diagonal elements of the matrix A creates a singular matrix. In other

More information

Objectives. 6.1, 7.1 Estimating with confidence (CIS: Chapter 10) CI)

Objectives. 6.1, 7.1 Estimating with confidence (CIS: Chapter 10) CI) Objectives 6.1, 7.1 Estimating with confidence (CIS: Chater 10) Statistical confidence (CIS gives a good exlanation of a 95% CI) Confidence intervals. Further reading htt://onlinestatbook.com/2/estimation/confidence.html

More information

HEAT, WORK, AND THE FIRST LAW OF THERMODYNAMICS

HEAT, WORK, AND THE FIRST LAW OF THERMODYNAMICS HET, ORK, ND THE FIRST L OF THERMODYNMIS 8 EXERISES Section 8. The First Law of Thermodynamics 5. INTERPRET e identify the system as the water in the insulated container. The roblem involves calculating

More information

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized

2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized BIT 38 :2 (998), 283{292. QUASI-MONTE CARLO METHODS FOR NUMERICAL INTEGRATION OF MULTIVARIATE HAAR SERIES II KARL ENTACHER y Deartment of Mathematics, University of Salzburg, Hellbrunnerstr. 34 A-52 Salzburg,

More information

Math 314 Lecture Notes Section 006 Fall 2006

Math 314 Lecture Notes Section 006 Fall 2006 Math 314 Lecture Notes Section 006 Fall 2006 CHAPTER 1 Linear Systems of Equations First Day: (1) Welcome (2) Pass out information sheets (3) Take roll (4) Open up home page and have students do same

More information

Introduction Consider a set of jobs that are created in an on-line fashion and should be assigned to disks. Each job has a weight which is the frequen

Introduction Consider a set of jobs that are created in an on-line fashion and should be assigned to disks. Each job has a weight which is the frequen Ancient and new algorithms for load balancing in the L norm Adi Avidor Yossi Azar y Jir Sgall z July 7, 997 Abstract We consider the on-line load balancing roblem where there are m identical machines (servers)

More information

7.2 Inference for comparing means of two populations where the samples are independent

7.2 Inference for comparing means of two populations where the samples are independent Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Two-samle t significance test (we give three examles) Two-samle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht

More information

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:

More information

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1) CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,

More information

Solutions to exercises on delays. P (x = 0 θ = 1)P (θ = 1) P (x = 0) We can replace z in the first equation by its value in the second equation.

Solutions to exercises on delays. P (x = 0 θ = 1)P (θ = 1) P (x = 0) We can replace z in the first equation by its value in the second equation. Ec 517 Christohe Chamley Solutions to exercises on delays Ex 1: P (θ = 1 x = 0) = P (x = 0 θ = 1)P (θ = 1) P (x = 0) = 1 z)µ (1 z)µ + 1 µ. The value of z is solution of µ c = δµz(1 c). We can relace z

More information

Asymmetric Fermi surfaces for magnetic Schrödinger operators

Asymmetric Fermi surfaces for magnetic Schrödinger operators Research Collection Reort Asymmetric Fermi surfaces for magnetic Schrödinger oerators Author(s): Feldman, Joel S. Trubowitz, Eugene Knörrer, Horst Publication Date: 998 Permanent Link: htts://doi.org/0.399/ethz-a-0043539

More information

Generating Swerling Random Sequences

Generating Swerling Random Sequences Generating Swerling Random Sequences Mark A. Richards January 1, 1999 Revised December 15, 8 1 BACKGROUND The Swerling models are models of the robability function (df) and time correlation roerties of

More information

MATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s,

MATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s, MATH 50: THE DISTRIBUTION OF PRIMES ROBERT J. LEMKE OLIVER For s R, define the function ζs) by. Euler s work on rimes ζs) = which converges if s > and diverges if s. In fact, though we will not exloit

More information

Exact Solutions in Finite Compressible Elasticity via the Complementary Energy Function

Exact Solutions in Finite Compressible Elasticity via the Complementary Energy Function Exact Solutions in Finite Comressible Elasticity via the Comlementary Energy Function Francis Rooney Deartment of Mathematics University of Wisconsin Madison, USA Sean Eberhard Mathematical Institute,

More information

Solutions to Assignment #02 MATH u v p 59. p 72. h 3; 1; 2i h4; 2; 5i p 14. p 45. = cos 1 2 p!

Solutions to Assignment #02 MATH u v p 59. p 72. h 3; 1; 2i h4; 2; 5i p 14. p 45. = cos 1 2 p! Solutions to Assignment #0 MATH 41 Kawai/Arangno/Vecharynski Section 1. (I) Comlete Exercises #1cd on. 810. searation to TWO decimal laces. So do NOT leave the nal answer as cos 1 (something) : (c) The

More information

COMMUNICATION BETWEEN SHAREHOLDERS 1

COMMUNICATION BETWEEN SHAREHOLDERS 1 COMMUNICATION BTWN SHARHOLDRS 1 A B. O A : A D Lemma B.1. U to µ Z r 2 σ2 Z + σ2 X 2r ω 2 an additive constant that does not deend on a or θ, the agents ayoffs can be written as: 2r rθa ω2 + θ µ Y rcov

More information

.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an

.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an . Modular arithmetic.. Divisibility. Given ositive numbers a; b, if a 6= 0 we can write b = aq + r for aroriate integers q; r such that 0 r a. The number r is the remainder. We say that a divides b (or

More information

X1=0 X1=1 X1=p-1. f 0 f 1 f p-1

X1=0 X1=1 X1=p-1. f 0 f 1 f p-1 On the Number of Deendent Variables for Incomletely Secied Multile-Valued Functions Tsutomu Sasao Deartment of Comuter Science and Electronics Kyushu Institute of Technology Iizua 8-85, Jaan Abstract This

More information

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.

More information

116 XIV. Reducing Product Representations

116 XIV. Reducing Product Representations 116 XIV. Reducing Product Representations XIV. Reducing Product Representations In Chapter X we began the consideration of nding the irreducible components of a product representation. The procedure for

More information

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment

More information

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE UDREA PÄUN Communicated by Marius Iosifescu The main contribution of this work is the unication, by G method using Markov chains, therefore, a

More information

2. Sample representativeness. That means some type of probability/random sampling.

2. Sample representativeness. That means some type of probability/random sampling. 1 Neuendorf Cluster Analysis Assumes: 1. Actually, any level of measurement (nominal, ordinal, interval/ratio) is accetable for certain tyes of clustering. The tyical methods, though, require metric (I/R)

More information

Solving Systems of Equations Row Reduction

Solving Systems of Equations Row Reduction Solving Systems of Equations Row Reduction November 19, 2008 Though it has not been a primary topic of interest for us, the task of solving a system of linear equations has come up several times. For example,

More information

NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS

NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1-55-667-1367, fax: 1-55-667-6372

More information

Sums of independent random variables

Sums of independent random variables 3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where

More information

DIFFERENTIAL GEOMETRY. LECTURES 9-10,

DIFFERENTIAL GEOMETRY. LECTURES 9-10, DIFFERENTIAL GEOMETRY. LECTURES 9-10, 23-26.06.08 Let us rovide some more details to the definintion of the de Rham differential. Let V, W be two vector bundles and assume we want to define an oerator

More information

3 Properties of Dedekind domains

3 Properties of Dedekind domains 18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers

More information

Otimal exercise boundary for an American ut otion Rachel A. Kuske Deartment of Mathematics University of Minnesota-Minneaolis Minneaolis, MN 55455 e-mail: rachel@math.umn.edu Joseh B. Keller Deartments

More information

Determining Momentum and Energy Corrections for g1c Using Kinematic Fitting

Determining Momentum and Energy Corrections for g1c Using Kinematic Fitting CLAS-NOTE 4-17 Determining Momentum and Energy Corrections for g1c Using Kinematic Fitting Mike Williams, Doug Alegate and Curtis A. Meyer Carnegie Mellon University June 7, 24 Abstract We have used the

More information