Saved in:
Bibliographic Details
Main Authors: Qiu, Tian, Subotnik, Joseph E.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.14631
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913513076686848
author Qiu, Tian
Subotnik, Joseph E.
author_facet Qiu, Tian
Subotnik, Joseph E.
contents We propose an efficient algorithm for the recently published electron/hole-transfer Dynamical-weighted State-averaged Constrained CASSCF (eDSC/hDSC) method studying charge transfer states and D$_1$-D$_0$ crossings for systems with odd numbers of electrons. By separating the constrained minimization problem into an unconstrained self-consistent-field (SCF) problem and a constrained non-self-consistent-field (nSCF) problem, and accelerating the direct inversion in the iterative subspace (DIIS) technique to solve the SCF problem, the overall computational cost is reduced by a factor of 8 to 20 compared with directly using sequential quadratic programming (SQP). This approach should be applicable for other constrained minimization problems and, in the immediate future, once gradients are available, the present eDSC/hDSC algorithm should allow for speedy non-adiabatic dynamics simulations.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14631
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle An Efficient Algorithm for Constrained CASSCF(1,2) and CASSCF(3,2) Simulations as Relevant to Electron and Hole Transfer Problems
Qiu, Tian
Subotnik, Joseph E.
Computational Physics
We propose an efficient algorithm for the recently published electron/hole-transfer Dynamical-weighted State-averaged Constrained CASSCF (eDSC/hDSC) method studying charge transfer states and D$_1$-D$_0$ crossings for systems with odd numbers of electrons. By separating the constrained minimization problem into an unconstrained self-consistent-field (SCF) problem and a constrained non-self-consistent-field (nSCF) problem, and accelerating the direct inversion in the iterative subspace (DIIS) technique to solve the SCF problem, the overall computational cost is reduced by a factor of 8 to 20 compared with directly using sequential quadratic programming (SQP). This approach should be applicable for other constrained minimization problems and, in the immediate future, once gradients are available, the present eDSC/hDSC algorithm should allow for speedy non-adiabatic dynamics simulations.
title An Efficient Algorithm for Constrained CASSCF(1,2) and CASSCF(3,2) Simulations as Relevant to Electron and Hole Transfer Problems
topic Computational Physics
url https://arxiv.org/abs/2409.14631