Technische Universität München Zentrum Mathematik
|
|
- Rhoda Harvey
- 5 years ago
- Views:
Transcription
1 Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 8 Solutions for Worksheet 9 (8-6-8) Question. Intersecting conics Classwork Let the following two matrices describe two conics: 3 A = 3 B = 8 4 The goal of this task is to determine all points of intersection between these two conics. a) Determine a linear combination C = A + λb which represents a degenerate conic, and compute its matrix. b) Transform this matrix C into an equivalent matrix C of rank. c) Read the constituent lines g and h from this matrix. d) Determine a matrix M g in such a way that for every vector v R 3 the equation M g v = g v holds. Also compute M h in the same way. If you don t remember the structure of such a matrix by heart, try to derive it instead of looking it up in your lecture notes. e) Find the matrix D of a degenerate dual conic that has all those lines as tangents which pass through either of the points of intersection between g and A. f) Find a matrix D equivalent to D but of rank. Make use of the fact that you know the homogeneous coordinates of g. Read the coordinates of two points of intersection from this matrix. g) In the same fashion, compute the points of intersection between line h and conic B. h) Write down a list of all the points during this computation where you either made an arbitrary choice, or where the problem statement made an arbitrary choice, even though a computation based on a different choice would have lead to the same final results. i) Identify the other degenerate conics which could result from subtask a), and split at least one of them into lines k and l. j) Compute all those points of intersection between the lines g, h, k, l which are also points of intersection between the conics. Use this to verify your previous results.
2 Solution: a) A conic is degenerated if the determinant of its symmetric matrix is zero. This leads to: 3 = det(a + λb) = det 3 + λ λ λ = 3 λ λ λ λ 4(λ ) 3 λ λ = (λ ) 3 λ λ 4 At this point we already see that λ = has to be a root of the determinant, which is enough for this part. C = A + B = b) Because of the very easy structure of C one can spot a suitable rank--matrix basically immediately: C = C + = c) A non-zero row or column of the matrix is a representative of one of the factor lines. C = = (,, ) g = h = d) If you do not know the structure of such a matrix M g by heart, reconstruct it from an example: v v g v = v = v 3 = v = M g v M g = v 3 v v 3 v v 3 v h v = v = = v = M h v M h = v 3 v v 3 e) A line m is tangential to D iff the intersection of m and g lies on A. (g m) T A (g m) = m T M T g A M g m We can deduce the matrix of the conic from this: D = M T g A M g = = 8 = 8 3
3 f) The matrix D must result as a linear combination of D and M g, as g is the connecting line of the two points described by the dual conic to D. D = D + λm g = 8 + λ In this easy case, one can see without computing the determinant that λ = ± leads to a rank--matrix. D = D + M g = 8 + = 8 4 D = 4 (,, ) This leads to the two intersections of g and A: p = p = g) Analogously we get ther intersections of h and B: E = M T h B M h = = = 4 E = E + M h = = (,, ) p 3 = h) At the following points we made an arbitrary choice: p 4 = In the linear combination in part a): Which conic has the coefficient. Another possibility would have been C = B + λa. In part a): Which of three roots of the determinant to use. These roots correspond to the three degenerated conics through the four points. In part b) and f), we could have used the transposed matrix or could have done without the scaling. The assignment of the letters g an h to rows and columns is arbitrary. The other assignment leads to swapping the lines just as transposing the matrix does. As we explicitly use g in the succeeding computations, this choice influences the next steps, but not the entirety of the intersection points. It does not matter which line and which conic to intersect. One can intersect both with A, both with B or g with B ans h with A. 3
4 i) To determine the other degenerated conics, we have to expand the determinant from part a). 3 λ λ det(a + λb) = (λ ) 3 λ λ 4 ( = (λ ) (λ 3) 3 λ λ ) 4 3 λ λ λ = (λ ) (λ 3) ((3 λ) 4 ( λ) ( ) (λ ) ) = (λ ) (λ 3) ( 4λ + λ + λ ) = (λ ) (λ 3) (8 λ) = 4 (λ ) (λ 3) (λ 4) With this, we know the other roots. And the respective conics unfold as linear combinations: A + 3B = = (,, ) 4 4 A + 4B = 4 = (,, ) k = l = j) We can the four intersection points also by the following computation: g = h = k = l = g k = = p g l = = p h k = = p 4 h l = = p 3 This ansatz yields the same four intersection points (up to scalars) as above. To close this exercise, a picture to visualise the conics and their finite and infinite intersections: A B 4
5 Question. Decomposing a conic Decompose the following conic into its constituent lines: 4 A = Solution: First, we determine the dual conic B = A = = From this matrix we can infer (by considering any non-zero row or column) that the intersection of the two lines is p = (3,, ) T. So it would have been enough to compute a single row or column. When looking a the structure of the adjugate matrix, we see that a single column is computed via -determinants with alternating sign. We recall this structure from the cross product. So, computing directly from A: = 8 = p 7 9 The anti-symmetric matrix we have to add to A to get rank is therefore a multiple of C = M p = 3 3 Now we have to find a suitable multiple. When A + αc has rank, every -determinant will be zero. Using the bottom right sub-matrix, we get α 7 3α 8 = (3α) = α = ± = ± = ±3 3 3 Of course, we could have used any of the other two -determinants with the top left one we would even have avoided division. What becomes apparent with the above solution is, however, that the respective coordinate of p appears in the denominator of the solution for α. The corresponding determinant appears in the numerator. This determinant we could also read from the adjugate. With the proportion factor α = 3 we found, we can compute the rank--matrix: D = A + 3C = = 4 = (,, ) So, the two lines have the homogeneous coordinates. g = h = 4
6 Question 3. From where was a picture taken Given the following points in RP Homework A = B = 3 C = D = E = you are asked to compute the point F RP (distinct from A through E) which satisfies (A, B; C, D) F = (B, C; D, E) F = 3 a) Each of these cross ratios defines a conic. The value has special significance for cross ratios. What is special about the corresponding conic, and how can you exploit this fact in subsequent tasks? b) Find matrices which represent the two conics for the given cross ratios. c) Find the point F which satisfies the above condition. Solution: a) A cross-ratio of, or in RP means that at least two of the points are the same. Concretely, for (A, B; C, D) = we have A B or C D. This is obvious from the definition of the cross-ratio. Transferring this to the plane viewed from a fifth point F, this means that the respective connecting lines collapse. I.e. either ABF are collinear or CDF. So the conic degenerates into two lines. b) The conic corresponding to the first equation can be directly determined from the two lines. (A B) (C D) T = 3 A suitable symmetric representation would be 6 6 Q + Q T = 6 T 3 3 = (,, ) = = Q 6 6 For the conic with cross-ratio 3 it is best to orientate oneself towards exercise on sheet 8. First, we have to determine the conics with cross-ratio, and. (B D) (C E) T = (,, ) = R 4 (B C) (D E) T = (,, ) = = R 4 4 (B E) (C D) T = (,, ) = = R 7 7 6
7 These conics should be symmetrised to be able to handle the next step. S = R + R T = 8 S = R + R T = 8 7 S = R + R T = 7 The next step is to adjust the scale defined by these three conics we need representatives for S and S such that their sum is (a multiple of) S. Because of the zeros we can read the respective factors directly from the top left and bottom right corner: S + S = S ( So we found the basis matrices: S takes on the role of and S ) the role of ( 3 this scale we get by a point. ) ( ). The cross-ratio of 3 for S + S = 3 + = 6 = K 7 6 c) In theory, we would now have to intersect the conics Q and K. We know, however, that Q is degenerated and we even know its components. Furthermore, we know that Q and K have the points B, C and D in common. It thus suffices to intersect the line AB with the conic K. 3 A B = 6 6 M A B = L = M T A B K M A B = = = This matrix describes the two intersection points of the line AB with the conic K. To decompose it into these points we have to add an anti-symmetric matrix to get a rank--matric. To be precise, we have to add a suitable multiple of M A B. We can get the proportion factor for example from the minor obtained by deleting the middle row and middle column. This has the advantage that the middle coordinate of A B is and we therefore do not have to divide by it. α = = = 4 + = 3 L + α M A B = 3 8 = 3 (, 3, ) So, the conic K intersects the line AB in the known point B and the desired point F. It is therefore determined as F = 3 3 7
8 The computation to get this final result was quite long and some intermediate result are still uncomfortably large. Moreover, we had to take care of many signs. This makes computational errors very likely. So it makes sense to verify the result at this point. Computing the cross-ratios given in the instructions with the computed F does result in the given values. The result is correct. Question 4. Degrees of freedom of conics a) How many real degrees of freedom does one have in choosing an arbitrary conic in RP? b) Suppose you have chosen such a conic. Now we are looking for projective transformations which map the unit circle to this conic. How many real degrees of freedom are there to choose such a transformation? In subsequent subtasks this figure shall be denoted as k. c) Suppose you are given k pairwise distinct points P i on the unit circle, and also k pairwise distinct points P i on a conic represented by some matrix B. Describe how one could obtain the matrix of the projective transformation which maps the unit circle onto B. d) Execute this computation using specific numbers. You are free to choose coordinates in such a way that the computations become as simple as possible. The conic B shall not be degenerate, though, and not a circle either. Furthermore, you should perform all steps as you described them in c), even though your specific choice of coordinates could make some steps more simple. You may of course use these easier solutions to verify your results. Solution: a) A conic is described by an equation with 6 coefficients. This corresponds to the 6 entries of a triangular matrix, from which the other other entries of a symmetric matrix yield. A multiple of such an equation or matrix gives, however, the same conic. This leaves degrees of freedom. An alternative approach is the following: A conic can be described by points in the plane. Each point gives real degrees of freedom. But each of these points can be shifted along the conic without changing the conic. This eliminates degree of freedom. This leaves degrees, too. b) A conic is parametrised by RP. Hence, three points on the conic fix a projective scale. All other points are uniquely determined by their cross-ratio w.r.t. these three points. Each of these three base points can be chosen on the conic, giving degree of freedom each. I.e. 3 in total. c) One possibility is to construct the point P 4 which is in harmonic position w.r.t. P through P 3 i.e. satisfying (P, P ; P 3, P 4 ) =. It can be determined, for example, by Hesse s transfer principle. Analogously, we can determine a point P 4 as its image. Then we have four points and their images which determine a unique projective transformation, as we know. d) There are many reasonable choices for suitable numbers. Furthermore, there is a certain trade-of between easy computations and a high learning effect. The more complicated the coordinates are the better one has to understand the general approach. This solution treats a rather easy case: The transformation which is the final result will be given in advance. For example, one could choose the transformation that scales every x-coordinate by. The image of the unit circle would then be an ellipse with its center of symmetry at the origin. As defining points one could use points on the coordinate axes. The corresponding details would like this: A = B = P = P = P = P = P 3 = P 3 = 8
9 With this we can compute the points P 4 and P 4. To do so, we take the tangents at the conic in P and P, connect their intersection with P 3 and intersect this line with the conic. Starting with the intersection of the tangents: Q (A P ) (A P ) = = = Q 8 Q (B P ) (B P ) = = = Q And then... P 4 = Q T AQ P 3 P3 T AQ Q = P 3 Q = P 4 = Q T BQ T P 3 P 3 T BQ Q = P 3 Q = Now we need transformations mapping the standard basis of RP onto the corresponding point quadruple. λ λ µ = µ = τ τ λ λ µ = µ = τ τ M = M = Of these maps, M will gets executed in the opposite direction and afterwards M in forward direction. The compound map is therefore 4 M = M M = = That is exactly the transformation we chose in the beginning. This means the computation is correct. It can be applied to other points and conics by using other numbers. The method is sufficiently general. 9
Technische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16 Solutions for Worksheet 6 (2016-05-26)
More informationMATH10212 Linear Algebra B Homework 7
MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments
More information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
More informationLesson 3. Inverse of Matrices by Determinants and Gauss-Jordan Method
Module 1: Matrices and Linear Algebra Lesson 3 Inverse of Matrices by Determinants and Gauss-Jordan Method 3.1 Introduction In lecture 1 we have seen addition and multiplication of matrices. Here we shall
More informationConics and their duals
9 Conics and their duals You always admire what you really don t understand. Blaise Pascal So far we dealt almost exclusively with situations in which only points and lines were involved. Geometry would
More informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationMATH 2050 Assignment 8 Fall [10] 1. Find the determinant by reducing to triangular form for the following matrices.
MATH 2050 Assignment 8 Fall 2016 [10] 1. Find the determinant by reducing to triangular form for the following matrices. 0 1 2 (a) A = 2 1 4. ANS: We perform the Gaussian Elimination on A by the following
More informationLecture 2 Systems of Linear Equations and Matrices, Continued
Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationChoose three of: Choose three of: Choose three of:
MATH Final Exam (Version ) Solutions July 8, 8 S. F. Ellermeyer Name Instructions. Remember to include all important details of your work. You will not get full credit (or perhaps even any partial credit)
More informationLinear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway
Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationHonors Advanced Mathematics Determinants page 1
Determinants page 1 Determinants For every square matrix A, there is a number called the determinant of the matrix, denoted as det(a) or A. Sometimes the bars are written just around the numbers of the
More information30.3. LU Decomposition. Introduction. Prerequisites. Learning Outcomes
LU Decomposition 30.3 Introduction In this Section we consider another direct method for obtaining the solution of systems of equations in the form AX B. Prerequisites Before starting this Section you
More informationMethods for Solving Linear Systems Part 2
Methods for Solving Linear Systems Part 2 We have studied the properties of matrices and found out that there are more ways that we can solve Linear Systems. In Section 7.3, we learned that we can use
More informationSPRING OF 2008 D. DETERMINANTS
18024 SPRING OF 2008 D DETERMINANTS In many applications of linear algebra to calculus and geometry, the concept of a determinant plays an important role This chapter studies the basic properties of determinants
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 10 Row expansion of the determinant Our next goal is
More informationMATRIX DETERMINANTS. 1 Reminder Definition and components of a matrix
MATRIX DETERMINANTS Summary Uses... 1 1 Reminder Definition and components of a matrix... 1 2 The matrix determinant... 2 3 Calculation of the determinant for a matrix... 2 4 Exercise... 3 5 Definition
More informationChapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33
Chapter 5: Matrices Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 5: Matrices Semester 1 2018 1 / 33 In this chapter Matrices were first introduced in the Chinese Nine Chapters on the Mathematical
More informationLecture 8: Determinants I
8-1 MATH 1B03/1ZC3 Winter 2019 Lecture 8: Determinants I Instructor: Dr Rushworth January 29th Determinants via cofactor expansion (from Chapter 2.1 of Anton-Rorres) Matrices encode information. Often
More information1 Last time: determinants
1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)
More informationSection 1.5. Solution Sets of Linear Systems
Section 1.5 Solution Sets of Linear Systems Plan For Today Today we will learn to describe and draw the solution set of an arbitrary system of linear equations Ax = b, using spans. Ax = b Recall: the solution
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationHermite normal form: Computation and applications
Integer Points in Polyhedra Gennady Shmonin Hermite normal form: Computation and applications February 24, 2009 1 Uniqueness of Hermite normal form In the last lecture, we showed that if B is a rational
More informationMIDTERM 1 - SOLUTIONS
MIDTERM - SOLUTIONS MATH 254 - SUMMER 2002 - KUNIYUKI CHAPTERS, 2, GRADED OUT OF 75 POINTS 2 50 POINTS TOTAL ) Use either Gaussian elimination with back-substitution or Gauss-Jordan elimination to solve
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 8 Lecture 8 8.1 Matrices July 22, 2018 We shall study
More informationChapter 4. Solving Systems of Equations. Chapter 4
Solving Systems of Equations 3 Scenarios for Solutions There are three general situations we may find ourselves in when attempting to solve systems of equations: 1 The system could have one unique solution.
More information7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to 1.1. Introduction Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationSecond Midterm Exam April 14, 2011 Answers., and
Mathematics 34, Spring Problem ( points) (a) Consider the matrices all matrices. Second Midterm Exam April 4, Answers [ Do these matrices span M? ] [, ] [, and Lectures & (Wilson) ], as vectors in the
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More informationMTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education
MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life
More information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.
More informationLinear Algebra 1 Exam 1 Solutions 6/12/3
Linear Algebra 1 Exam 1 Solutions 6/12/3 Question 1 Consider the linear system in the variables (x, y, z, t, u), given by the following matrix, in echelon form: 1 2 1 3 1 2 0 1 1 3 1 4 0 0 0 1 2 3 Reduce
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 6 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 6 1 / 14 Gauss Jordan elimination Last time we discussed bringing matrices to reduced
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: March 17 2011 Problem 1 The state of the planar pendulum is entirely defined by the position of its moving end in the plane R 2 Since
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationAPPLICATIONS The eigenvalues are λ = 5, 5. An orthonormal basis of eigenvectors consists of
CHAPTER III APPLICATIONS The eigenvalues are λ =, An orthonormal basis of eigenvectors consists of, The eigenvalues are λ =, A basis of eigenvectors consists of, 4 which are not perpendicular However,
More information2018 Fall 2210Q Section 013 Midterm Exam I Solution
8 Fall Q Section 3 Midterm Exam I Solution True or False questions ( points = points) () An example of a linear combination of vectors v, v is the vector v. True. We can write v as v + v. () If two matrices
More informationMath 250B Midterm I Information Fall 2018
Math 250B Midterm I Information Fall 2018 WHEN: Wednesday, September 26, in class (no notes, books, calculators I will supply a table of integrals) EXTRA OFFICE HOURS: Sunday, September 23 from 8:00 PM
More informationMATH10212 Linear Algebra B Homework 6. Be prepared to answer the following oral questions if asked in the supervision class:
MATH0 Linear Algebra B Homework 6 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra its Applications Pearson, 006 (or other editions) Normally, homework assignments
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationDigital Workbook for GRA 6035 Mathematics
Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................
More informationThe complex projective line
17 The complex projective line Now we will to study the simplest case of a complex projective space: the complex projective line. We will see that even this case has already very rich geometric interpretations.
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: February 16 2012 Problem 1 a The projection maps a point P x y S 1 to the point P u 0 R 2 the intersection of the line NP with the x-axis
More informationMATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.
MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of
More information4.2. ORTHOGONALITY 161
4.2. ORTHOGONALITY 161 Definition 4.2.9 An affine space (E, E ) is a Euclidean affine space iff its underlying vector space E is a Euclidean vector space. Given any two points a, b E, we define the distance
More informationMaths for Signals and Systems Linear Algebra in Engineering
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE
More informationMath Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!
Math 5- Computation Test September 6 th, 6 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge! Name: Answer Key: Making Math Great Again Be sure to show your work!. (8 points) Consider the following
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationMatrix Factorization and Analysis
Chapter 7 Matrix Factorization and Analysis Matrix factorizations are an important part of the practice and analysis of signal processing. They are at the heart of many signal-processing algorithms. Their
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationMath 54 HW 4 solutions
Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,
More informationLecture 9: Elementary Matrices
Lecture 9: Elementary Matrices Review of Row Reduced Echelon Form Consider the matrix A and the vector b defined as follows: 1 2 1 A b 3 8 5 A common technique to solve linear equations of the form Ax
More informationIntroduction to Systems of Equations
Introduction to Systems of Equations Introduction A system of linear equations is a list of m linear equations in a common set of variables x, x,, x n. a, x + a, x + Ù + a,n x n = b a, x + a, x + Ù + a,n
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationMODEL ANSWERS TO HWK #3
MODEL ANSWERS TO HWK #3 1. Suppose that the point p = [v] and that the plane H corresponds to W V. Then a line l containing p, contained in H is spanned by the vector v and a vector w W, so that as a point
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationMatrices. In this chapter: matrices, determinants. inverse matrix
Matrices In this chapter: matrices, determinants inverse matrix 1 1.1 Matrices A matrix is a retangular array of numbers. Rows: horizontal lines. A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 a 41 a
More informationECON 186 Class Notes: Linear Algebra
ECON 86 Class Notes: Linear Algebra Jijian Fan Jijian Fan ECON 86 / 27 Singularity and Rank As discussed previously, squareness is a necessary condition for a matrix to be nonsingular (have an inverse).
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More information5.6. PSEUDOINVERSES 101. A H w.
5.6. PSEUDOINVERSES 0 Corollary 5.6.4. If A is a matrix such that A H A is invertible, then the least-squares solution to Av = w is v = A H A ) A H w. The matrix A H A ) A H is the left inverse of A and
More informationSAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationLS.1 Review of Linear Algebra
LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order
More information11 a 12 a 13 a 21 a 22 a b 12 b 13 b 21 b 22 b b 11 a 12 + b 12 a 13 + b 13 a 21 + b 21 a 22 + b 22 a 23 + b 23
Chapter 2 (3 3) Matrices The methods used described in the previous chapter for solving sets of linear equations are equally applicable to 3 3 matrices. The algebra becomes more drawn out for larger matrices,
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More informationMath 462: Homework 2 Solutions
Math 46: Homework Solutions Paul Hacking /6/. Consider the matrix A = (a) Check that A is orthogonal. (b) Determine whether A is a rotation or a reflection / rotary reflection. [Hint: What is the determinant
More informationMATH 110: LINEAR ALGEBRA PRACTICE MIDTERM #2
MATH 0: LINEAR ALGEBRA PRACTICE MIDTERM #2 FARMER SCHLUTZENBERG Note The theorems in sections 5. and 5.2 each have two versions, one stated in terms of linear operators, one in terms of matrices. The book
More informationAlgebraic. techniques1
techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them
More informationModeling and Simulation with ODE for MSE
Zentrum Mathematik Technische Universität München Prof. Dr. Massimo Fornasier WS 6/7 Dr. Markus Hansen Sheet 7 Modeling and Simulation with ODE for MSE The exercises can be handed in until Wed, 4..6,.
More informationGetting Started with Communications Engineering
1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we
More informationMTH 35, SPRING 2017 NIKOS APOSTOLAKIS
MTH 35, SPRING 2017 NIKOS APOSTOLAKIS 1. Linear independence Example 1. Recall the set S = {a i : i = 1,...,5} R 4 of the last two lectures, where a 1 = (1,1,3,1) a 2 = (2,1,2, 1) a 3 = (7,3,5, 5) a 4
More information1 procedure for determining the inverse matrix
table of contents 1 procedure for determining the inverse matrix The inverse matrix of a matrix A can be determined only if the determinant of the matrix A is different from zero. The following procedures
More informationLaw of Trichotomy and Boundary Equations
Law of Trichotomy and Boundary Equations Law of Trichotomy: For any two real numbers a and b, exactly one of the following is true. i. a < b ii. a = b iii. a > b The Law of Trichotomy is a formal statement
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationMATH 2210Q MIDTERM EXAM I PRACTICE PROBLEMS
MATH Q MIDTERM EXAM I PRACTICE PROBLEMS Date and place: Thursday, November, 8, in-class exam Section : : :5pm at MONT Section : 9: :5pm at MONT 5 Material: Sections,, 7 Lecture 9 8, Quiz, Worksheet 9 8,
More informationANSWERS (5 points) Let A be a 2 2 matrix such that A =. Compute A. 2
MATH 7- Final Exam Sample Problems Spring 7 ANSWERS ) ) ). 5 points) Let A be a matrix such that A =. Compute A. ) A = A ) = ) = ). 5 points) State ) the definition of norm, ) the Cauchy-Schwartz inequality
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) 00 Solutions For Problem Sheet 0 In this Problem Sheet we calculated some left and right inverses and verified the theorems about them given in the lectures.
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 8 MATRICES III Rank of a matrix 2 General systems of linear equations 3 Eigenvalues and eigenvectors Rank of a matrix
More informationIntroduction to Geometry
Introduction to Geometry it is a draft of lecture notes of H.M. Khudaverdian. Manchester, 18 May 211 Contents 1 Euclidean space 3 1.1 Vector space............................ 3 1.2 Basic example of n-dimensional
More informationLinear Equation: a 1 x 1 + a 2 x a n x n = b. x 1, x 2,..., x n : variables or unknowns
Linear Equation: a x + a 2 x 2 +... + a n x n = b. x, x 2,..., x n : variables or unknowns a, a 2,..., a n : coefficients b: constant term Examples: x + 4 2 y + (2 5)z = is linear. x 2 + y + yz = 2 is
More informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
More informationMH1200 Final 2014/2015
MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a
More informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationTBP MATH33A Review Sheet. November 24, 2018
TBP MATH33A Review Sheet November 24, 2018 General Transformation Matrices: Function Scaling by k Orthogonal projection onto line L Implementation If we want to scale I 2 by k, we use the following: [
More informationBasic Surveying Week 3, Lesson 2 Semester 2017/18/2 Vectors, equation of line, circle, ellipse
Basic Surveying Week 3, Lesson Semester 017/18/ Vectors, equation of line, circle, ellipse 1. Introduction In surveying calculations, we use the two or three dimensional coordinates of points or objects
More informationEXAM 2 REVIEW DAVID SEAL
EXAM 2 REVIEW DAVID SEAL 3. Linear Systems and Matrices 3.2. Matrices and Gaussian Elimination. At this point in the course, you all have had plenty of practice with Gaussian Elimination. Be able to row
More informationOverview. Motivation for the inner product. Question. Definition
Overview Last time we studied the evolution of a discrete linear dynamical system, and today we begin the final topic of the course (loosely speaking) Today we ll recall the definition and properties of
More informationNumerical Methods Lecture 2 Simultaneous Equations
Numerical Methods Lecture 2 Simultaneous Equations Topics: matrix operations solving systems of equations pages 58-62 are a repeat of matrix notes. New material begins on page 63. Matrix operations: Mathcad
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationMath/CS 466/666: Homework Solutions for Chapter 3
Math/CS 466/666: Homework Solutions for Chapter 3 31 Can all matrices A R n n be factored A LU? Why or why not? Consider the matrix A ] 0 1 1 0 Claim that this matrix can not be factored A LU For contradiction,
More information(Refer Slide Time: )
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi FIR Lattice Synthesis Lecture - 32 This is the 32nd lecture and our topic for
More informationLines and points. Lines and points
omogeneous coordinates in the plane Homogeneous coordinates in the plane A line in the plane a + by + c is represented as (a, b, c). A line is a subset of points in the plane. All vectors (ka, kb, kc)
More information