Search NASA⌕ Search

SEARCH · Search NASA

Results for “algebraic specification”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Xyce™ Parallel Electronic Simulator Users’ Guide, Version 7.10

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: • Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). This includes support for most popular parallel and serial computers. • A differential-algebraic-equation (DAE) formulation, which better isolates the device model package from solver algorithms. This allows one to develop new types of analysis without requiring the implementation of analysis-specific device models. • Device models that are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). • Object-oriented code design and implementation using modern coding practices. Xyce is a parallel code in the most general sense of the phrase — a message passing parallel implementation — which allows it to run efficiently a wide range of computing platforms. These include serial, shared-memory and distributed-memory parallel platforms. Attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Orders of vanishing and U(1) charges in F-theory

Many interesting questions about F-theory models, including several concerning the F-theory swampland, involve massless matter charged under U(1) gauge symmetries. It is therefore important to better understand the geometric properties of F-theory models realizing various U(1) charges. We propose that, for F-theory models described by elliptic fibrations in Weierstrass form, the U(1) charge of light matter is encoded in the orders of vanishing of the section components corresponding to the U(1) gauge symmetry. We give specific equations relating the U(1) charges to the orders of vanishing that seem to hold for both U(1)-charged singlets and for matter additionally charged under a simply-laced nonabelian gauge algebra. Our formulas correctly describe properties of F-theory models in the prior literature, and we give an argument that they should describe the orders of vanishing for arbitrarily high U(1) charges. They also resemble formulas for the p-adic valuations of elliptic divisibility sequences developed by Stange. These proposals could serve as a U(1) analogue of the Katz-Vafa method, allowing one to determine U(1) charges without resolution. Additionally, they predict geometric information about F-theory models with general U(1) charges, which may be useful for exploring the F-theory landscape and swampland.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

The kinetic origin of the fluid helicity—A symmetry in the kinetic phase space

Helicity, a topological degree that measures the winding and linking of vortex lines, is preserved by ideal (barotropic) fluid dynamics. In the context of the Hamiltonian description, the helicity is a Casimir invariant characterizing a foliation of the associated Poisson manifold. Casimir invariants are special invariants that depend on the Poisson bracket, not on the particular choice of the Hamiltonian. The total mass (or particle number) is another Casimir invariant, whose invariance guarantees the mass (particle) conservation (independent of any specific choice of the Hamiltonian). In a kinetic description (e.g., that of the Vlasov equation), the helicity is no longer an invariant (although the total mass remains a Casimir of the Vlasov’s Poisson algebra). The implication is that some “kinetic effect” can violate the constancy of the helicity. To elucidate how the helicity constraint emerges or submerges, we examine the fluid reduction of the Vlasov system; the fluid (macroscopic) system is a “sub-algebra” of the kinetic (microscopic) Vlasov system. In the Vlasov system, the helicity can be conserved if a special helicity symmetry condition holds. To put it another way, breaking helicity symmetry induces a change in the helicity. We delineate the geometrical meaning of helicity symmetry and show that for a special class of flows (the so-called epi-two-dimensional flows), the helicity symmetry is written as ∂γ = 0 for a coordinate γ of the configuration space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Extending water vapor measurement capability of photon-limited differential absorption lidars through simultaneous denoising and inversion

Abstract. The micropulse differential absorption lidar (MPD) was developed at Montana State University (MSU) and the National Center for Atmospheric Research (NCAR) to perform range-resolved water vapor (WV) measurements using low-power lasers and photon-counting detectors. The MPD has proven to produce accurate WV measurements up to 6 km altitude. However, the MPD's ability to produce accurate higher-altitude WV measurements is impeded by the current standard differential absorption lidar (DIAL) retrieval methods. These methods are built upon a fundamental methodology that algebraically solves for the WV using the MPD forward models and noisy observations, which exacerbates any random noise in the lidar observations. The work in this paper introduces the adapted Poisson total variation (PTV) specifically for the MPD instrument. PTV was originally developed for a ground-based high spectral resolution lidar, and this paper reports on the adaptations that were required in order to apply PTV on MPD WV observations. The adapted PTV method, coined PTV-MPD, extends the maximum altitude of the MPD from 6 to 8 km and substantially increases the accuracy of the WV retrievals starting above 2 km. PTV-MPD achieves the improvement by simultaneously denoising the MPD noisy observations and inferring the WV by separating the random noise from the non-random WV. An analysis with 130 radiosonde (RS) comparisons shows that the relative root-mean-square difference (RRMSE) of WV measurements between RS and PTV-MPD exceeds 100 % between 6 and 8 km, whereas the RRMSE between RS and the standard method exceeds 100 % near 3 km. In addition, we show that by employing PTV-MPD, the MPD is able to extend its useful range of WV estimates beyond that of the ARM Southern Great Plains Raman lidar (RRMSE exceeding 100 % between 3 and 4 km); the Raman lidar has a power-aperture product 500 times greater than that of the MPD.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Machine Learning meets Algebraic Combinatorics: A Suite of Benchmark Datasets to Accelerate AI for Mathematics Research

The use of benchmark datasets has become an important engine of progress in machine learning (ML) over the past 15 years. Recently there has been growing interest in utilizing machine learning to drive advances in research-level mathematics. However, off-the-shelf solutions often fail to deliver the types of insights required by mathematicians. This suggests the need for new ML methods specifically designed with mathematics in mind. The question then is: what benchmarks should the community use to evaluate these? On the one hand, toy problems such as learning the multiplicative structure of small finite groups have become popular in the mechanistic interpretability community whose perspective on explainability aligns well with the needs of mathematicians. While toy datasets are a useful benchmark for initial work, they lack the scale, complexity, and sophistication of many of the principal objects of study in modern mathematics. To address this, we introduce a new collection of benchmark datasets, Algebraic Combinatorics Benchmarks (ACBench), representing either classic or open problems in algebraic combinatorics, a subfield of mathematics that studies discrete structures arising from abstract algebra. After describing the datasets, we discuss the challenges involved in constructing “good” mathematics benchmarks, describe baseline model performance, and discuss some of the insights these datasets can provide that may be of interest even to those who are not interested in mathematics research itself.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Axion domain walls, small instantons, and non-invertible symmetry breaking

Non-invertible global symmetry often predicts degeneracy in axion potentials and carries important information about the global form of the gauge group. When these symmetries are spontaneously broken they can lead to the formation of stable axion domain wall networks which support topological degrees of freedom on their worldvolume. Such non-invertible symmetries can be broken by embedding into appropriate larger UV gauge groups where small instanton contributions lift the vacuum degeneracy, and provide a possible solution to the domain wall problem. We explain these ideas in simple illustrative examples and then apply them to the Standard Model, whose gauge algebra and matter content are consistent with several possible global structures. Each possible global structure leads to different selection rules on the axion couplings, and various UV completions of the Standard Model lead to more specific relations. As a proof of principle, we also present an example of a UV embedding of the Standard Model which can solve the axion domain wall problem. The formation and annihilation of the long-lived axion domain walls can lead to observables, such as gravitational wave signals. Observing such signals, in combination with the axion coupling measurements, can provide valuable insight into the global structure of the Standard Model, as well as its UV completion.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

RadSim: Math, Utility & RTK

This package includes three parts, (1) gov.llnl.math, (2)gov.llnl.utility and (3)gov.llnl.rtk, which are utilized in the development of Radiation Detector Simulator (RadSim) project. RadSim is being developed to provide the capability to: (1) simulate radiation source emissions, (2) interpolate results from radiation transport tools into a common format to prepare incident flux, and (3) model radiation detector response to rapidly produce synthetic radiation measurement templates. RadSim is targeted for open-source release, which will enable researchers and industry partners to model gamma-ray detectors response to simulated flux from the transport tool of their choice. The techniques and implementation will be entirely transparent, which will allow for improvements and boutique modifications by future researchers beyond the lifespan of this specific project. The first tool of the package, gov.llnl.math, includes classes and functions to define and perform basic math operations. Some of the example features available in the package include defining statistical distributions and performing algebra and matrix operations, all of which are already accessible on publicly available software packages such as MATLAB and ROOT. The second package gov.llnl.utility includes tools commonly used to enable optimization and readability of various data structures such as Java lists and external xml files. Lastly, the gov.llnl.rtk package includes classes and functions to implement methods commonly used in radiation physics, such as data structures to represent and characterize photon spectra and tools to apply well-defined and published methods to calibrate a given spectra.

Cheung, Hoi Sing↗
DOE OSTI2024

cppTPSA/pyTPSA: a C++/Python package for truncated power series algebra

The truncated power series algebra (TPSA), also referred to as differential algebra (DA), is a well-established and widely used method in particle accelerator physics and astronomy. The most straightforward usage of TPSA/DA is to calculate the Taylor expansion of a given function at a specific point up to order ?. In recent years, as the application of TPSA/TA has been extended to other fields, a reusable implementation of TPSA/DA as a modern C++ library or other high level programming language like Python has become desirable. The cppTPSA package implements TPSA/DA in C++11 and provides developers a convenient library with which to build advanced TPSA/DA-based methods. A Python 3 library, pyTPSA, has also been developed based on the C++ lib.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

CFT and lattice correlators near an RG domain wall between minimal models

Conformal interfaces separating two conformal field theories (CFTs) provide maps between different CFTs, and naturally exist in nature as domain walls between different phases. One particularly interesting construction of a conformal interface is the renormalization group (RG) domain wall between CFTs. For a given Virasoro minimal model \mathcal{M}_{k+3,k+2} ℳ k + 3 , k + 2 , an RG domain wall can be generated by a specific deformation which triggers an RG flow towards its adjacent Virasoro minimal model \mathcal{M}_{k+2,k+1} ℳ k + 2 , k + 1 with the deformation turned on over part of the space. An algebraic construction of this domain wall was proposed by Gaiotto in [J. High Energy Phys. 12, 103 (2012)]. In this paper, we will provide a study of this RG domain wall for the minimal case k=2 k = 2 , which can be thought of as a nonperturbative check of the construction. In this case the wall is separating the Tricritical Ising Model (TIM) CFT and the Ising Model (IM) CFT. We will check the analytical results of correlation functions from the RG brane construction with the numerical density matrix renormalization group (DMRG) calculation using a lattice model proposed in [arXiv.1206.1332, Science 344, 280 (2014)], and find a perfect agreement. We comment on possible experimental realizations of this RG domain wall.

Cogburn, Cameron V.↗
DOE OSTI2025

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗
DOE OSTI2022

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗
DOE OSTI2023

HYBRID Modeling Validation and Verification Status Matrix

The HYBRID modeling repository is a premier resource for integrated energy systems modeling. HYBRID models have been developed since 2015 to describe the physical operation of tightly coupled thermal systems including power generators, thermal transport systems, thermal storage, thermal-to-electric conversion systems, and other thermal applications. Due to the increased size of the repository, a concise summary matrix of available models is desired. This matrix will consolidate not only the list of available models but also indicate original information sources, publications that have model examples, and level of validation and verification that exists for the models. Validation and verification (V&V) levels begin from simplified algebraic relationship and advance to dynamic data validation. Moving forward, as new models are contributed to HYBRID, their V&V level will be included, updating this matrix.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Reproduced Computational Results Report for “Ginkgo: A Modern Linear Operator Algebra Framework for High Performance Computing”

The article titled “Ginkgo: A Modern Linear Operator Algebra Framework for High Performance Computing” by Anzt et al. presents a modern, linear operator centric, C++ library for sparse linear algebra. Experimental results in the article demonstrate that Ginkgo is a flexible and user-friendly framework capable of achieving high-performance on state-of-the-art GPU architectures. In this report, the Ginkgo library is installed and a subset of the experimental results are reproduced. Specifically, the experiment that shows the achieved memory bandwidth of the Ginkgo Krylov linear solvers on NVIDIA A100 and AMD MI100 GPUs is redone and the results are compared to what presented in the published article. Upon completion of the comparison, the published results are deemed reproducible.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Phenomena-based graph representations and applications to chemical process simulation

Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture the physical phenomena taking place in the process (e.g., material and energy conservation, phase equilibrium, reactions). In this work, we show that graph-theoretic representations of the physical phenomena within unit operations can help navigate and decompose equations to systematically identify alternative approaches for fast and robust numerical solutions. Specifically, we present a graph-theoretic abstraction that captures the connectivity between the model variables/equations and use this abstraction to group variables/equations into fundamental phenomena. We show that phenomena-based decomposition of the underlying equations can help decouple nonlinearities and enforce material/energy conservation at the process level to accelerate convergence. The proposed decomposition approach differs from the more traditional sequential modular simulation approach, in which equations are grouped and decomposed by unit operations. We implemented the phenomena-based decomposition in BioSTEAM—an open-source process simulation platform in Python—and demonstrated that this approach can converge a variety of separation process models. Compared to sequential modular simulation, the phenomena-based approach can converge idealized systems faster, but it can be slower for (or even fail to converge) highly coupled and nonideal process systems.

Convergence↗
DOE OSTI2022

Duality and form factors in the thermally deformed two-dimensional tricritical Ising model

The thermal deformation of the critical point action of the 2D tricritical Ising model gives rise to an exact scattering theory with seven massive excitations based on the exceptional E_7 E 7 Lie algebra. The high and low temperature phases of this model are related by duality. This duality guarantees that the leading and sub-leading magnetisation operators, \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , in either phase are accompanied by associated disorder operators, \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) . Working specifically in the high temperature phase, we write down the sets of bootstrap equations for these four operators. For \sigma(x) σ ( x ) and \sigma'(x) σ ′ ( x ) , the equations are identical in form and are parameterised by the values of the one-particle form factors of the two lightest \mathbb{Z}_2 ℤ 2 odd particles. Similarly, the equations for \mu(x) μ ( x ) and \mu'(x) μ ′ ( x ) have identical form and are parameterised by two elementary form factors. Using the clustering property, we show that these four sets of solutions are eventually not independent; instead, the parameters of the solutions for \sigma(x)/\sigma'(x) σ ( x ) / σ ′ ( x ) are fixed in terms of those for \mu(x)/\mu'(x) μ ( x ) / μ ′ ( x ) . We use the truncated conformal space approach to confirm numerically the derived expressions of the matrix elements as well as the validity of the \Delta Δ -sum rule as applied to the off-critical correlators. We employ the derived form factors of the order and disorder operators to compute the exact dynamical structure factors of the theory, a set of quantities with a rich spectroscopy which may be directly tested in future inelastic neutron or Raman scattering experiments.

Cortes Cubero, Axel↗
DOE OSTI2022

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗