Search NASA⌕ Search

Engineering topics

Brozell, Scott R.

Publications and source records attributed to Brozell, Scott R..

Edge counts for the auxiliary pair graph within the graphical unitary group approach

Closed-form expressions are presented for the numbers of edges in the auxiliary pair graphs (APGs) associated with non spin-orbit and spin-orbit Shavitt graphs for full configuration interaction expansions. A Shavitt graph is a visual representation of a configuration state function expansion space constructed via the graphical unitary group approach (GUGA). An APG is an organisational aid and a programmatic tool generated from a Shavitt graph. The number of edges in an APG determines bounds on the computational scaling as a function of the total numbers of electrons, orbitals, and spin multiplicities. The edge counts extend a suite of Shavitt graph statistics based on these functional parameters. The derivation and the presentation of the formulas for the edge counts has been assisted by the bra-ket interchange symmetry and the particle-hole interchange symmetry in the GUGA formalism. Furthermore, these symmetry operators produce one-to-one correspondences between various sets of edges, and this yields identities among some edge count formulas. There are 208 possible edge types. Of these, some do not contribute to two-electron operators, some are related by bra-ket interchange symmetry, and some are related by particle-hole interchange symmetry. For the remaining unique edge types, explicit expressions are derived for the numbers of edges.

74 ATOMIC AND MOLECULAR PHYSICS↗

Wave function analysis with a maximum flow algorithm

An efficient algorithm for computing the maximum-flow path in a network is applied to the identification of the dominant configuration state functions (CSFs) in a graphically contracted function (GCF), configuration interaction, wave function. The flow network is a space of spin-adapted CSFs represented by a Shavitt graph, wherein the nodes correspond to orbital occupations and spin quantum numbers. The graph nodes are connected by arcs, and an arc density is defined as sums of the associated squared CSF coefficients. A max-min approach determines an upper bound to the maximum possible incoming flow for each graph node. A backtracking step generates a candidate walk and is followed by a limited search of alternative branching paths for the dominant CSF. The arc density contributions are removed from the graph, and the algorithm is reapplied to the updated graph. This list of generated walks can be partitioned in order to guarantee that the dominant CSFs have been identified. All of the steps in this algorithm are computationally efficient and do not depend on the potentially large dimension of the underlying linear CSF expansion space. An analysis of low-lying valence states of C-2 illustrates the method.

74 ATOMIC AND MOLECULAR PHYSICS↗

The Generality of the GUGA MRCI Approach in COLUMBUS for Treating Complex Quantum Chemistry

The core part of the program system COLUMBUS allows highly efficient calculations using variational multireference (MR) methods in the framework of configuration interaction with single and double excitations (MR-CISD) and averaged quadratic coupled-cluster calculations (MR-AQCC), based on uncontracted sets of configurations and the graphical unitary group approach (GUGA). The availability of analytic MR-CISD and MR-AQCC energy gradients and analytic nonadiabatic couplings for MR-CISD enables exciting applications including, e.g., investigations of π-conjugated biradicaloid compounds, calculations of multitudes of excited states, development of diabatization procedures, and furnishing the electronic structure information for on-the-fly surface nonadiabatic dynamics. With fully variational uncontracted spin-orbit MRCI, COLUMBUS provides a unique possibility of performing high-level calculations on compounds containing heavy atoms up to lanthanides and actinides. Crucial for carrying out all of these calculations effectively is the availability of an efficient parallel code for the CI step. Configuration spaces of several billion in size now can be treated quite routinely on standard parallel computer clusters. Emerging developments in COLUMBUS, including the all configuration mean energy multiconfiguration self-consistent field method and the graphically contracted function method, promise to allow practically unlimited configuration space dimensions. Spin density based on the GUGA approach, analytic spin-orbit energy gradients, possibilities for local electron correlation MR calculations, development of general interfaces for nonadiabatic dynamics, and MRCI linear vibronic coupling models conclude this overview.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Representations of Shavitt Graphs Within the Graphical Unitary Group Approach

The Shavitt graph is a visual representation of a distinct row table (DRT) within the graphical unitary group approach. The DRT is a compact representation of the entire configuration state function expansion space within a molecular electronic structure calculation. Each node of the graph is associated with an integer triple (a k , b k , c k ). These integers may be mapped to other quantum numbers, including the number of orbitals, number of electrons, and spin quantum number, and used to display Shavitt graphs in various ways that emphasize different aspects of the expansion space or that reveal different aspects of computed wave functions. In conclusion, the features of several graph density plots are discussed, including electron-hole symmetries and the bonding-antibonding wave function character.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The all configuration mean energy multiconfiguration self-consistent-field method. I. Equal configuration weights

The All Configuration Mean Energy (ACME) conditions are a special case of state averaging for Multiconfigurational Self-Consistent-Field (MCSCF) orbital optimisation. The method is formulated using the Graphical Unitary Group Approach (GUGA) in which the Configuration State Function (CSF) basis is represented as walks within a Shavitt graph. This graphical formulation leads to efficient recursive algorithms for the energy and reduced density matrices (RDM) that are independent of the CSF dimension and that scale only as O(n2) where n is the number of occupied orbitals. The Hamiltonian matrix diagonalization step is obviated and the CSF expansion coefficients are neither referenced nor required. This allows MCSCF orbital optimisation to be performed for essentially unlimited numbers of active orbitals and arbitrarily large CSF expansions. The discussion includes various types of CSF expansion spaces, the partitioning of the essential and redundant orbital optimisation parameters, the computation of the spin-density, and the formulation of state-specific analytic gradients and nonadiabatic coupling for high-level electronic structure methods that use the ACME MCSCF orbitals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The multifacet graphically contracted function method. I. Formulation and implementation

The basic formulation for the multifacet generalization of the graphically contracted function (MFGCF) electronic structure method is presented. The analysis includes the discussion of linear dependency and redundancy of the arc factor parameters, the computation of reduced density matrices, Hamiltonian matrix construction, spin-density matrix construction, the computation of optimization gradients for single-state and state-averaged calculations, graphical wave function analysis, and the efficient computation of configuration state function and Slater determinant expansion coefficients. Timings are given for Hamiltonian matrix element and analytic optimization gradient computations for a range of model problems for full-CI Shavitt graphs, and it is observed that both the energy and the gradient computation scale as O(N{sup 2}n{sup 4}) for N electrons and n orbitals. The important arithmetic operations are within dense matrix-matrix product computational kernels, resulting in a computationally efficient procedure. An initial implementation of the method is used to present applications to several challenging chemical systems, including N{sub 2} dissociation, cubic H{sub 8} dissociation, the symmetric dissociation of H{sub 2}O, and the insertion of Be into H{sub 2}. The results are compared to the exact full-CI values and also to those of the previous single-facet GCF expansion form.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The multifacet graphically contracted function method. II. A general procedure for the parameterization of orthogonal matrices and its application to arc factors

Practical algorithms are presented for the parameterization of orthogonal matrices Q ∈ R {sup m×n} in terms of the minimal number of essential parameters (φ). Both square n = m and rectangular n < m situations are examined. Two separate kinds of parameterizations are considered, one in which the individual columns of Q are distinct, and the other in which only Span(Q) is significant. The latter is relevant to chemical applications such as the representation of the arc factors in the multifacet graphically contracted function method and the representation of orbital coefficients in SCF and DFT methods. The parameterizations are represented formally using products of elementary Householder reflector matrices. Standard mathematical libraries, such as LAPACK, may be used to perform the basic low-level factorization, reduction, and other algebraic operations. Some care must be taken with the choice of phase factors in order to ensure stability and continuity. The transformation of gradient arrays between the Q and (φ) parameterizations is also considered. Operation counts for all factorizations and transformations are determined. Numerical results are presented which demonstrate the robustness, stability, and accuracy of these algorithms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗