diff --git a/examples/nist.cc b/examples/nist.cc
index 754467c..f95b4a3 100644
--- a/examples/nist.cc
+++ b/examples/nist.cc
@@ -592,7 +592,7 @@
       typedef
       ceres::TinySolver<
         ceres::TinySolverCostFunctionAdapter<Eigen::Dynamic, num_parameters>,
-        Eigen::LDLT<Eigen::Matrix<double, num_parameters, num_parameters>>> Solver;
+        Eigen::LDLT<Eigen::Matrix<double, num_parameters, num_parameters> > > Solver;
       Solver solver;
       solver.options.max_iterations = FLAGS_num_iterations;
       solver.options.error_threshold = std::numeric_limits<double>::epsilon();
diff --git a/include/ceres/tiny_solver_cost_function_adapter.h b/include/ceres/tiny_solver_cost_function_adapter.h
index fac0784..2ba1a2d 100644
--- a/include/ceres/tiny_solver_cost_function_adapter.h
+++ b/include/ceres/tiny_solver_cost_function_adapter.h
@@ -116,7 +116,7 @@
     // column-major layout, and the CostFunction objects use row-major
     // Jacobian matrices. So the following bit of code does the
     // conversion from row-major Jacobians to column-major Jacobians.
-    Eigen::Map<Eigen::Matrix<double, NUM_RESIDUALS, NUM_PARAMETERS>>
+    Eigen::Map<Eigen::Matrix<double, NUM_RESIDUALS, NUM_PARAMETERS> >
         col_major_jacobian(jacobian, NumResiduals(), NumParameters());
     col_major_jacobian = row_major_jacobian_;
     return true;