Schmidt Process can be applied, this means that every nonzero subspace of 8 has an orthonormal basis.

Size: px
Start display at page:

Download "Schmidt Process can be applied, this means that every nonzero subspace of 8 has an orthonormal basis."

Transcription

1 8The Gram-Schmidt Process The Gram-Schmidt Process is an algorithm used to convert any basis for a subspace [ of 8 into a new orthogonal basis for [. This orthogonal basis can then be normalized, if desired, to get an orthonormal basis for [Þ Since every nonzero subspace [ has a basis to which the Gram- Schmidt Process can be applied, this means that every nonzero subspace of 8 has an orthonormal basis. It is important to think about what the algorithm is doing: that makes it much easier to remember and use the algorithm. Therefore this presentation, while doing the very same thing as in the text, tries harder than the text to separate the idea from the calculations The idea behind Gram- Schmidt Process is contained in the following Lemma. Lemma Suppose ßÞÞÞß 3 is an orthogonal set of nonzero vectors in 8 and [ œ Span ßÞÞÞß 3. Pick a vector B  [ and write B œ B s where Bs œ proj [ B [ and [ Þ Then i) Span ßÞÞÞß 3 ß B œ Span ßÞÞÞß 3ß, and ii) the enlarged set ßÞÞÞß ß is orthogonal NOTE: in the Orthogonal Decomposition Theorem, we wrote B œ Bs D where D [ Þ Here, I'm using the letter (rather than the letter D ) to denote the orthogonal component of BÞ In this context, I think that helps the discussion to read more smoothly. Informally, what does the Lemma say? The 3 's are orthogonal to each other, so ßÞÞÞß 3 is a linearly independent set and a basis for [. Then we enlarge [ to Span ßÞÞÞß 3ß B by adding to the basis a new vector B from outside [. Since B is not a linear combination of ßÞßß 8, ßÞÞÞß 3ß B is linearly independent and is a basis for the enlarged subspace Span ßÞÞÞß ß B. But the Bs part of B was already in [ before we enlarged; it is ß the orthogonal component of B Ð from [ Ñ that actually enlarges [Þ Just adding the orthogonal component of B to ßÞÞÞß 3 has the same effect as adding the whole vector B to ßÞÞÞß 3, and since [ ß the new set ßÞÞÞß 3ß is an orthogonal basis for the enlarged subspace. Proof i) To show that Span ßÞÞÞß ß B œ Span ßÞÞÞß ß, we need to show that a) every vector A in Span ßÞÞÞß ß B is also in Span ßÞÞÞß ß, b) every vector A in Span ßÞÞÞß ß is also in Span ßÞÞÞß ß B and For short, let's use the notation lc Ð ß ÞÞÞß 3 Ñ to mean a linear combination of ß ÞÞÞß 3. With this shorthand, for example, lc Ð ßÞÞÞß Ñ lc Ð ßÞÞÞß Ñ œ lc Ð ßÞÞÞß Ñ (?) why

2 Since Bs is in [, we know that B s œ lcð ßÞÞÞß Ñß For a) If A is in Span ßÞÞÞß 3ß B, then A œ lc Ð ßÞÞÞß 3Ñ -B œ lc Ð ßÞÞÞß 3Ñ -Ð B s Ñ œ lc Ð ßÞÞÞß 3Ñ -B s - œ lcð ßÞÞÞß 3 Ñ lcð ßÞÞÞß 3Ñ - œ lcð ßÞÞÞß 3 Ñ - ß so A is in Span ß ÞÞÞß ß Þ For b) If A is in Span ßÞÞÞß 3ß, then A œ lc Ð ßÞÞÞß 3Ñ - œ lc Ð ßÞÞÞß 3Ñ -ÐB Bs Ñ œ lcð ßÞÞÞß 3 Ñ - B lcð ßÞÞÞß 3Ñ œ lcð ßÞÞÞß 3 Ñ -B, so A is in Span ß ÞÞÞß ß B ii) ßÞÞÞß 3 is an orthogonal set and (each 3) because [. So ßÞÞÞß ß is an orthogonal set. ñ The Gram-Schmidt Process (GSP) If you understand the preceding lemma, the idea behind the Gram-Schmidt Process is very easy. We want to convert an basis ÖB ß ÞÞÞß B: for [ into an orthogonal basis ßÞÞÞß :. We build the orthogonal basis by replacing each vector B3 with a vector 3. We do this from the ground up ß one B3 at a time, starting with B Þ Step 1. To start, let œ B, and call [ œ SpanÖ B œ Span Ö Step 2: Now enlarge [: let [ œ SpanÖB ß B œ Span ß B Ðsince œ B ÑÞ Decompose B œ B s, where Bs œ proj[ B and [. But we don't need the whole vector B to get [. According to the Lemma, [ œ SpanÖB ß B œ Span ß B œ Span Ö ß, and, by the Lemma ß Ö ß is an orthogonal set. Of course, we already know a formula for : since [ œ SpanÖ ß œ B projw B œ B Step 3: Now enlarge [: let [ œ Span ÖB ß B, B œ Span ß,. Decompose œ B s, where Bs œ proj[ B and [ Þ But we don't need the whole vector B to get [ 3 According to the Lemma, [ œ Span ÖB ß B, B œ Span ß, B œ Span Ö ß ß ß and, by the Lemma, Ö ß ß is an orthogonal set. Of course, we already know a formula for : since [ œ Span ß, œ B proj B œ B W

3 Next: Keep repeating this process as long as you can. Suppose we have arrived at [ 3 œ SpanÖB ßÞÞÞß B 3 œ Span ßÞÞÞß 3, where ßÞÞÞß 3 is an orthogonal set. If 3 : ( that is, if there are still some B 3 's remaining), then use B 3 to enlarge [ 3 again: [ 3 œ SpanÖB ßÞÞÞßB3ß B 3 œ Span ßÞÞÞß 3ß B3 Þ Once again, we don't need the whole vector B 3 ; as before, it's enough to use 3 œ the component of B3 orthogonal to [ 3. By the Lemma, we have SpanÖB ßÞÞÞßB3ß B 3 œ Span ßÞÞÞß 3ß B 3 œ Span ßÞÞÞß 3ß 3 and ßÞÞÞß ß is an orthogonal set. 3 And, of course, we know a formula for : since [ œ Span ß ßÞÞÞ, œ B proj W3 B œ B ÞÞÞ 3 3 Finally, we run out of B3 's and arrive at [: œ SpanÖB ßÞÞÞß B : œ Span ßÞÞÞß :, and ßÞÞÞß : is an orthogonal set that is a basis for the original subspace [ œ [: Þ (For certain purposes it's useful to remember that at each step in the process, the set ÖB ßÞÞÞß B has the same span as the set ßÞÞÞß You'll feel much better about the Gram-Schmidt Process if you understand the preceding material about what's going on in the calculations. However, when you solve problems you might just use a programmed recipe for the vectors in the orthogonal basis. Suppose ÖB ß ÞÞÞß B : is a basis for the subspace [ of 8. Then ß ß ÞÞÞß : is an orthogonal basis for [ where œ B œ B proj B œ B B B B œ B proj proj œ B % œ B% proj B proj B proj B % % % B % B % B % œ B % ã : œ B: proj B proj B ÞÞÞ... proj B : : : : B : B : B : : œ B ÞÞÞ... : : : :

4 Example Use the Gram-Schmidt Process to find an orthogonal basis for Ô Ô Ô [ œ Span ßߟ and explain some of the details at each step. Õ Õ Õ Å Å Å B B You can check that B ßB ß are linearly independent and therefore form a basis for [. What would happen if we applied the Gram-Schmidt Process to a linearly dependent set of vectors ÖB ßÞÞÞß B :? Ô Let œ B œ ß and [ œ SpanÖ B Span œ Ö Þ Õ Let [ œ SpanÖB ß B œ Span ß B Þ Using the Lemma, we can replace B with œ the component of B orthogonal to [ œ B proj B proj [ B Ô Ô Ô Ô Ô œ œ œ, so Õ Õ œ Ô Ô Ö Ù Õ Õ Õ Õ Õ Ô Ô Ô œ B proj [ B œ œ Ö Ù Ö Ù Õ Õ Õ Optional: rescale to avoid working with the fractions in the remaining calculations: multiply by and instead use % Ô Ô œ œ ( explain why rescaling doesn't mess anything up. ) Õ Õ % Then SpanÖB ß B œ Span ß B œ Span ß Þ % ( cont. )

5 Let [ œ Span ÖB ß B, œ Span ß, Using the Lemma, we can replace with œ the component of orthogonal to [ œ proj [ œ B proj B proj B proj [ B œ œ Ô Ô Ô Ô Ô Õ Õ Õ Õ % Ô Ô Ô Ô Õ Ù Ö Ù Ö Õ Õ Õ % Õ % Ô Õ % Ô Ô Ô * œ œ %, Õ Õ % Õ so Ô Ô Ô œ proj [ œ œ Õ Õ Õ Then [ œ Span ÖB ß B, B œ Span Ö ß,, and we have replaced all the B 's. [ is the 3 subspace [ we were originally given, and an orthogonal basis for [ is ß ß œ Ô Ô Ô ßÖ ÙßÖ ÙŸÞ Õ Õ % Õ

Assume we are given a tissue sample =, and a feature vector

Assume we are given a tissue sample =, and a feature vector MA 751 Part 6 Support Vector Machines 3. An example: Gene expression arrays Assume we are given a tissue sample =, and a feature vector x œ F Ð=Ñ $!ß!!! consisting of 30,000 gene expression levels as read

More information

Constructing the Integers

Constructing the Integers Constructing the Integers We have seen how we can start with the (informal) system of integers, and use it to build new algebraic systems 7. The members of 7are equivalence classes formed from the integers.

More information

Computer Project. Purpose: To better understand the notion of rank and learn its connection with linear independence.

Computer Project. Purpose: To better understand the notion of rank and learn its connection with linear independence. MA 242 - M. Kon Extra Credit Assignment 3 Due Tuesday, 3/28/17 Computer Project Name Remember - it's never too late to start doing the extra credit computer algebra problem sets! 1. Rank and Linear Independence

More information

Peano Systems and the Whole Number System

Peano Systems and the Whole Number System Peano Systems and the Whole Number System We have a good informal picture about how the system of whole numbers works. By the whole number system we mean to the set = œ Öß "ß #ß ÞÞÞ, together with its

More information

A SIMPLE METHOD FOR SEARCHING FOR PRIME PAIRS IN THE GOLDBACH CONJECTURE WEI SHENG ZENG AND ZIQI SUN

A SIMPLE METHOD FOR SEARCHING FOR PRIME PAIRS IN THE GOLDBACH CONJECTURE WEI SHENG ZENG AND ZIQI SUN A SIMPLE METHOD FOR SEARCHING FOR PRIME PAIRS IN THE GOLDBACH CONJECTURE WEI SHENG ZENG AND ZIQI SUN ABSTRACT. In this paper we introduce a simple method of searching for the prime pairs in the famous

More information

Definition For a fixed 7, define a relation Von by

Definition For a fixed 7, define a relation Von by The following definition gives a very important equivalence relation on. We will use it to illustrate a number of the ideas that follow. Definition For a fixed 7, define a relation Von by V œ ÖÐBß CÑ À

More information

The linear transformation X À Ä given by XÐBÑ œ EB is invertible À that is, there

The linear transformation X À Ä given by XÐBÑ œ EB is invertible À that is, there What do we know about an invertible ( 8 8) matrix E? E is invertible Í E rref ÐEÑ œ M 8 X is invertible X À Ä (where XÐBÑ œ EB) is onto for every, in 8, EB œ, has at least " solution The columns of E span

More information

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0. Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts

More information

Orthogonal complements

Orthogonal complements Roberto s Notes on Linear Algebra Chapter 9: Orthogonality Section 3 Orthogonal complements What you need to know already: What orthogonal and orthonormal bases are. What you can learn here: How we can

More information

MATH 1242 FALL 2008 COMMON FINAL EXAMINATION PART I. Instructor:

MATH 1242 FALL 2008 COMMON FINAL EXAMINATION PART I. Instructor: MATH 14 FALL 008 COMMON FINAL EXAMINATION PART I Name Student ID Instructor: Section/Time This exam is divided into three parts. Calculators are not allowed on Part I. You have three hours for the entire

More information

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0.

1) Give a set-theoretic description of the given points as a subset W of R 3. a) The points on the plane x + y 2z = 0. ) Give a set-theoretic description of the given points as a subset W of R. a) The points on the plane x + y z =. x Solution: W = {x: x = [ x ], x + x x = }. x b) The points in the yz-plane. Solution: W

More information

Unit II-2. Orthogonal projection. Orthogonal projection. Orthogonal projection. the scalar is called the component of u along v. two vectors u,v are

Unit II-2. Orthogonal projection. Orthogonal projection. Orthogonal projection. the scalar is called the component of u along v. two vectors u,v are Orthogonal projection Unit II-2 Orthogonal projection the scalar is called the component of u along v in real ips this may be a positive or negative value in complex ips this may have any complex value

More information

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

CHAPTER 8. Copyright Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

MA M. Kon Extra Credit Assignment 2 Due Tuesday, 2/28/17. Name. Computer Project: 1. Reduced Echelon Form and rref

MA M. Kon Extra Credit Assignment 2 Due Tuesday, 2/28/17. Name. Computer Project: 1. Reduced Echelon Form and rref MA 242 - M. Kon Extra Credit Assignment 2 Due Tuesday, 2/28/17 Name Computer Project: 1. Reduced Echelon Form and rref Purpose: To calculate the reduced echelon form by hand and with effects of roundoff

More information

Lesson 6.5A Working with Radicals

Lesson 6.5A Working with Radicals Lesson 6.5A Working with Radicals Activity 1 Equivalent Radicals We use the product and quotient rules for radicals to simplify radicals. To "simplify" a radical does not mean to find a decimal approximation

More information

Banner 8 Using International Characters

Banner 8 Using International Characters College of William and Mary Banner 8 Using International Characters A Reference and Training Guide Banner Support January 23, 2009 Table of Contents Windows XP Keyboard Setup 3 VISTA Keyboard Setup 7 Creating

More information

SFU CMPT Lecture: Week 8

SFU CMPT Lecture: Week 8 SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing

More information

points. If each point is identified with a treatment combination, then the design consisting of 8 : "

points. If each point is identified with a treatment combination, then the design consisting of 8 : Handout #14 - Regular fractional factorial designs An example of regular fractional factorial design was given in Section 13.3. This handout presents a general theory of the construction of regular fractional

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Math 233 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu

More information

hp calculators HP 35s Using Algebraic Mode Calculation modes Functions of a single number in algebraic A simple example in algebraic

hp calculators HP 35s Using Algebraic Mode Calculation modes Functions of a single number in algebraic A simple example in algebraic Calculation modes Functions of a single number in algebraic A simple example in algebraic Arithmetic calculations with two numbers Another example - the area of a piece of carpet Algebraic mode in detail

More information

Lecture 5 C Programming Language

Lecture 5 C Programming Language Lecture 5 C Programming Language Summary of Lecture 5 Pointers Pointers and Arrays Function arguments Dynamic memory allocation Pointers to functions 2D arrays Addresses and Pointers Every object in the

More information

Chapter 6 The Standard Deviation as Ruler and the Normal Model

Chapter 6 The Standard Deviation as Ruler and the Normal Model ST 305 Chapter 6 Reiland The Standard Deviation as Ruler and the Normal Model Chapter Objectives: At the end of this chapter you should be able to: 1) describe how adding or subtracting the same value

More information

MAFS.5.NF.2.5. Interpret multiplication as rescaling.

MAFS.5.NF.2.5. Interpret multiplication as rescaling. MAFS.5.NF.2.5 Interpret multiplication as rescaling. Understand that multiplying a fraction > 1 and a given number results in a product > either factor. Examples: 2 x 5/4 = 10/4 or 2½; 10/4 > 2 or 2½ >

More information

CS161 Handout 07 Summer 2013 July 17, 2013 Guide to Reductions. Thanks to Julie Tibshirani for helping with this handout!

CS161 Handout 07 Summer 2013 July 17, 2013 Guide to Reductions. Thanks to Julie Tibshirani for helping with this handout! CS161 Handout 07 Summer 2013 July 17, 2013 Guide to Reductions Thanks to Julie Tibshirani for helping with this handout! We'll design many algorithms over the course of this class. Often, the algorithms

More information

) $ G}] }O H~U. G yhpgxl. Cong

) $ G}] }O H~U. G yhpgxl. Cong » Þ åî ïî á ë ïý þý ÿ þ ë ú ú F \ Œ Œ Ÿ Ÿ F D D D\ \ F F D F F F D D F D D D F D D D D FD D D D F D D FD F F F F F F F D D F D F F F D D D D F Ÿ Ÿ F D D Œ Ÿ D Ÿ Ÿ FŸ D c ³ ² í ë óô ò ð ¹ í ê ë Œ â ä ã

More information

Integral Geometry and the Polynomial Hirsch Conjecture

Integral Geometry and the Polynomial Hirsch Conjecture Integral Geometry and the Polynomial Hirsch Conjecture Jonathan Kelner, MIT Partially based on joint work with Daniel Spielman Introduction n A lot of recent work on Polynomial Hirsch Conjecture has focused

More information

DECOMPOSITION is one of the important subjects in

DECOMPOSITION is one of the important subjects in Proceedings of the Federated Conference on Computer Science and Information Systems pp. 561 565 ISBN 978-83-60810-51-4 Analysis and Comparison of QR Decomposition Algorithm in Some Types of Matrix A. S.

More information

Math 1322, Fall 2002 Introduction to Matlab: Basic Commands

Math 1322, Fall 2002 Introduction to Matlab: Basic Commands Math 1322, Fall 2002 Introduction to Matlab: Basic Commands You should look at Sections 1.1-1.3 of the Matlab reference book ( Using Matlab in Calculus by Gary Jensen), preferably with Matlab running in

More information

CHAPTER 3 ADDING AND SUBTRACTING FRACTIONS

CHAPTER 3 ADDING AND SUBTRACTING FRACTIONS 3.1 Adding and Subtracting Like Fractions 83 CHAPTER 3 ADDING AND SUBTRACTING FRACTIONS 3.1 Adding and Subtracting Like Fractions 3.1 Margin Exercises 1. (a && The denominators are the same, so & and &

More information

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC This update to the AppleShare PC User's Guide discusses AppleShare PC support for the use of international character sets, paper sizes, and date

More information

Exam MLC Flashcards. Samuel Broverman

Exam MLC Flashcards. Samuel Broverman Exam MLC Flashcards Samuel roverman 2brove@rogers.com, www.sambroverman.com S. roverman 2007 Samuel roverman 2brove@rogers.com, www.sambroverman.com Table of Contents Introductory Topics Life Contingencies

More information

Watch the video below to learn more about number formats in Excel. *Video removed from printing pages. Why use number formats?

Watch the video below to learn more about number formats in Excel. *Video removed from printing pages. Why use number formats? Excel 2016 Understanding Number Formats What are number formats? Whenever you're working with a spreadsheet, it's a good idea to use appropriate number formats for your data. Number formats tell your spreadsheet

More information

Science Translations Software Reference Reprints

Science Translations Software Reference Reprints Science Translations Software Reference Reprints More articles and software are available on the Internet at www.filetiger.com and www.graphcat.com. Typographical Typography Jerry Stern 1992, 2000, All

More information

Problem One: A Quick Algebra Review

Problem One: A Quick Algebra Review CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning

More information

Chapter 3: Direct Proofs

Chapter 3: Direct Proofs 3.1: Getting Started on a Problem Chapter 3: Direct Proofs Let's review some steps for studying the truth of a statement. Step 1, Examples: If possible, look at some specific examples, including extreme

More information

Vector Calculus: Understanding the Cross Product

Vector Calculus: Understanding the Cross Product University of Babylon College of Engineering Mechanical Engineering Dept. Subject : Mathematics III Class : 2 nd year - first semester Date: / 10 / 2016 2016 \ 2017 Vector Calculus: Understanding the Cross

More information

BUCKLEY. User s Guide

BUCKLEY. User s Guide BUCKLEY User s Guide O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs All operating systems come equipped with a utility that make

More information

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the

More information

MITOCW ocw f99-lec12_300k

MITOCW ocw f99-lec12_300k MITOCW ocw-18.06-f99-lec12_300k This is lecture twelve. OK. We've reached twelve lectures. And this one is more than the others about applications of linear algebra. And I'll confess. When I'm giving you

More information

Lecture 13. Math 22 Summer 2017 July 17, 2017

Lecture 13. Math 22 Summer 2017 July 17, 2017 Lecture 13 Math 22 Summer 2017 July 17, 2017 Reminders/Announcements Midterm 1 Wednesday, July 19, Kemeny 008, 6pm-8pm Please respond to email if you have a conflict with this time! Kate is moving her

More information

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All

More information

Table of Laplace Transforms

Table of Laplace Transforms Table of Laplace Transforms 1 1 2 3 4, p > -1 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 Heaviside Function 27 28. Dirac Delta Function 29 30. 31 32. 1 33 34. 35 36. 37 Laplace Transforms

More information

Modules. CS2023 Winter 2004

Modules. CS2023 Winter 2004 Modules CS2023 Winter 2004 Outcomes: Modules C for Java Programmers, Chapter 7, sections 7.4.1-7.4.6 Code Complete, Chapter 6 After the conclusion of this section you should be able to Understand why modules

More information

Digital Logic Design: a rigorous approach c

Digital Logic Design: a rigorous approach c Digital Logic Design: a rigorous approach c Chapter 4: Directed Graphs Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. October 31, 2017 Book Homepage: http://www.eng.tau.ac.il/~guy/even-medina

More information

An Improved Measurement Placement Algorithm for Network Observability

An Improved Measurement Placement Algorithm for Network Observability IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 4, NOVEMBER 2001 819 An Improved Measurement Placement Algorithm for Network Observability Bei Gou and Ali Abur, Senior Member, IEEE Abstract This paper

More information

Christofides Algorithm

Christofides Algorithm 2. compute minimum perfect matching of odd nodes 2. compute minimum perfect matching of odd nodes 2. compute minimum perfect matching of odd nodes 3. find Eulerian walk node order 2. compute minimum perfect

More information

Personal Conference Manager (PCM)

Personal Conference Manager (PCM) Chapter 3-Basic Operation Personal Conference Manager (PCM) Guidelines The Personal Conference Manager (PCM) interface enables the conference chairperson to control various conference features using his/her

More information

Definition of Inverse Function

Definition of Inverse Function Definition of Inverse Function A function and its inverse function can be described as the "DO" and the "UNDO" functions. A function takes a starting value, performs some operation on this value, and creates

More information

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.

Know the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element. The first exam will be on Wednesday, September 22, 2010. The syllabus will be sections 1.1 and 1.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive

More information

Appendix C. Numeric and Character Entity Reference

Appendix C. Numeric and Character Entity Reference Appendix C Numeric and Character Entity Reference 2 How to Do Everything with HTML & XHTML As you design Web pages, there may be occasions when you want to insert characters that are not available on your

More information

REGULAR GRAPHS OF GIVEN GIRTH. Contents

REGULAR GRAPHS OF GIVEN GIRTH. Contents REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion

More information

The method of rationalizing

The method of rationalizing Roberto s Notes on Differential Calculus Chapter : Resolving indeterminate forms Section The method of rationalizing What you need to know already: The concept of it and the factor-and-cancel method of

More information

Describe the two most important ways in which subspaces of F D arise. (These ways were given as the motivation for looking at subspaces.

Describe the two most important ways in which subspaces of F D arise. (These ways were given as the motivation for looking at subspaces. Quiz Describe the two most important ways in which subspaces of F D arise. (These ways were given as the motivation for looking at subspaces.) What are the two subspaces associated with a matrix? Describe

More information

Greedy Algorithms. Previous Examples: Huffman coding, Minimum Spanning Tree Algorithms

Greedy Algorithms. Previous Examples: Huffman coding, Minimum Spanning Tree Algorithms Greedy Algorithms A greedy algorithm is one where you take the step that seems the best at the time while executing the algorithm. Previous Examples: Huffman coding, Minimum Spanning Tree Algorithms Coin

More information

Note: Please use the actual date you accessed this material in your citation.

Note: Please use the actual date you accessed this material in your citation. MIT OpenCourseWare http://ocw.mit.edu 18.06 Linear Algebra, Spring 2005 Please use the following citation format: Gilbert Strang, 18.06 Linear Algebra, Spring 2005. (Massachusetts Institute of Technology:

More information

The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs

The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent

More information

Adorn. Serif. Smooth. v22622x

Adorn. Serif. Smooth. v22622x s u Adorn f Serif Smooth 9 0 t v22622x user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs

More information

ECE608 - Chapter 16 answers

ECE608 - Chapter 16 answers ¼ À ÈÌ Ê ½ ÈÊÇ Ä ÅË ½µ ½ º½¹ ¾µ ½ º½¹ µ ½ º¾¹½ µ ½ º¾¹¾ µ ½ º¾¹ µ ½ º ¹ µ ½ º ¹ µ ½ ¹½ ½ ECE68 - Chapter 6 answers () CLR 6.-4 Let S be the set of n activities. The obvious solution of using Greedy-Activity-

More information

Lesson 20: Every Line is a Graph of a Linear Equation

Lesson 20: Every Line is a Graph of a Linear Equation Student Outcomes Students know that any non vertical line is the graph of a linear equation in the form of, where is a constant. Students write the equation that represents the graph of a line. Lesson

More information

Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games

Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games Lisa Fleischer Kamal Jain Mohammad Mahdian Abstract We prove the existence of tolls to induce multicommodity,

More information

MITOCW watch?v=kvtlwgctwn4

MITOCW watch?v=kvtlwgctwn4 MITOCW watch?v=kvtlwgctwn4 PROFESSOR: The idea of congruence was introduced to the world by Gauss in the early 18th century. You've heard of him before, I think. He's responsible for some work on magnetism

More information

SDG ATARI 8 BITS REFERENCE CARD

SDG ATARI 8 BITS REFERENCE CARD SDG ATARI 8 BITS REFERENCE CARD 1.- Introduction Graphs and statistics (SDG) is a powerful software and easy to use. Through menu you can create and edit variables, manage files, describe variables in

More information

What's the Slope of a Line?

What's the Slope of a Line? What's the Slope of a Line? These lines look pretty different, don't they? Lines are used to keep track of lots of info -- like how much money a company makes. Just off the top of your head, which of the

More information

9.5 Equivalence Relations

9.5 Equivalence Relations 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same

More information

MAT 22B-001: Differential Equations

MAT 22B-001: Differential Equations MAT 22B-001: Differential Equations Final Exam Solutions Note: There is a table of the Laplace transform in the last page Name: SSN: Total Score: Problem 1 (5 pts) Solve the following initial value problem

More information

MITOCW watch?v=kz7jjltq9r4

MITOCW watch?v=kz7jjltq9r4 MITOCW watch?v=kz7jjltq9r4 PROFESSOR: We're going to look at the most fundamental of all mathematical data types, namely sets, and let's begin with the definitions. So informally, a set is a collection

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the logic we've been using in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical equivalences.

More information

Polytopes Course Notes

Polytopes Course Notes Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................

More information

FRACTIONAL FACTORIAL (

FRACTIONAL FACTORIAL ( FRACTIONAL FACTORIAL ( # : ; ) STUDIES Page 1 Motivation: For : factors, even # : gets big fast : for : œ"! # œ"!#% Example Hendrix 1979 Chemtech A Coating Roll Temp 115 vs 125 B Solvent Recycled vs Refined

More information

Lesson 4.2 The Vertex

Lesson 4.2 The Vertex Lesson. The Vertex Activity 1 The Vertex 1. a. How do you know that the graph of C œ ÐB Ñ ' is a parabola? b. Does the parabola open up or down? Why? c. What is the smallest C-value on the graph of C œ

More information

6.001 Notes: Section 4.1

6.001 Notes: Section 4.1 6.001 Notes: Section 4.1 Slide 4.1.1 In this lecture, we are going to take a careful look at the kinds of procedures we can build. We will first go back to look very carefully at the substitution model,

More information

Pointers. CS2023 Winter 2004

Pointers. CS2023 Winter 2004 Pointers CS2023 Winter 2004 Outcomes: Introduction to Pointers C for Java Programmers, Chapter 8, sections 8.1-8.8 Other textbooks on C on reserve After the conclusion of this section you should be able

More information

BBC Learning English Face up to Phrasals Bob & Jackie's Chemistry Project

BBC Learning English Face up to Phrasals Bob & Jackie's Chemistry Project BBC Learning English Face up to Phrasals & 's Chemistry Project Episode 1: Let's Get Started : Ok, chemistry project. Let's get this up. Are you ok,? experiment set What's all this about a chemistry project?

More information

MTH309 Linear Algebra: Maple Guide

MTH309 Linear Algebra: Maple Guide MTH309 Linear Algebra: Maple Guide Section 1. Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) Example. Calculate the REF and RREF of the matrix Solution. Use the following command to insert

More information

On the Performance of Greedy Algorithms in Packet Buffering

On the Performance of Greedy Algorithms in Packet Buffering On the Performance of Greedy Algorithms in Packet Buffering Susanne Albers Ý Markus Schmidt Þ Abstract We study a basic buffer management problem that arises in network switches. Consider input ports,

More information

Do you remember any iterative sorting methods? Can we produce a good sorting method by. We try to divide and conquer: break into subproblems

Do you remember any iterative sorting methods? Can we produce a good sorting method by. We try to divide and conquer: break into subproblems MERGESORT 315 Sorting Recursively Do you remember any iterative sorting methods? How fast are they? Can we produce a good sorting method by thinking recursively? We try to divide and conquer: break into

More information

Scan Scheduling Specification and Analysis

Scan Scheduling Specification and Analysis Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract

More information

Exploiting scattering media for exploring 3D objects

Exploiting scattering media for exploring 3D objects Exploiting scattering media for exploring 3D objects Alok Kumar Singh 1, Dinesh N Naik 1,, Giancarlo Pedrini 1, Mitsuo Takeda 1, 3 and Wolfgang Osten 1 1 Institut für Technische Optik and Stuttgart Research

More information

Cartons (PCCs) Management

Cartons (PCCs) Management Final Report Project code: 2015 EE04 Post-Consumer Tetra Pak Cartons (PCCs) Management Prepared for Tetra Pak India Pvt. Ltd. Post Consumer Tetra Pak Cartons (PCCs) Management! " # $ " $ % & ' ( ) * +,

More information

Probabilistic analysis of algorithms: What s it good for?

Probabilistic analysis of algorithms: What s it good for? Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008 The goal Given some algorithm taking inputs from some set Á, we would like

More information

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can

More information

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 Graphs (MTAT.05.080, 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 homepage: http://www.ut.ee/~peeter_l/teaching/graafid08s (contains slides) For grade:

More information

Math 308 Autumn 2016 MIDTERM /18/2016

Math 308 Autumn 2016 MIDTERM /18/2016 Name: Math 38 Autumn 26 MIDTERM - 2 /8/26 Instructions: The exam is 9 pages long, including this title page. The number of points each problem is worth is listed after the problem number. The exam totals

More information

Software Properties as Axioms and Theorems

Software Properties as Axioms and Theorems Applied Software Properties as Axioms and Theorems proofs by induction or How to Write Reliable Software and know it's reliable Applied 1 Example: Multiplexor Function Problem: Multiplex two sequences

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Probably the simplest kind of problem. Occurs in many contexts, often as part of larger problem. Symbolic manipulation packages can do linear algebra "analytically" (e.g. Mathematica,

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

Adorn. Slab Serif Smooth R E G U LAR. v22622x

Adorn. Slab Serif Smooth R E G U LAR. v22622x s u Adorn f Slab Serif Smooth R E G U LAR B OL D t 0 v22622x 9 user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v O P E N T Y P E FAQ : For information on how to access the swashes and alternates,

More information

Matchings. Examples. K n,m, K n, Petersen graph, Q k ; graphs without perfect matching. A maximal matching cannot be enlarged by adding another edge.

Matchings. Examples. K n,m, K n, Petersen graph, Q k ; graphs without perfect matching. A maximal matching cannot be enlarged by adding another edge. Matchings A matching is a set of (non-loop) edges with no shared endpoints. The vertices incident to an edge of a matching M are saturated by M, the others are unsaturated. A perfect matching of G is a

More information

arxiv: v2 [math.co] 13 Aug 2013

arxiv: v2 [math.co] 13 Aug 2013 Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed

More information

AXIOMS FOR THE INTEGERS

AXIOMS FOR THE INTEGERS AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,

More information

Version /10/2015. Type specimen. Bw STRETCH

Version /10/2015. Type specimen. Bw STRETCH Version 1.00 08/10/2015 Bw STRETCH type specimen 2 Description Bw Stretch is a compressed grotesque designed by Alberto Romanos, suited for display but also body text purposes. It started in 2013 as a

More information

REU 2006 Discrete Math Lecture 5

REU 2006 Discrete Math Lecture 5 REU 2006 Discrete Math Lecture 5 Instructor: László Babai Scribe: Megan Guichard Editors: Duru Türkoğlu and Megan Guichard June 30, 2006. Last updated July 3, 2006 at 11:30pm. 1 Review Recall the definitions

More information

Algebra of Sets (Mathematics & Logic A)

Algebra of Sets (Mathematics & Logic A) Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

III. CLAIMS ADMINISTRATION

III. CLAIMS ADMINISTRATION III. CLAIMS ADMINISTRATION Insurance Providers: Liability Insurance: Greenwich Insurance Company American Specialty Claims Representative: Mark Thompson 142 N. Main Street, Roanoke, IN 46783 Phone: 260-672-8800

More information

Designing Networks Incrementally

Designing Networks Incrementally Designing Networks Incrementally Adam Meyerson Kamesh Munagala Ý Serge Plotkin Þ Abstract We consider the problem of incrementally designing a network to route demand to a single sink on an underlying

More information

Discrete Mathematics. Kruskal, order, sorting, induction

Discrete Mathematics.   Kruskal, order, sorting, induction Discrete Mathematics wwwmifvult/~algis Kruskal, order, sorting, induction Kruskal algorithm Kruskal s Algorithm for Minimal Spanning Trees The algorithm constructs a minimal spanning tree as follows: Starting

More information

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit.

Math 2B Linear Algebra Test 2 S13 Name Write all responses on separate paper. Show your work for credit. Math 2B Linear Algebra Test 2 S3 Name Write all responses on separate paper. Show your work for credit.. Construct a matrix whose a. null space consists of all combinations of (,3,3,) and (,2,,). b. Left

More information

Column and row space of a matrix

Column and row space of a matrix Column and row space of a matrix Recall that we can consider matrices as concatenation of rows or columns. c c 2 c 3 A = r r 2 r 3 a a 2 a 3 a 2 a 22 a 23 a 3 a 32 a 33 The space spanned by columns of

More information