Wikipedia

Shear matrix

In mathematics, a shear matrix or transvection is an elementary matrix that represents the addition of a multiple of one row or column to another. Such a matrix may be derived by taking the identity matrix and replacing one of the zero elements with a non-zero value.

A typical shear matrix is shown below:

The name shear reflects the fact that the matrix represents a shear transformation. Geometrically, such a transformation takes pairs of points in a linear space, that are purely axially separated along the axis whose row in the matrix contains the shear element, and effectively replaces those pairs by pairs whose separation is no longer purely axial but has two vector components. Thus, the shear axis is always an eigenvector of S.

A shear parallel to the x axis results in and . In matrix form:

Similarly, a shear parallel to the y axis has and . In matrix form:

Clearly the determinant will always be 1, as no matter where the shear element is placed, it will be a member of a skew-diagonal that also contains zero elements (as all skew-diagonals have length at least two) hence its product will remain zero and won't contribute to the determinant. Thus every shear matrix has an inverse, and the inverse is simply a shear matrix with the shear element negated, representing a shear transformation in the opposite direction. In fact, this is part of an easily derived more general result: if S is a shear matrix with shear element , then Sn is a shear matrix whose shear element is simply n. Hence, raising a shear matrix to a power n multiplies its shear factor by n.

Properties

If S is an n×n shear matrix, then:

  • S has rank n and therefore is invertible
  • 1 is the only eigenvalue of S, so det S = 1 and trace S = n
  • the eigenspace of S has n-1 dimensions.
  • S is asymmetric
  • S may be made into a block matrix by at most 1 column interchange and 1 row interchange operation
  • the area, volume, or any higher order interior capacity of a polytope is invariant under the shear transformation of the polytope's vertices.

Applications

See also

Notes

  1. ^ Foley et al. (1991, pp. 207–208,216–217)

References

  • Foley, James D.; van Dam, Andries; Feiner, Steven K.; Hughes, John F. (1991), Computer Graphics: Principles and Practice (2nd ed.), Reading: Addison-Wesley, ISBN 0-201-12110-7
This article is copied from an article on Wikipedia® - the free encyclopedia created and edited by its online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of Wikipedia® encyclopedia articles provide accurate and timely information, please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.

Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.