exponential.F90

Go to the documentation of this file.

!! Copyright (C) 2002-2006 M. Marques, A. Castro, A. Rubio, G. Bertsch
!! Copyright (C) 2019 M. Oliveira
!!
!! This program is free software; you can redistribute it and/or modify
!! it under the terms of the GNU General Public License as published by
!! the Free Software Foundation; either version 2, or (at your option)
!! any later version.
!!
!! This program is distributed in the hope that it will be useful,
!! but WITHOUT ANY WARRANTY; without even the implied warranty of
!! MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
!! GNU General Public License for more details.
!!
!! You should have received a copy of the GNU General Public License
!! along with this program; if not, write to the Free Software
!! Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
!! 02110-1301, USA.
!!
 
#include "global.h"
 
module exponential_oct_m
  use accel_oct_m
  use batch_oct_m
  use batch_ops_oct_m
  use blas_oct_m
  use chebyshev_coefficients_oct_m
  use debug_oct_m
  use global_oct_m
  use grid_oct_m
  use hamiltonian_abst_oct_m
  use hamiltonian_elec_oct_m
  use hamiltonian_elec_base_oct_m
  use, intrinsic :: iso_fortran_env
  use lalg_adv_oct_m
  use lalg_basic_oct_m
  use loct_math_oct_m
  use math_oct_m
  use mesh_oct_m
  use mesh_function_oct_m
  use mesh_batch_oct_m
  use messages_oct_m
  use namespace_oct_m
  use parser_oct_m
  use profiling_oct_m
  use states_elec_oct_m
  use states_elec_calc_oct_m
  use types_oct_m
  use wfs_elec_oct_m
  use xc_oct_m
 
  implicit none
 
  private
  public ::                            &
    exponential_t,                     &
    exponential_init,                  &
    exponential_copy,                  &
    exponential_apply_all,             &
    exponential_lanczos_function_batch,&
    operator_t,                        &
    hamiltonian_operator_t,            &
    sinvh_operator_t
 
  integer, public, parameter ::  &
    EXP_LANCZOS            = 2,  &
    exp_taylor             = 3,  &
    exp_chebyshev          = 4
 
  type exponential_t
    private
    integer, public :: exp_method
    real(real64)    :: lanczos_tol
    real(real64)    :: chebyshev_tol
    integer, public :: exp_order
    integer         :: arnoldi_gs
    logical, public :: full_batch = .false. 
  contains
    procedure :: apply_batch => exponential_apply_batch
    procedure :: apply_single => exponential_apply_single
    procedure :: apply_phi_batch => exponential_apply_phi_batch
  end type exponential_t
 
  
  type, abstract :: operator_t
    type(namespace_t), pointer :: namespace
    class(mesh_t), pointer :: mesh
  contains
    procedure(operator_apply), deferred :: apply
    procedure :: is_hermitian => operator_is_hermitian
  end type operator_t
 
  abstract interface
    subroutine operator_apply(this, psib, hpsib)
      import operator_t
      import batch_t
      class(operator_t), intent(in) :: this
      class(batch_t), intent(inout) :: psib
      class(batch_t), intent(inout) :: hpsib
    end subroutine operator_apply
  end interface
 
  
  type, extends(operator_t) :: hamiltonian_operator_t
    class(hamiltonian_abst_t), pointer :: hm
  contains
    procedure :: apply => hamiltonian_operator_apply
    procedure :: init  => hamiltonian_operator_init
    procedure :: is_hermitian => hamiltonian_operator_is_hermitian
  end type hamiltonian_operator_t
 
  interface hamiltonian_operator_t
    procedure hamiltonian_operator_constructor
  end interface hamiltonian_operator_t
 
  type, extends(operator_t) :: sinvh_operator_t
    class(hamiltonian_abst_t), pointer :: hm
  contains
    procedure :: apply => sinvh_operator_apply
    procedure :: init  => sinvh_operator_init
    procedure :: is_hermitian => sinvh_operator_is_hermitian
  end type sinvh_operator_t
 
  interface sinvh_operator_t
    procedure SinvH_operator_constructor
  end interface sinvh_operator_t
 
contains
 
  ! ---------------------------------------------------------
  subroutine exponential_init(te, namespace, full_batch)
    type(exponential_t), intent(out) :: te
    type(namespace_t),   intent(in)  :: namespace
    logical, optional,   intent(in)  :: full_batch
 
    push_sub(exponential_init)
 
    !%Variable TDExponentialMethod
    !%Type integer
    !%Default taylor
    !%Section Time-Dependent::Propagation
    !%Description
    !% Method used to numerically calculate the exponential of the Hamiltonian,
    !% a core part of the full algorithm used to approximate the evolution
    !% operator, specified through the variable <tt>TDPropagator</tt>.
    !% In the case of using the Magnus method, described below, the action of the exponential
    !% of the Magnus operator is also calculated through the algorithm specified
    !% by this variable.
    !%Option lanczos 2
    !% Allows for larger time-steps.
    !% However, the larger the time-step, the longer the computational time per time-step.
    !% In certain cases, if the time-step is too large, the code will emit a warning
    !% whenever it considers that the evolution may not be properly proceeding --
    !% the Lanczos process did not converge. The method consists in a Krylov
    !% subspace approximation of the action of the exponential
    !% (see M. Hochbruck and C. Lubich, <i>SIAM J. Numer. Anal.</i> <b>34</b>, 1911 (1997) for details).
    !% The performance of the method is controlled by the tolerance (controlled by <tt>TDLanczosTol</tt>).
    !% The smaller the tolerance, the more precisely the exponential
    !% is calculated, but also the larger the dimension of the Arnoldi
    !% subspace. If the maximum dimension (currently 200) is not enough to meet the criterion,
    !% the above-mentioned warning is emitted.
    !% Be aware that the larger the required dimension of the Krylov subspace, the larger
    !% the memory required for this method. So if you run out of memory, try to reduce
    !% the time step.
    !%Option taylor 3
    !% This method amounts to a straightforward application of the definition of
    !% the exponential of an operator, in terms of its Taylor expansion.
    !%
    !% <math>\exp_{\rm STD} (-i\delta t H) = \sum_{i=0}^{k} {(-i\delta t)^i\over{i!}} H^i.</math>
    !%
    !% The order <i>k</i> is determined by variable <tt>TDExpOrder</tt>.
    !% Some numerical considerations from <a href=http://www.phys.washington.edu/~bertsch/num3.ps>
    !% Jeff Giansiracusa and George F. Bertsch</a>
    !% suggest the 4th order as especially suitable and stable.
    !%Option chebyshev 4
    !% In principle, the Chebyshev expansion
    !% of the exponential represents it more accurately than the canonical or standard expansion.
    !% <tt>TDChebyshevTol</tt> determines the tolerance to which the expansion is computed.
    !%
    !% There exists a closed analytic form for the coefficients of the exponential in terms
    !% of Chebyshev polynomials:
    !%
    !% <math>\exp_{\rm CHEB} \left( -i\delta t H \right) = \sum_{k=0}^{\infty} (2-\delta_{k0})(-i)^{k}J_k(\delta t) T_k(H),</math>
    !%
    !% where <math>J_k</math> are the Bessel functions of the first kind, and H has to be previously
    !% scaled to <math>[-1,1]</math>.
    !% See H. Tal-Ezer and R. Kosloff, <i>J. Chem. Phys.</i> <b>81</b>,
    !% 3967 (1984); R. Kosloff, <i>Annu. Rev. Phys. Chem.</i> <b>45</b>, 145 (1994);
    !% C. W. Clenshaw, <i>MTAC</i> <b>9</b>, 118 (1955).
    !%End
    call parse_variable(namespace, 'TDExponentialMethod', exp_taylor, te%exp_method)
 
    select case (te%exp_method)
    case (exp_taylor)
    case (exp_chebyshev)
      !%Variable TDChebyshevTol
      !%Type float
      !%Default 1e-10
      !%Section Time-Dependent::Propagation
      !%Description
      !% An internal tolerance variable for the Chebyshev method. The smaller, the more
      !% precisely the exponential is calculated and the more iterations are needed, i.e.,
      !% it becomes more expensive. The expansion is terminated once the error estimate
      !% is below this tolerance.
      !%End
      call parse_variable(namespace, 'TDChebyshevTol', 1e-10_real64, te%chebyshev_tol)
      if (te%chebyshev_tol <= m_zero) call messages_input_error(namespace, 'TDChebyshevTol')
    case (exp_lanczos)
      !%Variable TDLanczosTol
      !%Type float
      !%Default 1e-6
      !%Section Time-Dependent::Propagation
      !%Description
      !% An internal tolerance variable for the Lanczos method. The smaller, the more
      !% precisely the exponential is calculated, and also the bigger the dimension
      !% of the Krylov subspace needed to perform the algorithm. One should carefully
      !% make sure that this value is not too big, or else the evolution will be
      !% wrong.
      !%End
      call parse_variable(namespace, 'TDLanczosTol', 1e-6_real64, te%lanczos_tol)
      if (te%lanczos_tol <= m_zero) call messages_input_error(namespace, 'TDLanczosTol')
 
    case default
      call messages_input_error(namespace, 'TDExponentialMethod')
    end select
    call messages_print_var_option('TDExponentialMethod', te%exp_method, namespace=namespace)
 
    if (te%exp_method == exp_taylor) then
      !%Variable TDExpOrder
      !%Type integer
      !%Default 4
      !%Section Time-Dependent::Propagation
      !%Description
      !% For <tt>TDExponentialMethod</tt> = <tt>taylor</tt>,
      !% the order to which the exponential is expanded.
      !%End
      call parse_variable(namespace, 'TDExpOrder', default__tdexporder, te%exp_order)
      if (te%exp_order < 2) call messages_input_error(namespace, 'TDExpOrder')
    else
      if (parse_is_defined(namespace, 'TDExpOrder')) then
        message(1) = "TDExpOrder is only relevant for TDExponentialMethod = taylor"
        call messages_fatal(1, namespace=namespace)
      end if
    end if
 
    te%arnoldi_gs = option__arnoldiorthogonalization__cgs
    if (te%exp_method == exp_lanczos) then
      !%Variable ArnoldiOrthogonalization
      !%Type integer
      !%Section Time-Dependent::Propagation
      !%Description
      !% The orthogonalization method used for the Arnoldi procedure.
      !% Only for TDExponentialMethod = lanczos.
      !%Option cgs 3
      !% Classical Gram-Schmidt (CGS) orthogonalization.
      !% The algorithm is defined in Giraud et al., Computers and Mathematics with Applications 50, 1069 (2005).
      !%Option drcgs 5
      !% Classical Gram-Schmidt orthogonalization with double-step reorthogonalization.
      !% The algorithm is taken from Giraud et al., Computers and Mathematics with Applications 50, 1069 (2005).
      !% According to this reference, this is much more precise than CGS or MGS algorithms.
      !%End
      call parse_variable(namespace, 'ArnoldiOrthogonalization', option__arnoldiorthogonalization__cgs, &
        te%arnoldi_gs)
    end if
 
    ! do lanczos expansion for full batch?
    te%full_batch = optional_default(full_batch, te%full_batch)
 
    pop_sub(exponential_init)
  end subroutine exponential_init
 
  ! ---------------------------------------------------------
  subroutine exponential_copy(teo, tei)
    type(exponential_t), intent(inout) :: teo
    type(exponential_t), intent(in)    :: tei
 
    push_sub(exponential_copy)
 
    teo%exp_method  = tei%exp_method
    teo%lanczos_tol = tei%lanczos_tol
    teo%exp_order   = tei%exp_order
    teo%arnoldi_gs  = tei%arnoldi_gs
 
    pop_sub(exponential_copy)
  end subroutine exponential_copy
 
  ! ---------------------------------------------------------
  subroutine exponential_apply_single(te, namespace, mesh, hm, zpsi, ist, ik, deltat, imag_time)
    class(exponential_t),        intent(inout) :: te
    type(namespace_t),           intent(in)    :: namespace
    class(mesh_t),               intent(in)    :: mesh
    type(hamiltonian_elec_t),    intent(inout) :: hm
    integer,                     intent(in)    :: ist
    integer,                     intent(in)    :: ik
    complex(real64), contiguous, intent(inout) :: zpsi(:, :)
    real(real64),                intent(in)    :: deltat
    logical, optional,           intent(in)    :: imag_time
 
    type(wfs_elec_t) :: psib, inh_psib
    complex(real64), allocatable :: zpsi_inh(:, :)
 
    push_sub(exponential_apply_single)
 
    !We apply the phase only to np points, and the phase for the np+1 to np_part points
    !will be treated as a phase correction in the Hamiltonian
    if (hm%phase%is_allocated()) then
      call hm%phase%apply_to_single(zpsi, mesh%np, hm%d%dim, ik, .false.)
    end if
 
    call wfs_elec_init(psib, hm%d%dim, ist, ist, zpsi, ik)
 
    if (hamiltonian_elec_inh_term(hm)) then
      safe_allocate(zpsi_inh(1:mesh%np_part, 1:hm%d%dim))
      call states_elec_get_state(hm%inh_st, mesh, ist, ik, zpsi_inh(:, :))
      call wfs_elec_init(inh_psib, hm%d%dim, ist, ist, zpsi_inh, ik)
      call te%apply_batch(namespace, mesh, hm, psib, deltat, &
        imag_time=imag_time, inh_psib=inh_psib)
      call inh_psib%end()
      safe_deallocate_a(zpsi_inh)
    else
      call te%apply_batch(namespace, mesh, hm, psib, deltat, &
        imag_time=imag_time)
    end if
 
    call psib%end()
 
    if (hm%phase%is_allocated()) then
      call hm%phase%apply_to_single(zpsi, mesh%np, hm%d%dim, ik, .true.)
    end if
 
    pop_sub(exponential_apply_single)
  end subroutine exponential_apply_single
 
  ! ---------------------------------------------------------
  ! ---------------------------------------------------------
  subroutine exponential_apply_batch(te, namespace, mesh, hm, psib, deltat, psib2, deltat2, imag_time, inh_psib, op)
    class(exponential_t),                intent(inout) :: te
    type(namespace_t),                   intent(in)    :: namespace
    class(mesh_t),                       intent(in)    :: mesh
    class(hamiltonian_abst_t),           intent(inout) :: hm
    class(batch_t),                      intent(inout) :: psib
    real(real64),                        intent(in)    :: deltat
    class(batch_t),            optional, intent(inout) :: psib2
    real(real64),              optional, intent(in)    :: deltat2
    logical,                   optional, intent(in)    :: imag_time
    class(batch_t),            optional, intent(inout) :: inh_psib
    class(operator_t), target, optional, intent(in)    :: op
 
    complex(real64) :: deltat_, deltat2_
    class(chebyshev_function_t), pointer :: chebyshev_function, chebyshev_function_dt2
    logical :: imag_time_
    class(operator_t), pointer :: op_
 
    push_sub(exponential_apply_batch)
    call profiling_in("EXPONENTIAL_BATCH")
 
    assert(psib%type() == type_cmplx)
 
    assert(present(psib2) .eqv. present(deltat2))
    if (present(inh_psib)) then
      assert(inh_psib%nst == psib%nst)
    end if
 
    if (present(op)) then
      op_ => op
    else
      op_ => hamiltonian_operator_t(namespace, mesh, hm)
    end if
 
    deltat2_ = cmplx(optional_default(deltat2, m_zero), m_zero, real64)
 
    imag_time_ = optional_default(imag_time, .false.)
    if (imag_time_) then
      deltat_ = -m_zi*deltat
      if (present(deltat2)) deltat2_ = m_zi*deltat2
    else
      deltat_ = cmplx(deltat, m_zero, real64)
      if (present(deltat2)) deltat2_ = cmplx(deltat2, m_zero, real64)
    end if
 
    if (.not. op_%is_hermitian() .and. te%exp_method == exp_chebyshev) then
      write(message(1), '(a)') 'The Chebyshev expansion cannot be used for non-Hermitian operators.'
      write(message(2), '(a)') 'Please use the Lanczos exponentiation scheme ("TDExponentialMethod = lanczos")'
      write(message(3), '(a)') 'or the Taylor expansion ("TDExponentialMethod = taylor") method.'
      call messages_fatal(3, namespace=namespace)
    end if
 
    select case (te%exp_method)
    case (exp_taylor)
      ! Note that delttat2_ is only initialized if deltat2 is present.
      if (present(deltat2)) then
        call exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat_, op_, &
          psib2, deltat2_)
      else
        call exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat_, op_)
      end if
      if (present(inh_psib)) then
        if (present(deltat2)) then
          call exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat_, op_, &
            psib2, deltat2_, inh_psib)
        else
          call exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat_, op_, &
            inh_psib=inh_psib)
        end if
      end if
 
    case (exp_lanczos)
      if (present(psib2)) then
        ! psib2 holds a copy of the starting vector; the Krylov basis is built once (driven by
        ! psib) and both exp(-i*deltat*H) and exp(-i*deltat2*H) are reconstructed from it.
        call psib%copy_data_to(mesh%np, psib2)
        call exponential_lanczos_batch(te, namespace, mesh, psib, deltat_, op_, &
          psib2=psib2, deltat2=deltat2_)
        if (present(inh_psib)) then
          call exponential_lanczos_batch(te, namespace, mesh, psib, deltat_, op_, inh_psib, &
            psib2=psib2, deltat2=deltat2_)
        end if
      else
        call exponential_lanczos_batch(te, namespace, mesh, psib, deltat_, op_)
        if (present(inh_psib)) then
          call exponential_lanczos_batch(te, namespace, mesh, psib, deltat_, op_, inh_psib)
        end if
      end if
 
    case (exp_chebyshev)
      if (present(inh_psib)) then
        write(message(1), '(a)') 'Chebyshev exponential ("TDExponentialMethod = chebyshev")'
        write(message(2), '(a)') 'with inhomogeneous term is not implemented'
        call messages_fatal(2, namespace=namespace)
      end if
      ! initialize classes for computing coefficients
      if (imag_time_) then
        chebyshev_function => chebyshev_exp_imagtime_t(hm%spectral_half_span, hm%spectral_middle_point, deltat)
        if (present(psib2)) then
          chebyshev_function_dt2 => chebyshev_exp_imagtime_t(hm%spectral_half_span, hm%spectral_middle_point, deltat2)
        end if
      else
        chebyshev_function => chebyshev_exp_t(hm%spectral_half_span, hm%spectral_middle_point, deltat)
        if (present(psib2)) then
          chebyshev_function_dt2 => chebyshev_exp_t(hm%spectral_half_span, hm%spectral_middle_point, deltat2)
        end if
      end if
      if (present(psib2)) call psib%copy_data_to(mesh%np, psib2)
      call exponential_cheby_batch(te, namespace, mesh, hm, psib, chebyshev_function, op_)
      deallocate(chebyshev_function)
      if (present(psib2)) then
        call exponential_cheby_batch(te, namespace, mesh, hm, psib2, chebyshev_function_dt2, op_)
        deallocate(chebyshev_function_dt2)
      end if
 
    end select
 
    if (.not.present(op)) then
      safe_deallocate_p(op_)
    end if
 
    call profiling_out("EXPONENTIAL_BATCH")
    pop_sub(exponential_apply_batch)
  end subroutine exponential_apply_batch
 
  ! ---------------------------------------------------------
  subroutine exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat, op, psib2, deltat2, inh_psib, phik_shift)
    type(exponential_t),                intent(inout) :: te
    type(namespace_t),                  intent(in)    :: namespace
    class(mesh_t),                      intent(in)    :: mesh
    class(hamiltonian_abst_t),          intent(inout) :: hm
    class(batch_t),                     intent(inout) :: psib
    complex(real64),                    intent(in)    :: deltat
    class(operator_t),                  intent(in)    :: op
    class(batch_t),           optional, intent(inout) :: psib2
    complex(real64),          optional, intent(in)    :: deltat2
    class(batch_t),           optional, intent(inout) :: inh_psib
    integer,                  optional, intent(in)    :: phik_shift
 
    complex(real64) :: zfact, zfact2
    integer :: iter, denom, phik_shift_
    logical :: zfact_is_real
    class(batch_t), allocatable :: psi1b, hpsi1b
 
    push_sub(exponential_taylor_series_batch)
    call profiling_in("EXP_TAYLOR_BATCH")
 
    call psib%clone_to(psi1b)
    call psib%clone_to(hpsi1b)
 
    zfact = m_z1
    zfact2 = m_z1
    zfact_is_real = abs(deltat-real(deltat, real64)) < m_epsilon
 
    if (present(psib2)) call psib%copy_data_to(mesh%np, psib2)
 
    if (present(inh_psib)) then
      zfact = zfact*deltat
      call batch_axpy(mesh%np, real(zfact, real64), inh_psib, psib)
 
      if (present(psib2)) then
        zfact2 = zfact2*deltat2
        call batch_axpy(mesh%np, real(zfact2, real64), inh_psib, psib2)
      end if
    end if
 
    ! shift the denominator by this shift for the phi_k functions
    phik_shift_ = optional_default(phik_shift, 0)
 
    do iter = 1, te%exp_order
      denom = iter+phik_shift_
      if (present(inh_psib)) denom = denom + 1
      zfact = zfact*(-m_zi*deltat)/denom
      if (present(deltat2)) zfact2 = zfact2*(-m_zi*deltat2)/denom
      zfact_is_real = .not. zfact_is_real
      ! FIXME: need a test here for runaway exponential, e.g. for too large dt.
      !  in runaway case the problem is really hard to trace back: the positions
      !  go haywire on the first step of dynamics (often NaN) and with debugging options
      !  the code stops in ZAXPY below without saying why.
 
      if (iter /= 1) then
        call op%apply(psi1b, hpsi1b)
      else
        if (present(inh_psib)) then
          call op%apply(inh_psib, hpsi1b)
        else
          call op%apply(psib, hpsi1b)
        end if
      end if
 
      if (zfact_is_real) then
        call batch_axpy(mesh%np, real(zfact, real64), hpsi1b, psib)
        if (present(psib2)) call batch_axpy(mesh%np, real(zfact2, real64), hpsi1b, psib2)
      else
        call batch_axpy(mesh%np, zfact, hpsi1b, psib)
        if (present(psib2)) call batch_axpy(mesh%np, zfact2, hpsi1b, psib2)
      end if
 
      if (iter /= te%exp_order) call hpsi1b%copy_data_to(mesh%np, psi1b)
 
    end do
 
    call psi1b%end()
    call hpsi1b%end()
    safe_deallocate_a(psi1b)
    safe_deallocate_a(hpsi1b)
 
    call profiling_out("EXP_TAYLOR_BATCH")
    pop_sub(exponential_taylor_series_batch)
  end subroutine exponential_taylor_series_batch
 
  subroutine exponential_lanczos_batch(te, namespace, mesh, psib, deltat, op, inh_psib, psib2, deltat2)
    type(exponential_t),                intent(inout) :: te
    type(namespace_t),                  intent(in)    :: namespace
    class(mesh_t),                      intent(in)    :: mesh
    class(batch_t),                     intent(inout) :: psib
    complex(real64),                    intent(in)    :: deltat
    class(operator_t),                  intent(in)    :: op
    class(batch_t),           optional, intent(in)    :: inh_psib
    class(batch_t),           optional, intent(inout) :: psib2
    complex(real64),          optional, intent(in)    :: deltat2
 
    class(batch_t), allocatable :: tmpb, tmpb2
 
    push_sub(exponential_lanczos_batch)
 
    assert(present(psib2) .eqv. present(deltat2))
 
    if (present(inh_psib)) then
      call inh_psib%clone_to(tmpb, copy_data=.true.)
      if (present(psib2)) then
        ! psib  = psib  + deltat  * phi1(-i*deltat *H) inh_psib
        ! psib2 = psib2 + deltat2 * phi1(-i*deltat2*H) inh_psib   (shared Krylov basis)
        call inh_psib%clone_to(tmpb2, copy_data=.true.)
        call exponential_lanczos_function_batch(te, namespace, mesh, tmpb, deltat, phi1, op, &
          psib2=tmpb2, deltat2=deltat2)
        call batch_axpy(mesh%np, real(deltat, real64), tmpb, psib)
        call batch_axpy(mesh%np, real(deltat2, real64), tmpb2, psib2)
        call tmpb2%end()
        safe_deallocate_a(tmpb2)
      else
        ! psib = psib + deltat * phi1(-i*deltat*H) inh_psib
        call exponential_lanczos_function_batch(te, namespace, mesh, tmpb, deltat, phi1, op)
        call batch_axpy(mesh%np, real(deltat, real64), tmpb, psib)
      end if
      call tmpb%end()
      safe_deallocate_a(tmpb)
    else
      if (present(psib2)) then
        call exponential_lanczos_function_batch(te, namespace, mesh, psib, deltat, exponential, op, &
          psib2=psib2, deltat2=deltat2)
      else
        call exponential_lanczos_function_batch(te, namespace, mesh, psib, deltat, exponential, op)
      end if
    end if
 
    pop_sub(exponential_lanczos_batch)
  end subroutine exponential_lanczos_batch
 
  ! ---------------------------------------------------------
  subroutine exponential_lanczos_function_batch(te, namespace, mesh, psib, deltat, fun, op, psib2, deltat2)
    type(exponential_t),                intent(inout) :: te
    type(namespace_t),                  intent(in)    :: namespace
    class(mesh_t),                      intent(in)    :: mesh
    class(batch_t),                     intent(inout) :: psib
    complex(real64),                    intent(in)    :: deltat
    interface
      complex(real64) function fun(z)
        import real64
        complex(real64), intent(in) :: z
      end
    end interface
    class(operator_t),                  intent(in)    :: op
    class(batch_t),           optional, intent(inout) :: psib2
    complex(real64),          optional, intent(in)    :: deltat2
 
    integer ::  iter, l, ii, ist, max_initialized
    complex(real64), allocatable :: hamilt(:,:,:), expo(:,:,:), expo2(:,:,:)
    complex(real64), allocatable :: hamilt_tmp(:,:,:), coef(:,:), coef2(:,:)
    real(real64), allocatable :: beta(:), res(:), res2(:), norm(:)
    integer, parameter :: max_order = 200
    integer, parameter :: order_initial = 16
    integer :: order_alloc
    type(batch_p_t), allocatable :: vb(:) ! Krylov subspace vectors
    logical :: have_dt2, converged, breakdown
 
    push_sub(exponential_lanczos_function_batch)
    call profiling_in("EXP_LANCZOS_FUN_BATCH")
 
    if (te%exp_method /= exp_lanczos) then
      message(1) = "The exponential method needs to be set to Lanzcos (TDExponentialMethod=lanczos)."
      call messages_fatal(1)
    end if
 
    ! Optionally, a second exponential fun(deltat2*H) psib is computed reusing the same
    ! Krylov basis and projected matrix (they do not depend on deltat), and written to psib2.
    ! psib2 must already hold a copy of the input psib on entry (used as the starting vector
    ! for the reconstruction), which is what the caller provides.
    have_dt2 = present(psib2)
    assert(present(psib2) .eqv. present(deltat2))
    if (have_dt2) then
      assert(psib2%nst == psib%nst)
    end if
 
    safe_allocate(beta(1:psib%nst))
    safe_allocate(res(1:psib%nst))
    safe_allocate(norm(1:psib%nst))
    ! the residual is only computed from iteration 4 on; the non-convergence
    ! message below prints maxval(res), so it must be defined even if the loop
    ! somehow ends earlier
    res = m_huge
    safe_allocate(vb(1:max_order))
    call psib%clone_to(vb(1)%p)
    max_initialized = 1
 
    ! Initialise starting Lanczos vector, v_1, from input wave function
    call psib%copy_data_to(mesh%np, vb(1)%p, async=.true.)
 
    ! Normalise v_1
    ! Note, this is not the Lanczos coefficient
    call mesh_batch_nrm2(mesh, vb(1)%p, beta)
    if (te%full_batch) beta = norm2(beta)
 
    ! If we have a null vector, no need to compute the action of the exponential.
    if (all(abs(beta) <= 1.0e-12_real64)) then
      safe_deallocate_a(beta)
      safe_deallocate_a(res)
      safe_deallocate_a(norm)
      call vb(1)%p%end()
      safe_deallocate_a(vb)
      call profiling_out("EXP_LANCZOS_FUN_BATCH")
      pop_sub(exponential_lanczos_function_batch)
      return
    end if
 
    call batch_scal(mesh%np, m_one/beta, vb(1)%p, a_full = .false.)
 
    order_alloc = order_initial
    safe_allocate(hamilt(1:order_alloc+1, 1:order_alloc+1, 1:psib%nst))
    safe_allocate(  expo(1:order_alloc+1, 1:order_alloc+1, 1:psib%nst))
    if (have_dt2) then
      safe_allocate(expo2(1:order_alloc+1, 1:order_alloc+1, 1:psib%nst))
      safe_allocate(res2(1:psib%nst))
      res2 = m_huge
    end if
 
    ! Lanczos loop
    do iter = 1, max_order-1
      ! Grow the projected matrices if the subspace outgrows them
      if (iter + 1 > order_alloc) then
        safe_allocate(hamilt_tmp(1:2*order_alloc+1, 1:2*order_alloc+1, 1:psib%nst))
        hamilt_tmp = m_z0
        hamilt_tmp(1:order_alloc+1, 1:order_alloc+1, :) = hamilt(:, :, :)
        safe_deallocate_a(hamilt)
        call move_alloc(hamilt_tmp, hamilt)
        ! expo and expo2 are written before they are read, so nothing to keep
        order_alloc = min(2*order_alloc, max_order)
        safe_deallocate_a(expo)
        safe_allocate(expo(1:order_alloc+1, 1:order_alloc+1, 1:psib%nst))
        if (have_dt2) then
          safe_deallocate_a(expo2)
          safe_allocate(expo2(1:order_alloc+1, 1:order_alloc+1, 1:psib%nst))
        end if
      end if
 
      call psib%clone_to(vb(iter + 1)%p)
      max_initialized = iter + 1
 
      ! Apply the operator (default is Hamiltonian), w = H v_j
      call op%apply(vb(iter)%p, vb(iter+1)%p)
 
      ! We use either the Lanczos method (Hermitian case) or the Arnoldi method
      if (op%is_hermitian()) then
        ! The Lanczos projection is tridiagonal: T(i,j) = 0 for i < j-1.
        hamilt(1:max(iter-2, 1), iter, 1:psib%nst) = m_zero
        if (iter > 1) then
          ! T(j-1,j) = beta_j
          hamilt(iter-1, iter, 1:psib%nst) = hamilt(iter, iter-1, 1:psib%nst)
          ! w = H v_j - beta_j v_{j-1}
          call batch_axpy(mesh%np, -hamilt(iter-1, iter, 1:psib%nst), vb(iter-1)%p, vb(iter+1)%p, a_full = .false.)
        end if
        ! Only the projection onto v_j remains for the call below.
        l = iter
      else
        ! Arnoldi projects against every existing basis vector v_1,...,v_j
        l = 1
        if (iter > 2) then
          ! The projected matrix is upper Hessenberg: H(j,1:j-2) = 0
          hamilt(iter, 1:iter-2, 1:psib%nst) = m_zero
        end if
      end if
 
      ! Orthogonalize against previous vectors, where vb(iter+1)%p defines w on entry
      ! For Lanczos, this routine computes 3 things:
      !  (overlap):    alpha_j = <v_j, w> returned to hamilt(j, j, :)
      !  (norm):       beta_{j+1} = ||r_j|| returned to hamilt(j+1, j, :)
      !  (residual):   r_j = w - alpha_j v_j returned in vb(j+1)%p, not normalised
      ! For Arnoldi, this routine computes 3 things:
      !  (overlap):    h_{1:j,j} = <v_{1:j}, w> returned to hamilt(1:j, j, :)
      !  (norm):       h_{j+1,j} = ||r_j|| returned to hamilt(j+1, j, :)
      !  (residual):   r_j = w - sum_{i=1}^j h_{i,j} v_i in vb(j+1)%p, not normalised
      call zmesh_batch_orthogonalization(mesh, iter - l + 1, vb(l:iter), vb(iter+1)%p, &
        normalize = .false., overlap = hamilt(l:iter, iter, 1:psib%nst), norm = hamilt(iter + 1, iter, 1:psib%nst), &
        gs_scheme = te%arnoldi_gs, full_batch = te%full_batch)
 
      ! We now estimate the error we made. This is given by the formula denoted
      ! Er2 in Sec. 5.2.
      breakdown = all(abs(hamilt(iter + 1, iter, :)) < 1.0e4_real64*m_epsilon) ! "Happy breakdown"
 
      ! We now need to compute exp(Hm), where Hm is the projection of the linear transformation
      ! of the Hamiltonian onto the Krylov subspace Km
      ! See Eq. 4
      !
      ! Note that in the Hermitian case, we use the Lanczos algorithm that requires
      ! only a tridiagonal matrix. Else we have an upper Hessenberg matrix.
      !
      ! Compute the exponential only if it is potentially used: for happy breakdown and
      ! for convergence at iteration >= 4. This saves a lot of time especially for small
      ! iteration counts.
      if (iter > 3 .or. breakdown) then
        if (op%is_hermitian()) then
          ! Only the first column of fun(T) is used; one real eigendecomposition serves both time steps
          do ii = 1, psib%nst
            if (have_dt2) then
              call lalg_tridiagonal_function_first_column(iter, hamilt(:,:,ii), fun, -m_zi*deltat, expo(:,1,ii), &
                -m_zi*deltat2, expo2(:,1,ii))
              res2(ii) = abs(hamilt(iter + 1, iter, ii) * abs(expo2(iter, 1, ii)))
            else
              call lalg_tridiagonal_function_first_column(iter, hamilt(:,:,ii), fun, -m_zi*deltat, expo(:,1,ii))
            end if
            res(ii) = abs(hamilt(iter + 1, iter, ii) * abs(expo(iter, 1, ii)))
          end do !ii
        else
          ! Same for the Arnoldi projection, with one complex eigendecomposition and one linear solve
          do ii = 1, psib%nst
            if (have_dt2) then
              call lalg_hessenberg_function_first_column(iter, hamilt(:,:,ii), fun, -m_zi*deltat, expo(:,1,ii), &
                -m_zi*deltat2, expo2(:,1,ii))
              res2(ii) = abs(hamilt(iter + 1, iter, ii) * abs(expo2(iter, 1, ii)))
            else
              call lalg_hessenberg_function_first_column(iter, hamilt(:,:,ii), fun, -m_zi*deltat, expo(:,1,ii))
            end if
            res(ii) = abs(hamilt(iter + 1, iter, ii) * abs(expo(iter, 1, ii)))
          end do !ii
        end if
      end if
 
      if (breakdown) exit
 
      ! Compute 1/beta_{j+1}
      ! We normalize only if the norm is non-zero
      ! see http://www.netlib.org/utk/people/JackDongarra/etemplates/node216.html#alg:arn0
      norm = m_one
      do ist = 1, psib%nst
        if (abs(hamilt(iter + 1, iter, ist)) >= 1.0e4_real64 * m_epsilon) then
          norm(ist) = m_one / abs(hamilt(iter + 1, iter, ist))
        end if
      end do
 
      ! v_{j+1} = r_j / beta_{j+1}
      call batch_scal(mesh%np, norm, vb(iter+1)%p, a_full = .false.)
 
      ! When a second exponential shares this basis, require both to be
      ! converged.
      converged = .false.
      if (iter > 3) then
        converged = all(res < te%lanczos_tol)
        if (converged .and. have_dt2) converged = all(res2 < te%lanczos_tol)
      end if
      if (converged) exit
 
    end do !iter
 
    if (iter == max_order) then ! Here one should consider the possibility of the happy breakdown.
      write(message(1),'(a,i5,a,es9.2)') 'Lanczos exponential expansion did not converge after ', iter, &
        ' iterations. Residual: ', maxval(res)
      call messages_warning(1, namespace=namespace)
      ! expo was last evaluated for the subspace of the final loop iteration
      iter = max_order - 1
    else
      write(message(1),'(a,i5)') 'Debug: Lanczos exponential iterations: ', iter
      call messages_info(1, namespace=namespace, debug_only=.true.)
    end if
 
    ! See Eq. 4 for the expression here
    ! zpsi = nrm * V * expo(1:iter, 1) = nrm * V * expo * V^(T) * zpsi
    ! psib (and, on entry, psib2) still holds the original starting vector = beta * vb(1).
    ! Both exponentials are reconstructed from the same Krylov basis vb.
    safe_allocate(coef(1:iter-1, 1:psib%nst))
    do ii = 1, psib%nst
      coef(1:iter-1, ii) = beta(ii)*expo(2:iter, 1, ii)
    end do
    if (have_dt2) then
      safe_allocate(coef2(1:iter-1, 1:psib%nst))
      do ii = 1, psib%nst
        coef2(1:iter-1, ii) = beta(ii)*expo2(2:iter, 1, ii)
      end do
      call batch_gemv(mesh%np, vb(2:iter), coef, expo(1,1,1:psib%nst), psib, &
        coef2, expo2(1,1,1:psib%nst), psib2)
      safe_deallocate_a(coef2)
    else
      call batch_gemv(mesh%np, vb(2:iter), coef, expo(1,1,1:psib%nst), psib)
    end if
    safe_deallocate_a(coef)
 
    do ii = 1, max_initialized
      call vb(ii)%p%end()
    end do
 
    safe_deallocate_a(vb)
    safe_deallocate_a(hamilt)
    safe_deallocate_a(hamilt_tmp)
    safe_deallocate_a(expo)
    safe_deallocate_a(expo2)
    safe_deallocate_a(beta)
    safe_deallocate_a(res)
    safe_deallocate_a(res2)
    safe_deallocate_a(norm)
 
    call accel_finish()
 
    call profiling_out("EXP_LANCZOS_FUN_BATCH")
 
    pop_sub(exponential_lanczos_function_batch)
  end subroutine exponential_lanczos_function_batch
 
 
  ! ---------------------------------------------------------
  subroutine exponential_cheby_batch(te, namespace, mesh, hm, psib, chebyshev_function, op)
    type(exponential_t),                intent(inout) :: te
    type(namespace_t),                  intent(in)    :: namespace
    class(mesh_t),                      intent(in)    :: mesh
    class(hamiltonian_abst_t),          intent(inout) :: hm
    class(batch_t),                     intent(inout) :: psib
    class(chebyshev_function_t),        intent(in)    :: chebyshev_function
    class(operator_t),                  intent(in)    :: op
 
    integer :: j, order_needed
    complex(real64) :: coefficient
    complex(real64), allocatable :: coefficients(:)
    real(real64) :: error
    class(batch_t), allocatable, target :: psi0, psi1, psi2
    class(batch_t), pointer :: psi_n, psi_n1, psi_n2
    integer, parameter :: max_order = 200
 
    push_sub(exponential_cheby_batch)
    call profiling_in("EXP_CHEBY_BATCH")
 
    call psib%clone_to(psi0)
    call psib%clone_to(psi1)
    call psib%clone_to(psi2)
    call psib%copy_data_to(mesh%np, psi0)
 
    order_needed = max_order
    do j = 1, max_order
      error = chebyshev_function%get_error(j)
      if (error > m_zero .and. error < te%chebyshev_tol) then
        order_needed = j
        exit
      end if
    end do
 
    call chebyshev_function%get_coefficients(j, coefficients)
 
    ! zero-order term
    call batch_scal(mesh%np, coefficients(0), psib)
    ! first-order term
    ! shifted Hamiltonian
    call op%apply(psi0, psi1)
    call batch_axpy(mesh%np, -hm%spectral_middle_point, psi0, psi1)
    call batch_scal(mesh%np, m_one/hm%spectral_half_span, psi1)
    ! accumulate result
    call batch_axpy(mesh%np, coefficients(1), psi1, psib)
 
    ! use pointers to avoid copies
    psi_n => psi2
    psi_n1 => psi1
    psi_n2 => psi0
 
    do j = 2, order_needed
      ! compute shifted Hamiltonian and Chebyshev recurrence formula
      call op%apply(psi_n1, psi_n)
      call batch_axpy(mesh%np, -hm%spectral_middle_point, psi_n1, psi_n)
      call batch_xpay(mesh%np, psi_n2, -m_two/hm%spectral_half_span, psi_n)
      call batch_scal(mesh%np, -m_one, psi_n)
 
      ! accumulate result
      call batch_axpy(mesh%np, coefficients(j), psi_n, psib)
 
      ! shift pointers for the three-term recurrence, this avoids copies
      if (mod(j, 3) == 2) then
        psi_n => psi0
        psi_n1 => psi2
        psi_n2 => psi1
      else if (mod(j, 3) == 1) then
        psi_n => psi2
        psi_n1 => psi1
        psi_n2 => psi0
      else
        psi_n => psi1
        psi_n1 => psi0
        psi_n2 => psi2
      end if
    end do
 
    if (order_needed == max_order) then
      write(message(1),'(a,i5,a,es9.2)') 'Chebyshev exponential expansion did not converge after ', j, &
        ' iterations. Coefficient: ', coefficient
      call messages_warning(1, namespace=namespace)
    else
      write(message(1),'(a,i5)') 'Debug: Chebyshev exponential iterations: ', j
      call messages_info(1, namespace=namespace, debug_only=.true.)
    end if
 
    call psi0%end()
    call psi1%end()
    call psi2%end()
    safe_deallocate_a(psi0)
    safe_deallocate_a(psi1)
    safe_deallocate_a(psi2)
 
    safe_deallocate_a(coefficients)
 
    call profiling_out("EXP_CHEBY_BATCH")
 
    pop_sub(exponential_cheby_batch)
  end subroutine exponential_cheby_batch
 
  ! ---------------------------------------------------------
  subroutine exponential_apply_all(te, namespace, gr, hm, st, deltat, order)
    type(exponential_t),      intent(inout) :: te
    type(namespace_t),        intent(in)    :: namespace
    type(grid_t),             intent(inout) :: gr
    type(hamiltonian_elec_t), intent(inout) :: hm
    type(states_elec_t),      intent(inout) :: st
    real(real64),             intent(in)    :: deltat
    integer, optional,        intent(inout) :: order
 
    integer :: ik, ib, i
    real(real64) :: zfact
 
    type(states_elec_t) :: st1, hst1
 
    push_sub(exponential_apply_all)
 
    assert(te%exp_method == exp_taylor)
 
    call states_elec_copy(st1, st)
    call states_elec_copy(hst1, st)
 
    zfact = m_one
    do i = 1, te%exp_order
      zfact = zfact * deltat / i
 
      if (i == 1) then
        call zhamiltonian_elec_apply_all(hm, namespace, gr, st, hst1)
      else
        call zhamiltonian_elec_apply_all(hm, namespace, gr, st1, hst1)
      end if
 
      do ik = st%d%kpt%start, st%d%kpt%end
        do ib = st%group%block_start, st%group%block_end
          call batch_scal2v(gr%np, -m_zi, hst1%group%psib(ib, ik), st1%group%psib(ib, ik), conjugate_xx = .false.)
          call batch_axpy(gr%np, zfact, st1%group%psib(ib, ik), st%group%psib(ib, ik))
        end do
      end do
 
    end do
    ! End of Taylor expansion loop.
 
    call states_elec_end(st1)
    call states_elec_end(hst1)
 
    ! We now add the inhomogeneous part, if present.
    if (hamiltonian_elec_inh_term(hm)) then
      !write(*, *) 'Now we apply the inhomogeneous term...'
 
      call states_elec_copy(st1, hm%inh_st)
      call states_elec_copy(hst1, hm%inh_st)
 
 
      do ik = st%d%kpt%start, st%d%kpt%end
        do ib = st%group%block_start, st%group%block_end
          call batch_axpy(gr%np, deltat, st1%group%psib(ib, ik), st%group%psib(ib, ik))
        end do
      end do
 
      zfact = m_one
      do i = 1, te%exp_order
        zfact = zfact * deltat / (i+1)
 
        if (i == 1) then
          call zhamiltonian_elec_apply_all(hm, namespace, gr, hm%inh_st, hst1)
        else
          call zhamiltonian_elec_apply_all(hm, namespace, gr, st1, hst1)
        end if
 
        do ik = st%d%kpt%start, st%d%kpt%end
          do ib = st%group%block_start, st%group%block_end
            call batch_scal2v(gr%np, -m_zi, hst1%group%psib(ib, ik), st1%group%psib(ib, ik), conjugate_xx = .false.)
            call batch_axpy(gr%np, deltat * zfact, st1%group%psib(ib, ik), st%group%psib(ib, ik))
          end do
        end do
 
      end do
 
      call states_elec_end(st1)
      call states_elec_end(hst1)
 
    end if
 
    if (present(order)) order = te%exp_order*st%nik*st%nst ! This should be the correct number
 
    pop_sub(exponential_apply_all)
  end subroutine exponential_apply_all
 
  subroutine exponential_apply_phi_batch(te, namespace, mesh, hm, psib, deltat, k, op)
    class(exponential_t),               intent(inout) :: te
    type(namespace_t),                  intent(in)    :: namespace
    class(mesh_t),                      intent(in)    :: mesh
    class(hamiltonian_abst_t),          intent(inout) :: hm
    class(batch_t),                     intent(inout) :: psib
    real(real64),                       intent(in)    :: deltat
    integer,                            intent(in)    :: k
    class(operator_t), target,optional, intent(in)    :: op
 
    class(chebyshev_function_t), pointer :: chebyshev_function
    complex(real64) :: deltat_
    class(operator_t), pointer :: op_
 
    push_sub_with_profile(exponential_apply_phi_batch)
 
    assert(psib%type() == type_cmplx)
 
    if (present(op)) then
      op_ => op
    else
      op_ => hamiltonian_operator_t(namespace, mesh, hm)
    end if
 
    if (.not. op_%is_hermitian() .and. te%exp_method == exp_chebyshev) then
      write(message(1), '(a)') 'The Chebyshev expansion for the exponential will only converge if the imaginary'
      write(message(2), '(a)') 'eigenvalues are small enough compared to the span of the real eigenvalues,'
      write(message(3), '(a)') 'i.e., for ratios smaller than about 1e-3.'
      write(message(4), '(a)') 'The Lanczos method ("TDExponentialMethod = lanczos") is guaranteed to'
      write(message(5), '(a)') 'always converge in this case.'
      call messages_warning(5, namespace=namespace)
    end if
 
    deltat_ = cmplx(deltat, m_zero, real64)
 
    select case (te%exp_method)
    case (exp_taylor)
      call exponential_taylor_series_batch(te, namespace, mesh, hm, psib, deltat_, op_, phik_shift=k)
 
    case (exp_lanczos)
      if (k == 1) then
        call exponential_lanczos_function_batch(te, namespace, mesh, psib, deltat_, phi1, op_)
      else if (k == 2) then
        call exponential_lanczos_function_batch(te, namespace, mesh, psib, deltat_, phi2, op_)
      else
        write(message(1), '(a)') 'Lanczos expansion not implemented for phi_k, k > 2'
        call messages_fatal(1, namespace=namespace)
      end if
 
    case (exp_chebyshev)
      if (k == 1) then
        chebyshev_function => chebyshev_numerical_t(hm%spectral_half_span, hm%spectral_middle_point, deltat, phi1)
      else if (k == 2) then
        chebyshev_function => chebyshev_numerical_t(hm%spectral_half_span, hm%spectral_middle_point, deltat, phi2)
      else
        write(message(1), '(a)') 'Chebyshev expansion not implemented for phi_k, k > 2'
        call messages_fatal(1, namespace=namespace)
      end if
      call exponential_cheby_batch(te, namespace, mesh, hm, psib, chebyshev_function, op_)
      deallocate(chebyshev_function)
    end select
 
    if (.not.present(op)) then
      safe_deallocate_p(op_)
    end if
 
    pop_sub_with_profile(exponential_apply_phi_batch)
  end subroutine exponential_apply_phi_batch
 
  function hamiltonian_operator_constructor(namespace, mesh, hm) result(this)
    type(namespace_t), target,         intent(in) :: namespace
    class(mesh_t), target,             intent(in) :: mesh
    class(hamiltonian_abst_t), target, intent(in) :: hm
    type(hamiltonian_operator_t), pointer :: this
 
    push_sub(hamiltonian_operator_constructor)
 
    allocate(this)
    call this%init(namespace, mesh, hm)
 
    pop_sub(hamiltonian_operator_constructor)
  end function hamiltonian_operator_constructor
 
  subroutine hamiltonian_operator_init(this, namespace, mesh, hm)
    class(hamiltonian_operator_t),     intent(inout) :: this
    type(namespace_t), target,         intent(in)    :: namespace
    class(mesh_t), target,             intent(in)    :: mesh
    class(hamiltonian_abst_t), target, intent(in)    :: hm
 
    push_sub(hamiltonian_operator_init)
 
    this%mesh => mesh
    this%namespace => namespace
    this%hm => hm
 
    pop_sub(hamiltonian_operator_init)
  end subroutine hamiltonian_operator_init
 
  subroutine hamiltonian_operator_apply(this, psib, hpsib)
    class(hamiltonian_operator_t), intent(in) :: this
    class(batch_t), intent(inout) :: psib
    class(batch_t), intent(inout) :: hpsib
 
    push_sub(hamiltonian_operator_apply)
 
    call this%hm%zapply(this%namespace, this%mesh, psib, hpsib)
 
    pop_sub(hamiltonian_operator_apply)
  end subroutine hamiltonian_operator_apply
 
  ! ---------------------------------------------------------
  logical function operator_is_hermitian(this)
    class(operator_t), intent(in) :: this
 
    operator_is_hermitian = .true.
  end function operator_is_hermitian
 
  ! ---------------------------------------------------------
  logical function hamiltonian_operator_is_hermitian(this)
    class(hamiltonian_operator_t), intent(in) :: this
 
    hamiltonian_operator_is_hermitian = this%hm%is_hermitian()
  end function hamiltonian_operator_is_hermitian
 
  ! ---------------------------------------------------------
  function sinvh_operator_constructor(namespace, mesh, hm) result(this)
    type(namespace_t), target,         intent(in) :: namespace
    class(mesh_t), target,             intent(in) :: mesh
    class(hamiltonian_abst_t), target, intent(in) :: hm
    type(sinvh_operator_t), pointer :: this
 
    push_sub(sinvh_operator_constructor)
 
    allocate(this)
    call this%init(namespace, mesh, hm)
 
    pop_sub(sinvh_operator_constructor)
  end function sinvh_operator_constructor
 
  ! ---------------------------------------------------------
  subroutine sinvh_operator_init(this, namespace, mesh, hm)
    class(sinvh_operator_t),           intent(inout) :: this
    type(namespace_t), target,         intent(in)    :: namespace
    class(mesh_t), target,             intent(in)    :: mesh
    class(hamiltonian_abst_t), target, intent(in)    :: hm
 
    push_sub(sinvh_operator_init)
 
    this%mesh => mesh
    this%namespace => namespace
    this%hm => hm
 
    pop_sub(sinvh_operator_init)
  end subroutine sinvh_operator_init
 
  ! ---------------------------------------------------------
  subroutine sinvh_operator_apply(this, psib, hpsib)
    class(sinvh_operator_t), intent(in) :: this
    class(batch_t), intent(inout) :: psib
    class(batch_t), intent(inout) :: hpsib
 
    push_sub(sinvh_operator_apply)
 
    select type (psib)
    class is (wfs_elec_t)
      select type (hpsib)
      class is (wfs_elec_t)
        select type (hm => this%hm)
        class is (hamiltonian_elec_t)
          call zhamiltonian_elec_apply_sinvh_batch(hm, this%namespace, this%mesh, psib, hpsib)
        class default
          ! S^{-1} = 1 for non-electronic Hamiltonians: just apply H
          call this%hm%zapply(this%namespace, this%mesh, psib, hpsib)
        end select
      class default
        message(1) = "SinvH_operator_apply requires wfs_elec_t batches."
        call messages_fatal(1)
      end select
    class default
      message(1) = "SinvH_operator_apply requires wfs_elec_t batches."
      call messages_fatal(1)
    end select
 
    pop_sub(sinvh_operator_apply)
  end subroutine sinvh_operator_apply
 
  ! ---------------------------------------------------------
  logical function sinvh_operator_is_hermitian(this)
    class(sinvh_operator_t), intent(in) :: this
 
    ! A = S^{-1}H is self-adjoint in the S inner product, NOT the Euclidean one
    sinvh_operator_is_hermitian = .false.
  end function sinvh_operator_is_hermitian
 
end module exponential_oct_m
 
!! Local Variables:
!! mode: f90
!! coding: utf-8
!! End: