%%% This file is part of PlanetMath snapshot of 2009-01-12 %%% Primary Title: Schur decomposition %%% Primary Category Code: 15-00 %%% Filename: SchurDecomposition.tex %%% Version: 5 %%% Owner: Daume %%% Author(s): Daume %%% PlanetMath is released under the GNU Free Documentation License. %%% You should have received a file called fdl.txt along with this file. %%% If not, please write to gnu@gnu.org. \documentclass[12pt]{article} \pagestyle{empty} \setlength{\paperwidth}{8.5in} \setlength{\paperheight}{11in} \setlength{\topmargin}{0.00in} \setlength{\headsep}{0.00in} \setlength{\headheight}{0.00in} \setlength{\evensidemargin}{0.00in} \setlength{\oddsidemargin}{0.00in} \setlength{\textwidth}{6.5in} \setlength{\textheight}{9.00in} \setlength{\voffset}{0.00in} \setlength{\hoffset}{0.00in} \setlength{\marginparwidth}{0.00in} \setlength{\marginparsep}{0.00in} \setlength{\parindent}{0.00in} \setlength{\parskip}{0.15in} \usepackage{html} % this is the default PlanetMath preamble. as your knowledge % of TeX increases, you will probably want to edit this, but % it should be fine as is for beginners. % almost certainly you want these \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsfonts} % used for TeXing text within eps files %\usepackage{psfrag} % need this for including graphics (\includegraphics) %\usepackage{graphicx} % for neatly defining theorems and propositions %\usepackage{amsthm} % making logically defined graphics %\usepackage{xypic} % there are many more packages, add them here as you need them % define commands here \begin{document} If $A$ is a \htmladdnormallink{complex}{http://planetmath.org/encyclopedia/PolarForm.html} \htmladdnormallink{square matrix}{http://planetmath.org/encyclopedia/SquareMatrix.html} of \htmladdnormallink{order}{http://planetmath.org/encyclopedia/Order7.html} n \textit{(i.e. $A\in\mathrm{Mat}_n(\mathbb{C})$)}, then there exists a \htmladdnormallink{unitary matrix}{http://planetmath.org/encyclopedia/UnitaryMatrix.html} $Q \in \mathrm{Mat}_n(\mathbb{C})$ such that\\ \begin{center} $Q^HAQ = T = D + N$ \end{center} where $^H$ is the \htmladdnormallink{conjugate transpose}{http://planetmath.org/encyclopedia/Tranjugate.html}, $D = \operatorname{diag}(\lambda_1, \dots, \lambda_n)$ \textit{(the $\lambda_i$ are \htmladdnormallink{eigenvalues}{http://planetmath.org/encyclopedia/Eigenvalues.html} of $A$)}, and $N \in \mathrm{Mat}_n(\mathbb{C})$ is \htmladdnormallink{strictly upper triangular matrix}{http://planetmath.org/encyclopedia/StrictlyLowerTriangularMatrix.html}. Furthermore, $Q$ can be chosen such that the eigenvalues $\lambda_i$ appear in any order along the \htmladdnormallink{diagonal}{http://planetmath.org/encyclopedia/Diagonal.html}. \cite{1} \begin{thebibliography}{1} \bibitem[GVL]{1} Golub, H. Gene, Van Loan F. Charles: Matrix Computations \textit{(Third Edition)}. The Johns Hopkins University Press, London, 1996. \end{thebibliography} \end{document}