Lines Matching refs:sm1
16 SparseMatrix<double> sm1(1000,1000);
24 sm1.resize(m,n); //Change sm1 to a m x n matrix.
25 sm1.reserve(nnz); // Allocate room for nnz nonzeros elements.
34 SparseMatrix<double,Colmajor> sm1;
35 // Initialize sm2 with sm1.
36 SparseMatrix<double,Rowmajor> sm2(sm1), sm3;
38 sm3 = sm1;
48 sm1.insert(i, j) = v_ij;
51 sm1.coeffRef(i,j) = v_ij;
52 sm1.coeffRef(i,j) += v_ij;
53 sm1.coeffRef(i,j) -= v_ij;
65 sm1.setFromTriplets(TripletList.begin(), TripletList.end());
74 sm1.setZero();
87 sm1.rows(); // Number of rows
88 sm1.cols(); // Number of columns
89 sm1.nonZeros(); // Number of non zero values
90 sm1.outerSize(); // Number of columns (resp. rows) for a column major (resp. row major )
91 sm1.innerSize(); // Number of rows (resp. columns) for a row major (resp. column major)
92 sm1.norm(); // Euclidian norm of the matrix
93 sm1.squaredNorm(); // Squared norm of the matrix
94 sm1.blueNorm();
95 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
96 sm1.isCompressed(); // Check if sm1 is in compressed form
110 sm3 = sm1 + sm2;
111 sm3 = sm1 - sm2;
112 sm2 += sm1;
113 sm2 -= sm1; \endcode
116 sm1 and sm2 should have the same storage order
122 sm3 = sm1 * s1; sm3 *= s1;
123 sm3 = s1 * sm1 + s2 * sm2; sm3 /= s1;\endcode
132 sm3 = sm1 * sm2;
133 dm2 = sm1 * dm1;
134 dv2 = sm1 * dv1;
143 sm2 = sm1.transpose();
144 sm2 = sm1.adjoint();
155 sm1.twistedBy(perm); // Permute rows and columns
156 sm2 = sm1 * perm; //Permute the columns
157 sm2 = perm * sm1; // Permute the columns
169 sm1.cwiseProduct(sm2);
170 sm1.cwiseQuotient(sm2);
171 sm1.cwiseMin(sm2);
172 sm1.cwiseMax(sm2);
173 sm1.cwiseAbs();
174 sm1.cwiseSqrt();
177 sm1 and sm2 should have the same storage order
189 sm1.block(startRow, startCol, rows, cols);
190 sm1.block(startRow, startCol);
191 sm1.topLeftCorner(rows, cols);
192 sm1.topRightCorner(rows, cols);
193 sm1.bottomLeftCorner( rows, cols);
194 sm1.bottomRightCorner( rows, cols);
202 sm1.innerVector(outer);
203 sm1.innerVectors(start, size);
204 sm1.leftCols(size);
206 sm1.middleRows(start, numRows);
207 sm1.middleCols(start, numCols);
208 sm1.col(j);
217 sm2 = sm1.triangularview<Lower>();
218 sm2 = sm1.selfadjointview<Lower>();
229 dv2 = sm1.triangularView<Upper>().solve(dv1);
230 dv2 = sm1.topLeftCorner(size, size).triangularView<Lower>().solve(dv1);
239 sm1.valuePtr(); // Pointer to the values
240 sm1.innerIndextr(); // Pointer to the indices.
241 sm1.outerIndexPtr(); //Pointer to the beginning of each inner vector