Fully Guaranteed and Computable Error Bounds on the Energy for Periodic Kohn–Sham Equations with Convex Density Functionals

In this article, we derive fully guaranteed error bounds for the energy of convex nonlinear mean-field models. These results apply in particular to Kohn-Sham equations with convex density functionals, which includes the reduced Hartree-Fock (rHF) model, as well as the Kohn-Sham model with exact exchange-density functional (which is unfortunately not explicit and therefore not usable in practice). We then decompose the obtained bounds into two parts, one depending on the chosen discretization and one depending on the number of iterations performed in the self-consistent algorithm used to solve the nonlinear eigenvalue problem, paving the way for adaptive refinement strategies. The accuracy of the bounds is demonstrated on a series of test cases, including a Silicon crystal and an Hydrogen Fluoride molecule simulated with the rHF model and discretized with planewaves. We also show that, although not anymore guaranteed, the error bounds remain very accurate for a Silicon crystal simulated with the Kohn-Sham model using nonconvex exchangecorrelation functionals of practical interest.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Scientific Computing
Published
2025-10-10
DOI
https://doi.org/10.1137/25m1735676
Primary Topic
Advanced Condensed Matter Physics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fully Guaranteed and Computable Error Bounds on the Energy for Periodic Kohn–Sham Equations with Convex Density Functionals

Benjamin Stamm, Geneviève Dusson, Gaspard Kemlin, Éric Cancès et al.
2 links
SIAM Journal on Scientific Computing
Advanced Condensed Matter Physics
article

Fully Guaranteed and Computable Error Bounds on the Energy for Periodic Kohn–Sham Equations with Convex Density Functionals

Benjamin Stamm, Geneviève Dusson, Gaspard Kemlin, Éric Cancès, Andrea Bordignon, Rafael Antonio Lainez Reyes
article en

Abstract

In this article, we derive fully guaranteed error bounds for the energy of convex nonlinear mean-field models. These results apply in particular to Kohn-Sham equations with convex density functionals, which includes the reduced Hartree-Fock (rHF) model, as well as the Kohn-Sham model with exact exchange-density functional (which is unfortunately not explicit and therefore not usable in practice). We then decompose the obtained bounds into two parts, one depending on the chosen discretization and one depending on the number of iterations performed in the self-consistent algorithm used to solve the nonlinear eigenvalue problem, paving the way for adaptive refinement strategies. The accuracy of the bounds is demonstrated on a series of test cases, including a Silicon crystal and an Hydrogen Fluoride molecule simulated with the rHF model and discretized with planewaves. We also show that, although not anymore guaranteed, the error bounds remain very accurate for a Silicon crystal simulated with the Kohn-Sham model using nonconvex exchangecorrelation functionals of practical interest.

SIAM Journal on Scientific ComputingVol. 47(5)
University of Stuttgart (DE), Centre National de la Recherche Scientifique (FR), École nationale des ponts et chaussées (FR), Stuttgart Technical University of Applied Sciences (DE), CERMICS (FR), Laboratoire Amiénois de Mathématique Fondamentale et Appliquée (FR), Laboratoire de Mathématiques de Besançon (FR), Université de Picardie Jules Verne (FR), Université de Franche-Comté (FR)
Affordable and clean energy
Openalex Percentile: Top 100%
Advanced Condensed Matter Physics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.