Search NASA⌕ Search

SEARCH · Search NASA

Results for “Shavitt graph”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

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↗

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↗

Evaluation of the spin-orbit interaction within the graphically contracted function method.

The graphically contracted function (GCF) method is extended to include an effective one-electron spin-orbit (SO) operator in the Hamiltonian matrix construction. Our initial implementation is based on a multiheaded Shavitt graph approach that allows for the efficient simultaneous computation of entire blocks of Hamiltonian matrix elements. Two algorithms are implemented. The SO-GCF method expands the spin-orbit wave function in the basis of GCFs and results in a Hamiltonian matrix of dimension N{sub dim} = N{sub a} ((S{sub max} + 1){sup 2} ? S{sub min}{sup 2}). N{sub a} is the number of sets of nonlinear arc factor parameters, and S{sub min} and S{sub max} are respectively the minimum and maximum values of an allowed spin range in the wave function expansion. The SO-SCGCF (SO spin contracted GCF) method expands the wave function in a basis of spin contracted functions and results in a Hamiltonian matrix of dimension N{sub dim} = N{sub a}. For a given N{sub a} and spin range, the number of parameters defining the wave function is the same in the two methods after accounting for normalization. The full Hamiltonian matrix construction with both approaches scales formally as O(N{sub a}{sup 2}{omega}n{sup 4}) for n molecular orbitals. The {omega} factor depends on the complexity of the Shavitt graph and includes factors such as the number of electrons, N, and the number of interacting spin states. Timings are given for Hamiltonian matrix construction for both algorithms for a range of wave functions with up to N = n = 128 and that correspond to an underlying linear full-CI CSF expansion dimension of over 10{sup 75} CSFs, many orders of magnitude larger than can be considered using traditional CSF-based spin-orbit CI approaches. For Hamiltonian matrix construction, the SO-SCGCF method is slightly faster than the SO-GCF method for a given N{sub a} and spin range. The SO-GCF method may be more suitable for describing multiple states, whereas the SO-SCGCF method may be more suitable for describing single states.

97 MATHEMATICS AND COMPUTING↗

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 evaluation of spin-density matrices within the graphically contracted function method.

An efficient algorithm is presented to compute spin-density matrices from wave functions expanded in a basis of graphically contracted functions (GCF). The GCFs are based on the graphical unitary group approach (GUGA), which is a 'spin-free' formulation of the electronic wave function. The spin-density matrix elements are computed from one-particle and two-particle charge-density matrix elements. The recursive algorithm allows the spin-density matrix to be computed with O(N{sub 2}{sup GCF}{omega}n{sup 2}) total effort where N{sub GCF} is the dimension of the GCF basis and n is the dimension of the orbital basis. The scale factor {omega} depends on the number of electrons N and ranges from O(N{sup 0}) to O(N{sup 2}) depending on the complexity of the underlying Shavitt graph. Because the 'spin-free' GCF formulation eliminates the need to expand the wave function in a spin-dependent Slater determinant basis, it is possible to treat wave functions with large numbers of electrons and orbitals. Timings are given for wave functions that correspond to determinantal expansions over 10{sup 200} in length. The implementation is applicable to arbitrary spin states and to both ground and excited electronic states.

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 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↗