// // ZQUATEV: Diagonalization of quaternionic matrices // File : blocked.cc // Copyright (c) 2016, Toru Shiozaki (shiozaki@northwestern.edu) // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are met: // // 1. Redistributions of source code must retain the above copyright notice, this // list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright notice, // this list of conditions and the following disclaimer in the documentation // and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR // ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND // ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // The views and conclusions contained in the software and documentation are those // of the authors and should not be interpreted as representing official policies, // either expressed or implied, of the FreeBSD Project. // #include "zquatev.h" #include "f77.h" #include "supermat.h" #include using namespace std; namespace ts { namespace impl { void panel_update(const int n, const int nb, complex* const D0, complex* const D1, complex* const Q0, complex* const Q1, const int ld, const int norig, complex* const work_ptr) { assert(n > nb+1); // otherwise does not work complex* cptr = work_ptr; auto work1_3n = cptr; cptr += (n-1)*3; auto work2_3nb = cptr; cptr += nb*3; auto work3_nb = cptr; cptr += nb; auto work4_nb = cptr; cptr += nb; SuperMatrix<3,3> T(cptr, nb, nb); cptr += 9*nb*nb; SuperMatrix<3,1> R(cptr, nb, nb); cptr += 3*nb*nb; SuperMatrix<1,3> S(cptr, nb, nb); cptr += 3*nb*nb; SuperMatrix<1,2> W(cptr, n-1, nb, n-1, 1); cptr += 2*(n-1)*nb; SuperMatrix<1,3> YD(cptr, n-1, nb, n-1, 1, true, true); cptr += 2*(n-1)*nb + n-1; SuperMatrix<1,3> ZD(cptr, n-1, nb, n-1, 1, true, true); cptr += 2*(n-1)*nb + n-1; SuperMatrix<1,3> YE(cptr, n-1, nb, n-1, 1, true, true); cptr += 2*(n-1)*nb + n-1; SuperMatrix<1,3> ZE(cptr, n-1, nb, n-1, 1, true, true); // TODO once the paper is out, add comments with equation numbers. for (int k = 0; k != nb; ++k) { // prepare the k-th column using compact WY-like representation if (k > 0) { SuperMatrix<1,1> d(D0+k*ld+1, n-1, 1, n-1, 1, false); SuperMatrix<1,1> e(D1+k*ld+1, n-1, 1, n-1, 1, false); SuperMatrix<3,1> x(work2_3nb, W.mptr(0), 1, W.mptr(0), 1); x.nptr(2) = 1; SuperMatrix<2,1> x2 = x.trunc<2>(); W.cut_row<0>(k-1, x2); x.data<2,0>(0,0) = 1.0; contract<_N>(1.0, YD, x, d); contract<_N>(1.0, YE, x, e); SuperMatrix<1,1> y(work1_3n, n-1, 1); contract<_N>(1.0, ZE, x, y); d.add_lastcolumn<0>(y); y.reset(); contract<_N>(-1.0, ZD, x, y); e.add_lastcolumn<0>(y); const int sf = k-1; auto ds = d.shift(sf); auto es = e.shift(sf); auto Ws = W.shift(sf); SuperMatrix<3,1> y1(work1_3n, k, 1, k, 1); y1.nptr(0) = W.mptr(0); y1.nptr(1) = W.mptr(1); auto y1s = y1.trunc<2>(); contract<_C>(1.0, W, d, y1s); zaxpy_(k, 1.0, d.block(0,0), 1, y1.ptr<2,0>(0,0), 1); SuperMatrix<3,1> y2(work2_3nb, k, 1); contract_tr<_C>(1.0, T, y1, y2, work4_nb); contract<_N>(1.0, Ws, y2.trunc<2>(), ds); ds.data<0,0>(0,0) += y2.data<2,0>(k-1,0); SuperMatrix<1,1> y3(work3_nb, k, 1); contract_tr<_C>(1.0, R, y1, y3, work4_nb); y3.conj(); y2.reset(); contract_tr<_C>(1.0, S, y3, y2, work4_nb); SuperMatrix<1,1> y4(work1_3n, n-sf, 1); contract<_N>(1.0, Ws, y2.trunc<2>(), y4); y4.data<0,0>(0,0) += y2.data<2,0>(k-1,0); y4.conj(); SuperMatrix<3,1> y5(work2_3nb, k, 1, k, 1); y5.nptr(0) = W.mptr(0); y5.nptr(1) = W.mptr(1); auto y5s = y5.trunc<2>(); contract<_T>(1.0, W, e, y5s); zaxpy_(k, 1.0, e.block(0,0), 1, y5.ptr<2,0>(0,0), 1); es.add_lastcolumn<0>(y4); SuperMatrix<3,1> y5x(work1_3n, y5); SuperMatrix<1,1> y6(work3_nb, k, 1); contract_tr<_T>(1.0, R, y5x, y6, work4_nb); SuperMatrix<3,1> y7(work2_3nb, k, 1); contract_tr<_C>(1.0, S, y6, y7, work4_nb); contract<_N>(-1.0, Ws, y7.trunc<2>(), ds); ds.data<0,0>(0,0) -= y7.data<2,0>(k-1,0); y7.reset(); contract_tr<_T>(1.0, T, y5x, y7, work4_nb); y7.conj(); SuperMatrix<1,1> y8(work1_3n, n-sf, 1); contract<_N>(1.0, Ws, y7.trunc<2>(), y8); y8.data<0,0>(0,0) += y7.data<2,0>(k-1,0); y8.conj(); es.add_lastcolumn<0>(y8); } if (k == n-1) break; const int len = n-k-1; complex alpha = D1[k*ld+k+1]; if (len > 1) { complex* dnow = D1+k*ld+k+1; complex tau; dnow[0] = 1.0; zlarfg_(len, alpha, dnow+1, 1, tau); tau = conj(tau); conj_n(dnow, len); if (k == 0) { W.write_lastcolumn<0>(dnow, len); T.data<0,0>(0,0) = -tau; zgemv_("N", len, len, -tau, D0+ld+1, ld, dnow, 1, 0.0, YD.block(0,0), 1); zgemv_("N", len, len, -tau, D1+ld+1, ld, dnow, 1, 0.0, YE.block(0,0), 1); zaxpy_(len, -conj(tau)*zdotc_(len, dnow, 1, D0+1, 1), dnow, 1, D0+1, 1); } else { R.append_row<0>(); SuperMatrix<2,1> x(work2_3nb, k, 1); SuperMatrix<1,1> v(work1_3n, n-k-1, 1, n-k-1, 1); v.write_lastcolumn<0>(dnow, len); contract<_C>(-tau, W.shift(k), v, x); SuperMatrix<3,1> v2(work1_3n, k, 1); contract_tr<_N>(1.0, T.slice<0,2>(), x, v2, work4_nb); T.append_column<0>(v2); T.append_row<0,0>(k, -tau); SuperMatrix<1,1> v3(work3_nb, k, 1); contract_tr<_N>(1.0, S.slice<0,2>(), x, v3, work4_nb); S.append_column<0>(v3); W.append_column<0>(dnow, len, k); SuperMatrix<1,1> yx(work1_3n, n-1, 1); contract<_N>(1.0, YD.slice<0,2>(), x, yx); YD.append_column<0>(yx); zgemv_("N", n-1, len, -tau, D0+(k+1)*ld+1, ld, dnow, 1, 1.0, YD.ptr<0,0>(0,k), 1); yx.reset(); contract<_N>(1.0, YE.slice<0,2>(), x, yx); YE.append_column<0>(yx); zgemv_("N", n-1, len, -tau, D1+(k+1)*ld+1, ld, dnow, 1, 1.0, YE.ptr<0,0>(0,k), 1); yx.reset(); contract<_N>(1.0, ZD.slice<0,2>(), x, yx); ZD.append_column<0>(yx); yx.reset(); contract<_N>(1.0, ZE.slice<0,2>(), x, yx); ZE.append_column<0>(yx); zaxpy_(len, -conj(tau)*zdotc_(len, dnow, 1, D0+k*ld+k+1, 1), dnow, 1, D0+k*ld+k+1, 1); } } double c; complex s, dum; zlartg_(D0[k+1+k*ld], alpha, c, s, dum); assert(abs(-conj(s)*D0[k+1+k*ld]+c*alpha) < 1.0e-10); D0[k+1+k*ld] = c*D0[k+1+k*ld] + s*alpha; const double cbar = c-1.0; const complex sbar = conj(s); if (k == 0) { assert(abs(W.data<0,0>(0,0)-1.0)<1.0e-10); T.data<0,2>(0,0) = T.data<0,0>(0,0)*cbar; T.data<2,2>(0,0) = cbar; R.data<0,0>(0,0) = T.data<0,0>(0,0); R.data<2,0>(0,0) = 1.0; S.data<0,2>(0,0) = -sbar; auto YD0 = YD.slice<0>(); auto YE0 = YE.slice<0>(); YD.add_lastcolumn<2>(YD0, cbar); YE.add_lastcolumn<2>(YE0, cbar); zaxpy_(n-1, cbar, D0+ld+1, 1, YD.block(0,2), 1); zaxpy_(n-1, cbar, D1+ld+1, 1, YE.block(0,2), 1); SuperMatrix<1,1> yd0b(work1_3n, YD0); SuperMatrix<1,1> ye0b(work1_3n+n-1, YE0); zaxpy_(n-1, 1.0, D0+ld+1, 1, yd0b.block(0,0), 1); zaxpy_(n-1, 1.0, D1+ld+1, 1, ye0b.block(0,0), 1); yd0b.conj(); ye0b.conj(); ZD.add_lastcolumn<2>(yd0b, -sbar); ZE.add_lastcolumn<2>(ye0b, -sbar); } else { SuperMatrix<2,1> x(work2_3nb, k+1, 1); W.cut_row<0>(k, x); SuperMatrix<1,1> yx(work1_3n, n-1, 1); SuperMatrix<1,1> zx(work1_3n+n-1, n-1, 1); contract<_N>(1.0, YD.slice<0,2>(), x, yx); contract<_N>(1.0, ZD.slice<0,2>(), x, zx); fill_n(YD.block(0,2), n-1, 0.0); fill_n(ZD.block(0,2), n-1, 0.0); ZD.add_lastcolumn<2>(zx, cbar); zx.conj(); YD.add_lastcolumn<2>(zx, sbar); zaxpy_(n-1, 1.0, D0+(k+1)*ld+1, 1, yx.block(0,0), 1); YD.add_lastcolumn<2>(yx, cbar); yx.conj(); ZD.add_lastcolumn<2>(yx, -sbar); yx.reset(); zx.reset(); contract<_N>(1.0, YE.slice<0,2>(), x, yx); contract<_N>(1.0, ZE.slice<0,2>(), x, zx); fill_n(YE.block(0,2), n-1, 0.0); fill_n(ZE.block(0,2), n-1, 0.0); ZE.add_lastcolumn<2>(zx, cbar); zx.conj(); YE.add_lastcolumn<2>(zx, sbar); zaxpy_(n-1, 1.0, D1+(k+1)*ld+1, 1, yx.block(0,0), 1); YE.add_lastcolumn<2>(yx, cbar); yx.conj(); ZE.add_lastcolumn<2>(yx, -sbar); SuperMatrix<3,1> v(work1_3n, k+1, 1); contract_tr<_N>(1.0, T.slice<0,2>(), x, v, work4_nb); SuperMatrix<1,1> y(work3_nb, k+1, 1); contract_tr<_N>(1.0, S.slice<0,2>(), x, y, work4_nb); y.conj(); SuperMatrix<3,1> z(work2_3nb, k+1, 1); contract_tr<_N>(sbar, R, y, z, work4_nb); y.conj(); T.append_column<2>(z); T.add_lastcolumn<2>(v, cbar); T.append_row<2,2>(k, cbar); R.append_column<0>(v); R.append_row<2,0>(k,1.0); y.scale(cbar); S.append_column<2>(y); S.append_row<0,2>(k, -sbar); } if (len > 1) { complex* dnow = D0+k*ld+k+1; complex ctau; complex alpha2 = dnow[0]; dnow[0] = 1.0; zlarfg_(len, alpha2, dnow+1, 1, ctau); if (k == 0) { W.write_lastcolumn<1>(dnow, len); const complex zz = -ctau*zdotc_(len, W.block(0,0), 1, dnow, 1); T.data<0,1>(0,0) = zz*T.data<0,0>(0,0) -ctau*T.data<0,2>(0,0); T.data<2,1>(0,0) = -ctau*T.data<2,2>(0,0); T.data<1,1>(0,0) = -ctau; S.data<0,1>(0,0) = -ctau*S.data<0,2>(0,0); zgemv_("N", n-1, n-1, -ctau, D0+ld+1, ld, dnow, 1, 0.0, YD.block(0,1), 1); zgemv_("N", n-1, n-1, -ctau, D1+ld+1, ld, dnow, 1, 0.0, YE.block(0,1), 1); YD.add_lastcolumn<1>(YD.slice<0>(), zz); YE.add_lastcolumn<1>(YE.slice<0>(), zz); YD.add_lastcolumn<1>(YD.slice<2>(), -ctau); YE.add_lastcolumn<1>(YE.slice<2>(), -ctau); ZD.add_lastcolumn<1>(ZD.slice<2>(), -ctau); ZE.add_lastcolumn<1>(ZE.slice<2>(), -ctau); } else { R.append_row<1>(); SuperMatrix<3,1> x(work2_3nb, k+1, 1, k+1, 1); x.nptr(1) = k; SuperMatrix<1,1> v(work1_3n, n-k-1, 1, n-k-1, 1); v.write_lastcolumn<0>(dnow, len); SuperMatrix<2,1> x2 = x.trunc<2>(); contract<_C>(-ctau, W.shift(k), v, x2); x.data<2,0>(k,0) = -ctau; SuperMatrix<3,1> v2(work1_3n, k+1, 1); contract_tr<_N>(1.0, T, x, v2, work4_nb); T.append_column<1>(v2); T.append_row<1,1>(k, -ctau); SuperMatrix<1,1> v3(work3_nb, k+1, 1); contract_tr<_N>(1.0, S, x, v3, work4_nb); S.append_column<1>(v3); W.append_column<1>(dnow, len, k); x.data<2,0>(0,0) = -ctau; x.nptr(2) = 1; SuperMatrix<1,1> yx(work1_3n, n-1, 1); contract<_N>(1.0, YD, x, yx); YD.append_column<1>(yx); zgemv_("N", n-1, len, -ctau, D0+(k+1)*ld+1, ld, dnow, 1, 1.0, YD.ptr<0,1>(0,k), 1); yx.reset(); contract<_N>(1.0, YE, x, yx); YE.append_column<1>(yx); zgemv_("N", n-1, len, -ctau, D1+(k+1)*ld+1, ld, dnow, 1, 1.0, YE.ptr<0,1>(0,k), 1); yx.reset(); contract<_N>(1.0, ZD, x, yx); ZD.append_column<1>(yx); yx.reset(); contract<_N>(1.0, ZE, x, yx); ZE.append_column<1>(yx); } dnow[0] = alpha2; } } // finally update const int nrem = n-nb; if (nrem > 0) { // first update D and E. // Y^D + Z^E zaxpy_((n-1)*(nb*2+1), 1.0, ZE.block(0,0), 1, YD.block(0,0), 1); zaxpy_((n-1)*(nb*2+1), -1.0, ZD.block(0,0), 1, YE.block(0,0), 1); // Multiplied by W^+ zgemm3m_("N", "C", n-1, nrem, nb*2, 1.0, YD.block(0,0), n-1, W.block(0,0)+nb-1, n-1, 1.0, D0+nb*ld+1, ld); zgemm3m_("N", "C", n-1, nrem, nb*2, 1.0, YE.block(0,0), n-1, W.block(0,0)+nb-1, n-1, 1.0, D1+nb*ld+1, ld); assert(YD.nptr(0) == n-1 && YD.mptr(2) == 1); zaxpy_(n-1, 1.0, YD.block(0,2), 1, D0+nb*ld+1, 1); zaxpy_(n-1, 1.0, YE.block(0,2), 1, D1+nb*ld+1, 1); // now I can destroy Y and Z. complex* const ptr = YD.block(0,0); // D^+W SuperMatrix<1,3> DW(ptr, nrem, nb, nrem, nb, /*init*/false); // 3 used zgemm3m_("C", "N", nrem, nb*2, n-1, 1.0, D0+nb*ld+1, ld, W.block(0,0), n-1, 0.0, DW.block(0,0), nrem); transpose_conj(nb, nrem, D0+nb*ld+1, ld, DW.block(0,2), nrem); // E^TW SuperMatrix<1,3> EW(ptr+nrem*nb*3, nrem, nb, nrem, nb, /*init*/false); // 6 used zgemm3m_("T", "N", nrem, nb*2, n-1, 1.0, D1+nb*ld+1, ld, W.block(0,0), n-1, 0.0, EW.block(0,0), nrem); transpose(nb, nrem, D1+nb*ld+1, ld, EW.block(0,2), nrem); // WT^+ SuperMatrix<1,3> WT(ptr+nrem*nb*6, nrem, nb, nrem, nb, /*init*/true); // 9 used contract<_N, _C>(1.0, W.shift(nb-1), T.slice<0,2>(), WT); for (int i = 0; i != nb; ++i) { WT.data<0,0>(0,i) += conj(T.data<0,2>(i,nb-1)); WT.data<0,1>(0,i) += conj(T.data<1,2>(i,nb-1)); WT.data<0,2>(0,i) += conj(T.data<2,2>(i,nb-1)); } // D <- WT^+W^+D zgemm3m_("N", "C", nrem, nrem, nb*3, 1.0, WT.block(0,0), nrem, DW.block(0,0), nrem, 1.0, D0+nb*ld+nb, ld); // E <- W^*T^T W^TE conj_n(WT.block(0,0), nrem*nb*3); zgemm3m_("N", "T", nrem, nrem, nb*3, 1.0, WT.block(0,0), nrem, EW.block(0,0), nrem, 1.0, D1+nb*ld+nb, ld); // next first form WS^+ SuperMatrix<1,1> WS(ptr+nrem*nb*6, nrem, nb, nrem, nb, /*init*/true); // 7 used contract<_N, _C>(1.0, W.shift(nb-1), S.slice<0,2>(), WS); for (int i = 0; i != nb; ++i) WS.data<0,0>(0,i) += conj(S.data<0,2>(i,nb-1)); // E^T WR SuperMatrix<1,1> EWR(ptr+nrem*nb*7, nrem, nb, nrem, nb, /*init*/true); // 8 used contract<_N, _N>(1.0, EW, R, EWR); // -WS^+ R^T W^T E = -WS^+ (E^T WR)^T zgemm3m_("N", "T", nrem, nrem, nb, -1.0, WS.block(0,0), nrem, EWR.block(0,0), nrem, 1.0, D0+nb*ld+nb, ld); // D^+WR SuperMatrix<1,1> DWR(ptr+nrem*nb*7, nrem, nb, nrem, nb, /*init*/true); // 8 used contract<_N, _N>(1.0, DW, R, DWR); // W^* S^T R^+ W^+D = W^* S^T(D^+ WR)^+ conj_n(WS.block(0,0), nrem*nb); zgemm3m_("N", "C", nrem, nrem, nb, 1.0, WS.block(0,0), nrem, DWR.block(0,0), nrem, 1.0, D1+nb*ld+nb, ld); } if (n != norig) { complex* const ptr = YD.block(0,0); // Q0W SuperMatrix<1,3> Q0W(ptr, norig, nb, norig, nb, /*init*/false); // 3 used zgemm3m_("N", "N", norig, nb*2, n-1, 1.0, Q0+ld, ld, W.block(0,0), n-1, 0.0, Q0W.block(0,0), norig); fill_n(Q0W.block(0,2), norig*nb, 0.0); for (int i = 0; i != nb; ++i) zaxpy_(norig, 1.0, Q0+ld*(i+1), 1, Q0W.block(0,2)+norig*i, 1); // Q1W SuperMatrix<1,3> Q1W(ptr+norig*nb*3, norig, nb, norig, nb, /*init*/false); // 6 used zgemm3m_("N", "N", norig, nb*2, n-1, 1.0, Q1+ld, ld, W.block(0,0), n-1, 0.0, Q1W.block(0,0), norig); fill_n(Q1W.block(0,2), norig*nb, 0.0); for (int i = 0; i != nb; ++i) zaxpy_(norig, 1.0, Q1+ld*(i+1), 1, Q1W.block(0,2)+norig*i, 1); // WT^+ SuperMatrix<1,3> WT(ptr+norig*nb*6, n-1, nb, n-1, nb, /*init*/true); // 9 used transpose_conj(nb, nb, T.block(0,2), nb, WT.block(0,0), n-1); transpose_conj(nb, nb, T.block(1,2), nb, WT.block(0,1), n-1); transpose_conj(nb, nb, T.block(2,2), nb, WT.block(0,2), n-1); contract<_N, _C>(1.0, W, T.slice<0,2>(), WT); // Q0 <- Q0WTW^+ and Q1 <- Q1WTW^+ zgemm3m_("N", "C", norig, n-1, 3*nb, 1.0, Q0W.block(0,0), norig, WT.block(0,0), n-1, 1.0, Q0+ld, ld); zgemm3m_("N", "C", norig, n-1, 3*nb, 1.0, Q1W.block(0,0), norig, WT.block(0,0), n-1, 1.0, Q1+ld, ld); // next first form WS^+ SuperMatrix<1,1> WS(ptr+norig*nb*6, n-1, nb, n-1, nb, /*init*/true); // 7 used transpose_conj(nb, nb, S.block(0,2), nb, WS.block(0,0), n-1); contract<_N, _C>(1.0, W, S.slice<0,2>(), WS); // R^T W^T Q0^T SuperMatrix<1,1> RWQ0(ptr+norig*nb*6+(n-1)*nb, nb, norig, nb, norig, /*init*/true); // 8 used contract<_T, _T>(1.0, R, Q0W, RWQ0); // Q1 <- Q0^* W^* R^* SW^+ zgemm3m_("C", "C", norig, n-1, nb, -1.0, RWQ0.block(0,0), nb, WS.block(0,0), n-1, 1.0, Q1+ld, ld); // R^T W^T Q1^T SuperMatrix<1,1> RWQ1(ptr+norig*nb*6+(n-1)*nb, nb, norig, nb, norig, /*init*/true); // 8 used contract<_T, _T>(1.0, R, Q1W, RWQ1); // Q0 <- Q1^* W^* R^* SW^+ zgemm3m_("C", "C", norig, n-1, nb, 1.0, RWQ1.block(0,0), nb, WS.block(0,0), n-1, 1.0, Q0+ld, ld); } else { // in the first run this can be simplified, because Q0 = unit, Q1 = 0 on input. assert(abs(zdotc_(n*n, Q0, 1, Q0, 1)-static_cast(n)) < 1.0e-10 && abs(zdotc_(n*n, Q1, 1, Q1, 1)) < 1.0e-10); complex* const ptr = YD.block(0,0); SuperMatrix<1,3> WT(ptr, n-1, nb, n-1, nb, /*init*/true); transpose_conj(nb, nb, T.block(0,2), nb, WT.block(0,0), n-1); transpose_conj(nb, nb, T.block(1,2), nb, WT.block(0,1), n-1); transpose_conj(nb, nb, T.block(2,2), nb, WT.block(0,2), n-1); contract<_N, _C>(1.0, W, T.slice<0,2>(), WT); transpose_conj(n-1, nb, WT.block(0,2), n-1, Q0+ld+1, ld); for (int i = 0; i != nb; ++i) Q0[(i+1)*ld+i+1] += 1.0; zgemm3m_("N", "C", n-1, n-1, 2*nb, 1.0, W.block(0,0), n-1, WT.block(0,0), n-1, 1.0, Q0+ld+1, ld); SuperMatrix<1,1> WS(ptr, n-1, nb, n-1, nb, /*init*/true); transpose_conj(nb, nb, S.block(0,2), nb, WS.block(0,0), n-1); contract<_N, _C>(1.0, W, S.slice<0,2>(), WS); SuperMatrix<1,1> RW(ptr+(n-1)*nb, nb, n-1, nb, n-1, /*init*/true); transpose(nb, nb, R.block(2,0), nb, RW.block(0,0), nb); contract<_T, _T>(1.0, R.trunc<2>(), W, RW); zgemm3m_("C", "C", n-1, n-1, nb, -1.0, RW.block(0,0), nb, WS.block(0,0), n-1, 1.0, Q1+ld+1, ld); } } } }