An Efficient Algorithm for Constrained CASSCF(1,2)\nand CASSCF(3,2) Simulations as Relevant to Electron and Hole Transfer\nProblems

We\npropose an efficient algorithm for the recently published electron/hole-transfer\nDynamical-weighted State-averaged Constrained CASSCF (eDSC/hDSC) method\nstudying charge transfer states and D<sub>1</sub>-D<sub>0</sub> crossings\nfor systems with odd numbers of electrons. By separating the constrained\nminimization problem into an unconstrained self-consistent-field (SCF)\nproblem and a constrained nonself-consistent-field (nSCF) problem,\nas well as accelerating the direct inversion in the iterative subspace\n(DIIS) technique to solve the SCF problem, the overall computational\ncost is reduced by a factor of 8–20 compared with directly\nusing sequential quadratic programming (SQP). This approach should\nbe applicable for other constrained minimization problems, and in\nthe immediate future, once gradients are available, the present eDSC/hDSC\nalgorithm should allow for speedy nonadiabatic dynamics simulations.

Publication Details

Journal
Figshare
Published
2024-10-07
DOI
https://doi.org/10.1021/acs.jctc.4c00937.s001
Primary Topic
Spectroscopy and Quantum Chemical Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Algorithm for Constrained CASSCF(1,2)\nand CASSCF(3,2) Simulations as Relevant to Electron and Hole Transfer\nProblems

Figshare
Spectroscopy and Quantum Chemical Studies
article

An Efficient Algorithm for Constrained CASSCF(1,2)\nand CASSCF(3,2) Simulations as Relevant to Electron and Hole Transfer\nProblems

article en

Abstract

We\npropose an efficient algorithm for the recently published electron/hole-transfer\nDynamical-weighted State-averaged Constrained CASSCF (eDSC/hDSC) method\nstudying charge transfer states and D<sub>1</sub>-D<sub>0</sub> crossings\nfor systems with odd numbers of electrons. By separating the constrained\nminimization problem into an unconstrained self-consistent-field (SCF)\nproblem and a constrained nonself-consistent-field (nSCF) problem,\nas well as accelerating the direct inversion in the iterative subspace\n(DIIS) technique to solve the SCF problem, the overall computational\ncost is reduced by a factor of 8–20 compared with directly\nusing sequential quadratic programming (SQP). This approach should\nbe applicable for other constrained minimization problems, and in\nthe immediate future, once gradients are available, the present eDSC/hDSC\nalgorithm should allow for speedy nonadiabatic dynamics simulations.

Figshare
Openalex Percentile: Top 75%
Spectroscopy and Quantum Chemical Studies
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.