Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 20 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Real-time time-dependent density functional theory using higher order finite element methods (1810.13130v4)

Published 31 Oct 2018 in physics.comp-ph

Abstract: We present a computationally efficient approach to solve the time-dependent Kohn-Sham equations in real-time using higher-order finite-element spatial discretization, applicable to both pseudopotential and all-electron calculations. To this end, we develop an a priori mesh adaption technique, based on the semi-discrete (discrete in space but continuous in time) error estimate on the time-dependent Kohn-Sham orbitals, to construct a close to optimal finite-element discretization. Subsequently, we obtain the full-discrete error estimate to guide our choice of the time-step. We employ spectral finite-elements along with Gauss-Legendre-Lobatto quadrature to render the overlap matrix diagonal, simplifying the inversion of the overlap matrix that features in the evaluation of the discrete time-evolution operator. We use the second-order Magnus operator as the time-evolution operator in all our calculations. Furthermore, the action of the discrete Magnus operator, expressed as exponential of a matrix, on the Kohn-Sham orbitals is obtained efficiently through an adaptive Lanczos iteration. We observe close to optimal rates of convergence of the dipole moment with respect to spatial and temporal discretization, for both pseudopotential and all-electron calculations. We demonstrate a staggering 100-fold reduction in the computational time afforded by higher-order finite-elements over linear finite-elements. We present comparative studies, in terms of accuracy and efficiency, of our approach against finite-difference based discretization for pseudopotential calculations, and demonstrate significant computational savings when compared to the finite-difference method. We also demonstrate the competence of higher-order finite-elements for all-electron benchmark systems. Lastly, we observe good parallel scalability of the proposed method on many hundreds of processors.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube