28   DenseMatrix mat_d = DenseMatrix::Zero(rows, cols), up_sym_d, lo_sym_d, res_d;  in sparse_permutations()  local
48   res_d = mat_d*p;  in sparse_permutations()
49   VERIFY(res.isApprox(res_d) && "mat*p");  in sparse_permutations()
52   res_d = p*mat_d;  in sparse_permutations()
53   VERIFY(res.isApprox(res_d) && "p*mat");  in sparse_permutations()
56   res_d = mat*p.inverse();  in sparse_permutations()
57   VERIFY(res.isApprox(res_d) && "mat*inv(p)");  in sparse_permutations()
60   res_d = p.inverse()*mat_d;  in sparse_permutations()
61   VERIFY(res.isApprox(res_d) && "inv(p)*mat");  in sparse_permutations()
64   res_d = (p * mat_d) * p.inverse();  in sparse_permutations()
65   VERIFY(res.isApprox(res_d) && "p*mat*inv(p)");  in sparse_permutations()
69   res_d = up_sym_d;  in sparse_permutations()
70   VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");  in sparse_permutations()
73   res_d = lo_sym_d;  in sparse_permutations()
74   VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");  in sparse_permutations()
78   res_d = up_sym_d;  in sparse_permutations()
79   VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");  in sparse_permutations()
82   res_d = lo_sym_d;  in sparse_permutations()
83   VERIFY(res.isApprox(res_d) && "lower selfadjoint full");  in sparse_permutations()
87   res_d = up_sym_d;  in sparse_permutations()
88   VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");  in sparse_permutations()
91   res_d = lo_sym_d;  in sparse_permutations()
92   VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");  in sparse_permutations()
95   res_d = up_sym_d;  in sparse_permutations()
96   VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");  in sparse_permutations()
99   res_d = lo_sym_d;  in sparse_permutations()
100   VERIFY(res.isApprox(res_d) && "lower selfadjoint full");  in sparse_permutations()
104   res_d = up_sym_d.template triangularView<Upper>();  in sparse_permutations()
105   VERIFY(res.isApprox(res_d) && "full selfadjoint upper to upper");  in sparse_permutations()
108   res_d = up_sym_d.template triangularView<Lower>();  in sparse_permutations()
109   VERIFY(res.isApprox(res_d) && "full selfadjoint upper to lower");  in sparse_permutations()
112   res_d = lo_sym_d.template triangularView<Upper>();  in sparse_permutations()
113   VERIFY(res.isApprox(res_d) && "full selfadjoint lower to upper");  in sparse_permutations()
116   res_d = lo_sym_d.template triangularView<Lower>();  in sparse_permutations()
117   VERIFY(res.isApprox(res_d) && "full selfadjoint lower to lower");  in sparse_permutations()
122   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
123   VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to upper");  in sparse_permutations()
126   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
127   VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to upper");  in sparse_permutations()
130   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
131   VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to lower");  in sparse_permutations()
134   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
135   VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to lower");  in sparse_permutations()
139   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
140   VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to upper");  in sparse_permutations()
143   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
144   VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to upper");  in sparse_permutations()
147   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
148   VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to lower");  in sparse_permutations()
151   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
152   VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to lower");  in sparse_permutations()
156   res_d = (p * up_sym_d) * p.inverse();  in sparse_permutations()
157   VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to full");  in sparse_permutations()
160   res_d = (p * lo_sym_d) * p.inverse();  in sparse_permutations()
161   VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to full");  in sparse_permutations()
164   res_d = (p * up_sym_d) * p.inverse();  in sparse_permutations()
165   VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to full");  in sparse_permutations()
168   res_d = (p * lo_sym_d) * p.inverse();  in sparse_permutations()
169   VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to full");  in sparse_permutations()