DSKO: Dancing through DFTB Parametrization

Artem Samtsevych1, Yihua Song1, Tammo van der Heide2

  • 1Fritz Haber Institute of the Max Planck Society, 14195 Berlin, Germany.

Summary

Density functional tight binding (DFTB) simulations are improved with the new DFTB Slater-Koster Optimizer (DSKO). DSKO generates accurate electronic parameters, enhancing DFTB

Related Concept Videos

Two-Dimensional Force System01:20

Two-Dimensional Force System

A two-dimensional system in mechanical engineering involves the analysis of motion and forces in a plane. A two-dimensional force vector can be resolved into its components as:
1.9K
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
967
Two-Dimensional Force System: Problem Solving01:29

Two-Dimensional Force System: Problem Solving

Solving problems related to two-dimensional force systems is an essential aspect of mechanics and engineering. By applying the principles of vector analysis and force equilibrium, one can determine the effect of multiple forces acting on an object in a two-dimensional space.
The first step to solving a two-dimensional force system problem is to draw a free-body diagram of the object under consideration. This diagram helps identify all the external forces acting on the object, including their...
1.6K
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
1.3K
Properties of DTFT II01:24

Properties of DTFT II

In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
797
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the...
963