Lines Matching refs:res_d
60 DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d; in sparse_permutations() local
83 res_d = mat_d*p; in sparse_permutations()
84 VERIFY(res.isApprox(res_d) && "mat*p"); in sparse_permutations()
89 res_d = p*mat_d; in sparse_permutations()
90 VERIFY(res.isApprox(res_d) && "p*mat"); in sparse_permutations()
95 res_d = mat*p.inverse(); in sparse_permutations()
96 VERIFY(res.isApprox(res_d) && "mat*inv(p)"); in sparse_permutations()
101 res_d = p.inverse()*mat_d; in sparse_permutations()
102 VERIFY(res.isApprox(res_d) && "inv(p)*mat"); in sparse_permutations()
107 res_d = (p * mat_d) * p.inverse(); in sparse_permutations()
108 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); in sparse_permutations()
112 res_d = up_sym_d; in sparse_permutations()
113 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
116 res_d = lo_sym_d; in sparse_permutations()
117 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); in sparse_permutations()
121 res_d = up_sym_d; in sparse_permutations()
122 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); in sparse_permutations()
125 res_d = lo_sym_d; in sparse_permutations()
126 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); in sparse_permutations()
130 res_d = up_sym_d; in sparse_permutations()
131 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
134 res_d = lo_sym_d; in sparse_permutations()
135 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); in sparse_permutations()
138 res_d = up_sym_d; in sparse_permutations()
139 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); in sparse_permutations()
142 res_d = lo_sym_d; in sparse_permutations()
143 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); in sparse_permutations()
147 res_d = up_sym_d.template triangularView<Upper>(); in sparse_permutations()
148 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to upper"); in sparse_permutations()
151 res_d = up_sym_d.template triangularView<Lower>(); in sparse_permutations()
152 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to lower"); in sparse_permutations()
155 res_d = lo_sym_d.template triangularView<Upper>(); in sparse_permutations()
156 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to upper"); in sparse_permutations()
159 res_d = lo_sym_d.template triangularView<Lower>(); in sparse_permutations()
160 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to lower"); in sparse_permutations()
165 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>(); in sparse_permutations()
166 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to upper"); in sparse_permutations()
169 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>(); in sparse_permutations()
170 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to upper"); in sparse_permutations()
173 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>(); in sparse_permutations()
174 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to lower"); in sparse_permutations()
177 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>(); in sparse_permutations()
178 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to lower"); in sparse_permutations()
182 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>(); in sparse_permutations()
183 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to upper"); in sparse_permutations()
186 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>(); in sparse_permutations()
187 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to upper"); in sparse_permutations()
190 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>(); in sparse_permutations()
191 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to lower"); in sparse_permutations()
194 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>(); in sparse_permutations()
195 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to lower"); in sparse_permutations()
199 res_d = (p * up_sym_d) * p.inverse(); in sparse_permutations()
200 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to full"); in sparse_permutations()
203 res_d = (p * lo_sym_d) * p.inverse(); in sparse_permutations()
204 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to full"); in sparse_permutations()
207 res_d = (p * up_sym_d) * p.inverse(); in sparse_permutations()
208 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to full"); in sparse_permutations()
211 res_d = (p * lo_sym_d) * p.inverse(); in sparse_permutations()
212 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to full"); in sparse_permutations()