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.

SourceResearch connectionFrom yearThrough year

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

At least 937 records · Page 52

All sources NASA NTRS DOE OSTI

DOE OSTI2015

An efficient tensor transpose algorithm for multicore CPU, Intel Xeon Phi, and NVidia Tesla GPU

An efficient parallel tensor transpose algorithm is suggested for shared-memory computing units, namely, multicore CPU, Intel Xeon Phi, and NVidia GPU. The algorithm operates on dense tensors (multidimensional arrays) and is based on the optimization of cache utilization on x86 CPU and the use of shared memory on NVidia GPU. From the applied side, the ultimate goal is to minimize the overhead encountered in the transformation of tensor contractions into matrix multiplications in computer implementations of advanced methods of quantum many-body theory (e.g., in electronic structure theory and nuclear physics). A particular accent is made on higher-dimensional tensors that typically appear in the so-called multireference correlated methods of electronic structure theory. Depending on tensor dimensionality, the presented optimized algorithms can achieve an order of magnitude speedup on x86 CPUs and 2-3 times speedup on NVidia Tesla K20X GPU with respect to the na ve scattering algorithm (no memory access optimization). Furthermore, the tensor transpose routines developed in this work have been incorporated into a general-purpose tensor algebra library (TAL-SH).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

Precise computer controlled positioning of robot end effectors using force sensors

A major problem in space applications of robotics and docking of spacecraft is the development of technology for automated precise positioning of mating components with smooth motion and soft contact. To achieve the above objective, a design method was developed for optimally placing the closed-loop poles of a discretized robotic control system at exact prescribed locations inside the unit circle of the complex z-plane. The design method combines the merits of the pole placement and the linear quadratic design approaches. The proposed design procedure is based on the assignment of one real eigenvalue or two complex conjugate (or real) eigenvalues at each design step. The method involves solutions of simple algebraic equations and this is considered to be efficient for on-line or off-line computations. Also, two methods for the linearization of the nonlinear model of a robotic manipulator were presented. Since automatic control of multi-degree freedom robotic manipulators involves high nonlinear equations of systems, a pilot project was proposed involving the control of a one-dimensional system. This simple system can be readily implemented for testing the concepts and algorithms.

Shieh, Leang S.↗

DOE OSTI2019

Multistate hybrid time-dependent density functional theory with surface hopping accurately captures ultrafast thymine photodeactivation

We report an efficient analytical implementation of first-order nonadiabatic derivative couplings between arbitrary Born–Oppenheimer states in the hybrid time-dependent density functional theory (TDDFT) framework using atom-centered basis functions. Our scheme is based on quadratic response theory and includes orbital relaxation terms neglected in previous approaches. Simultaneous computation of multiple derivative couplings and energy gradients enables efficient multistate nonadiabatic molecular dynamics simulations in conjunction with Tully's fewest switches surface hopping (SH) method. We benchmark the thus obtained multistate TDDFT-SH scheme by simulating ultrafast decay of UV-photoexcited thymine, for which accurate gas-phase data from ultrafast spectroscopy experiments are available. The calculations predict a fast 153 fs decay from the bright S 2 to the dark S 1 excited state, followed by a much slower 14 ps S 1 deactivation to the ground state; statistical uncertainties were estimated using bootstrap sampling. These results agree well with the experimentally observed time constants of 100–200 fs and 5–7 ps, respectively, unlike previous multiconfigurational self-consistent field and second-order algebraic diagrammatic construction calculations. Furthermore, our results support the S 1 -trapping hypothesis. For thymine, the computational cost of a single TDDFT-SH time-step including the lowest 3 states, all couplings and gradients, is ~5 times larger than the cost of a single Born–Oppenheimer dynamics time step for the ground state in our implementation. Thus, ps nonadiabatic dynamics simulations using multistate hybrid TDDFT-SH for systems with up to ~100 atoms are possible without drastic approximations on single workstation nodes. Our implementation will be made available through Turbomole.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1983

Calculation of a simulated 3-D high speed inlet using the Navier-Stokes equations

A hybrid numerical algorithm, developed to solve the full three-dimensional Navier-Stokes equations, is applied to the computation of the flowfield in a simulated three-dimensional high speed aircraft inlet at a Mach number of 2.5 and Reynolds number of 1.4 x 10 to the 7th based on inlet length. The numerical algorithm incorporates a coordinate transformation in order to handle general flow geometries, and utilizes the algebraic turbulent eddy viscosity model of Baldwin and Lomax. The hybrid algorithm has been vectorized on the CDC CYBER 203 computer using the SL/1 vector programming language developed at NASA Langley. The computed results are compared with experimental measurements of the ramp and cowl static pressures, and boundary layer pitot profiles. The results are also compared with a previous two-dimensional Navier-Stokes computation of the same configuration. The agreement with the experimental data is generally good; however, additional improvements in turbulence modeling are needed.

Knight, D. D.↗

DOE OSTI2024

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗

DOE OSTI2019

A configurational force for adaptive re-meshing of gradient-enhanced poromechanics problems with history-dependent variables

Here, we introduce a mesh-adaption framework that employs a multi-physical configurational force and Lie algebra to capture multiphysical responses of fluid-infiltrating geological materials while maintaining the efficiency of the computational models. To resolve sharp gradients of both displacement and pore pressure, we introduce an energy-estimate-free re-meshing criterion by extending the configurational force theory to consider the energy dissipation due to the fluid diffusion and the gradient-dependent plastic flow. To establish new equilibria after remeshing, the local tensorial history-dependent variables at the integration points are first decomposed into spectral forms. Then, the principal values and directions are projected onto smooth fields interpolated by the basis function of the finite element space via the Lie-algebra mapping. Our numerical results indicate that this Lie algebra operator in general leads to a new trial state closer to the equilibrium than the ones obtained from the tensor component mapping approach. A new configurational force for dissipative fluid-infiltrating porous materials that exhibit gradient-dependent plastic flow is introduced such that the remeshing may accommodate the need to resolve the sharp pressure gradient as well as the strain localization. The predicted responses are found to be not influenced by the mesh size due to the micromorphic regularization, while the adaptive meshing enables us to capture the width of deformation bands without the necessity of employing fine mesh everywhere in the domain.

42 ENGINEERING↗

DOE OSTI2021

CSRI Summer Proceedings 2021

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia National Laboratories for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researches to learn about problems in computer and computational science at DOE laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, algebraic preconditioners, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, validation and verification methods, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers, beyond Moore’s Law computing, exascale computing tools and application design, reduced order and multiscale modeling, parallel input/output, and theoretical computer science. The CSRI Summer Program is organized by CSRI and includes a weekly seminar series and the publication of a summer proceedings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

CSRI Summer Proceedings 2021

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

DOE OSTI2022

Local Noether theorem for quantum lattice systems and topological invariants of gapped states

Here, we study generalizations of the Berry phase for quantum lattice systems in arbitrary dimensions. For a smooth family of gapped ground states in d dimensions, we define a closed d + 2-form on the parameter space, which generalizes the curvature of the Berry connection. Its cohomology class is a topological invariant of the family. When the family is equivariant under the action of a compact Lie group G, topological invariants take values in the equivariant cohomology of the parameter space. These invariants unify and generalize the Hall conductance and the Thouless pump. A key role in these constructions is played by a certain differential graded Fréchet–Lie algebra attached to any quantum lattice system. As a by-product, we describe ambiguities in charge densities and conserved currents for arbitrary lattice systems with rapidly decaying interactions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Unitary circuit synthesis for tomography of generalized coherent states

We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables. Such expectations can be estimated by performing projective measurements on $\mathcal{O}$(M 3 log(M/δ)/ε 2 ) copies of the state, where M is the dimension of an associated Lie algebra, ε is a precision parameter, and 1 - δ is the required confidence level. The method can be implemented on a classical computer and runs in time $\mathcal{O}$(M 4 log(M/ε)). It provides $\mathcal{O}$(Mlog(M/ε)) simple unitaries that form the sequence. The overall complexity is then polynomial in M, being very efficient in cases where M is significantly smaller than the Hilbert space dimension, as for some fermion algebras. When the algebra of relevant observables is given by certain Pauli matrices, each simple unitary may be easily decomposed into two-qubit gates. We discuss applications to efficient quantum state tomography and classical simulations of quantum circuits. $\mathcal{O}$

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1984

User's guide for NASCRIN: A vectorized code for calculating two-dimensional supersonic internal flow fields

A computer program NASCRIN has been developed for analyzing two-dimensional flow fields in high-speed inlets. It solves the two-dimensional Euler or Navier-Stokes equations in conservation form by an explicit, two-step finite-difference method. An explicit-implicit method can also be used at the user's discretion for viscous flow calculations. For turbulent flow, an algebraic, two-layer eddy-viscosity model is used. The code is operational on the CDC CYBER 203 computer system and is highly vectorized to take full advantage of the vector-processing capability of the system. It is highly user oriented and is structured in such a way that for most supersonic flow problems, the user has to make only a few changes. Although the code is primarily written for supersonic internal flow, it can be used with suitable changes in the boundary conditions for a variety of other problems.

Kumar, A.↗

DOE OSTI2013

Annual Report: Carbon Capture Simulation Initiative (CCSI) (30 September 2013)

The Carbon Capture Simulation Initiative (CCSI) is a partnership among national laboratories, industry and academic institutions that is developing and deploying state-of-the-art computational modeling and simulation tools to accelerate the commercialization of carbon capture technologies from discovery to development, demonstration, and ultimately the widespread deployment to hundreds of power plants. The CCSI Toolset will provide end users in industry with a comprehensive, integrated suite of scientifically validated models, with uncertainty quantification (UQ), optimization, risk analysis and decision making capabilities. The CCSI Toolset incorporates commercial and open-source software currently in use by industry and is also developing new software tools as necessary to fill technology gaps identified during execution of the project. Ultimately, the CCSI Toolset will (1) enable promising concepts to be more quickly identified through rapid computational screening of devices and processes; (2) reduce the time to design and troubleshoot new devices and processes; (3) quantify the technical risk in taking technology from laboratory-scale to commercial-scale; and (4) stabilize deployment costs more quickly by replacing some of the physical operational tests with virtual power plant simulations. CCSI is led by the National Energy Technology Laboratory (NETL) and leverages the Department of Energy (DOE) national laboratories’ core strengths in modeling and simulation, bringing together the best capabilities at NETL, Los Alamos National Laboratory (LANL), Lawrence Berkeley National Laboratory (LBNL), Lawrence Livermore National Laboratory (LLNL), and Pacific Northwest National Laboratory (PNNL). The CCSI’s industrial partners provide representation from the power generation industry, equipment manufacturers, technology providers and engineering and construction firms. The CCSI’s academic participants (Carnegie Mellon University, Princeton University, West Virginia University, Boston University and the University of Texas at Austin) bring unparalleled expertise in multiphase flow reactors, combustion, process synthesis and optimization, planning and scheduling, and process control techniques for energy processes. During Fiscal Year (FY) 13, CCSI announced the initial release of its first set of computational tools and models during the October 2012 meeting of its Industry Advisory Board. This initial release led to five companies licensing the CCSI Toolset under a Test and Evaluation Agreement this year. By the end of FY13, the CCSI Technical Team had completed development of an updated suite of computational tools and models. The list below summarizes the new and enhanced toolset components that were released following comprehensive testing during October 2013. 1. FOQUS. Framework for Optimization and Quantification of Uncertainty and Sensitivity. Package includes: FOQUS Graphic User Interface (GUI), simulation-based optimization engine, Turbine Client, and heat integration capabilities. There is also an updated simulation interface and new configuration GUI for connecting Aspen Plus or Aspen Custom Modeler (ACM) simulations to FOQUS and the Turbine Science Gateway. 2. A new MFIX-based Computational Fluid Dynamics (CFD) model to predict particle attrition. 3. A new dynamic reduced model (RM) builder, which generates computationally efficient RMs of the behavior of a dynamic system. 4. A completely re-written version of the algebraic surrogate model builder for optimization (ALAMO). The new version is several orders of magnitude faster than the initial release and eliminates the MATLAB dependency. 5. A new suite of high resolution filtered models for the hydrodynamics associated with horizontal cylindrical objects in a flow path. 6. The new Turbine Science Gateway (Cluster), which supports FOQUS for running multiple simulations for optimization or UQ using a local computer or cluster. 7. A new statistical tool (BSS-ANOVA-UQ) for calibration and validation of CFD models. 8. A new basic data submodel in Aspen Plus format for a representative high viscosity capture solvent, 2-MPZ system. 9. An updated RM tool for CFD (REVEAL) that can create a RM from MFIX. A new lightweight, stand-alone version will be available in late 2013. 10. An updated RM integration tool to convert the RM from REVEAL into a CAPE-OPEN or ACM model for use in a process simulator. 11. An updated suite of unified steady-state and dynamic process models for solid sorbent carbon capture included bubbling fluidized bed and moving bed reactors. 12. An updated and unified set of compressor models including steady-state design point model and dynamic model with surge detection. 13. A new framework for the synthesis and optimization of coal oxycombustion power plants using advanced optimization algorithms. This release focuses on modeling and optimization of a cryogenic air separation unit (ASU). 14. A new technical risk model in spreadsheet format. 15. An updated version of the sorbent kinetic/equilibrium model for parameter estimation for the 1st generation sorbent model. 16. An updated process synthesis superstructure model to determine optimal process configurations utilizing surrogate models from ALAMO for adsorption and regeneration in a solid sorbent process. 17. Validation models for NETL Carbon Capture Unit utilizing sorbent AX. Additional validation models will be available for sorbent 32D in 2014. 18. An updated hollow fiber membrane model and system example for carbon capture. 19. An updated reference power plant model in Thermoflex that includes additional steam extraction and reinjection points to enable heat integration module. 20. An updated financial risk model in spreadsheet format.

01 COAL, LIGNITE, AND PEAT↗

DOE OSTI2021

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1994

Turbulence modeling for separated flow

Two projects are described in this report. The first involves assessing turbulence models in separated flow. The second addresses the anomalous behavior of certain turbulence models in stagnation point flow. The primary motivation for developing turbulent transport models is to provide tools for computing non-equilibrium, or complex, turbulent flows. Simple flows can be analyzed using data correlations or algebraic eddy viscosities, but in more complicated flows such as a massively separated boundary layer, a more elaborate level of modeling is required. It is widely believed that at least a two-equation transport model is required in such cases. The transport equations determine the evolution of suitable velocity and time-scales of the turbulence. The present study included assessment of second-moment closures in several separated flows, including sharp edge separation; smooth wall, pressure driven separation; and unsteady vortex shedding. Flows with mean swirl are of interest for their role in enhancing mixing both by turbulent and mean motion. The swirl can have a stabilizing effect on the turbulence. An axi-symmetric extension to the INS-2D computer program was written adding the capability of computing swirling flow. High swirl can produce vortex breakdown on the centerline of the jet and it occurs in various combustors.

Durbin, Paul A.↗

NASA NTRS2005

Mimicking Natural Laminar to Turbulent Flow Transition: A Systematic CFD Study Using PAB3D

For applied aerodynamic computations using a general purpose Navier-Stokes code, the common practice of treating laminar to turbulent flow transition over a non-slip surface is somewhat arbitrary by either treating the entire flow as turbulent or forcing the flow to undergo transition at given trip locations in the computational domain. In this study, the possibility of using the PAB3D code, standard k-epsilon turbulence model, and the Girimaji explicit algebraic stresses model to mimic natural laminar to turbulent flow transition was explored. The sensitivity of flow transition with respect to two limiters in the standard k-epsilon turbulence model was examined using a flat plate and a 6:1 aspect ratio prolate spheroid for our computations. For the flat plate, a systematic dependence of transition Reynolds number on background turbulence intensity was found. For the prolate spheroid, the transition patterns in the three-dimensional boundary layer at different flow conditions were sensitive to the free stream turbulence viscosity limit, the reference Reynolds number and the angle of attack, but not to background turbulence intensity below a certain threshold value. The computed results showed encouraging agreements with the experimental measurements at the corresponding geometry and flow conditions.

Pao, S. Paul↗

DOE OSTI2017

On the exactness of soft theorems

Soft behaviours of S-matrix for massless theories reflect the underlying symmetry principle that enforces its masslessness. As an expansion in soft momenta, sub-leading soft theorems can arise either due to (I) unique structure of the fundamental vertex or (II) presence of enhanced broken-symmetries. While the former is expected to be modified by infrared or ultraviolet divergences, the latter should remain exact to all orders in perturbation theory. Using current algebra, we clarify such distinction for spontaneously broken (super) Poincaré and (super) conformal symmetry. We compute the UV divergences of DBI, conformal DBI, and A-V theory to verify the exactness of type (II) soft theorems, while type (I) are shown to be broken and the soft-modifying higher-dimensional operators are identified. Moreover, as further evidence for the exactness of type (II) soft theorems, we consider the α' expansion of both super and bosonic open strings amplitudes, and verify the validity of the translation symmetry breaking soft-theorems up to $\mathcal{O}$ (α' 6 ) . Thus the massless S-matrix of string theory “knows” about the presence of D-branes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2016

An inertia-free filter line-search algorithm for large-scale nonlinear programming

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

Chiang, Nai-Yuan↗