[sdpb] 135/233: Trivial changes to comments

[Tobias Hansen]

This is an automated email from the git hooks/post-receive script.

thansen pushed a commit to branch master
in repository sdpb.

commit 833aaae399a78f82d274b6a1dd7d3001c0e0e8b8
Author: David Simmons-Duffin <dsd at athena.sns.ias.edu>
Date:   Sat Jan 31 17:26:33 2015 -0500

    Trivial changes to comments
---
 src/SDP.cpp | 2 +-
 src/SDP.h   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/SDP.cpp b/src/SDP.cpp
index 07d8a5c..816e9a2 100644
--- a/src/SDP.cpp
+++ b/src/SDP.cpp
@@ -74,7 +74,7 @@ dualConstraintGroupFromPolVecMat(const PolynomialVectorMatrix &m) {
   // The rest multiply decision variables y
   g.constraintMatrix    = Matrix(numConstraints, vectorDim - 1);
 
-  // Populate B and c by sampling the matrix polynomial
+  // Populate B and c by sampling the polynomial matrix
   int p = 0;
   for (int c = 0; c < g.dim; c++) {
     for (int r = c; r < g.dim; r++) {
diff --git a/src/SDP.h b/src/SDP.h
index 9aeec82..0be1d78 100644
--- a/src/SDP.h
+++ b/src/SDP.h
@@ -235,7 +235,7 @@ class SDP {
 // DualConstraintGroups labeled by 0<=j<J.
 //
 // DualConstraintGroup's are currently only used as an intermediate
-// data structure between the matrix polynomials defining an MPP and a
+// data structure between the polynomial matrices defining an PMP and a
 // full SDP.  By directly combining DualConstraintGroups into an SDP
 // using sdpFromDualConstraintGroups, it is possible to define slightly
 // more general optimization problems than those produced by

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/sdpb.git