DOCSLIB.ORG

2D Transformations 2D Transformation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
2D Transformations 2D Transformation 2D Transformations 2D Transformation Given a 2D object, transformation is to y change the object’s Position (translation) y Size (scaling) x Orientation (rotation) Shapes (shear) x y Apply a sequence of matrix multiplication to the object vertices x Point representation Translation Re-position a point along a straight line We can use a column vector (a 2x1 matrix) to represent a 2D point x Given a point (x,y), and the translation distance (tx,ty) y A general form of linear transformation can The new point: (x’, y’) (x’,y’) x’ = x + tx be written as: ty y’ = y + ty (x,y) tx x’ = ax + by + c X’ a b c x OR Y’ = d e f * y 1 0 0 1 1 OR P’ = P + T where P’ = x’ p = x T = tx y’ = dx + ey + f y’ y ty 1 3x3 2D Translation Matrix Translation x’ = x + tx How to translate an object with multiple y’ y ty vertices? Use 3 x 1 vector x’ 1 0 tx x y’ = 0 1 ty * y 1 0 0 1 1 Translate individual vertices Note that now it becomes a matrix-vector multiplication 2D Rotation Rotation Default rotation center: Origin (0,0) (x,y) -> Rotate about the origin by θ (x’,y’) (x’, y’) (x,y) θ r θ> 0 : Rotate counter clockwise φ θ How to compute (x’, y’) ? x = r cos (φ)y = r sin (φ) x’ = r cos (φ + θ)y = r sin (φ + θ) θ< 0 : Rotate clockwise θ 2 Rotation Rotation (x’,y’) (x’,y’) x = r cos (φ)y = r sin (φ) x’ = x cos(θ) – y sin(θ) x’ = r cos (φ + θ)y = r sin (φ + θ) (x,y) (x,y) θ r y’ = y cos(θ) + x sin(θ) θ r φ φ x’ = r cos ( ) φ + θ Matrix form? = r cos(φ) cos(θ) – r sin(φ) sin(θ) = x cos(θ) – y sin(θ) x’ cos(θ) -sin(θ) x = y’ = r sin (φ + θ) y’ sin(θ) cos(θ) y = r sin(φ) cos(θ) + r cos(φ)sin(θ) = y cos(θ) + x sin(θ) 3 x 3? 3x3 2D Rotation Matrix Rotation x’ cos(θ) -sin(θ) x (x’,y’) = How to rotate an object with multiple y’ sin(θ) cos(θ) y (x,y) vertices? θ r φ x’ cos(θ) -sin(θ) 0 x = y’ sin(θ) cos(θ) 0 y θ 1 0 0 1 1 Rotate individual Vertices 3 2D Scaling 2D Scaling Scale: Alter the size of an object by a scaling factor (4,4) (Sx, Sy), i.e. (2,2) Sx = 2, Sy = 2 (2,2) (1,1) x’ = x . Sx x’ Sx 0 x = y’ = y . Sy y’ 0 Sy y Not only the object size is changed, it also moved!! (4,4) Usually this is an undesirable effect (2,2) Sx = 2, Sy = 2 We will discuss later (soon) how to fix it (2,2) (1,1) 3x3 2D Scaling Matrix Put it all together Translation: x’ = x + tx x’ Sx 0 x = y’ y ty y’ 0 Sy y Rotation: x’ = cos( θ ) -sin( θ ) * x y’ sin(θ) cos(θ) y x’ Sx 0 0 x y’ = 0 Sy 0 * y Scaling: x’ Sx 0 x = * 1 0 0 1 1 y’ 0 Sy y 4 Or, 3x3 Matrix representations Why use 3x3 matrices? Translation: x’ 1 0 tx x So that we can perform all transformations y’ = 0 1 ty * y 1 0 0 1 1 using matrix/vector multiplications x’ cos(θ) -sin(θ) 0 x Rotation: = y’ sin(θ) cos(θ) 0 * y This allows us to pre-multiply all the matrices 1 0 0 1 1 together x’ Sx 0 0 x Scaling: y’ = 0 Sy 0 * y The point (x,y) needs to be represented as 1 0 0 1 1 (x,y,1) -> this is called Homogeneous Why use 3x3 matrices? coordinates! Shearing Shearing in y x 1 0 0 x y = g 1 0 * y 1 0 0 1 1 Interesting Facts: Y coordinates are unaffected, but x cordinates are translated linearly with y A 2D rotation is three shears Shearing will not change the area of the object That is: x 1 h 0 x y’ = y y = 0 1 0 * y Any 2D shearing can be done by a rotation, followed x’ = x + y * h 1 0 0 1 1 by a scaling, and followed by a rotation 5 Rotation Revisit Arbitrary Rotation Center The standard rotation matrix is used to To rotate about an arbitrary point P (px,py) rotate about the origin (0,0) by θ: Translate the object so that P will coincide with cos(θ) -sin(θ) 0 the origin: T(-px, -py) sin(θ) cos(θ) 0 Rotate the object: R(θ) 0 0 1 Translate the object back: T(px,py) What if I want to rotate about an arbitrary center? (px,py) Arbitrary Rotation Center Scaling Revisit Translate the object so that P will coincide with The standard scaling matrix will only the origin: T(-px, -py) anchor at (0,0) Rotate the object: R(θ) Translate the object back: T(px,py) Sx 0 0 0 Sy 0 0 0 1 Put in matrix form: T(px,py) R(θ) T(-px, -py) * P What if I want to scale about an arbitrary x’ 1 0 px cos(θ) -sin(θ) 0 1 0 -px x y’ = 0 1 py sin(θ) cos(θ) 0 0 1 -py y pivot point? 1 0 0 1 0 0 1 0 0 1 1 6 Arbitrary Scaling Pivot Affine Transformation To scale about an arbitrary pivot point P Translation, Scaling, Rotation, Shearing are all affine (px,py): transformation Affine transformation – transformed point P’ (x’,y’) is Translate the object so that P will coincide with a linear combination of the original point P (x,y), i.e. the origin: T(-px, -py) x’ m11 m12 m13 x Rotate the object: S(sx, sy) y’ = m21 m22 m23 y 1 0 0 1 1 Translate the object back: T(px,py) Any 2D affine transformation can be decomposed into a rotation, followed by a scaling, followed by a (px,py) shearing, and followed by a translation. Affine matrix = translation x shearing x scaling x rotation Composing Transformation Composing Transformation Composing Transformation – the process of applying Matrix multiplication is associative several transformation in succession to form one M3 x M2 x M1 = (M3 x M2) x M1 = M3 x (M2 x M1) overall transformation Transformation products may not be commutative If we apply transform a point P using M1 matrix first, A x B != B x A and then transform using M2, and then M3, then we Some cases where A x B = B x A have: A B (M3 x (M2 x (M1 x P ))) = M3 x M2 x M1 x P translation translation scaling scaling (pre-multiply) rotation rotation M uniform scaling rotation (sx = sy) 7 Transformation order matters! How OpenGL does it? Example: rotation and translation are not OpenGL’s transformation functions are commutative meant to be used in 3D Translate (5,0) and then Rotate 60 degree No problem for 2D though – just ignore OR the z dimension Rotate 60 degree and then translate (5,0)?? Translation: glTranslatef(d)(tx, ty, tz) -> Rotate and then translate !! glTranslatef(d)(tx,ty,0) for 2D How OpenGL does it? OpenGL Transformation Composition Rotation: A global modeling transformation matrix glRotatef(d)(angle, vx, vy, vz) -> (GL_MODELVIEW, called it M here) glRotatef(d)(angle, 0,0,1) for 2D glMatrixMode(GL_MODELVIEW) y y The user is responsible to reset it if necessary (vx, vy, vz) – rotation axis glLoadIdentity() -> M = 1 0 0 x x 0 1 0 z You can imagine z is pointing out 0 0 1 of the slide 8 OpenGL Transformation Composition Transformation Pipeline Matrices for performing user-specified transformations are multiplied to the model view global matrix For example, Object Modeling Object World Coordinates 1 0 1 Local Coordinates transformation glTranslated(1,1 0); M = M x 0 1 1 0 0 1 All the vertices P defined within glBegin() will first go through the transformation (modeling … transformation) P’ = M x P 9.
Load more

Recommended publications
  • Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis
    Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues Meisam Sharify To cite this version: Meisam Sharify. Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues. Numerical Analysis [math.NA]. Ecole Polytechnique X, 2011. English. pastel-00643836 HAL Id: pastel-00643836 https://pastel.archives-ouvertes.fr/pastel-00643836 Submitted on 24 Nov 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Th`esepr´esent´eepour obtenir le titre de DOCTEUR DE L'ECOLE´ POLYTECHNIQUE Sp´ecialit´e: Math´ematiquesAppliqu´ees par Meisam Sharify Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues Jury Marianne Akian Pr´esident du jury St´ephaneGaubert Directeur Laurence Grammont Examinateur Laura Grigori Examinateur Andrei Sobolevski Rapporteur Fran¸coiseTisseur Rapporteur Paul Van Dooren Examinateur September 2011 Abstract Tropical algebra, which can be considered as a relatively new field in Mathemat- ics, emerged in several branches of science such as optimization, synchronization of production and transportation, discrete event systems, optimal control, oper- ations research, etc.
    [Show full text]
  • Two-Dimensional Rotational Kinematics Rigid Bodies
    Rigid Bodies A rigid body is an extended object in which the Two-Dimensional Rotational distance between any two points in the object is Kinematics constant in time. Springs or human bodies are non-rigid bodies. 8.01 W10D1 Rotation and Translation Recall: Translational Motion of of Rigid Body the Center of Mass Demonstration: Motion of a thrown baton • Total momentum of system of particles sys total pV= m cm • External force and acceleration of center of mass Translational motion: external force of gravity acts on center of mass sys totaldp totaldVcm total FAext==mm = cm Rotational Motion: object rotates about center of dt dt mass 1 Main Idea: Rotation of Rigid Two-Dimensional Rotation Body Torque produces angular acceleration about center of • Fixed axis rotation: mass Disc is rotating about axis τ total = I α passing through the cm cm cm center of the disc and is perpendicular to the I plane of the disc. cm is the moment of inertial about the center of mass • Plane of motion is fixed: α is the angular acceleration about center of mass cm For straight line motion, bicycle wheel rotates about fixed direction and center of mass is translating Rotational Kinematics Fixed Axis Rotation: Angular for Fixed Axis Rotation Velocity Angle variable θ A point like particle undergoing circular motion at a non-constant speed has SI unit: [rad] dθ ω ≡≡ω kkˆˆ (1)An angular velocity vector Angular velocity dt SI unit: −1 ⎣⎡rad⋅ s ⎦⎤ (2) an angular acceleration vector dθ Vector: ω ≡ Component dt dθ ω ≡ magnitude dt ω >+0, direction kˆ direction ω < 0, direction − kˆ 2 Fixed Axis Rotation: Angular Concept Question: Angular Acceleration Speed 2 ˆˆd θ Object A sits at the outer edge (rim) of a merry-go-round, and Angular acceleration: α ≡≡α kk2 object B sits halfway between the rim and the axis of rotation.
    [Show full text]
  • 1.2 Rules for Translations
    1.2. Rules for Translations www.ck12.org 1.2 Rules for Translations Here you will learn the different notation used for translations. The figure below shows a pattern of a floor tile. Write the mapping rule for the translation of the two blue floor tiles. Watch This First watch this video to learn about writing rules for translations. MEDIA Click image to the left for more content. CK-12 FoundationChapter10RulesforTranslationsA Then watch this video to see some examples. MEDIA Click image to the left for more content. CK-12 FoundationChapter10RulesforTranslationsB 18 www.ck12.org Chapter 1. Unit 1: Transformations, Congruence and Similarity Guidance In geometry, a transformation is an operation that moves, flips, or changes a shape (called the preimage) to create a new shape (called the image). A translation is a type of transformation that moves each point in a figure the same distance in the same direction. Translations are often referred to as slides. You can describe a translation using words like "moved up 3 and over 5 to the left" or with notation. There are two types of notation to know. T x y 1. One notation looks like (3, 5). This notation tells you to add 3 to the values and add 5 to the values. 2. The second notation is a mapping rule of the form (x,y) → (x−7,y+5). This notation tells you that the x and y coordinates are translated to x − 7 and y + 5. The mapping rule notation is the most common. Example A Sarah describes a translation as point P moving from P(−2,2) to P(1,−1).
    [Show full text]
  • THESIS MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Submitted by Lara Kassab Department of Mathematics in Partial Fu
    THESIS MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Submitted by Lara Kassab Department of Mathematics In partial fulfillment of the requirements For the Degree of Master of Science Colorado State University Fort Collins, Colorado Spring 2019 Master’s Committee: Advisor: Henry Adams Michael Kirby Bailey Fosdick Copyright by Lara Kassab 2019 All Rights Reserved ABSTRACT MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces, along with its optimality properties and goodness of fit. This allows us to study the MDS embeddings of the geodesic circle S1 into Rm for all m, and to ask questions about the MDS embeddings of the geodesic n-spheres Sn into Rm. Furthermore, we address questions on convergence of MDS. For instance, if a sequence of metric measure spaces converges to a fixed metric measure space X, then in what sense do the MDS embeddings of these spaces converge to the MDS embedding of X? Convergence is understood when each metric space in the sequence has the same finite number of points, or when each metric space has a finite number of points tending to infinity. We are also interested in notions of convergence when each metric space in the sequence has an arbitrary (possibly infinite) number of points. ii ACKNOWLEDGEMENTS We would like to thank Henry Adams, Mark Blumstein, Bailey Fosdick, Michael Kirby, Henry Kvinge, Facundo Mémoli, Louis Scharf, the students in Michael Kirby’s Spring 2018 class, and the Pattern Analysis Laboratory at Colorado State University for their helpful conversations and support throughout this project.
    [Show full text]
  • Multidisciplinary Design Project Engineering Dictionary Version 0.0.2
    Multidisciplinary Design Project Engineering Dictionary Version 0.0.2 February 15, 2006 . DRAFT Cambridge-MIT Institute Multidisciplinary Design Project This Dictionary/Glossary of Engineering terms has been compiled to compliment the work developed as part of the Multi-disciplinary Design Project (MDP), which is a programme to develop teaching material and kits to aid the running of mechtronics projects in Universities and Schools. The project is being carried out with support from the Cambridge-MIT Institute undergraduate teaching programe. For more information about the project please visit the MDP website at http://www-mdp.eng.cam.ac.uk or contact Dr. Peter Long Prof. Alex Slocum Cambridge University Engineering Department Massachusetts Institute of Technology Trumpington Street, 77 Massachusetts Ave. Cambridge. Cambridge MA 02139-4307 CB2 1PZ. USA e-mail: [email protected] e-mail: [email protected] tel: +44 (0) 1223 332779 tel: +1 617 253 0012 For information about the CMI initiative please see Cambridge-MIT Institute website :- http://www.cambridge-mit.org CMI CMI, University of Cambridge Massachusetts Institute of Technology 10 Miller’s Yard, 77 Massachusetts Ave. Mill Lane, Cambridge MA 02139-4307 Cambridge. CB2 1RQ. USA tel: +44 (0) 1223 327207 tel. +1 617 253 7732 fax: +44 (0) 1223 765891 fax. +1 617 258 8539 . DRAFT 2 CMI-MDP Programme 1 Introduction This dictionary/glossary has not been developed as a definative work but as a useful reference book for engi- neering students to search when looking for the meaning of a word/phrase. It has been compiled from a number of existing glossaries together with a number of local additions.
    [Show full text]
  • Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
    Introduction 2.5D matrix multiplication 2.5D LU factorization Conclusion Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms Edgar Solomonik and James Demmel UC Berkeley September 1st, 2011 Edgar Solomonik and James Demmel 2.5D algorithms 1/ 36 Introduction 2.5D matrix multiplication 2.5D LU factorization Conclusion Outline Introduction Strong scaling 2.5D matrix multiplication Strong scaling matrix multiplication Performing faster at scale 2.5D LU factorization Communication-optimal LU without pivoting Communication-optimal LU with pivoting Conclusion Edgar Solomonik and James Demmel 2.5D algorithms 2/ 36 Introduction 2.5D matrix multiplication Strong scaling 2.5D LU factorization Conclusion Solving science problems faster Parallel computers can solve bigger problems I weak scaling Parallel computers can also solve a xed problem faster I strong scaling Obstacles to strong scaling I may increase relative cost of communication I may hurt load balance Edgar Solomonik and James Demmel 2.5D algorithms 3/ 36 Introduction 2.5D matrix multiplication Strong scaling 2.5D LU factorization Conclusion Achieving strong scaling How to reduce communication and maintain load balance? I reduce communication along the critical path Communicate less I avoid unnecessary communication Communicate smarter I know your network topology Edgar Solomonik and James Demmel 2.5D algorithms 4/ 36 Introduction 2.5D matrix multiplication Strong scaling matrix multiplication 2.5D LU factorization Performing faster at scale Conclusion
    [Show full text]
  • Affine Transformations  Foley, Et Al, Chapter 5.1-5.5
    Reading Optional reading: Angel 4.1, 4.6-4.10 Angel, the rest of Chapter 4 Affine transformations Foley, et al, Chapter 5.1-5.5. David F. Rogers and J. Alan Adams, Mathematical Elements for Computer Graphics, 2nd Ed., McGraw-Hill, New York, Daniel Leventhal 1990, Chapter 2. Adapted from Brian Curless CSE 457 Autumn 2011 1 2 Linear Interpolation More Interpolation 3 4 1 Geometric transformations Vector representation Geometric transformations will map points in one We can represent a point, p = (x,y), in the plane or space to points in another: (x', y‘, z‘ ) = f (x, y, z). p=(x,y,z) in 3D space These transformations can be very simple, such as column vectors as scaling each coordinate, or complex, such as non-linear twists and bends. We'll focus on transformations that can be represented easily with matrix operations. as row vectors 5 6 Canonical axes Vector length and dot products 7 8 2 Vector cross products Inverse & Transpose 9 10 Two-dimensional Representation, cont. transformations We can represent a 2-D transformation M by a Here's all you get with a 2 x 2 transformation matrix matrix M: If p is a column vector, M goes on the left: So: We will develop some intimacy with the If p is a row vector, MT goes on the right: elements a, b, c, d… We will use column vectors. 11 12 3 Identity Scaling Suppose we choose a=d=1, b=c=0: Suppose we set b=c=0, but let a and d take on any positive value: Gives the identity matrix: Gives a scaling matrix: Provides differential (non-uniform) scaling in x and y: Doesn't move the points at all 1 2 12 x y 13 14 ______________ ____________ Suppose we keep b=c=0, but let either a or d go Now let's leave a=d=1 and experiment with b.
    [Show full text]
  • 1 Review of Inner Products 2 the Approximation Problem and Its Solution Via Orthogonality
    Approximation in inner product spaces, and Fourier approximation Math 272, Spring 2018 Any typographical or other corrections about these notes are welcome. 1 Review of inner products An inner product space is a vector space V together with a choice of inner product. Recall that an inner product must be bilinear, symmetric, and positive definite. Since it is positive definite, the quantity h~u;~ui is never negative, and is never 0 unless ~v = ~0. Therefore its square root is well-defined; we define the norm of a vector ~u 2 V to be k~uk = ph~u;~ui: Observe that the norm of a vector is a nonnegative number, and the only vector with norm 0 is the zero vector ~0 itself. In an inner product space, we call two vectors ~u;~v orthogonal if h~u;~vi = 0. We will also write ~u ? ~v as a shorthand to mean that ~u;~v are orthogonal. Because an inner product must be bilinear and symmetry, we also obtain the following expression for the squared norm of a sum of two vectors, which is analogous the to law of cosines in plane geometry. k~u + ~vk2 = h~u + ~v; ~u + ~vi = h~u + ~v; ~ui + h~u + ~v;~vi = h~u;~ui + h~v; ~ui + h~u;~vi + h~v;~vi = k~uk2 + k~vk2 + 2 h~u;~vi : In particular, this gives the following version of the Pythagorean theorem for inner product spaces. Pythagorean theorem for inner products If ~u;~v are orthogonal vectors in an inner product space, then k~u + ~vk2 = k~uk2 + k~vk2: Proof.
    [Show full text]
  • 2-D Drawing Geometry Homogeneous Coordinates
    2-D Drawing Geometry Homogeneous Coordinates The rotation of a point, straight line or an entire image on the screen, about a point other than origin, is achieved by first moving the image until the point of rotation occupies the origin, then performing rotation, then finally moving the image to its original position. The moving of an image from one place to another in a straight line is called a translation. A translation may be done by adding or subtracting to each point, the amount, by which picture is required to be shifted. Translation of point by the change of coordinate cannot be combined with other transformation by using simple matrix application. Such a combination is essential if we wish to rotate an image about a point other than origin by translation, rotation again translation. To combine these three transformations into a single transformation, homogeneous coordinates are used. In homogeneous coordinate system, two-dimensional coordinate positions (x, y) are represented by triple- coordinates. Homogeneous coordinates are generally used in design and construction applications. Here we perform translations, rotations, scaling to fit the picture into proper position 2D Transformation in Computer Graphics- In Computer graphics, Transformation is a process of modifying and re- positioning the existing graphics. • 2D Transformations take place in a two dimensional plane. • Transformations are helpful in changing the position, size, orientation, shape etc of the object. Transformation Techniques- In computer graphics, various transformation techniques are- 1. Translation 2. Rotation 3. Scaling 4. Reflection 2D Translation in Computer Graphics- In Computer graphics, 2D Translation is a process of moving an object from one position to another in a two dimensional plane.
    [Show full text]
  • A Geometric Model of Allometric Scaling
    1 Site model of allometric scaling and fractal distribution networks of organs Walton R. Gutierrez* Touro College, 27West 23rd Street, New York, NY 10010 *Electronic address: [email protected] At the basic geometric level, the distribution networks carrying vital materials in living organisms, and the units such as nephrons and alveoli, form a scaling structure named here the site model. This unified view of the allometry of the kidney and lung of mammals is in good agreement with existing data, and in some instances, improves the predictions of the previous fractal model of the lung. Allometric scaling of surfaces and volumes of relevant organ parts are derived from a few simple propositions about the collective characteristics of the sites. New hypotheses and predictions are formulated, some verified by the data, while others remain to be tested, such as the scaling of the number of capillaries and the site model description of other organs. I. INTRODUCTION Important Note (March, 2004): This article has been circulated in various forms since 2001. The present version was submitted to Physical Review E in October of 2003. After two rounds of reviews, a referee pointed out that aspects of the site model had already been discovered and proposed in a previous article by John Prothero (“Scaling of Organ Subunits in Adult Mammals and Birds: a Model” Comp. Biochem. Physiol. 113A.97-106.1996). Although modifications to this paper would be required, it still contains enough new elements of interest, such as (P3), (P4) and V, to merit circulation. The q-bio section of www.arxiv.org may provide such outlet.
    [Show full text]
  • Eigenvalues, Eigenvectors and the Similarity Transformation
    Eigenvalues, Eigenvectors and the Similarity Transformation Eigenvalues and the associated eigenvectors are ‘special’ properties of square matrices. While the eigenvalues parameterize the dynamical properties of the system (timescales, resonance properties, amplification factors, etc) the eigenvectors define the vector coordinates of the normal modes of the system. Each eigenvector is associated with a particular eigenvalue. The general state of the system can be expressed as a linear combination of eigenvectors. The beauty of eigenvectors is that (for square symmetric matrices) they can be made orthogonal (decoupled from one another). The normal modes can be handled independently and an orthogonal expansion of the system is possible. The decoupling is also apparent in the ability of the eigenvectors to diagonalize the original matrix, A, with the eigenvalues lying on the diagonal of the new matrix, . In analogy to the inertia tensor in mechanics, the eigenvectors form the principle axes of the solid object and a similarity transformation rotates the coordinate system into alignment with the principle axes. Motion along the principle axes is decoupled. The matrix mechanics is closely related to the more general singular value decomposition. We will use the basis sets of orthogonal eigenvectors generated by SVD for orbit control problems. Here we develop eigenvector theory since it is more familiar to most readers. Square matrices have an eigenvalue/eigenvector equation with solutions that are the eigenvectors xand the associated eigenvalues : Ax = x The special property of an eigenvector is that it transforms into a scaled version of itself under the operation of A. Note that the eigenvector equation is non-linear in both the eigenvalue () and the eigenvector (x).
    [Show full text]
  • Scaling Symmetry Meets Topology ⇑ Pengfei Zhang, Hui Zhai
    Science Bulletin 64 (2019) 289–290 Contents lists available at ScienceDirect Science Bulletin journal homepage: www.elsevier.com/locate/scib Research Highlight Scaling symmetry meets topology ⇑ Pengfei Zhang, Hui Zhai Institute for Advanced Study, Tsinghua University, Beijing 100084, China In 1970, Vitaly Efimov found an interesting phenomenon in a also been proposed and observed in ultracold atomic gases [7]. quantum three-body problem, which is now known as the Efimov Very recently, it has also been pointed out that the Efimov effect effect [1]. Efimov found that when the two-body interaction poten- can be linked to the fractal behavior in the time domain [8,9]. Nev- tial is short-ranged and is tuned to the vicinity of an s-wave reso- ertheless, these studies have so far been limited to atomic and nance, an infinite number of three-body bound states emerge and nuclear systems. The recently published experiment by Wang their eigenenergies En form a geometric sequence as et al. [12] brings the Efimov physics into condensed matter system En ¼jE0j expð2pn=s0Þ, where s0 is a universal constant. This by observing such a universal discrete scaling symmetry in the effect is directly related to a symmetry called the scaling symme- topological semi-metals. The topological semi-metal has received try. In short, the three-body problem with a resonant two-body considerable attentions in the past decades. The interplay between interacting potential can be reduced to the following one-dimen- this discrete scaling symmetry and topology introduces a new sional Schrödinger equation as twist to the physics of topological material and will make its ! physics even richer.
    [Show full text]