14.4: Matrix Inversion

Introduction to Autonomous Robots · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY-NC 4.0, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    14.4: Matrix Inversion

    Given a matrix A, finding the inverse B = A−1 involves solving the system of equations that satisfies

    \[\mathbf{AB=BA=I}\]

    with I the identity matrix. (The identity matrix is zero everywhere except at its diagonal entries, which are one.)

    In the particular case of orthonormal matrices, which columns are all orthogonal to each other and of length one, the inverse is equivalent to the transpose, i.e.

    \[\mathbf{A}^{-1}=\mathbf{A}^{T}\]

    This is important, as rotation matrices are orthonormal. In case a matrix is not quadratic, we can calculate the pseudo-inverse, which is defined by

    \[\mathbf{A}^{+}=\mathbf{A}^{T}(\mathbf{AA}^{T})^{-1}\]

    and is often used in finding an inverse kinematic solution.


    This page titled 14.4: Matrix Inversion was last modified on Tue, 10 Aug 2021 01:33:37 GMT and is shared under a CC BY-NC 4.0 license and was authored, remixed, and/or curated by Nikolaus Correll via source content that was edited to the style and standards of the LibreTexts platform.