convolution_timestep() [3/4]

template<typename T >

void cntr::convolution_timestep	(	int	n,
		herm_matrix< T > &	C,
		herm_matrix< T > &	A,
		herm_matrix< T > &	Acc,
		function< T > &	ft,
		herm_matrix< T > &	B,
		herm_matrix< T > &	Bcc,
		T	beta,
		T	h,
		int	SolveOrder
	)

Returns convolution of two 'herm_matrix' objects and a contour function at a given time step

Purpose

Computes contour convolution \(C=A*FxB \) of the 'herm_matrix' object 'A' and 'B' and a time-dependent contour function \(F(t)\) at a given time step 't=nh'. If 'n=-1', one performs Matsubara convolution with a function \(F(-1)\). Works for a scalar and square matrices.

Parameters

n	[int] number of the time step ('t=nh')
C	[herm_matrix] Matrix to which the result of the convolution on Matsubara axis is given
A	[herm_matrix] contour Green's function
Acc	[herm_matrix] complex conjugate to A
ft	[function] contour function F(t).
B	[herm_matrix] contour Green's function
Bcc	[herm_matrix] complex conjugate to B
beta	inversed temperature
h	time interval
SolveOrder	[int] integrator order

Definition at line 2968 of file cntr_convolution_impl.hpp.

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

                                                       {
    int size1 = C.size1(), ntau = C.ntau(), n1 = (n < SolveOrder ? SolveOrder : n);
    assert(ft.size1() == size1 && ft.nt() >= -1);
    if (n == -1) {
        convolution_matsubara(C, A, ft.ptr(-1), B, integration::I<T>(SolveOrder), beta);
        return;
    }
    assert(n >= 0);
    assert(A.size1() == size1);
    assert(Acc.size1() == size1);
    assert(B.size1() == size1);
    assert(Bcc.size1() == size1);
    assert(A.ntau() == ntau);
    assert(Acc.ntau() == ntau);
    assert(B.ntau() == ntau);
    assert(Bcc.ntau() == ntau);
    assert(A.nt() >= n1);
    assert(Acc.nt() >= n1);
    assert(B.nt() >= n1);
    assert(Bcc.nt() >= n1);
    assert(ft.nt() >= n1);
    assert(C.nt() >= n);
    if (size1 == 1) {
        convolution_timestep_ret<T, herm_matrix<T>, 1>(n, C, A, Acc, ft.ptr(0), B, Bcc, integration::I<T>(SolveOrder),
                                                       h);
        convolution_timestep_tv<T, herm_matrix<T>, 1>(n, C, A, Acc, ft.ptr(-1), ft.ptr(0), B,
                                                      Bcc, integration::I<T>(SolveOrder), beta, h);
        convolution_timestep_les<T, herm_matrix<T>, 1>(n, C, A, Acc, ft.ptr(-1), ft.ptr(0),
                                                       B, Bcc, integration::I<T>(SolveOrder), beta, h);
    } else {
        convolution_timestep_ret<T, herm_matrix<T>, LARGESIZE>(n, C, A, Acc, ft.ptr(0), B,
                                                               Bcc, integration::I<T>(SolveOrder), h);
        convolution_timestep_tv<T, herm_matrix<T>, LARGESIZE>(n, C, A, Acc, ft.ptr(-1),
                                                              ft.ptr(0), B, Bcc, integration::I<T>(SolveOrder), beta, h);
        convolution_timestep_les<T, herm_matrix<T>, LARGESIZE>(
            n, C, A, Acc, ft.ptr(-1), ft.ptr(0), B, Bcc, integration::I<T>(SolveOrder), beta, h);
    }
}

Here is the call graph for this function: