Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic methods”

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.

At least 361 records · Page 20

A Geometric Measure Theory Approach to Identify Complex Structural Features on Soft Matter Surfaces

The structural features that protrude above or below a soft matter interface are well-known to be related to interfacially mediated chemical reactivity and transport processes. It is a challenge to develop a robust algorithm for identifying these organized surface structures, as the morphology can be highly varied and they may exist on top of an interface containing significant interfacial roughness. A new algorithm that employs concepts from geometric measure theory, algebraic topology, and optimization is developed to identify candidate structures at a soft matter surface, and then, using a probabilistic approach, to rank their likelihood of being a complex structural feature. The algorithm is tested for a surfactant laden water/oil interface, where it is robust to identifying protrusions responsible for water transport against a set identified by visual inspection. To our knowledge, this is the first example of applying geometric measure theory to analyze the properties of a chemical/materials science system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hierarchical Model Reduction Driven by Machine Learning for Parametric Advection-Diffusion-Reaction Problems in the Presence of Noisy Data

Abstract We propose a new approach to generate a reliable reduced model for a parametric elliptic problem, in the presence of noisy data. The reference model reduction procedure is the directional HiPOD method, which combines Hierarchical Model reduction with a standard Proper Orthogonal Decomposition, according to an offline/online paradigm. In this paper we show that directional HiPOD looses in terms of accuracy when problem data are affected by noise. This is due to the interpolation driving the online phase, since it replicates, by definition, the noise trend. To overcome this limit, we replace interpolation with Machine Learning fitting models which better discriminate relevant physical features in the data from irrelevant unstructured noise. The numerical assessment, although preliminary, confirms the potentialities of the new approach.

97 MATHEMATICS AND COMPUTING↗

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic Catalysis Fundamentals: I. Fast calculation of limit cycles in dynamic catalysis

Dynamic catalysis—the forced oscillation of catalytic reaction coordinate potential energy surfaces (PES)—has recently emerged as a promising method for the acceleration of heterogeneously-catalyzed reactions. Theoretical study of enhancement of rates and supra-equilibrium product yield via dynamic catalysis has, to-date, been severely limited by onerous computational demands of forward integration of stiff, coupled ordinary differential equations (ODEs) that are necessary to quantitatively describe periodic cycling between PESs. Here, we establish a new approach that reduces, by ≳108×, the computational cost of finding the time-averaged rate at dynamic steady state (i.e. the limit cycle for linear and nonlinear systems of kinetic equations). Our developments are motivated by and conceived from physical and mathematical insight drawn from examination of a simple, didactic case study for which closed-form solutions of rate enhancement are derived in explicit terms of periods of oscillation and elementary step rate constants. Generalization of such closed-form solutions to more complex catalytic systems is achieved by introducing a periodic boundary condition requiring the dynamic steady state solution to have the same periodicity as the kinetic oscillations and solving the corresponding differential equations by linear algebra or Newton-Raphson-based approaches. The methodology is well-suited to extension to non-linear systems for which we detail the potential for multiple solutions or solutions with different periodicities. For linear and non-linear systems alike, the acute decrement in computational expense enables rapid optimization of oscillation waveforms and, consequently, accelerates understanding of the key catalyst properties that enable maximization of reaction rates, conversions, and selectivities during dynamic catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Oracle-Preserving Latent Flows

A fundamental task in data science is the discovery, description, and identification of any symmetries present in the data. We developed a deep learning methodology for the simultaneous discovery of multiple non-trivial continuous symmetries across an entire labeled dataset. The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function, ensuring the desired symmetry properties. The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to invariant transformations with respect to high-dimensional oracles. The method is demonstrated with several examples on the MNIST digit dataset, where the oracle is provided by the 10-dimensional vector of logits of a trained classifier. We find classes of symmetries that transform each image from the dataset into new synthetic images while conserving the values of the logits. We illustrate these transformations as lines of equal probability (“flows”) in the reduced latent space. These results show that symmetries in the data can be successfully searched for and identified as interpretable non-trivial transformations in the equivalent latent space.

97 MATHEMATICS AND COMPUTING↗

High Performance PEFC Electrode Structures

Raytheon Technologies Research Center (RTRC) in collaboration with Ion Power Inc. and the University of Arkansas at Little Rock and the FC-PAD consortium executed a project that: (1) developed comprehensive models of oxygen and proton transport in cathode catalyst layers that provided new insights about losses associated with reducing platinum loading to 0.1 mg/cm 2 , (2) designed, fabricated, characterized, and tested cells featuring carbon-supported catalyst layers with low platinum loadings that met efficiency and power density targets set forth by the Hydrogen and Fuel Cells Technology Office, and (3) designed, fabricated, characterized, and tested novel catalyst structures. The modeling efforts produced eight scientific publications that shared new descriptions of oxygen and proton transport in catalyst layers with the broader technical community. The key physical insights from the models are expressed in straightforward algebraic expressions, facilitating easy adoption by other researchers. The models developed during the project explain why resistance to oxygen transport is inversely proportional to interfacial area of platinum – an observation that eluded quantitative explanation for a decade. The models quantitatively predict polarization when measured morphological parameters and transport properties are input. Membrane-electrode assemblies made during the project met stated goals for current at high voltage and power density at rated voltage for transportation fuel cells at the end of budget period 2. High performance was achieved by developing a diffusion layer with low resistance to oxygen transport and a PtCo/C cathode catalyst layer capable of supporting rapid proton and oxygen transport. The project was subsequently directed to curtail experimental work and focus on modeling during budget period 3. Ion Power Inc. developed new expertise in fabricating catalyst layers containing platinum-cobalt catalysts, and processing very thin membranes. The University of Arkansas at Little Rock developed novel nanocolumnar self-supported thin film electrocatalysts that can be grown on carbon supports using a simple high pressure sputter deposition method. The nanocolumnar microstructure provides adequate surface-to-volume ratio for efficient platinum utilization, and the conformal platinum shell with larger crystal grain sizes covering the carbon support surface may eliminate durability issues associated with catalyst dissolution, agglomeration, and carbon corrosion.

08 HYDROGEN↗

Near-wall model for compressible turbulent boundary layers based on an inverse velocity transformation

In this work, a near-wall model, which couples the inverse of a recently developed compressible velocity transformation (Griffin et al., Proc. Natl Acad. Sci., vol. 118, 2021, p. 34) and an algebraic temperature–velocity relation, is developed for high-speed turbulent boundary layers. As input, the model requires the mean flow state at one wall-normal height in the inner layer of the boundary layer and at the boundary-layer edge. As output, the model can predict mean temperature and velocity profiles across the entire inner layer, as well as the wall shear stress and heat flux. The model is tested in an a priori sense using a wide database of direct numerical simulation high-Mach-number turbulent channel flows, pipe flows and boundary layers (48 cases, with edge Mach numbers in the range 0.77–11, and semi-local friction Reynolds numbers in the range 170–5700). The present model is significantly more accurate than the classical ordinary differential equation (ODE) model for all cases tested. The model is deployed as a wall model for large-eddy simulations in channel flows with bulk Mach numbers in the range 0.7–4 and friction Reynolds numbers in the range 320–1800. When compared to the classical framework, in the a posteriori sense, the present method greatly improves the predicted heat flux, wall stress, and temperature and velocity profiles, especially in cases with strong heat transfer. In addition, the present model solves one ODE instead of two, and has a computational cost and implementation complexity similar to that of the commonly used ODE model.

42 ENGINEERING↗

FORCE Update 2024

The Framework for Optimization of Resources and Economics (FORCE) tool suite is the U.S. Department of Energy’s Nuclear Integrated Energy Systems (IES) Program flagship tool suite for technoeconomic IES analysis of IES. This tool suite is useful for analysis designed to evaluate and improve the technoeconomics of energy production systems, particularly for systems including nuclear technology. In this report, we document the development activity for the FORCE tool suite to extend its capabilities as performed during fiscal year 2024. In addition to reliability and accessibility, capability is one of the three standards guiding the development of the FORCE tool suite and the software codes that are its constituent parts. Extending the capabilities of the FORCE tool suite allows analysis both within the IES program as well as industry, university, and laboratory partners to perform analysis with more accuracy, insight, and impactful narrative. Four areas of capability development were the focus of activity this year: economic parameter uncertainty quantification, multiresolution analysis, components-to-optimization workflow automation, and statespace construction workflows for real-time optimal control. In economic parameter uncertainty quantification, the ability of HERON to capture risk due to scenarios (weather and energy demand uncertainty) was expanded to also include uncertainties in financial parameters such as capital cost or operation and maintenance costs. By including these sources of uncertainty, which are sometimes very large compared with scenario uncertainty, HERON is better able to capture the risk posed by investment in various IES technology. Because of this, analysts can also consider the reduction in risks that can be realized by choice of some technologies. In multiresolution analysis, development activity extended on work completed previously. In fiscal year 2023, methods for decomposing time series signals, such as demand, solar and wind availability, and price profiles, were analyzed and down-selected to those most effective at splitting signals into different resolutions. These resolutions allow considering the influence of different energy demand and supply behaviors across different time scales. For example, energy demand might be divided into seasonal, weekly, and hourly profiles. In fiscal year 2024, this preliminary work was extended and implemented within the Risk Analysis Virtual Environment (RAVEN) risk and uncertainty analysis platform, which is used throughout the FORCE framework. This development of the “multi-resolution time series analysis” (MR-TSA) module in RAVEN allows training synthetic history generators on complex time series. These synthetic history generators can then be used in HERON for generating scenarios that represent possible market and weather scenarios that can be analyzed on different time scales. We envision completing this work in the future, implementing multiresolution dispatch optimization strategies that can make the most beneficial use of these stratified time histories. In components-to-optimization workflow development, workflows for translating user inputs of components into algorithms for algebraic optimization were selected and implemented. Similar algorithms within the Holistic Energy Resource Optimization Network (HERON) were separated from the main code base of HERON and gathered with the components-to-optimization workflows in the new Dispatch Optimization Variable Engine (DOVE) software library. This modularization allows FORCE users to analyze dispatch optimization and energy system duty cycles independently of HERON, which previously was a burdensome task. Additionally, these dispatch optimization algorithms, set up in an independent library, can now be used across all software applications within FORCE, especially including the real-time optimal control software Optimization of Real-time Capacity Allocation (ORCA). Allowing FORCE software to share dispatch optimization algorithms within a single library allows for improved software maintenance and reliability. In statespace characterization workflow development, alternative workflows for optimizing dispatch with additional technical accuracy was the focus, particularly to improve the real-time optimization decision making in ORCA. Using algorithms and workflows initially developed for the Feasible Actuator Range Modifier (FARM), workflows for determining the statespace representation of IES were identified and demonstrated. The resulting dispatch optimization required a more robust optimization algorithm than that originally used in HERON (and moved to DOVE), which required adding an alternate workflow to DOVE that can more accurately match the behavior of physical systems using a partial differential equation representation. In conclusion, capability developments in the FORCE tool suite in fiscal year 2024 have improved the ability of the FORCE tool suite to perform

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

CSPlib: A performance portable parallel software toolkit for analyzing complex kinetic mechanisms

Computational singular perturbation (CSP) is a method to analyze dynamical systems. It targets the decoupling of fast and slow dynamics using an alternate linear expansion of the right-hand side of the governing equations based on eigenanalysis of the associated Jacobian matrix. This representation facilitates diagnostic analysis, detection and control of stiffness, and the development of simplified models. For this work, we have implemented CSP in a C++ open-source library CSPlib using the Kokkos parallel programming model to address portability across diverse heterogeneous computing platforms, i.e., multi/many-core CPUs and GPUs. We describe the CSPlib implementation and present its computational performance across different computing platforms using several test problems. Specifically, we test the CSPlib performance for a constant pressure ignition reactor model on different architectures, including IBM Power 9, Intel Xeon Skylake, and NVIDIA V100 GPU. The size of the chemical kinetic mechanism is varied in these tests. As expected, the Jacobian matrix evaluation, the eigensolution of the Jacobian matrix, and matrix inversion are the most expensive computational tasks. When considering the higher throughput characteristic of GPUs, GPUs performs better for small matrices with higher occupancy rate. CPUs gain more advantages from the higher performance of well-tuned and optimized linear algebra libraries such as OpenBLAS.

97 MATHEMATICS AND COMPUTING↗

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

MOSCATO Development and Integration in Fiscal Year 2025: Implementation of Multiphase, Multiphysics Modeling Capabilities for Molten Salt Systems

MOSCATO (Molten Salt Chemistry and Transport) is a multiphysics code that provides high-fidelity, coupled simulations of fluid flow, heat transfer, mass transfer, chemistry, electrochemical phenomena, and alloy corrosion for molten salt systems. In FY25, significant developments were made to the code package, enhancing its capabilities for modeling all relevant phenomena within operating moltens salt reactors (MSRs). The developments and activities in FY25 included: 1. Implementation of Level-Set methods to enable modeling of single-bubble behavior in molten salts. In FY25, the Level-Set two-phase flow modeling implementation was improved to simulate single bubble behavior with molten salt media. The large density and viscosity ratios between typical gases and molten salt liquids present challenges for these types of numerical solvers. With enhancements to the pressure projection method, MOSCATO’s Level-Set solver was able to be successfully validated to experiments related to helium bubble rise in stagnant molten salt. The simulated bubble rising velocity showed reasonable good agreement with experimental measurements. The bubble shape and dynamics were also visually compared with experimental snapshots, demonstrating a good qualitative match. 2. Generation of mass transfer correlations for multiphase flow systems. To enable calculations of the tritium transport across the interface between gas bubbles and salt, we modeled high- Schmidt-number mass transfer around a sphere across a broad range of Reynolds numbers. The mesh near the sphere surface was highly refined to resolve steep concentration gradients caused by the low diffusion coefficient. Literature-based mass transfer correlations were compared with the numerical results, and modifications were proposed to improve agreement, particularly at higher Schmidt numbers. These mass transfer correlations were subsequently provided to other national laboratories to help enable high quality mass transfer simulations using lower-order solvers under development within the NEAMS program. 3. Preliminary implementation of a bubbly flow solver. To model bubbly flow in molten salt, we implemented a bubbly flow solver for void fractions less than 5%. To do so, an algebraic relative velocity model that assumes small bubbles with rapid momentum equilibration was added to MOSCATO to compute bubble velocities. Preliminary comparisons with experimental data showed reasonable agreement, and further improvements are underway. 4. Generation of mass transfer correlations for MSRE subchannel The Molten-Salt Reactor Experiment (MSRE) was a landmark historical project that demonstrated the feasibility of molten-salt reactor technology. The MSRE campaign also generated a significant body of experimental data and reports that continue to support molten-salt–related research. In this report, the MSRE core subchannel was used as the reference geometry for a mass transfer study performed with MOSCATO. The geometry and computational mesh were adapted from a previous study, providing adequate resolution for the relatively low Reynolds number in this case. Additional mesh refinement was applied to reach higher Schmidt numbers, enabling the derivation of a reliable mass-transfer correlation for the present scenario. 5. Simulations of oxygen ingressions into molten salt. In the previous fiscal year, we initiated a study to simulate oxygen ingression in stagnant salt. As oxygen enters the salt through its surface, it reacts with Ce 3+ to form solid CeO 2 and other reaction products. To more fully capture the complex diffusion-convection-reaction mechanisms, capabilities for modeling natural convection in the salt vessel were added. These were needed as the flow of the ingressed gas induced flow in the salt caused by surface shear and non-isothermal effects. With these updated physics in place, we were able to successfully reproduce the experimental results for the rate of change of CeCl 3 concentrations versus time. 6. Flow corrosion model validation. In FY24, MOSCATO’s corrosion model was validated against static corrosion experiments. In FY25, this work was extended to a flow corrosion experiment, where FLiNaK salt was driven by natural convection, with initial salt impurities to initiate corrosion. Despite uncertainties in parameters such as elemental diffusion coefficients in the alloy and unknown H + concentrations, the simulations achieved good agreement with experimental results, especially in predicting sample mass losses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multilevel-in-width training for deep neural network regression

A common challenge in regression is that for many problems, the degrees of freedom required for a high-quality solution also allows for overfitting. Regularization is a class of strategies that seek to restrict the range of possible solutions so as to discourage overfitting while still enabling good solutions, and different regularization strategies impose different types of restrictions. In this paper, we present a multilevel regularization strategy that constructs and trains a hierarchy of neural networks, each of which has layers that are wider versions of the previous network's layers. Here, we draw intuition and techniques from the field of Algebraic Multigrid (AMG), traditionally used for solving linear and nonlinear systems of equations, and specifically adapt the Full Approximation Scheme (FAS) for nonlinear systems of equations to the problem of deep learning. Training through V-cycles then encourage the neural networks to build a hierarchical understanding of the problem. We refer to this approach as multilevel-in-width to distinguish from prior multilevel works which hierarchically alter the depth of neural networks. The resulting approach is a highly flexible framework that can be applied to a variety of layer types, which we demonstrate with both fully connected and convolutional layers. We experimentally show with PDE regression problems that our multilevel training approach is an effective regularizer, improving the generalize performance of the neural networks studied.

97 MATHEMATICS AND COMPUTING↗

Finite-size effects in periodic coupled cluster calculations

Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.

97 MATHEMATICS AND COMPUTING↗

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Noncompact atomic insulators

Here we study the conditions for Bloch bands to be spanned by symmetric and strictly compact Wannier states that have zero overlap with all lattice sites beyond a certain range. Similar to the characterization of topological insulators in terms of an algebraic (rather than exponential) localization of Wannier states, we find that there may be impediments to the compact localization even of topologically “trivial” obstructed atomic insulators. These insulators admit exponentially localized Wannier states centered at unoccupied orbitals of the crystalline lattice. First, we establish a sufficient condition for an insulator to have a compact representative. Second, for $\mathscr{C}_2$ rotational symmetry, we prove that the complement of fragile topological bands cannot be compact, even if it is an atomic insulator. Third, for $\mathscr{C}_4$ symmetry, our findings imply that there exist fragile bands with zero correlation length. Fourth, for a $\mathscr{C}_3$-symmetric atomic insulator, we explicitly derive that there are no compact Wannier states overlapping with less than 18 lattice sites. We conjecture that this obstruction generalizes to all finite Wannier sizes. Our results can be regarded as the stepping stone to a generalized theory of Wannier states beyond dipole or quadrupole polarization.

36 MATERIALS SCIENCE↗