Jacob’s ladder

[Robbe Daelman]

Jacob’s ladder uses progressively more complicated terms to obtain a better result. The first rung is the simplest and gives a rough estimate, every further rung adds another term that improves this estimate but is also more difficult and more computationally expensive to calculate.
In DFT, the lowest rung is the local density approximation, followed by the generalized gradient approximation. The next rungs are for example meta-GGA’s or hybrid functionals.

[Author]

Posts