K correction - Revision history

en>Tom.Reding: Gen fixes (page/s, endash, , et al., unicodify, and/or concising wikilinks, etc.), & ref cleanup using AWB

2015-01-06T04:58:02Z

Gen fixes (page/s, endash, &nbsp, et al., unicodify, and/or concising wikilinks, etc.), & ref cleanup using AWB

← Older revision		Revision as of 06:58, 6 January 2015
Line 1:		Line 1:
	~~{{Refimprove\|date=December 2013}}~~		Hi there, I am Sophia. For many years he's been living in Alaska and he doesn't strategy on altering it. To perform lacross is something I really appreciate doing. My working day job is an info officer but I've currently applied for an additional one.<br><br>Visit my blog; best psychic ([http://fashionlinked.com/index.php?do=/profile-13453/info/ fashionlinked.com])
	~~In [[mathematics]]~~, a '''shear matrix''' or '''transvection''' is an [[elementary matrix]] that represents the [[Elementary row operations#Row-addition transformations\|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:~~

	~~:<math>S=~~
	~~\begin{pmatrix}~~
	~~1 & 0 & 0 & \lambda & 0 \\~~
	~~0 & 1 & 0 & 0 & 0 \\~~
	~~0 & 0 & 1 & 0 & 0 \\~~
	~~0 & 0 & 0 & 1 & 0 \\~~
	~~0 & 0 & 0 & 0 & 1~~
	~~\end{pmatrix}.~~
	~~</math>~~

	~~The name~~ '~~'shear'' reflects the fact that the matrix represents a [[shear mapping\|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 ''x' = x + ''~~<~~math~~>~~\lambda~~<~~/math~~>~~''y'' and ''y' = y''. In matrix form~~:

	~~::<math>~~
	~~\begin{pmatrix} x' \\ y' \end{pmatrix} =~~
	~~\begin{pmatrix}~~
	~~1 & \lambda \\~~
	~~0 & 1~~
	~~\end{pmatrix}~~
	~~\begin{pmatrix} x \\ y \end{pmatrix}~~.
	~~</math>~~

	~~Similarly, a shear parallel to the ''y'' axis has ''x' = x'' and ''y' = y + ''<math>\lambda<~~/~~math>''x''~~. ~~In matrix form:~~

	~~::<math>~~
	~~\begin{pmatrix}x' \\ y' \end{pmatrix}~~ =
	~~\begin{pmatrix}~~
	~~1 & 0 \\~~
	~~\lambda & 1~~
	~~\end{pmatrix}~~
	~~\begin{pmatrix} x \\ y \end{pmatrix}.~~
	</~~math>~~

	~~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 <math>\lambda</~~math>, then ''S<sup>n<~~/~~sup>'' is a shear matrix whose shear element is simply ''n''<math>\lambda</math>~~. ~~Hence, raising a shear matrix to a power ''n'' multiplies its [[shear mapping#Definition\|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 (geometry)\|area]~~], [[volume (geometry~~)~~\|volume]], or any higher order interior capacity of a [[polytope]] is invariant under the shear transformation of the polytope's vertices.~~

	~~==Applications==~~
	* Shear matrices are often used in [[computer graphics]].<ref>{{harvtxt\|Foley\|van Dam\|Feiner\|Hughes\|1991\|pp=207–208,216–217}}</ref>

	~~==See also==~~
	*[[Transformation matrix]]

	~~== Notes ==~~
	~~<references/>~~

	~~== References ==~~
	* {{ citation \| first1 = James D. \| last1 = Foley \| first2 = Andries \| last2 = van Dam \| first3 = Steven K. \| last3 = Feiner \| first4 = John F. \| last4 = Hughes \| year = 1991 \| isbn = 0-201-12110-7 \| title = Computer Graphics: Principles and Practice \| edition = 2nd \| publisher = [[Addison-Wesley]] \| location = Reading }}

	~~{{DEFAULTSORT:Shear Matrix}}~~
	~~[[Category:Matrices]]~~
	~~[[Category:Linear algebra]]~~
	~~[[Category:Sparse matrices]]~~

en>Addbot: Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q3694453

2013-03-16T08:39:35Z

Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q3694453

← Older revision		Revision as of 10:39, 16 March 2013
Line 1:		Line 1:
	The name of the ~~writer~~ is ~~Jayson~~. ~~My wife~~ and ~~I reside in Mississippi but now I~~'~~m considering other options~~. ~~I am really fond~~ of to go to ~~karaoke but I~~'~~ve been taking on new things lately~~. ~~Office supervising~~ is ~~where my primary income arrives from but I~~'~~ve usually needed my own business~~.<br><br>~~My webpage ::~~ [~~http:~~/~~/cpacs~~.~~org/index~~.~~php?document_srl~~=~~90091&mid~~=~~board_zTGg26 tarot readings~~]		{{Refimprove\|date=December 2013}}
			In [[mathematics]], a '''shear matrix''' or '''transvection''' is an [[elementary matrix]] that represents the [[Elementary row operations#Row-addition transformations\|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:

			:<math>S=
			\begin{pmatrix}
			1 & 0 & 0 & \lambda & 0 \\
			0 & 1 & 0 & 0 & 0 \\
			0 & 0 & 1 & 0 & 0 \\
			0 & 0 & 0 & 1 & 0 \\
			0 & 0 & 0 & 0 & 1
			\end{pmatrix}.
			</math>

			The name ''shear'' reflects the fact that the matrix represents a [[shear mapping\|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 ''x' = x + ''<math>\lambda</math>''y'' and ''y' = y''. In matrix form:

			::<math>
			\begin{pmatrix} x' \\ y' \end{pmatrix} =
			\begin{pmatrix}
			1 & \lambda \\
			0 & 1
			\end{pmatrix}
			\begin{pmatrix} x \\ y \end{pmatrix}.
			</math>

			Similarly, a shear parallel to the ''y'' axis has ''x' = x'' and ''y' = y + ''<math>\lambda</math>''x''. In matrix form:

			::<math>
			\begin{pmatrix}x' \\ y' \end{pmatrix} =
			\begin{pmatrix}
			1 & 0 \\
			\lambda & 1
			\end{pmatrix}
			\begin{pmatrix} x \\ y \end{pmatrix}.
			</math>

			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 <math>\lambda</math>, then ''S<sup>n</sup>'' is a shear matrix whose shear element is simply ''n''<math>\lambda</math>. Hence, raising a shear matrix to a power ''n'' multiplies its [[shear mapping#Definition\|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 (geometry)\|area]], [[volume (geometry)\|volume]], or any higher order interior capacity of a [[polytope]] is invariant under the shear transformation of the polytope's vertices.

			==Applications==
			* Shear matrices are often used in [[computer graphics]].<ref>{{harvtxt\|Foley\|van Dam\|Feiner\|Hughes\|1991\|pp=207–208,216–217}}</ref>

			==See also==
			*[[Transformation matrix]]

			== Notes ==
			<references/>

			== References ==
			* {{ citation \| first1 = James D. \| last1 = Foley \| first2 = Andries \| last2 = van Dam \| first3 = Steven K. \| last3 = Feiner \| first4 = John F. \| last4 = Hughes \| year = 1991 \| isbn = 0-201-12110-7 \| title = Computer Graphics: Principles and Practice \| edition = 2nd \| publisher = [[Addison-Wesley]] \| location = Reading }}

			{{DEFAULTSORT:Shear Matrix}}
			[[Category:Matrices]]
			[[Category:Linear algebra]]
			[[Category:Sparse matrices]]

98.212.122.166: removed improper comma

2012-02-29T23:05:54Z

removed improper comma

New page

The name of the writer is Jayson. My wife and I reside in Mississippi but now I'm considering other options. I am really fond of to go to karaoke but I've been taking on new things lately. Office supervising is where my primary income arrives from but I've usually needed my own business.<br><br>My webpage :: [http://cpacs.org/index.php?document_srl=90091&mid=board_zTGg26 tarot readings]