Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

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 667 records · Page 37

Surface defects and chiral algebras

Here, we investigate superconformal surface defects in four-dimensional N = 2 superconformal theories. Each such defect gives rise to a module of the associated chiral algebra and the surface defect Schur index is the character of this module. Various natural chiral algebra operations such as Drinfield-Sokolov reduction and spectral flow can be interpreted as constructions involving four-dimensional surface defects. We compute the index of these defects in the free hypermultiplet theory and Argyres-Douglas theories, using both infrared techniques involving BPS states, as well as renormalization group flows onto Higgs branches. We find perfect agreement with the predicted characters, in each case.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Chapter Six - Derivation, cross-validation, and comparison of analytic formulas for electrostatic deflector aberrations

Here, we derived first and second order analytic aberration formulas in the horizontal transverse plane for an electrostatic deflector specified by the reference orbit radius, the central angle spanning the deflector, and its inhomogeneity coefficients. The derivation was performed using an iterative order-by-order perturbation method in a Frenet–Serret beamline coordinate system. We produced a C program edabrt for calculation of the first and second order aberrations using the formulas that we derived. The electrostatic deflector aberration formulas from Wollnik (1965) disagree with COSY INFINITY and the aberration formulas that we derived here, and they also deviate from the first and second order symplecticity conditions. The reason for this discrepancy is that the aberration formulas from Wollnik (1965) consider only motion in the main field of the deflector and do not properly account for fringe field effects, in particular the necessarily occurring change of kinetic energy due to the change in potential. The code GIOS uses electrostatic aberration formulas from Wollnik (1965) and exhibits the same discrepancy. We performed a comparison of first and second order electrostatic deflector aberrations for (1) the analytic formulas derived in this work, (2) differential-algebraic (DA) numerical integration of the equations of motion using the code COSY INFINITY, (3) the aberration formulas from Wollnik (1965), (4) aberrations computed using the code GIOS, and (5) the aberration formulas from Wollnik (1965) adjusted to account for the occurring change in potential. An electrostatic spherical deflector and an electrostatic cylindrical deflector were used as test cases for this comparison. There is excellent agreement between methods (1), (2), and (5), and these three methods satisfy the first and second order symplecticity conditions.

43 PARTICLE ACCELERATORS↗

Renormalization group computation of likelihood functions for cosmological data sets

I show how a renormalization group (RG) method can be used to incrementally integrate the information in cosmological large-scale structure data sets (including CMB, galaxy redshift surveys, etc.). I show numerical tests for Gaussian fields, where the method allows arbitrarily close to exact computation of the likelihood function in order N time, even for problems with no symmetry, compared to N 3 for brute force linear algebra (where N is the number of data points - to be fair, methods already exist to solve the Gaussian problem in at worst N log N time, and this method will not necessarily be faster in practice). The method requires no sampling or other Monte Carlo (random) element. Nonlinearity/non-Gaussianity can be accounted for to the extent that terms generated by integrating out small scale modes can be projected onto a sufficient basis, e.g., at least in the sufficiently perturbative regime. The formulas to evaluate are straightforward and require no understanding of quantum field theory, but this paper may also serve as a pedagogical introduction to Wilsonian RG for astronomers.

79 ASTRONOMY AND ASTROPHYSICS↗

Simit: A Language for Physical Simulation

With existing programming tools, writing high-performance simulation code is labor intensive and requires sacrificing readability and portability. Here, the alternative is to prototype simulations in a high-level language like Matlab, thereby sacrificing performance. The Matlab programming model naturally describes the behavior of an entire physical system using the language of linear algebra. However, simulations also manipulate individual geometric elements, which are best represented using linked data structures like meshes. Translating between the linked data structures and linear algebra comes at significant cost, both to the programmer and to the machine. High-performance implementations avoid the cost by rephrasing the computation in terms of linked or index data structures, leaving the code complicated and monolithic, often increasing its size by an order of magnitude. In this article, we present Simit, a new language for physical simulations that lets the programmer view the system both as a linked data structure in the form of a hypergraph and as a set of global vectors, matrices, and tensors depending on what is convenient at any given time. Simit provides a novel assembly construct that makes it conceptually easy and computationally efficient to move between the two abstractions. Using the information provided by the assembly construct, the compiler generates efficient in-place computation on the graph. We demonstrate that Simit is easy to use: a Simit program is typically shorter than a Matlab program; that it is high performance: a Simit program running sequentially on a CPU performs comparably to hand-optimized simulations; and that it is portable: Simit programs can be compiled for GPUs with no change to the program, delivering 4 to 20× speedups over our optimized CPU code.

97 MATHEMATICS AND COMPUTING↗

Batched sparse direct solver design and evaluation in SuperLU_DIST

Over the course of interactions with various application teams, the need for batched sparse linear algebra functions has emerged in order to make more efficient use of the GPUs for many small and sparse linear algebra problems. In this paper, we present our recent work on a batched sparse direct solver for GPUs. The sparse LU factorization is computed by the levels of the elimination tree, leveraging the batched dense operations at each level and a new batched Scatter GPU kernel. The sparse triangular solve is computed by the level sets of the directed acyclic graph (DAG) of the triangular matrix. Batched operations overcome the large overhead associated with launching many small kernels. For medium sized matrix batches with not-so-small bandwidth, using an NVIDIA A100 GPU, our new batched sparse direct solver is orders of magnitude faster than a batched banded solver and uses less than one-tenth of the memory.

Boukaram, Wajih↗

DAGSENS: Directed Acyclic Graph Based Direct and Adjoint Transient Sensitivity Analysis for Event-Driven Objective Functions

We present DAGSENS, a new theory for parametric transient sensitivity analysis of Differential Algebraic Equation systems (DAEs), such as SPICE-level circuits. The key ideas behind DAGSENS are, (1) to represent the entire sequence of computations, starting from DAE parameters, all the way up to the objective function whose sensitivity is needed, as a Directed Acyclic Graph (DAG) called the "sensitivity DAG", and (2) to compute the required sensitivities efficiently (with time complexity linear in the size of the sensitivity DAG) by leveraging dynamic programming techniques to traverse the DAG. DAGSENS is simple, elegant, and easy-to-understand compared to existing sensitivity analysis approaches; for example, in DAGSENS, one can switch between direct and adjoint transient sensitivities just by changing the direction of DAG traversal (i.e., topological order vs. reverse topological order). Also, DAGSENS is significantly more powerful than existing sensitivity analysis approaches because it allows one to compute the sensitivities of a much more general class of objective functions, including those defined based on "events" that occur during a transient simulation (e.g., a node voltage crossing a particular threshold, a phase-locked loop (PLL) achieving lock, a signal reaching its maximum/minimum value during a transient run, etc.). In this paper, we apply DAGSENS to compute the sensitivities of important event-driven performance metrics in several real-world electronic and biological applications, including high-speed communication (featuring sub-systems such as I/0 links and PLLs), statistical cell library characterization, and gene expression in Drosophila embryos.

42 ENGINEERING↗

Radiation dose reduction in medical x-ray CT via Fourier-based iterative reconstruction

Purpose: A Fourier-based iterative reconstruction technique, termed Equally Sloped Tomography (EST), is developed in conjunction with advanced mathematical regularization to investigate radiation dose reduction in x-ray CT. The method is experimentally implemented on fan-beam CT and evaluated as a function of imaging dose on a series of image quality phantoms and anonymous pediatric patient data sets. Numerical simulation experiments are also performed to explore the extension of EST to helical cone-beam geometry. Methods: EST is a Fourier based iterative algorithm, which iterates back and forth between real and Fourier space utilizing the algebraically exact pseudopolar fast Fourier transform (PPFFT). In each iteration, physical constraints and mathematical regularization are applied in real space, while the measured data are enforced in Fourier space. The algorithm is automatically terminated when a proposed termination criterion is met. Experimentally, fan-beam projections were acquired by the Siemens z-flying focal spot technology, and subsequently interleaved and rebinned to a pseudopolar grid. Image quality phantoms were scanned at systematically varied mAs settings, reconstructed by EST and conventional reconstruction methods such as filtered back projection (FBP), and quantified using metrics including resolution, signal-to-noise ratios (SNRs), and contrast-to-noise ratios (CNRs). Pediatric data sets were reconstructed at their original acquisition settings and additionally simulated to lower dose settings for comparison and evaluation of the potential for radiation dose reduction. Numerical experiments were conducted to quantify EST and other iterative methods in terms of image quality and computation time. The extension of EST to helical cone-beam CT was implemented by using the advanced single-slice rebinning (ASSR) method. Results: Based on the phantom and pediatric patient fan-beam CT data, it is demonstrated that EST reconstructions with the lowest scanner flux setting of 39 mAs produce comparable image quality, resolution, and contrast relative to FBP with the 140 mAs flux setting. Compared to the algebraic reconstruction technique and the expectation maximization statistical reconstruction algorithm, a significant reduction in computation time is achieved with EST. Finally, numerical experiments on helical cone-beam CT data suggest that the combination of EST and ASSR produces reconstructions with higher image quality and lower noise than the Feldkamp Davis and Kress (FDK) method and the conventional ASSR approach. Conclusions: A Fourier-based iterative method has been applied to the reconstruction of fan-bean CT data with reduced x-ray fluence. This method incorporates advantageous features in both real and Fourier space iterative schemes: using a fast and algebraically exact method to calculate forward projection, enforcing the measured data in Fourier space, and applying physical constraints and flexible regularization in real space. Our results suggest that EST can be utilized for radiation dose reduction in x-ray CT via the readily implementable technique of lowering mAs settings. Numerical experiments further indicate that EST requires less computation time than several other iterative algorithms and can, in principle, be extended to helical cone-beam geometry in combination with the ASSR method.

60 APPLIED LIFE SCIENCES↗

Dynamic Analysis Methods for Detecting Anomalies in Asynchronously Interacting Systems

Detecting modifications to digital system designs, whether malicious or benign, is problematic due to the complexity of the systems being analyzed. Moreover, static analysis techniques and tools can only be used during the initial design and implementation phases to verify safety and liveness properties. It is computationally intractable to guarantee that any previously verified properties still hold after a system, or even a single component, has been produced by a third-party manufacturer. In this paper we explore new approaches for creating a robust system design by investigating highly-structured computational models that simplify verification and analysis. Our approach avoids the need to fully reconstruct the implemented system by incorporating a small verification component that dynamically detects for deviations from the design specification at run-time. The first approach encodes information extracted from the original system design algebraically into a verification component. During run-time this component randomly queries the implementation for trace information and verifies that no design-level properties have been violated. If any deviation is detected then a pre-specified fail-safe or notification behavior is triggered. Our second approach utilizes a partitioning methodology to view liveness and safety properties as a distributed decision task and the implementation as a proposed protocol that solves this task. Thus the problem of verifying safety and liveness properties is translated to that of verifying that the implementation solves the associated decision task. We develop upon results from distributed systems and algebraic topology to construct a learning mechanism for verifying safety and liveness properties from samples of run-time executions.

97 MATHEMATICS AND COMPUTING↗

Functional methods for Heavy Quark Effective Theory

We use functional methods to compute one-loop effects in Heavy Quark Effective Theory. The covariant derivative expansion technique facilitates the efficient extraction of matching coefficients and renormalization group evolution equations. This paper pro- vides the first demonstration that such calculations can be performed through the algebraic evaluation of the path integral for the class of effective field theories that are (i) constructed using a non-trivial one-to-many mode decomposition of the UV theory, and (ii) valid for non-relativistic kinematics. We discuss the interplay between operators that appear at intermediate steps and the constraints imposed by the residual Lorentz symmetry that is encoded as reparameterization invariance within the effective description. The tools presented here provide a systematic approach for computing corrections to higher order in the heavy mass expansion; precision applications include predictions for experimental data and connections to theoretical tests via lattice QCD. A set of pedagogical appendices comprehensively reviews modern approaches to performing functional calculations algebraically, and derives contributions from a term with open covariant derivatives for the first time.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ROM-Based Surrogate Systems Modeling of EBR-II

We report the System Analysis Module (SAM), developed and maintained by Argonne National Laboratory, is designed to provide whole-plant transient safety analysis capabilities for a number of advanced non-light water reactors, including sodium-cooled fast reactor (SFR), lead-cooled fast reactor (LFR), and molten salt reactor (MSR)/fluoride-salt-cooled high-temperature reactor (FHR) designs. SAM is primarily constructed as a systems-level analysis tool, with the potential to incorporate reduced order models from three-dimensional computational fluid dynamics (CFD) simulations to improve characterization of complex, multidimensional physics. It is recognized that the computational expense associated with CFD can be intractable for various engineering analyses, such as uncertainty quantification, inference, and design optimization. This paper explores the reducibility of a SAM model using recent advances in randomized linear algebra techniques, which attempt to find recurring patterns in the various realizations generated by a model after randomly perturbing all its input parameters. The reduction is described in terms of fewer degrees of freedom (DOFs), referred to as the active DOFs, for the model variables such as input model parameters and model responses. The results indicate that there is significant room for additional reduction that may be leveraged for additional computational gains when employing SAM for engineering-intensive analyses that require repeated model executions. Different from physics-based reduction approaches, the proposed approach allows one to estimate upper bounds on the reduction errors, which are rigorously developed in this work. Finally, different methods for surrogate model construction, such as regression and neural network-based training, are employed to correlate the input and output active DOFs, which are related back to the original variables using matrix-based linear transformations.

42 ENGINEERING↗

A simple and effective five-equation two-phase numerical model for liquid-vapor phase transition in cavitating flows

Numerical difficulties, notably the non-monotonic behavior of the Wood speed of sound and the volume fraction positivity, associated with the reduced five-equation two-phase flow model of Kapila et al. (2001) [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, 2001. Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10), 3002–3024] have been resolved in the past through the introduction of a frozen speed of sound and an algebraic approach for mechanical relaxation afforded by a pressure non-equilibrium six-equation model proposed by [R. Saurel, F. Petitpas, R.A. Berry, 2009. Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixture, J. Comput. Phys. 228, 1678–1712]. By contrast, it is explored and demonstrated in this work that these difficulties can in fact still be resolved within the numerical scheme for solving the reduced five-equation model by numerically replacing the Wood speed of sound for the estimates of wave speeds in the approximate Riemann solver HLLC with the monotonic mixture speed of sound for a transport five-equation model. For shock interface (artificial mixture separating pure or nearly pure fluids) interaction problems, with the apparent advantage of monotonic behavior of the speed of sound in the interface, the effect of the numerical replacement is also confined to the interface. Differences other than the behavior of the speed of sound within the interface in the solutions due to the replacement diminish with increasing resolution when reasonable solution can be obtained with Wood speed of sound. For cavitating/expansion problems in physical fluid mixture, it is pointed out and explained why acoustics in the numerical solutions still propagate at the Wood speed of sound (therefore consistent with the reduced five-equation model) even though in some cases a much higher speed of sound like the numerical replacement above for solving the reduced five-equation model or the frozen speed of sound for solving a six-equation model is used for the estimates of wave speeds in the HLLC scheme. A variant of the five-equation two-phase flow model by Saurel et al. (2008) [R. Saurel, F. Petitpas, R. Abgrall, 2008. Modelling phase transition in metastable liquids: application to cavitating and flashing flows, J. Fluid Mech. 607, 313–350] is then constructed for liquid-vapor phase transition in cavitating flows. The relaxation toward thermo-chemical equilibrium during phase transition is achieved by solving a simple system of algebraic equations for the equilibrium state variables for better efficiency, following Pelanti and Shyue (2014) [M. Pelanti, K.-M. Shyue, 2014. A mixture-energy-consistent six-equation two-phase numerical model for fluid with interfaces, cavitation and evaporation waves. J. Comput. Phys. 259, 331–357]. Therefore, the current model retains both the simplicity afforded by the five-equation model and the efficiency of the algebraic relaxation solver. An alternative algebraic approach for handling the non-conservative term (the so-called K∇ · u term) in the reduced five-equation model for mechanical equilibrium of a liquid-vapor mixture is also explored by enforcing the thermal equilibrium at the same time. Finally, numerical results of sample tests in both one and two dimensions in the literature as well as that in three dimensions demonstrate the effectiveness and ability of the proposed model to simulate cavitating flows. An interesting mechanism of shock generation by acoustics in water due to phase transition is then found by the numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation

We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure factors. When the generators have large norm with respect to the dimension of the Lie algebra, or when the norm of the effective operator resulting from nested commutators is less than the product of the norms, the number of terms in the product is significantly less than that obtained from well-known results. We apply our results to construct product formulas useful for the quantum simulation of some continuous-variable and bosonic physical systems, including systems whose potential is not quadratic. For many of these systems, we show that the number of terms in the product can be sublinear or even subpolynomial in the dimension of the relevant local Hilbert spaces, where such a dimension is usually determined by the energy scale of the problem. Our results emphasize the power of quantum computers for the simulation of various quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine learning for nonintrusive model order reduction of the parametric inviscid transonic flow past an airfoil

Fluid flow in the transonic regime finds relevance in aerospace engineering, particularly in the design of commercial air transportation vehicles. Computational fluid dynamics models of transonic flow for aerospace applications are computationally expensive to solve because of the high degrees of freedom as well as the coupled nature of the conservation laws. While these issues pose a bottleneck for the use of such models in aerospace design, computational costs can be significantly minimized by constructing special, structure-preserving surrogate models called reduced-order models. In this work, we propose a machine learning method to construct reduced-order models via deep neural networks and we demonstrate its ability to preserve accuracy with a significantly lower computational cost. In addition, our machine learning methodology is physics-informed and constrained through the utilization of an interpretable encoding by way of proper orthogonal decomposition. Application to the inviscid transonic flow past the RAE2822 airfoil under varying freestream Mach numbers and angles of attack, as well as airfoil shape parameters with a deforming mesh, shows that the proposed approach adapts to high-dimensional parameter variation well. Notably, the proposed framework precludes the knowledge of numerical operators utilized in the data generation phase, thereby demonstrating its potential utility in the fast exploration of design space for diverse engineering applications. Comparison against a projection-based nonintrusive model order reduction method demonstrates that the proposed approach produces comparable accuracy and yet is orders of magnitude computationally cheap to evaluate, despite being agnostic to the physics of the problem.

97 MATHEMATICS AND COMPUTING↗

Dynamic mode decomposition with core sketch

With the increase in collected data volumes, either from experimental measurements or high fidelity simulations, there is an ever-growing need to develop computationally efficient tools to process, analyze, and interpret these datasets. Modal analysis techniques have gained great interest due to their ability to identify patterns in the data and extract valuable information about the system being considered. Dynamic mode decomposition (DMD) relies on elements of the Koopman approximation theory to compute a set of modes, each associated with a fixed oscillation frequency and a decay/growth rate. Extracting these details from large datasets can be computationally expensive due to the need to implement singular value decomposition of the input data matrix. Sketching algorithms have become popular in numerical linear algebra where statistical theoretic approaches are utilized to reduce the cost of major operations. A sketch of a matrix is another matrix, which is significantly smaller, but still sufficiently approximates the original system. We put forth an efficient DMD framework, SketchyDMD, based on a core sketching algorithm that captures information about the range and corange (their mutual relationship) of input data. The proposed sketching-based framework can accelerate various portions of the DMD routines, compared to classical methods that operate directly on the raw input data. We conduct numerical experiments using the spherical shallow water equations as a prototypical model in the context of geophysical flows. In conclusion, we show that the proposed SketchyDMD is superior to existing randomized DMD methods that are based on capturing only the range of the input data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Optimization Methods for Distribution Networks With High PV Integration

Here this paper proposes a suite of algorithms to determine the active- and reactive-power setpoints for photovoltaic (PV) inverters in distribution networks. The objective is to optimize the operation of the distribution feeder according to a variety of performance objectives and ensure voltage regulation. In general, these algorithms take a form of the widely studied ac optimal power flow (OPF) problem. For the envisioned application domain, nonlinear power-flow constraints render pertinent OPF problems nonconvex and computationally intensive for large systems. To address these concerns, we formulate a quadratic constrained quadratic program (QCQP) by leveraging a linear approximation of the algebraic power-flow equations. Furthermore, simplification from QCQP to a linearly constrained quadratic program is provided under certain conditions. The merits of the proposed approach are demonstrated with simulation results that utilize realistic PV-generation and load-profile data for illustrative distribution-system test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A real signal and its states

The paper describes the general physical theory of signals, carriers of information, which supplements Shannon’s abstract classical theory and is applicable in much broader fields, including nuclear physics. It is shown that in the absence of classical noise its place should be taken by the physical threshold of signal perception for objects of both macrocosm and microcosm. The signal perception threshold allows the presence of subthreshold (virtual) signal states. For these states, Boolean algebra of logic (A = 0/1) is transformed into the “algebraic logic” of probabilities (0 ≤ a ≤ 1). The similarity and difference of virtual states of macroand microsignals are elucidated. “Real” and “quantum” information for computers is considered briefly. The maximum information transmission rate is estimated based on physical constants.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

PyMTensor 1.0.0

SAND2021-1654 O The Python Material Tensor code (PyMTensor) applies crystal symmetries to arbitrary material tensors. It uses symbolic algebra to exactly determine the zero tensor components and the relationships between the nonzero components for all crystallographic point groups. It is capable of computing components of higher-order material tensors needed when treating nonlinear effects. It has a simple and flexible interface for inputting tensor rank information and any known symmetries between tensor indices.Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Jensen, DanielS↗