@@ -97,48 +97,6 @@ void transpose(const std::vector<Int>& ptr, const std::vector<Int>& rows,
9797 }
9898}
9999
100- void symProduct (const std::vector<Int>& ptr, const std::vector<Int>& rows,
101- const std::vector<double >& vals, const std::vector<double >& x,
102- std::vector<double >& y, double alpha) {
103- // Matrix-vector product in CSC format, for symmetric matrix which stores only
104- // the lower triangle.
105- // Compute y = y + alpha * M * x
106-
107- const Int n = ptr.size () - 1 ;
108-
109- for (Int col = 0 ; col < n; ++col) {
110- for (Int el = ptr[col]; el < ptr[col + 1 ]; ++el) {
111- Int row = rows[el];
112- double val = vals[el];
113-
114- y[row] += alpha * val * x[col];
115- if (row != col) y[col] += alpha * val * x[row];
116- }
117- }
118- }
119-
120- void symProductQuad (const std::vector<Int>& ptr, const std::vector<Int>& rows,
121- const std::vector<double >& vals,
122- const std::vector<double >& x, std::vector<HighsCDouble>& y,
123- double alpha) {
124- // Matrix-vector product in CSC format, for symmetric matrix which stores only
125- // the lower triangle.
126- // Compute y = y + alpha * M * x
127-
128- const Int n = ptr.size () - 1 ;
129-
130- for (Int col = 0 ; col < n; ++col) {
131- for (Int el = ptr[col]; el < ptr[col + 1 ]; ++el) {
132- Int row = rows[el];
133- HighsCDouble val = vals[el];
134-
135- y[row] += val * (HighsCDouble)x[col] * (HighsCDouble)alpha;
136- if (row != col)
137- y[col] += val * (HighsCDouble)x[row] * (HighsCDouble)alpha;
138- }
139- }
140- }
141-
142100void childrenLinkedList (const std::vector<Int>& parent, std::vector<Int>& head,
143101 std::vector<Int>& next) {
144102 // Create linked lists of children in elimination tree.
0 commit comments