Related Experiment Video
Updated: Feb 3, 2026

Structure of HIV-1 Capsid Assemblies by Cryo-electron Microscopy and Iterative Helical Real-space Reconstruction
Published on: August 9, 2011
Generalized Kohn-Sham iteration on Banach spaces
Andre Laestadius1, Markus Penz2, Erik I Tellgren1
1Hylleraas Centre for Quantum Molecular Sciences, Department of Chemistry, University of Oslo, P.O. Box 1033 Blindern, N-0315 Oslo, Norway.
This study rigorously formulates the Kohn-Sham (KS) algorithm using convex analysis, introducing a novel, regularized iteration scheme. This generalized approach ensures a well-defined KS iteration and proves convergence for density-functional theories.
Area of Science:
- Quantum Chemistry
- Mathematical Physics
- Computational Science
Background:
- The Kohn-Sham (KS) algorithm is central to density-functional theory (DFT) for electronic structure calculations.
- Existing formulations often lack rigorous mathematical underpinnings, particularly in generalized settings.
- A need exists for a robust mathematical framework to ensure the reliability of KS-based methods.
Purpose of the Study:
- To provide a rigorous mathematical formulation of the Kohn-Sham (KS) algorithm.
- To develop a generalized KS iteration scheme applicable to various DFT models.
- To establish the convergence properties of the proposed generalized KS method.
Main Methods:
- Utilizing convex analysis on Banach spaces for rigorous mathematical formulation.
- Employing a Levy-Lieb-type functional and its convex, lower semi-continuous extension.
- Introducing regularization to achieve differentiability and define a novel KS iteration scheme.
- Proving convergence in a weak sense.
Main Results:
- A rigorously defined Kohn-Sham (KS) iteration scheme is established.
- The generalized formulation overcomes limitations of common unregularized approaches.
- Weak convergence of the proposed KS iteration scheme is mathematically proven.
- The framework is shown to be applicable beyond standard DFT.
Conclusions:
- The generalized Kohn-Sham (KS) algorithm provides a robust mathematical foundation for density-functional theories.
- This rigorous approach enhances the reliability and applicability of KS-based computational methods.
- The formulation may extend to models outside of traditional quantum mechanics, broadening its impact.
Related Concept Videos
Generalized Hooke's Law
Generalized Anxiety Disorder
Social Foundations of Self II: The Generalized Other
Generalization, Discrimination, and Extinction
Generalization occurs when a behavior reinforced in one context is performed in similar situations. For instance, a student who studies diligently for calculus and receives excellent grades might apply the same study habits to psychology and history, expecting similar results. Generalization shows how learning in one setting can influence behavior in...
Space Trusses
At the core of a space truss lies the fundamental unit known as the tetrahedron. This structure is composed of six members that form a three-dimensional shape...
State Space Representation
Consider an RLC circuit, a...

