Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster algebras”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Dimensionality reduction of the many-body problem using coupled-cluster subsystem flow equations: classical and quantum computing perspective

We discuss reduced-scaling strategies employing recently introduced sub-system embedding sub-algebras coupled-cluster formalism (SES-CC) to describe many-body systems. These strategies utilize properties of the SES-CC formulations where the equations describing certain classes of sub- systems can be integrated into a computational flows composed coupled eigenvalue problems of reduced dimensionality. Additionally, these flows can be defined at the level of the CC Ansatz defined by selected classes of cluster amplitudes, which define the wave function ”memory” of possible partitionings of the many-body system into constituent sub-systems. One of the possible ways of solving these coupled problems is through implementing procedures, where the information is passed between the sub-systems in a self-consistent manner. As a special case, we consider local flow formulations where the so-called local character of correlation effects can be closely related to properties of sub-system embedding sub-algebras employing localized molecular basis. We also generalize flow equations to the time domain and to downfolding methods utilizing double exponential unitary CC Ansatz (DUCC), where reduced dimensionality of constituent sub-problems offer a possibility of efficient utilization of limited quantum resources in modeling realistic systems.

Electron correlation, quantum chemistry, quantum c↗
NASA NTRS1996

GENIE(++): A Multi-Block Structured Grid System

The computer code GENIE++ is a continuously evolving grid system containing a multitude of proven geometry/grid techniques. The generation process in GENIE++ is based on an earlier version. The process uses several techniques either separately or in combination to quickly and economically generate sculptured geometry descriptions and grids for arbitrary geometries. The computational mesh is formed by using an appropriate algebraic method. Grid clustering is accomplished with either exponential or hyperbolic tangent routines which allow the user to specify a desired point distribution. Grid smoothing can be accomplished by using an elliptic solver with proper forcing functions. B-spline and Non-Uniform Rational B-splines (NURBS) algorithms are used for surface definition and redistribution. The built in sculptured geometry definition with desired distribution of points, automatic Bezier curve/surface generation for interior boundaries/surfaces, and surface redistribution is based on NURBS. Weighted Lagrance/Hermite transfinite interpolation methods, interactive geometry/grid manipulation modules, and on-line graphical visualization of the generation process are salient features of this system which result in a significant time savings for a given geometry/grid application.

Williams, Tonya↗
DOE OSTI2021

Electromagnetic Transient Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (Distribution Grid Models)

The distribution and transmission grids are observing an increased penetration of power electronics in loads and generations. For example, there is increasing interest in integrating in extreme fast charging (XFC) systems for fast charging of electrical vehicles. As these systems are integrated, developing high-fidelity electromagnetic transient model of XFC systems in distribution grids and evaluating their interactions with the power grid would be of significant interest. This model will be utilized for design of XFC systems, to identify upgrades in distribution and/or transmission grids, for planning purposes by transmission planners or operators or owners, among others. It can also be utilized in operations for improved reliable performance of the grid and/or XFC station. The challenge with simulating these models is the high computational complexity introduced by the large number of states present in the system and the time-step needed to simulate the system. In this paper, advanced simulations algorithms are applied to reduce the computational complexity of simulating large-scale XFC systems. The algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. While the first three algorithms split the matrix that needs to be inverted from a large matrix to much smaller matrices, the final algorithm reduces the computational burden of applying higher-order integration approaches in the complete system. The comparison made in the previous sentence is with respect to use of homogeneous integration approaches used in conventional electromagnetic transient simulators like power systems computer aided design (PSCAD). The approaches mentioned here have resulted in speed-up of 36x in the simulation of a single distribution system with 15 XFCs.

Debnath, Suman↗
DOE OSTI2022

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗
DOE OSTI2023

Information loss, mixing and emergent type III 1 factors

A manifestation of the black hole information loss problem is that the two-point function of probe operators in a large Anti-de Sitter black hole decays in time, whereas, on the boundary CFT, it is expected to be an almost periodic function of time. We point out that the decay of the two-point function (clustering in time) holds important clues to the nature of observable algebras, states, and dynamics in quantum gravity. We call operators that cluster in time “mixing” and explore the necessary and sufficient conditions for mixing. The information loss problem is a special case of the statement that in type I algebras, there exists no mixing operators. We prove that, in a thermofield double state (KMS state), if mixing operators form an algebra (close under multiplication), the resulting algebra must be a von Neumann type III 1 factor. In other words, the physically intuitive requirement that all nonconserved operators should exponentially mix is so strong that it fixes the observable algebra to be an exotic algebra called a type III1 factor. More generally, for an arbitrary out-of-equilibrium state of a general quantum system (von Neumann algebra), we show that if the set of operators that mix under modular flow forms an algebra, it is a type III1 von Neumann factor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

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

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗
NASA NTRS1983

An enhanced version of an implicit code for the Euler equations

A two-dimensional implicit finite-difference code is applied to the inviscid Euler equations to compute transonic flow past airfoils in order to provide well-documented standard test cases for the general user community. The code is an improved version of Steger's 1976 implicit code. Enhancements include the use of up-wind differencing in supersonic regions before shocks and a variable time step to accelerate convergence. An airfoil grid generation routine based on algebraic techniques is employed. The grids are clustered near shocks to improve resolution. Computed results are compared with other numerical results from the literature.

Pulliam, T. H.↗
NASA NTRSDate not supplied

Uneven Inflation Load Share Trends in Clusters

The use of parachute clusters for payload recovery is still seeing widespread use ever since the early days of WWII. By involving the (near) simultaneous deployment of several smaller and identical canopies connected to the payload, cluster systems offer flexibility in tailoring to needed descent rates and load management, as well as providing robustness against individual canopy deployment or opening failure. Their downside, of course, resides in the possibility of differing inflation rates by each cluster member as caused by deployment variability, canopy-to-canopy interference, etc. Such variability leads to the lead-lag phenomenon, which causes uneven loading among the parachutes, often times leaving a single canopy to take up a significant portion of the system’s inflation loads. Herein we investigate how serious such an effect can be in terms of the number N of cluster members, underinflation drag of the lagging canopies, inflation swiftness of the leader in comparison to the laggards’, disreefing cutter activation staggering and pre-disreefing drag area. Two new metrics are used to highlight load share unevenness, namely, the peak and average leader canopy riser load in comparison to the leader’s drag during no-lead-lag; and leader peak load, as compared to total peak load. Results are calculated from data collected in NASA’s Orion/CPAS test program, as well as from simple algebraic expressions informing leader drag as sustained in different cluster systems (i.e., of different N) and varying leader inflation time relative to the laggards. Generally, using large-N cluster systems confers better load sharing among canopies. However, and in deployments where significant lead-lag occur, large-N systems may feature greater leader overload excursions, oftentimes in excess of 50% the no-lead-lag levels. These excursions are particularly made worse when cutter activation among the members are far from simultaneous and the laggards’ pre-disreefing drag area is small in comparison to the leader’s.

parachutes↗
DOE OSTI2020

Phase identification using co‐association matrix ensemble clustering

Calibrating distribution system models to aid in the accuracy of simulations such as hosting capacity analysis is increasingly important in the pursuit of the goal of integrating more distributed energy resources. The recent availability of smart meter data is enabling the use of machine learning tools to automatically achieve model calibration tasks. This research focuses on applying machine learning to the phase identification task, using a co‐association matrix‐based, ensemble spectral clustering approach. The proposed method leverages voltage time series from smart meters and does not require existing or accurate phase labels. This work demonstrates the success of the proposed method on both synthetic and real data, surpassing the accuracy of other phase identification research.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2021

Sulfur Molecules in Space by X-rays: A Computational Study

X-ray astronomy lacks high resolution spectra of interstellar dust analogues and molecules, severely hampering interstellar medium studies based on upcoming X-ray missions. Various theoretical approaches may be used to address this problem, but they must first be shown to reproduce reliable spectra compared to the experiment. In this work, we calculate the sulfur Kedge X-ray absorption spectra of H2S, SO2, and OCS, whose spectra are already known from X-ray experiments and predict the X-ray spectrum of CS, which as far as we are aware has not been measured, thereby hampering its detection by X-ray telescopes. We chose these four molecules as the astrochemistry of sulfur is an unsolved problem and as the four molecules are already known to exist in space. We consider three types of methods for modeling the X-ray spectra: more accurate calculations with the algebraic-diagrammatic construction (ADC) and the CC2, CCSD, and CC3coupled cluster (CC) approaches as well as more affordable ones with transition potential density functional theory (TP-DFT). A comparison of our computational results to previously reported experimental spectra shows that the core−valence separation (CVS)approaches CVS-ADC(2)-x and CVS-CC3 generally yield a good qualitative level of agreement with the experiment, suggesting that they can be used for interpreting measured spectra, while the TP-DFT method is not reliable for these molecules. However, quantitative agreement with the experiment is still outside the reach of the computational methods studied in this work.

Goranka Bilalbegovic↗
NASA NTRS1989

An algebraic homotopy method for generating quasi-three-dimensional grids for high-speed configurations

A fast and versatile procedure for algebraically generating boundary conforming computational grids for use with finite-volume Euler flow solvers is presented. A semi-analytic homotopic procedure is used to generate the grids. Grids generated in two-dimensional planes are stacked to produce quasi-three-dimensional grid systems. The body surface and outer boundary are described in terms of surface parameters. An interpolation scheme is used to blend between the body surface and the outer boundary in order to determine the field points. The method, albeit developed for analytically generated body geometries is equally applicable to other classes of geometries. The method can be used for both internal and external flow configurations, the only constraint being that the body geometries be specified in two-dimensional cross-sections stationed along the longitudinal axis of the configuration. Techniques for controlling various grid parameters, e.g., clustering and orthogonality are described. Techniques for treating problems arising in algebraic grid generation for geometries with sharp corners are addressed. A set of representative grid systems generated by this method is included. Results of flow computations using these grids are presented for validation of the effectiveness of the method.

Moitra, Anutosh↗
NASA NTRS1989

Effects Of Turbulence On Ignition

Report presents theoretical study of effects of turbulence on ignition of drops of single-component liquid fuel. Closely related to article, "Turbulence and Evaporation in Clusters of Drops" (NPO-17323). Uses theoretical model for evaporation and model for ignition developed previously. Radial velocity, va, of gas at surface of sphere of influence taken as algebraic combination of rate of evaporation and speed with which radius changes. Weighting factors of algebraic combination are such that in dilute spray, all new vapor coming from drops trapped in cluster, whereas in dense spray where evaporation strong, maximum new vapor escapes to ambient.

Bellan, Josette↗
DOE OSTI2021

Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package

This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange-correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear-electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an "open teamware" model and an increasingly modular design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Isotropic N-point basis functions and their properties

Isotropic functions of positions r 1 , r 2 ,..., r N , i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch–Gordan coefficients. An orthonormal basis of such functions provides a formalism suitable for analyzing isotropic distributions such as those that arise in cosmology, for instance in the clustering of galaxies as revealed by large-scale structure surveys. The algebraic properties of the basis functions are conveniently expressed in terms of 6-j and 9-j symbols. Finally, the calculation of relations among the basis functions is facilitated by 'Yutsis' diagrams for the addition and recoupling of angular momenta.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Repartitioning the Hamiltonian in many-body second-order Brillouin–Wigner perturbation theory: Uncovering new size-consistent models

Second-order Møller-Plesset perturbation theory is well-known as a computationally inexpensive approach to the electron correlation problem that is size-consistent with a size-consistent reference but fails to be regular. On the other hand, the less well-known many-body version of Brillouin-Wigner perturbation theory has the reverse properties: it is regular but fails to be size-consistent when used with the standard MP partitioning. Consequently, its widespread use remains limited. In this work, we analyze the ways in which it is possible to use alternative non-MP partitions of the Hamiltonian to yield variants of BW2 that are size-consistent as well as regular. We show that there is a vast space of such BW2 theories and also show that it is possible to define a repartitioned BW2 theory from the ground state density alone, which regenerates the exact correlation energy. We also provide a general recipe for deriving regular, size-consistent, and size-extensive partitions from physically meaningful components, and we apply the result to small model systems. The scope of these results appears to further set the stage for a revival of BW2 in quantum chemistry.

Ab initio perturbation↗
DOE OSTI2020

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗