KNOWPIA
WELCOME TO KNOWPIA

In linear algebra, linear transformations can be represented by matrices. If is a linear transformation mapping to and is a column vector with entries, then

for some matrix , called the **transformation matrix** of ^{[citation needed]}. Note that has rows and columns, whereas the transformation is from to . There are alternative expressions of transformation matrices involving row vectors that are preferred by some authors.^{[1]}^{[2]}

Matrices allow arbitrary linear transformations to be displayed in a consistent format, suitable for computation.^{[3]} This also allows transformations to be composed easily (by multiplying their matrices).

Linear transformations are not the only ones that can be represented by matrices. Some transformations that are non-linear on an n-dimensional Euclidean space **R**^{n} can be represented as linear transformations on the *n*+1-dimensional space **R**^{n+1}. These include both affine transformations (such as translation) and projective transformations. For this reason, 4×4 transformation matrices are widely used in 3D computer graphics. These *n*+1-dimensional transformation matrices are called, depending on their application, *affine transformation matrices*, *projective transformation matrices*, or more generally *non-linear transformation matrices*. With respect to an *n*-dimensional matrix, an *n*+1-dimensional matrix can be described as an augmented matrix.

In the physical sciences, an active transformation is one which actually changes the physical position of a system, and makes sense even in the absence of a coordinate system whereas a passive transformation is a change in the coordinate description of the physical system (change of basis). The distinction between active and passive transformations is important. By default, by *transformation*, mathematicians usually mean active transformations, while physicists could mean either.

Put differently, a *passive* transformation refers to description of the *same* object as viewed from two different coordinate frames.

If one has a linear transformation in functional form, it is easy to determine the transformation matrix *A* by transforming each of the vectors of the standard basis by *T*, then inserting the result into the columns of a matrix. In other words,

For example, the function is a linear transformation. Applying the above process (suppose that *n* = 2 in this case) reveals that

The matrix representation of vectors and operators depends on the chosen basis; a similar matrix will result from an alternate basis. Nevertheless, the method to find the components remains the same.

To elaborate, vector can be represented in basis vectors, with coordinates :

Now, express the result of the transformation matrix *A* upon , in the given basis:

The elements of matrix *A* are determined for a given basis *E* by applying *A* to every , and observing the response vector

This equation defines the wanted elements, , of *j*-th column of the matrix *A*.^{[4]}

Yet, there is a special basis for an operator in which the components form a diagonal matrix and, thus, multiplication complexity reduces to n. Being diagonal means that all coefficients but are zeros leaving only one term in the sum above. The surviving diagonal elements, , are known as **eigenvalues** and designated with in the defining equation, which reduces to . The resulting equation is known as **eigenvalue equation**.^{[5]} The eigenvectors and eigenvalues are derived from it via the **characteristic polynomial**.

With diagonalization, it is often possible to translate to and from eigenbases.

Most common geometric transformations that keep the origin fixed are linear, including rotation, scaling, shearing, reflection, and orthogonal projection; if an affine transformation is not a pure translation it keeps some point fixed, and that point can be chosen as origin to make the transformation linear. In two dimensions, linear transformations can be represented using a 2×2 transformation matrix.

A stretch in the *xy*-plane is a linear transformation which enlarges all distances in a particular direction by a constant factor but does not affect distances in the perpendicular direction. We only consider stretches along the x-axis and y-axis. A stretch along the x-axis has the form `x'` = `kx`; `y'` = `y` for some positive constant `k`. (Note that if `k` is > 1, then this really is a "stretch"; if `k` is < 1, it is technically a "compression", but we still call it a stretch. Also, if `k`=1, then the transformation is an identity, i.e. it has no effect.)

The matrix associated with a stretch by a factor `k` along the x-axis is given by:

Similarly, a stretch by a factor `k` along the y-axis has the form `x'` = `x`; `y'` = `ky`, so the matrix associated with this transformation is

If the two stretches above are combined with reciprocal values, then the transformation matrix represents a squeeze mapping:

A square with sides parallel to the axes is transformed to a rectangle that has the same area as the square. The reciprocal stretch and compression leave the area invariant.

For rotation by an angle θ **clockwise** (negative direction) about the origin the functional form is and . Written in matrix form, this becomes:^{[6]}

Similarly, for a rotation **counterclockwise** (positive direction) about the origin, the functional form is and the matrix form is:

These formulae assume that the *x* axis points right and the *y* axis points up.

The coordinate points reported by the touch screen change with the rotation of the angle(0,90,180,270)

For shear mapping (visually similar to slanting), there are two possibilities.

A shear parallel to the *x* axis has and . Written in matrix form, this becomes:

A shear parallel to the *y* axis has and , which has matrix form:

For reflection about a line that goes through the origin, let be a vector in the direction of the line. Then use the transformation matrix:

To project a vector orthogonally onto a line that goes through the origin, let be a vector in the direction of the line. Then use the transformation matrix:

As with reflections, the orthogonal projection onto a line that does not pass through the origin is an affine, not linear, transformation.

Parallel projections are also linear transformations and can be represented simply by a matrix. However, perspective projections are not, and to represent these with a matrix, homogeneous coordinates can be used.

The matrix to rotate an angle *θ* about any axis defined by unit vector (*l*,*m*,*n*) is ^{[7]}

To reflect a point through a plane (which goes through the origin), one can use , where is the 3×3 identity matrix and is the three-dimensional unit vector for the vector normal of the plane. If the L2 norm of , , and is unity, the transformation matrix can be expressed as:

Note that these are particular cases of a Householder reflection in two and three dimensions. A reflection about a line or plane that does not go through the origin is not a linear transformation — it is an affine transformation — as a 4×4 affine transformation matrix, it can be expressed as follows (assuming the normal is a unit vector):

where for some point on the plane, or equivalently, .

If the 4th component of the vector is 0 instead of 1, then only the vector's direction is reflected and its magnitude remains unchanged, as if it were mirrored through a parallel plane that passes through the origin. This is a useful property as it allows the transformation of both positional vectors and normal vectors with the same matrix. See homogeneous coordinates and affine transformations below for further explanation.

One of the main motivations for using matrices to represent linear transformations is that transformations can then be easily composed and inverted.

Composition is accomplished by matrix multiplication. Row and column vectors are operated upon by matrices, rows on the left and columns on the right. Since text reads from left to right, column vectors are preferred when transformation matrices are composed:

If **A** and **B** are the matrices of two linear transformations, then the effect of first applying **A** and then **B** to a column vector is given by:

In other words, the matrix of the combined transformation * A followed by B* is simply the product of the individual matrices.

When **A** is an invertible matrix there is a matrix **A**^{−1} that represents a transformation that "undoes" **A** since its composition with **A** is the identity matrix. In some practical applications, inversion can be computed using general inversion algorithms or by performing inverse operations (that have obvious geometric interpretation, like rotating in opposite direction) and then composing them in reverse order. Reflection matrices are a special case because they are their own inverses and don't need to be separately calculated.

To represent affine transformations with matrices, we can use homogeneous coordinates. This means representing a 2-vector (*x*, *y*) as a 3-vector (*x*, *y*, 1), and similarly for higher dimensions. Using this system, translation can be expressed with matrix multiplication. The functional form becomes:

All ordinary linear transformations are included in the set of affine transformations, and can be described as a simplified form of affine transformations. Therefore, any linear transformation can also be represented by a general transformation matrix. The latter is obtained by expanding the corresponding linear transformation matrix by one row and column, filling the extra space with zeros except for the lower-right corner, which must be set to 1. For example, *the counter-clockwise rotation matrix from above* becomes:

Using transformation matrices containing homogeneous coordinates, translations become linear, and thus can be seamlessly intermixed with all other types of transformations. The reason is that the real plane is mapped to the *w* = 1 plane in real projective space, and so translation in real Euclidean space can be represented as a shear in real projective space. Although a translation is a non-linear transformation in a 2-D or 3-D Euclidean space described by Cartesian coordinates (i.e. it can't be combined with other transformations while preserving commutativity and other properties), it becomes, in a 3-D or 4-D projective space described by homogeneous coordinates, a simple linear transformation (a shear).

More affine transformations can be obtained by composition of two or more affine transformations. For example, given a translation **T'** with vector a rotation **R** by an angle θ **counter-clockwise**, a scaling **S** with factors and a translation **T** of vector the result **M** of **T'RST** is:^{[8]}

When using affine transformations, the homogeneous component of a coordinate vector (normally called *w*) will never be altered. One can therefore safely assume that it is always 1 and ignore it. However, this is not true when using perspective projections.

Another type of transformation, of importance in 3D computer graphics, is the perspective projection. Whereas parallel projections are used to project points onto the image plane along parallel lines, the perspective projection projects points onto the image plane along lines that emanate from a single point, called the center of projection. This means that an object has a smaller projection when it is far away from the center of projection and a larger projection when it is closer (see also reciprocal function).

The simplest perspective projection uses the origin as the center of projection, and the plane at as the image plane. The functional form of this transformation is then ; . We can express this in homogeneous coordinates as:

After carrying out the matrix multiplication, the homogeneous component will be equal to the value of and the other three will not change. Therefore, to map back into the real plane we must perform the **homogeneous divide** or **perspective divide** by dividing each component by :

More complicated perspective projections can be composed by combining this one with rotations, scales, translations, and shears to move the image plane and center of projection wherever they are desired.

**^**Rafael Artzy (1965)*Linear Geometry***^**J. W. P. Hirschfeld (1979)*Projective Geometry of Finite Fields*, Clarendon Press**^**Gentle, James E. (2007). "Matrix Transformations and Factorizations".*Matrix Algebra: Theory, Computations, and Applications in Statistics*. Springer. ISBN 9780387708737.CS1 maint: uses authors parameter (link)**^**Nearing, James (2010). "Chapter 7.3 Examples of Operators" (PDF).*Mathematical Tools for Physics*. ISBN 978-0486482125. Retrieved January 1, 2012.**^**Nearing, James (2010). "Chapter 7.9: Eigenvalues and Eigenvectors" (PDF).*Mathematical Tools for Physics*. ISBN 978-0486482125. Retrieved January 1, 2012.**^**http://ocw.mit.edu/courses/aeronautics-and-astronautics/16-07-dynamics-fall-2009/lecture-notes/MIT16_07F09_Lec03.pdf**^**Szymanski, John E. (1989).*Basic Mathematics for Electronic Engineers:Models and Applications*. Taylor & Francis. p. 154. ISBN 0278000681.**^**Cédric Jules (February 25, 2015). "2D transformation matrices baking".

- The Matrix Page Practical examples in POV-Ray
- Reference page - Rotation of axes
- Linear Transformation Calculator
- Transformation Applet - Generate matrices from 2D transformations and vice versa.
- Coordinate transformation under rotation in 2D
- Excel Fun - Build 3D graphics from a spreadsheet