Perspective Projection of an Ellipse
|
|
- Avice Haynes
- 6 years ago
- Views:
Transcription
1 Perspective Projection of an Ellipse David Eberly, Geometric ools, Redmond WA his work is licensed under the Creative Commons Attribution 4.0 International License. o view a copy of this license, visit or send a letter to Creative Commons, PO Box 1866, Mountain View, CA 94042, USA. Created: March 10, 2015 Contents 1 Introduction 2 2 Elliptical Cones Right Elliptical Cones Skewed Elliptical Cones General Elliptical Cones Converting General Cones to Skewed Cones Projection of the Ellipse to Another Plane 5 1
2 1 Introduction he standard axis-aligned ellipse in 2D is of the form ( ) 2 y0 + ( y1 ) 2 = 1 (1) where d 0 > 0 and d 1 > 0. he 2D coordinates of points are (y 0, y 1 ). d 0 In 3D, we can specify an ellipse in a general plane. Let the ellipse center be C e, which is a point on the plane. Let the plane normal be the unit-length vector N e. Choose unit-length vectors U e and V e so that the set {U e, V e, N e } is a right-handed orthonormal basis; that is, the vectors are unit-length, mutually orthogonal, and N e = U e V e. he ellipse consists of 3D points d 1 X e = C e + y 0 U e + y 1 V e = C e + J e Y e (2) where (y 0, y 1 ) is a solution to equation (1). he second equality in equation (2) defines the 3 2 matrix J e whose columns are U e and V e and defines the 2 1 column vector Y e whose rows are the components of (y 0, y 1 ). Given an eyepoint E, we want to perspectively project the ellipse onto another plane. hat plane has unitlength normal N p and origin point C p. We may choose the normal so that E is on the side of the plane to which N p is directed; that is, N p (E C p ) > 0. If {U p, V p, N p } is a right-handed orthonormal set, then points on the projection plane are X p = C p + y 2 U p + y 3 V p = C p + J p Y p (3) he second equality in equation (3) defines the 3 2 matrix J p whose columns are U p and V p and defines the 2 1 column vector Y p whose rows are the components of (y 2, y 3 ). Assuming the ellipse is between the eyepoint and the projection plane, the projection is also an ellipse. We will determine a quadratic equation in the components of Y p that define the projected ellipse. 2 Elliptical Cones here are multiple ways to approach the projection problem. he one presented here is based on computing an ellipse as the intersection of an elliptical cone and a plane. he intersection will be represented implicitly by a quadratic equation of Y p. 2.1 Right Elliptical Cones A standard right elliptical cone is represented algebraically as ( ) 2 ( ) 2 y2 y0 1 = + e 2 d 0 ( y1 d 1 ) 2 (4) where the cone vertex is located at (0, 0, e 2 ) with e 2 > 0. he cone vertex is a solution to equation (4). When y 2 = 0, the elliptical cone equation reduces to the standard ellipse equation (1). hus, the standard ellipse points are on the elliptical cone, which means that these points are the intersection of the elliptical cone with the y 0 y 1 -plane. 2
3 2.2 Skewed Elliptical Cones he use of the term right elliptical refers to the vector from ellipse origin to cone vertex is perpendicular to the ellipse plane. We can define an elliptical cone generally by allowing the cone vertex to be at a point Ē = (ē 0, ē 1, ē 2 ) with ē 2 > 0 and the first two components not necessarily zero. he cone axis passes through Ē and the origin (0, 0, 0) but is no longer perpendicular to the ellipse plane. We wish to have an algebraic representation of this cone. Let us first look at a derivation that leads to equation (4). Define Q(Y) = Y ĀY + B Y + c, where as a 3-tuple, Y = (y 0, y 1, y 2 ). he 3 3 matrix Ā is symmetric, B is a 3 1 vector, and c is a scalar. he right elliptical cone is represented by the quadratic equation Q(Y) = 0 for some choice of Ā, B, and c. Observe that the choices involve 10 parameters, 6 for Ā = [ā ij], 3 for B = [ b j ], and 1 for c. 1. When y 2 = 0, Q(Y) = 0 must reduce to the standard ellipse equation. Replacing y 2 = 0 in the quadratic equation, [ ] y 0 y 1 ā00 ā 01 y [ ] 0 + b0 b1 y 0 + c = 0 ā 01 ā 11 y 1 o obtain the standard ellipse equation, we need ā 00 = 1/d 2 0, ā 01 = 0, ā 11 = 1/d 2 1, b 0 = 0, b 1 = 0, and c = he surface normal at the cone vertex is degenerate, so the gradient must be the zero vector: 0 = Q(Ē) = 2ĀĒ + B. Using the information from item 1 and this constraint, we have ā 02 = ē 0 /(ē 2 d 2 0), ā 12 = ē 1 /(ē 2 d 2 1), and 2ē 2 2ā 22 + ē 2 b2 = 2(ē 2 0/d ē 2 1/d 2 1). 3. he cone vertex solves Q(Ē) = 0, which implies ē2 2ā 22 + ē 2 b2 = 1 + (ē 2 0/d ē 2 1/d 2 1). 4. Items 2 and 3 are solved for ā 22 = (ē 2 0/d ē 2 1/d 2 1 1)/ē 2 2 and b 2 = 2/ē 2. y 1 We have determined A, B, and c, namely, 1/d ē 0 /(ē 2 d 2 0) Ā = 0 1/d 2 1 ē 1 /(ē 2 d 2 1) ē 0 /(ē 2 d 2 0) ē 1 /(ē 2 d 2 1) (ē 2 0/d ē 2 1/d 2 1 1)/ē 2 2, B = 0 0, c = 1 (5) 2/ē 2 Some factorization leads to the equation for the elliptical cone, ( ) 2 ( ) 2 ( ) 2 y2 y0 1 = ē0 y 2 y1 + ē1 y 2 (6) ē 2 d 0 d 0 ē 2 d 1 d 1 ē General Elliptical Cones In the most general case, the ellipse is not necessary in a coordinate-axis plane. Equation (2) is the equation for ellipse points, where (y 0, y 1 ) solves equation (1). We want to determine A, B, and c for which Q(X) = 0 implicitly defines the elliptical cone with vertex E and contains the specified ellipse points X e. 3
4 First, the ellipse points must satisfy 0 = Q(X) = X AX + B X + c, 0 = X e AX e + B X e + c = (C e + J e Y e ) A (C e + J e Y e ) + B (C e + J e Y e ) + c = Y ( ) e J e AJ e Ye + ( Je (B + 2AC e ) ) ( ) Ye + C e AC e + B C e + c (7) Because Y e is a solution to the standard ellipse equation, J e AJ e = Diagonal(1/d 2 0, 1/d 2 1), J e (B + 2AC e ) = (0, 0), C e AC e + B C e + c = 1 (8) which is a set of 6 linear equations in the unknowns. Second, the gradient of Q must be the zero vector at the cone vertex, Q(E) = 2AE + B = 0 (9) which is a set of 3 linear equations in the unknowns. hird, the cone vertex is a solution to the quadratic equation, Q(E) = E AE + B E + c = 0 (10) which is 1 linear equation in the unknowns. Altogether we have 10 linear equations in the 10 unknowns, allowing us to use a linear system solver to obtain the solution. 2.4 Converting General Cones to Skewed Cones Alternatively, we may translate the ellipse center to the origin and then rotate the ellipse plane into a coordinate plane, thus transforming the problem to the one we know has the representation in equation (6). Let R e = [U e V e N e ] be the rotation matrix whose columns are the right-handed orthonormal basis mentioned in the introduction. A point X in the current coordinate system is related to a point Y in the coordinate system of the skewed cone via the transformations X = C e + R e Y, Y = R e (X C e ) (11) he eyepoint E is transformed to an eyepoint Ē = R e (E C e ) = (ē 0, ē 1, ē 2 ). Equation (6) provides the ellipse representation ( ) 2 ( ) 2 ( ) 2 y2 y0 1 = ē0 y 2 y1 + ē1 y 2 (12) ē 2 d 0 d 0 ē 2 d 1 d 1 ē 2 In summary, the vertex of the general elliptical cone is E. he ellipse consists of points X e = C e + y 0 U e + y 1 V e, where (y 0, y 1 ) is a solution to equation (12) with Ē = R e (E C e ) and R e = [U e V e N e ]. For later use, we require the quadratic equation in the transformed coordinate system, 0 = X AX + B X + c = (C e + R e Y) A (C e + R e Y) + B (C e + R e Y) + c = Y ( ) ( Re AR e Y + R e (B + 2AC e ) ) ) Y + (C e AC e + B C e + c = Y ĀY + B Y + c (13) 4
5 where the last equality defines the 3 3 matrix Ā, the 3 1 vector B, and the scalar c; that is, Ā = R e AR e, B = R e (B + 2AC e ), c = C e AC e + B C e + c (14) where Ā, B, and c are constructued using equation (5). his determines the coefficients of the X-quadratic; define C e = R e C e ; then A = R e ĀR e, B = R e ( B 2Ā C e ), c = C e Ā C e B Ce + c (15) 3 Projection of the Ellipse to Another Plane We now have a representation of the general elliptical cone that contains the eyepoint E and the user-specified ellipse: X AX + B X + c = 0, where A, B, and c are defined by equation (15). he quantities Ā, B, and c are determined using Ē = R e (E C e ) in the skewed ellipse equation (5). We have the projection plane, whose origin is the point C p and unit-length normal is N p, and a right-handed orthonormal basis {U p, V p, N p } that may be used to represent points relative to this plane. Assume that this projection plane intersects the cone in a closed curve, which is necessarily an ellipse. he plane points are specified by equation (3). o compute the intersection of cone and plane, substitute the plane points into the quadratic equation for the elliptical cone, 0 = X p AX p + B X p + c = (C p + J p Y p ) A (C p + J p Y p ) + B (C p + J p Y p ) + c = Y ( ) p J p AJ p Yp + ( Jp (B + 2AC p ) ) ( ) Yp + C p AC p + B C p + c = Y p ÂY p + ˆB Y p + ĉ (16) where the last equality defines Â, ˆB, and ĉ; that is, Â = J p AJ p, ˆB = J p (B + 2AC p ), ĉ = C p AC p + B C p + c (17) he equation for the projected ellipse may be factored into (Y p K) M (Y p K) = 1, (18) where K = Â 1 ˆB/2 and M = Â/( ˆB Â 1 ˆB/4 ĉ). o obtain axis vectors and extents, you may apply an eigendecomposition of M = RDR. he columns of R are the axis vectors and the reciprocals of the diagonal entries of D are the squared extents. 5
6 he outline of the algorithm is listed next. 1. Inputs: (a) Eyepoint E. (b) Ellipse plane containing ellipse center C e, unit-length normal N e, and unit-length ellipse axes U e and V e. he matrix R e = [U e V e N e ] is a rotation matrix. Ellipse axis lengths d 0 (associated with U e ) and d 1 (associated with V e ). Define J e = [U e V e ]. he ellipse points are X e = C e + J e Y e with Y e Diagonal(1/d 2 0, 1/d 2 1)Y e = 1. (c) Projection plane with origin C p, unit-length normal N p, and vectors U p and V p that span the plane. he matrix R p = [U p V p N p ] is a rotation matrix. Define J p = [U p V p ]. he projected ellipse points are X p = C p + J p Y p, and the goal is to determine a quadratic equation in Y p that represents this ellipse. 2. Compute: (a) Ē = R e (E C e ) = (ē 0, ē 1, ē 2 ), C e = R e C e. (b) From equation (5) compute Ā = [ā ij], B = [ b j ], and c: ā 00 = 1/d 2 0, ā 11 = 1/d 2 1, ā 01 = ā 10 = 0, ā 02 = ā 20 = ē 0 /(ē 2 d 2 0), ā 12 = ā 21 = ē 1 /(ē 2 d 2 1), ā 22 = (ē 2 0/d ē 2 1/d 2 1 1)/ē 2 2, b0 = 0, b1 = 0, b2 = 2/ē 2, c = 1 (c) From equation (15) compute A, B, and c: A = R e ĀR e, B = R e ( B 2Ā C e ), c = C e Ā C e B Ce + c (d) From equation (17) compute Â, ˆB, and ĉ: Â = J p AJ p, ˆB = J p (B + 2AC p ), ĉ = C p AC p + B C p + c 3. Outputs: (a) he quadratic equation that defines the projected ellipse. (b) he factored equation Y p ÂY p + ˆBY p + ĉ (Y p K) M (Y p K) = 1, where K = Â 1 ˆB/2 and M = Â/( ˆB Â 1 ˆB/4 ĉ). (c) Eigendecomposition RDR = M, where the columns of R are the projected ellipse axis vectors and D = Diagonal(1/λ 2 0, 1/λ 2 1). he projected ellipse axis lengths are λ 0 and λ 1. 6
Reconstructing an Ellipsoid from its Perspective Projection onto a Plane
Reconstructing an Ellipsoid from its Perspective Projection onto a Plane David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons
More informationDistance Between Ellipses in 2D
Distance Between Ellipses in 2D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To
More informationIntersection of Rectangle and Ellipse
Intersection of Rectangle and Ellipse David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationInformation About Ellipses
Information About Ellipses David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationA Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves
A Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves David Eberly, Geometric Tools, Redmond WA 9852 https://www.geometrictools.com/ This work is licensed under the Creative
More informationIntersection of Objects with Linear and Angular Velocities using Oriented Bounding Boxes
Intersection of Objects with Linear and Angular Velocities using Oriented Bounding Boxes David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the
More informationThe Laplace Expansion Theorem: Computing the Determinants and Inverses of Matrices
The Laplace Expansion Theorem: Computing the Determinants and Inverses of Matrices David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative
More informationIntersection of Infinite Cylinders
Intersection of Infinite Cylinders David Eberly, Geometric Tools, Redmond WA 980 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationFitting a Natural Spline to Samples of the Form (t, f(t))
Fitting a Natural Spline to Samples of the Form (t, f(t)) David Eberly, Geometric Tools, Redmond WA 9852 https://wwwgeometrictoolscom/ This work is licensed under the Creative Commons Attribution 4 International
More informationSolving Systems of Polynomial Equations
Solving Systems of Polynomial Equations David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationLeast-Squares Fitting of Data with Polynomials
Least-Squares Fitting of Data with Polynomials David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationIntersection of Ellipses
Intersection of Ellipses David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationIntersection of Ellipsoids
Intersection of Ellipsoids David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationLeast Squares Fitting of Data by Linear or Quadratic Structures
Least Squares Fitting of Data by Linear or Quadratic Structures David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution
More informationDistance from Line to Rectangle in 3D
Distance from Line to Rectangle in 3D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationPrincipal Curvatures of Surfaces
Principal Curvatures of Surfaces David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationComputing Orthonormal Sets in 2D, 3D, and 4D
Computing Orthonormal Sets in 2D, 3D, and 4D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationDistance from a Point to an Ellipse, an Ellipsoid, or a Hyperellipsoid
Distance from a Point to an Ellipse, an Ellipsoid, or a Hyperellipsoid David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution
More informationThe geometry of least squares
The geometry of least squares We can think of a vector as a point in space, where the elements of the vector are the coordinates of the point. Consider for example, the following vector s: t = ( 4, 0),
More informationSolutions to Review Problems for Chapter 6 ( ), 7.1
Solutions to Review Problems for Chapter (-, 7 The Final Exam is on Thursday, June,, : AM : AM at NESBITT Final Exam Breakdown Sections % -,7-9,- - % -9,-,7,-,-7 - % -, 7 - % Let u u and v Let x x x x,
More informationDistance to Circles in 3D
Distance to Circles in 3D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationA A x i x j i j (i, j) (j, i) Let. Compute the value of for and
7.2 - Quadratic Forms quadratic form on is a function defined on whose value at a vector in can be computed by an expression of the form, where is an symmetric matrix. The matrix R n Q R n x R n Q(x) =
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More informationHow to Effect a Desired Rotation of a Vector about a Given Axis via Geometric (Clifford) Algebra
How to Effect a Desired Rotation of a Vector about a Given Axis via Geometric (Clifford Algebra August 9, 017 James Smith nitac14b@yahoo.com https://mx.linkedin.com/in/james-smith-1b195047 Abstract We
More informationThe Area of Intersecting Ellipses
The Area of Intersecting Ellipses David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationAnalytic Geometry MAT 1035
Analytic Geometry MAT 035 5.09.04 WEEKLY PROGRAM - The first week of the semester, we will introduce the course and given a brief outline. We continue with vectors in R n and some operations including
More information8. Diagonalization.
8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard
More informationNOTES ON BILINEAR FORMS
NOTES ON BILINEAR FORMS PARAMESWARAN SANKARAN These notes are intended as a supplement to the talk given by the author at the IMSc Outreach Programme Enriching Collegiate Education-2015. Symmetric bilinear
More informationAnalytic Geometry MAT 1035
Analytic Geometry MAT 035 5.09.04 WEEKLY PROGRAM - The first week of the semester, we will introduce the course and given a brief outline. We continue with vectors in R n and some operations including
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationDynamic Collision Detection using Oriented Bounding Boxes
Dynamic Collision Detection using Oriented Bounding Boxes David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0
More informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationReview of Matrices and Block Structures
CHAPTER 2 Review of Matrices and Block Structures Numerical linear algebra lies at the heart of modern scientific computing and computational science. Today it is not uncommon to perform numerical computations
More informationLinear Algebra I for Science (NYC)
Element No. 1: To express concrete problems as linear equations. To solve systems of linear equations using matrices. Topic: MATRICES 1.1 Give the definition of a matrix, identify the elements and the
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 informationInterpolation of Rigid Motions in 3D
Interpolation of Rigid Motions in 3D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationICS 6N Computational Linear Algebra Symmetric Matrices and Orthogonal Diagonalization
ICS 6N Computational Linear Algebra Symmetric Matrices and Orthogonal Diagonalization Xiaohui Xie University of California, Irvine xhx@uci.edu Xiaohui Xie (UCI) ICS 6N 1 / 21 Symmetric matrices An n n
More informationOrthogonal Projection and Least Squares Prof. Philip Pennance 1 -Version: December 12, 2016
Orthogonal Projection and Least Squares Prof. Philip Pennance 1 -Version: December 12, 2016 1. Let V be a vector space. A linear transformation P : V V is called a projection if it is idempotent. That
More informationLow-Degree Polynomial Roots
Low-Degree Polynomial Roots David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
More informationChapter 7: Symmetric Matrices and Quadratic Forms
Chapter 7: Symmetric Matrices and Quadratic Forms (Last Updated: December, 06) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved
More information12.5 Equations of Lines and Planes
12.5 Equations of Lines and Planes Equation of Lines Vector Equation of Lines Parametric Equation of Lines Symmetric Equation of Lines Relation Between Two Lines Equations of Planes Vector Equation of
More informationLinear Algebra (Review) Volker Tresp 2017
Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.
More informationLinear Models Review
Linear Models Review Vectors in IR n will be written as ordered n-tuples which are understood to be column vectors, or n 1 matrices. A vector variable will be indicted with bold face, and the prime sign
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationVectors and Matrices
Vectors and Matrices Scalars We often employ a single number to represent quantities that we use in our daily lives such as weight, height etc. The magnitude of this number depends on our age and whether
More informationLecture Note 1: Background
ECE5463: Introduction to Robotics Lecture Note 1: Background Prof. Wei Zhang Department of Electrical and Computer Engineering Ohio State University Columbus, Ohio, USA Spring 2018 Lecture 1 (ECE5463 Sp18)
More informationLinear Algebra (Review) Volker Tresp 2018
Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c
More informationQuadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.
Quadratic forms 1. Symmetric matrices An n n matrix (a ij ) n ij=1 with entries on R is called symmetric if A T, that is, if a ij = a ji for all 1 i, j n. We denote by S n (R) the set of all n n symmetric
More informationMATH 220 FINAL EXAMINATION December 13, Name ID # Section #
MATH 22 FINAL EXAMINATION December 3, 2 Name ID # Section # There are??multiple choice questions. Each problem is worth 5 points. Four possible answers are given for each problem, only one of which is
More informationMath 265 Linear Algebra Sample Spring 2002., rref (A) =
Math 265 Linear Algebra Sample Spring 22. It is given that A = rref (A T )= 2 3 5 3 2 6, rref (A) = 2 3 and (a) Find the rank of A. (b) Find the nullityof A. (c) Find a basis for the column space of A.
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 informationSOLUTION KEY TO THE LINEAR ALGEBRA FINAL EXAM 1 2 ( 2) ( 1) c a = 1 0
SOLUTION KEY TO THE LINEAR ALGEBRA FINAL EXAM () We find a least squares solution to ( ) ( ) A x = y or 0 0 a b = c 4 0 0. 0 The normal equation is A T A x = A T y = y or 5 0 0 0 0 0 a b = 5 9. 0 0 4 7
More information(iii) converting between scalar product and parametric forms. (ii) vector perpendicular to two given (3D) vectors
Vector Theory (15/3/2014) www.alevelmathsng.co.uk Contents (1) Equation of a line (i) parametric form (ii) relation to Cartesian form (iii) vector product form (2) Equation of a plane (i) scalar product
More informationSolution to Homework 8, Math 2568
Solution to Homework 8, Math 568 S 5.4: No. 0. Use property of heorem 5 to test for linear independence in P 3 for the following set of cubic polynomials S = { x 3 x, x x, x, x 3 }. Solution: If we use
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More informationMTH 2310, FALL Introduction
MTH 2310, FALL 2011 SECTION 6.2: ORTHOGONAL SETS Homework Problems: 1, 5, 9, 13, 17, 21, 23 1, 27, 29, 35 1. Introduction We have discussed previously the benefits of having a set of vectors that is linearly
More informationPolyhedral Mass Properties (Revisited)
Polyhedral Mass Properties (Revisited) David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationMAT1035 Analytic Geometry
MAT1035 Analytic Geometry Lecture Notes R.A. Sabri Kaan Gürbüzer Dokuz Eylül University 2016 2 Contents 1 Review of Trigonometry 5 2 Polar Coordinates 7 3 Vectors in R n 9 3.1 Located Vectors..............................................
More informationPreliminary Linear Algebra 1. Copyright c 2012 Dan Nettleton (Iowa State University) Statistics / 100
Preliminary Linear Algebra 1 Copyright c 2012 Dan Nettleton (Iowa State University) Statistics 611 1 / 100 Notation for all there exists such that therefore because end of proof (QED) Copyright c 2012
More informationEconomics 204 Summer/Fall 2010 Lecture 10 Friday August 6, 2010
Economics 204 Summer/Fall 2010 Lecture 10 Friday August 6, 2010 Diagonalization of Symmetric Real Matrices (from Handout Definition 1 Let δ ij = { 1 if i = j 0 if i j A basis V = {v 1,..., v n } of R n
More informationComputational math: Assignment 1
Computational math: Assignment 1 Thanks Ting Gao for her Latex file 11 Let B be a 4 4 matrix to which we apply the following operations: 1double column 1, halve row 3, 3add row 3 to row 1, 4interchange
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationLinear Algebra Primer
Linear Algebra Primer David Doria daviddoria@gmail.com Wednesday 3 rd December, 2008 Contents Why is it called Linear Algebra? 4 2 What is a Matrix? 4 2. Input and Output.....................................
More informationMath 291-2: Lecture Notes Northwestern University, Winter 2016
Math 291-2: Lecture Notes Northwestern University, Winter 2016 Written by Santiago Cañez These are lecture notes for Math 291-2, the second quarter of MENU: Intensive Linear Algebra and Multivariable Calculus,
More informationContents. Motivation. 1 di 7 23/03/ :41
1 di 7 23/03/2015 09:41 From Wikipedia, the free encyclopedia In mathematics, orthogonal coordinates are defined as a set of d coordinates q = (q 1, q 2,..., q d ) in which the coordinate surfaces all
More informationLagrange Multipliers
Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationREVIEW FOR EXAM III SIMILARITY AND DIAGONALIZATION
REVIEW FOR EXAM III The exam covers sections 4.4, the portions of 4. on systems of differential equations and on Markov chains, and..4. SIMILARITY AND DIAGONALIZATION. Two matrices A and B are similar
More informationLinear Independence x
Linear Independence A consistent system of linear equations with matrix equation Ax = b, where A is an m n matrix, has a solution set whose graph in R n is a linear object, that is, has one of only n +
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationLINEAR ALGEBRA KNOWLEDGE SURVEY
LINEAR ALGEBRA KNOWLEDGE SURVEY Instructions: This is a Knowledge Survey. For this assignment, I am only interested in your level of confidence about your ability to do the tasks on the following pages.
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters, transforms,
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationConverting Between Coordinate Systems
Converting Between Coordinate Systems David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak, scribe: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters,
More informationFormulas and Spreadsheets for Simple, Composite, and Complex Rotations of Vectors and Bivectors in Geometric (Clifford) Algebra
Formulas and Spreadsheets for Simple, Composite, and Complex Rotations of Vectors and Bivectors in Geometric (Clifford Algebra December 11, 017 James Smith nit14b@yahoo.com https://mx.linkedin.com/in/james-smith-1b195047
More information33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM
33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM (UPDATED MARCH 17, 2018) The final exam will be cumulative, with a bit more weight on more recent material. This outline covers the what we ve done since the
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationHomework 2. Solutions T =
Homework. s Let {e x, e y, e z } be an orthonormal basis in E. Consider the following ordered triples: a) {e x, e x + e y, 5e z }, b) {e y, e x, 5e z }, c) {e y, e x, e z }, d) {e y, e x, 5e z }, e) {
More informationProblem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show
MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,
More informationLeast Squares Optimization
Least Squares Optimization The following is a brief review of least squares optimization and constrained optimization techniques. I assume the reader is familiar with basic linear algebra, including the
More informationMATH 167: APPLIED LINEAR ALGEBRA Least-Squares
MATH 167: APPLIED LINEAR ALGEBRA Least-Squares October 30, 2014 Least Squares We do a series of experiments, collecting data. We wish to see patterns!! We expect the output b to be a linear function of
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More information33A Linear Algebra and Applications: Practice Final Exam - Solutions
33A Linear Algebra and Applications: Practice Final Eam - Solutions Question Consider a plane V in R 3 with a basis given by v = and v =. Suppose, y are both in V. (a) [3 points] If [ ] B =, find. (b)
More informationMatrix Algebra: Summary
May, 27 Appendix E Matrix Algebra: Summary ontents E. Vectors and Matrtices.......................... 2 E.. Notation.................................. 2 E..2 Special Types of Vectors.........................
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationBasic concepts in Linear Algebra and Optimization
Basic concepts in Linear Algebra and Optimization Yinbin Ma GEOPHYS 211 Outline Basic Concepts on Linear Algbra vector space norm linear mapping, range, null space matrix multiplication terative Methods
More informationDeep Learning Book Notes Chapter 2: Linear Algebra
Deep Learning Book Notes Chapter 2: Linear Algebra Compiled By: Abhinaba Bala, Dakshit Agrawal, Mohit Jain Section 2.1: Scalars, Vectors, Matrices and Tensors Scalar Single Number Lowercase names in italic
More informationMay 9, 2014 MATH 408 MIDTERM EXAM OUTLINE. Sample Questions
May 9, 24 MATH 48 MIDTERM EXAM OUTLINE This exam will consist of two parts and each part will have multipart questions. Each of the 6 questions is worth 5 points for a total of points. The two part of
More informationChapter 2. Vectors and Vector Spaces
2.2. Cartesian Coordinates and Geometrical Properties of Vectors 1 Chapter 2. Vectors and Vector Spaces Section 2.2. Cartesian Coordinates and Geometrical Properties of Vectors Note. There is a natural
More informationME751 Advanced Computational Multibody Dynamics
ME751 Advanced Computational Multibody Dynamics Review: Elements of Linear Algebra & Calculus September 9, 2016 Dan Negrut University of Wisconsin-Madison Quote of the day If you can't convince them, confuse
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More information