|
Objective:
- Investigate the efficiency of time-integration in the semi-empirical TB basis.
Approach:
- Explicit (matrix-vector product) vs. implicit (direct linear solver) methods.
- Traditional CPU vs. GPU accelerators.
- Measure time-integration only (matrix preparation/calculation not included).
Results:
- Implicit methods faster for larger time steps and lower cross sections.
- Explicit methods better scale and leverage accelerators.
- Explicit methods conditionally stable.
Impact:
- Current and future results aim to make realistic simulations feasible.
|
Impl. Crank-Nicholson (CN), Expl. Askar-Cakmak (AC, leapfrog), Expl. 3rd order Adams-Bashforth (AB3)


|