get_les() [10/12]

template<typename T >

void cntr::get_les	(	const int	i,
		const int	j,
		cdmatrix &	G_les,
		herm_matrix_timestep_view< T > &	G,
		herm_matrix_timestep_view< T > &	Gcc
	)

Returns the lesser component of a general contour function at given times.

Purpose

Returns the lesser component \( G^<(t_i,t_j) \) at given times \( t_i\) and \( t_j\). For \( i > j\) the hermitian conjugate \(G^\ddagger\) is used.

Parameters

i	[int] Index of time \( t_i\) .
j	[int] Index of time \( t_j\) .
G_les	[cdmatrix] The lesser component (returned to an eigen3 matrix).
G	[herm_matrix_timestep_view] Contour function G
Gcc	[herm_matrix_timestep_view] Hermitian conjugate \(G^\ddagger\) of \(G\).

Definition at line 199 of file cntr_getset_herm_matrix_timestep_view_inc.hpp.

                                      {
    assert(i <= G.tstp() && j <= G.tstp());
    assert(i == G.tstp() || j == G.tstp());
    assert(i <= Gcc.tstp() && j <= Gcc.tstp());
    assert(i == Gcc.tstp() || j == Gcc.tstp());
    assert(G.tstp() == Gcc.tstp());
    assert(G.ntau() == Gcc.ntau());
    assert(G.size1() == Gcc.size1());
    assert(G.size2() == Gcc.size2());
    assert(G.sig() == Gcc.sig());
    std::complex<T> *les;
    int size1=G.size1(), size2=G.size2();

    if (G.tstp() == j){
        les = G.lesptr(i);
        map_ptr2matrix(size1, size2, les, G_les);
    } else if (G.tstp() == i) {
        les = Gcc.lesptr(j);
        map_ptr2matrix(size1, size2, les, G_les);
        G_les.adjointInPlace();
        G_les = -G_les;
    }
}