right_multiply_hermconj()

template<typename T >

void cntr::herm_matrix_timestep< T >::right_multiply_hermconj	(	int	tstp,
		function< T > &	ft,
		T	weight = 1.0
	)

Right-multiplies the herm_matrix_timestep with the hermitian conjugate of a contour function.

Purpose

Performs the operation \(C(t,t^\prime) \rightarrow w C(t,t^\prime)F^\ddagger(t^\prime)\), where \(C(t,t^\prime)\) is the herm_matrix_timestep, \(F(t)\) is a contour function and \(w\) is a real weight. The operation is performed at given time step tstp.

Parameters

tstp	The time step at which \(F^\ddagger(t)\) and \(C(t,t^\prime)\) are multiplied. Dummy argument in release mode.
ft	The contour function.
weight	The weight as above.

Definition at line 1828 of file cntr_herm_matrix_timestep_impl.hpp.

References cntr::function< T >::nt(), cntr::function< T >::ptr(), and cntr::function< T >::size1().

                                                       {
    assert(tstp == tstp_);
    int m;
    cplx *xtemp, *ftemp, *x0, *f0, *fcc;
    xtemp = new cplx[element_size_];
    fcc = new cplx[element_size_];
    assert(ft.size1() == size1_ && "ft.size1() == size1_");
    assert(ft.nt() >= tstp && "ft.nt() >= tstp");
    assert(tstp >= -1&& "ft.nt() >= tstp");
    f0 = ft.ptr(-1);
    element_conj<T, LARGESIZE>(size1_, fcc, f0);
    if (tstp == -1) {
        x0 = data_;
        for (m = 0; m <= ntau_; m++) {
            element_mult<T, LARGESIZE>(size1_, xtemp, x0 + m * element_size_,
                                       fcc);
            element_smul<T, LARGESIZE>(size1_, xtemp, weight);
            element_set<T, LARGESIZE>(size1_, x0 + m * element_size_, xtemp);
        }
    } else {
        x0 = data_;
        for (m = 0; m <= tstp; m++) {
            element_conj<T, LARGESIZE>(size1_, fcc, ft.ptr(m));
            element_mult<T, LARGESIZE>(size1_, xtemp, x0 + m * element_size_,
                                       fcc);
            element_smul<T, LARGESIZE>(size1_, xtemp, weight);
            element_set<T, LARGESIZE>(size1_, x0 + m * element_size_, xtemp);
        }
        x0 = data_ + (tstp_ + 1) * element_size_;
        element_conj<T, LARGESIZE>(size1_, fcc, f0);
        for (m = 0; m <= ntau_; m++) {
            element_mult<T, LARGESIZE>(size1_, xtemp, x0 + m * element_size_,
                                       fcc);
            element_smul<T, LARGESIZE>(size1_, xtemp, weight);
            element_set<T, LARGESIZE>(size1_, x0 + m * element_size_, xtemp);
        }
        ftemp = ft.ptr(tstp);
        element_conj<T, LARGESIZE>(size1_, fcc, ftemp);
        x0 = data_ + (tstp_ + 1 + ntau_ + 1) * element_size_;
        for (m = 0; m <= tstp; m++) {
            element_mult<T, LARGESIZE>(size1_, xtemp, x0 + m * element_size_,
                                       fcc);
            element_smul<T, LARGESIZE>(size1_, xtemp, weight);
            element_set<T, LARGESIZE>(size1_, x0 + m * element_size_, xtemp);
        }
    }
    delete[] fcc;
    delete[] xtemp;
}

Here is the call graph for this function: