From 0c463a21c4a87e9ff3daf7df365082f7df55e3dd Mon Sep 17 00:00:00 2001
From: Jitse Niesen <jitse@maths.leeds.ac.uk>
Date: Tue, 10 May 2011 09:59:58 +0100
Subject: [PATCH] Forgot to 'hg add' example file in last commit.

---
 unsupported/Eigen/MatrixFunctions             |  2 +-
 unsupported/doc/examples/MatrixSquareRoot.cpp | 16 ++++++++++++++++
 2 files changed, 17 insertions(+), 1 deletion(-)
 create mode 100644 unsupported/doc/examples/MatrixSquareRoot.cpp

diff --git a/unsupported/Eigen/MatrixFunctions b/unsupported/Eigen/MatrixFunctions
index d49350f67..ecdf23cef 100644
--- a/unsupported/Eigen/MatrixFunctions
+++ b/unsupported/Eigen/MatrixFunctions
@@ -310,7 +310,7 @@ cut.
 The computation is the same as in the real case, except that the
 complex Schur decomposition is used to reduce the matrix to a
 triangular matrix. The theoretical cost is the same. Details are in:
-&Aring;ke Bj&ouml;rck and Scen Hammarling, "A Schur method for the
+&Aring;ke Bj&ouml;rck and Sven Hammarling, "A Schur method for the
 square root of a matrix", <em>Linear Algebra Appl.</em>,
 52/53:127&ndash;140, 1983.
 
diff --git a/unsupported/doc/examples/MatrixSquareRoot.cpp b/unsupported/doc/examples/MatrixSquareRoot.cpp
new file mode 100644
index 000000000..88e7557d7
--- /dev/null
+++ b/unsupported/doc/examples/MatrixSquareRoot.cpp
@@ -0,0 +1,16 @@
+#include <unsupported/Eigen/MatrixFunctions>
+#include <iostream>
+
+using namespace Eigen;
+
+int main()
+{
+  const double pi = std::acos(-1.0);
+
+  MatrixXd A(2,2);
+  A << cos(pi/3), -sin(pi/3), 
+       sin(pi/3),  cos(pi/3);
+  std::cout << "The matrix A is:\n" << A << "\n\n";
+  std::cout << "The matrix square root of A is:\n" << A.sqrt() << "\n\n";
+  std::cout << "The square of the last matrix is:\n" << A.sqrt() * A.sqrt() << "\n";
+}