Multimagic square: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Download
m gen fixes, typos fixed: etc → etc. using AWB
 
en>EmausBot
m Bot: Migrating 3 interwiki links, now provided by Wikidata on d:Q13220408
Line 1: Line 1:
May get download from the following hyperlink, if you're trying to find clash of families rid gems, elixir and gold. You'll get the greatest secret official document to get accessibility  assets and endless rocks by downloading from adhering to links.<br><br>Some of the upsides of video games can include fun, leisure activity and even education. The downsides range in addictive game play which will younger individuals seeing and after that hearing things they become not old enough when considering. With luck, each of our ideas presented within this article can help  manage video [http://Search.Huffingtonpost.com/search?q=games+amazingly&s_it=header_form_v1 games amazingly] well within your home for everyone's benefit.<br><br>Video gaming are very well-liked numerous homes. The associated with people perform online adventures to pass through time, however, some blessed consumers are paid to experience clash of clans sur pc. Game playing is going to automatically be preferred for some evening into the future. These tips will an individual to if you are interested to try out online.<br><br>Regardless of whether you feel like you really targeted your enemy stain on in a present [http://search.huffingtonpost.com/search?q=shooter&s_it=header_form_v1 shooter] and still missed, inspection what weapon you seem to be using. Just resembling in real life, different weapons have different prescriptions and weaknesses. The type of weapon you are the application of may not have a person's short distance required or the weapon recoil would be actually putting you to some extent off target.<br><br>When you have any issues concerning wherever along with the way to use clash of clans hack no survey ([http://circuspartypanama.com circuspartypanama.com]), it is possible to email us from our own web page. Often the aboriginal phase, Alertness Moment is back your romantic relationship prepares their own defenses, gathers admonition about your family enemy, and starts delivering extramarital liasons of tackle. During this appearance there isnrrrt any attacking. Instead, there are three major activities during alertness holiday time: rearranging your conflict starting, altruistic accretion militia in your association mates, and aloof adversary conflict bases.<br><br>When borer on a boondocks anteroom you possibly can now appearance added advice about that play, scout, union troops, or attack. Of course, these positive results will rely on the thing appearance of the fight you might be back.<br><br>A leap into the pre-owned or operated xbox adventure marketplace. Several online poker players will get a Collide of Clans Hack and finish this game really with ease. Several shops let these activities being dealt in and then also promote them at the very lessened cost. This can be by far the most cost-effective technique to obtain newer video games the actual higher cost.
In the [[mathematics|mathematical]] discipline of [[linear algebra]], '''the Schur decomposition''' or '''Schur triangulation''', named after [[Issai Schur]], is a [[matrix decomposition]].
 
== Statement ==
The Schur decomposition reads as follows: if ''A'' is a ''n'' &times; ''n'' [[square matrix]] with [[complex numbers|complex]] entries, then ''A'' can be expressed as<ref name=horn1985>{{cite book|author=Horn, R.A. and Johnson, C.R.|year=1985|title=Matrix Analysis|publisher=Cambridge University Press|isbn=0-521-38632-2}}(Section 2.3 and further at {{Google books quote|id=PlYQN0ypTwEC|page=79|text=Schur|p. 79}})</ref><ref name=Golub1996>{{cite book|author=Golub, G.H. and Van Loan, C.F.|year=1996|title=Matrix Computations|edition=3rd|publisher=Johns Hopkins University Press|isbn=0-8018-5414-8}}(Section 7.7 at {{Google books quote|id=mlOa7wPX6OYC|page=313|text=Schur Decomposition|p. 313}})</ref>
 
:<math> A = Q U Q^{-1}</math>
 
where ''Q'' is a [[unitary matrix]] (so that its inverse ''Q''<sup>−1</sup> is also the [[conjugate transpose]] ''Q''* of ''Q''), and ''U'' is an [[upper triangular matrix]], which is called a '''Schur form''' of ''A''. Since ''U'' is [[similar (linear algebra)|similar]] to ''A'', it has the same [[multiset]] of [[eigenvalue]]s, and since it is triangular, those eigenvalues are the diagonal entries of ''U''.
 
The Schur decomposition implies that there exists a nested sequence of ''A''-invariant subspaces {0} = ''V''<sub>0</sub> ⊂ ''V''<sub>1</sub> ⊂ ... ⊂ ''V<sub>n</sub>'' = '''C'''<sup>''n''</sup>, and that there exists an ordered [[orthonormal basis]] (for the standard [[Hermitian form]] of '''C'''<sup>''n''</sup>) such that the first ''i'' basis vectors span ''V''<sub>''i''</sub> for each ''i'' occurring in the nested sequence. Phrased somewhat differently, the first part says that a [[linear operator]] ''J'' on a complex finite-dimensional vector space [[Orbit-stabilizer_theorem#Orbits_and_stabilizers|stabilizes]] a complete [[Flag (linear algebra)|flag]] (''V''<sub>1</sub>,...,''V<sub>n</sub>'').
 
== Proof ==
A constructive proof for the Schur decomposition is as follows: every operator ''A'' on a complex finite-dimensional vector space has an eigenvalue ''&lambda;'', corresponding to some eigenspace ''V<sub>&lambda;</sub>''. Let ''V<sub>&lambda;</sub>''<sup>⊥</sup> be its orthogonal complement. It is clear that, with respect to this orthogonal decomposition, ''A'' has matrix representation (one can pick here any orthonormal bases ''Z<sub>1</sub>'' and ''Z<sub>2</sub>'' spanning ''V<sub>&lambda;</sub>'' and ''V<sub>&lambda;</sub>''<sup>⊥</sup> respectively)
 
:<math>\begin{bmatrix} Z_1 & Z_2 \end{bmatrix}^{*} A \begin{bmatrix}Z_1 & Z_2\end{bmatrix} = \begin{bmatrix} \lambda \, I_{\lambda} & A_{12} \\ 0 & A_{22} \end{bmatrix}:
\begin{matrix}
V_{\lambda} \\
\oplus \\
V_{\lambda}^{\perp}
\end{matrix}
\rightarrow
\begin{matrix}
V_{\lambda} \\
\oplus \\
V_{\lambda}^{\perp}
\end{matrix}
</math>
 
where ''I<sub>&lambda;</sub>'' is the identity operator on ''V<sub>&lambda;</sub>''. The above matrix would be upper-triangular except for the ''A''<sub>22</sub> block. But exactly the same procedure can be applied to the sub-matrix ''A''<sub>22</sub>, viewed as an operator on ''V<sub>&lambda;</sub>''<sup>⊥</sup>, and its submatrices. Continue this way n times. Thus the space '''C'''<sup>''n''</sup> will be exhausted and the procedure has yielded the desired result.
 
The above argument can be slightly restated as follows: let ''&lambda;'' be an eigenvalue of ''A'', corresponding to some eigenspace ''V<sub>&lambda;</sub>''. ''A'' induces an operator ''T'' on the [[quotient space (linear algebra)|quotient space]] '''C'''<sup>''n''</sup> modulo ''V<sub>&lambda;</sub>''. This operator is precisely the ''A''<sub>22</sub> submatrix from above. As before, ''T'' would have an eigenspace, say ''W<sub>&mu;</sub>'' ⊂ '''C'''<sup>''n''</sup> modulo ''V<sub>&lambda;</sub>''. Notice the preimage of ''W<sub>&mu;</sub>'' under the quotient map is an [[invariant subspace]] of ''A'' that contains ''V<sub>&lambda;</sub>''. Continue this way until the resulting quotient space has dimension 0. Then the successive preimages of the eigenspaces found at each step form a flag that ''A'' stabilizes.
 
== Notes ==
Although every square matrix has a Schur decomposition, in general this decomposition is not unique. For example, the eigenspace ''V<sub>&lambda;</sub>'' can have dimension > 1, in which case any orthonormal basis for ''V<sub>&lambda;</sub>'' would lead to the desired result.
 
Write the triangular matrix ''U'' as ''U'' = ''D'' + ''N'', where ''D'' is diagonal and ''N'' is strictly upper triangular (and thus a [[nilpotent matrix]]). The diagonal matrix ''D'' contains the eigenvalues of ''A'' in arbitrary order (hence its Frobenius norm, squared, is the sum of the squared moduli of the eigenvalues of ''A'', while
the Frobenius norm of ''A'', squared, is the sum of the squared [[singular value]]s of ''A''). The nilpotent part ''N'' is generally not unique either, but its [[Matrix norm#Frobenius norm|Frobenius norm]] is uniquely determined by ''A'' (just because the Frobenius norm of A is equal to the Frobenius norm of  ''U'' = ''D'' + ''N'').
 
It is clear that if ''A'' is a [[normal matrix]], then ''U'' from its Schur decomposition must be a [[diagonal matrix]] and the column vectors of ''Q'' are the [[eigenvector]]s of ''A''. Therefore, the Schur decomposition extends the [[spectral decomposition]]. In particular, if ''A'' is [[Positive-definite matrix|positive definite]], the Schur decomposition of ''A'', its spectral decomposition, and its [[singular value decomposition]] coincide.
 
A [[commutative operation|commuting]] family {''A<sub>i</sub>''} of matrices can be simultaneously triangularized, i.e. there exists a unitary matrix ''Q'' such that, for every ''A<sub>i</sub>'' in the given family, ''Q A<sub>i</sub> Q*'' is upper triangular. This can be readily deduced from the above proof. Take element ''A'' from {''A<sub>i</sub>''} and again consider an eigenspace ''V<sub>A</sub>''. Then ''V<sub>A</sub>'' is invariant under all matrices in {''A<sub>i</sub>''}. Therefore all matrices in {''A<sub>i</sub>''} must share one common eigenvector in ''V<sub>A</sub>''. Induction then proves the claim. As a corollary, we have that every commuting family of normal matrices can be simultaneously [[Diagonalizable matrix|diagonalized]].
 
In the infinite dimensional setting, not every [[bounded operator]] on a Banach space has an invariant subspace. However, the upper-triangularization of an arbitrary square matrix does generalize to [[compact operator]]s. Every compact operator on a complex Banach  space has a [[Flag (linear algebra)#Subspace nest|nest]] of closed invariant subspaces.
 
== Applications ==
[[Lie theory]] applications include:
* Every invertible operator is contained in a [[Borel group]].
* Every operator fixes a point of the [[flag manifold]].
 
== Generalized Schur decomposition ==
Given square matrices ''A'' and ''B'', the '''generalized Schur decomposition''' factorizes both matrices as <math>A=QSZ^*</math> and <math>B=QTZ^*</math>, where ''Q'' and ''Z'' are [[unitary matrix|unitary]], and ''S'' and ''T'' are [[upper triangular]]. The generalized Schur decomposition is also sometimes called the '''QZ decomposition'''.<ref name=Golub1996>See {{Google books quote|id=mlOa7wPX6OYC|page=375|text=QZ|sec. 7.7.}}</ref>
 
The generalized [[eigenvalue]]s <math>\lambda</math> that solve the [[Eigendecomposition of a matrix#Additional topics|generalized eigenvalue problem]] <math>Ax=\lambda Bx</math> (where ''x'' is an unknown nonzero vector) can be calculated as the ratio of the diagonal elements of ''S'' to those of ''T''. That is, using subscripts to denote matrix elements, the ''i''th generalized eigenvalue <math>\lambda_i</math> satisfies <math>\lambda_i=S_{ii}/T_{ii}</math>.
 
== References ==
<references />
 
[[Category:Matrix theory]]
[[Category:Articles containing proofs]]
[[Category:Matrix decompositions]]

Revision as of 00:07, 16 May 2013

In the mathematical discipline of linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition.

Statement

The Schur decomposition reads as follows: if A is a n × n square matrix with complex entries, then A can be expressed as[1][2]

A=QUQ−1

where Q is a unitary matrix (so that its inverse Q−1 is also the conjugate transpose Q* of Q), and U is an upper triangular matrix, which is called a Schur form of A. Since U is similar to A, it has the same multiset of eigenvalues, and since it is triangular, those eigenvalues are the diagonal entries of U.

The Schur decomposition implies that there exists a nested sequence of A-invariant subspaces {0} = V0 ⊂ V1 ⊂ ... ⊂ Vn = Cn, and that there exists an ordered orthonormal basis (for the standard Hermitian form of Cn) such that the first i basis vectors span Vi for each i occurring in the nested sequence. Phrased somewhat differently, the first part says that a linear operator J on a complex finite-dimensional vector space stabilizes a complete flag (V1,...,Vn).

Proof

A constructive proof for the Schur decomposition is as follows: every operator A on a complex finite-dimensional vector space has an eigenvalue λ, corresponding to some eigenspace Vλ. Let Vλ⊥ be its orthogonal complement. It is clear that, with respect to this orthogonal decomposition, A has matrix representation (one can pick here any orthonormal bases Z1 and Z2 spanning Vλ and Vλ⊥ respectively)

[Z1Z2]∗A[Z1Z2]=[λIλA120A22]:Vλ⊕Vλ⊥→Vλ⊕Vλ⊥

where Iλ is the identity operator on Vλ. The above matrix would be upper-triangular except for the A22 block. But exactly the same procedure can be applied to the sub-matrix A22, viewed as an operator on Vλ⊥, and its submatrices. Continue this way n times. Thus the space Cn will be exhausted and the procedure has yielded the desired result.

The above argument can be slightly restated as follows: let λ be an eigenvalue of A, corresponding to some eigenspace Vλ. A induces an operator T on the quotient space Cn modulo Vλ. This operator is precisely the A22 submatrix from above. As before, T would have an eigenspace, say Wμ ⊂ Cn modulo Vλ. Notice the preimage of Wμ under the quotient map is an invariant subspace of A that contains Vλ. Continue this way until the resulting quotient space has dimension 0. Then the successive preimages of the eigenspaces found at each step form a flag that A stabilizes.

Notes

Although every square matrix has a Schur decomposition, in general this decomposition is not unique. For example, the eigenspace Vλ can have dimension > 1, in which case any orthonormal basis for Vλ would lead to the desired result.

Write the triangular matrix U as U = D + N, where D is diagonal and N is strictly upper triangular (and thus a nilpotent matrix). The diagonal matrix D contains the eigenvalues of A in arbitrary order (hence its Frobenius norm, squared, is the sum of the squared moduli of the eigenvalues of A, while the Frobenius norm of A, squared, is the sum of the squared singular values of A). The nilpotent part N is generally not unique either, but its Frobenius norm is uniquely determined by A (just because the Frobenius norm of A is equal to the Frobenius norm of U = D + N).

It is clear that if A is a normal matrix, then U from its Schur decomposition must be a diagonal matrix and the column vectors of Q are the eigenvectors of A. Therefore, the Schur decomposition extends the spectral decomposition. In particular, if A is positive definite, the Schur decomposition of A, its spectral decomposition, and its singular value decomposition coincide.

A commuting family {Ai} of matrices can be simultaneously triangularized, i.e. there exists a unitary matrix Q such that, for every Ai in the given family, Q Ai Q* is upper triangular. This can be readily deduced from the above proof. Take element A from {Ai} and again consider an eigenspace VA. Then VA is invariant under all matrices in {Ai}. Therefore all matrices in {Ai} must share one common eigenvector in VA. Induction then proves the claim. As a corollary, we have that every commuting family of normal matrices can be simultaneously diagonalized.

In the infinite dimensional setting, not every bounded operator on a Banach space has an invariant subspace. However, the upper-triangularization of an arbitrary square matrix does generalize to compact operators. Every compact operator on a complex Banach space has a nest of closed invariant subspaces.

Applications

Lie theory applications include:

Generalized Schur decomposition

Given square matrices A and B, the generalized Schur decomposition factorizes both matrices as A=QSZ∗ and B=QTZ∗, where Q and Z are unitary, and S and T are upper triangular. The generalized Schur decomposition is also sometimes called the QZ decomposition.[2]

The generalized eigenvalues λ that solve the generalized eigenvalue problem Ax=λBx (where x is an unknown nonzero vector) can be calculated as the ratio of the diagonal elements of S to those of T. That is, using subscripts to denote matrix elements, the ith generalized eigenvalue λi satisfies λi=Sii/Tii.

References

  1. ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534(Section 2.3 and further at Template:Google books quote)
  2. ↑ 2.0 2.1 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534(Section 7.7 at Template:Google books quote) Cite error: Invalid <ref> tag; name "Golub1996" defined multiple times with different content.