Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple iterations”

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

Open Source Software Prevalence Ingest Tool

The OSSP Ingest Tool accepts user-input organizational information, ingests IT/OT asset lists in Excel format, and ingests the associated CycloneDX SBOM's. It then performs analytics demonstrating the ability to answer the follow research questions: o RQ1. Ability to identify all OSS services running on, and all OSS components present within, an OT device o RQ1a: Ability to differentiate multiple versions of the same OSS component within each OT device. o RQ1b: Ability to differentiate running from not-running OSS components. o RQ1c: Ability to differentiate based on the originator of the component, because a supplier may have modified it after retrieval from the upstream software source. o RQ2. Ability to correlate the identity of a single OSS component across multiple OT devices, mitigating common name variations such as differences in capitalization, '-' vs '_', and so on. o RQ3. Ability to perform subset analysis of OSS components across multiple OT devices o RQ3a: Ability to perform subset analysis across OSS libraries, generating density & distribution graphs to identify commonly-used libraries and outliers. o RQ3b: Ability to perform subset analysis of a single OSS library, generating density & distribution by CI sector, by device type, by device make/model, and/or by firmware version. o RQ3c: Ability to perform subset analysis by grouping OSS libraries according to programming language, then overlay with RQ4b. o RQ3d: Ability to perform subset analysis by OSS upstream source, providing insight into degree of modifications performed by suppliers. o RQ4. Ability to identify dependencies (transitive and direct) of each differentiated OSS library within each OT device, and enable RQ1,2,3 iteratively for dependencies. o RQ1. Ability to identify all OSS services running on, and all OSS components present within, an OT device o RQ1a: Ability to differentiate multiple versions of the same OSS component within each OT device. o RQ1b: Ability Page

Kapadia, Shayna [Lawrence Livermore National Labor↗
DOE OSTI2024

Impacts of photovoltaic solar energy on soil carbon: A global systematic review and framework

Globally, solar energy is anticipated to be the primary source of electricity as early as 2050, and the greatest additions in capacity are currently in the form of large, ground-mounted photovoltaic solar energy facilities (GPVs). Growing interest lies in understanding and anticipating opportunities to increase soil carbon sequestration across the footprint and perimeter of both conventional and multi-use GPVs (e.g., ecovoltaics, agrivoltaics, and rangevolatics), especially as operators increasingly deputize as land managers. To date, studies on the relationship between soils and PV solar energy are limited to unique, localized sites. This study employed a systematic review to (i) identify a global corpus of 18 studies on interactions between GPVs and soils, (ii) collect and characterize 113 soil and soil-related experimental variables interacting with GPVs from this corpus, and (iii) synthesize trends among these experimental variables. Next, this study combined data from the systematic review with an iterative, knowledge co-production approach to produce a conceptual model for the study of soil and GPV interactions that applies to multiple installation types, scales, and contexts where GPVs are deployed, and identified research opportunities, threats, and priorities. This study's baseline understanding, conceptual model, and co-produced knowledge confer unique insight into the feasibility of combining soil carbon sequestration with the climate change mitigation potential of PV solar energy.

agrivoltaics↗
DOE OSTI2024

Enabling dynamic 3D coherent diffraction imaging via adaptive latent space tuning of generative autoencoders

Abstract Coherent diffraction imaging (CDI) is an advanced non-destructive 3D X-ray imaging technique for measuring a sample’s electron density. The main challenge of CDI is loss of phase information in diffraction intensity measurements, resulting in lengthy iterative reconstruction processes that can return non-unique solutions, which pose challenges for experiments attempting to track dynamic sample evolution through multiple states. As the increased brightness of fourth-generation light sources enables faster sample measurements and drives operando experiments with Bragg CDI, there is a growing need for faster reconstruction techniques that can keep pace. We have developed an adaptive generative autoencoder approach for uniquely tracking a sample’s electron density as it dynamically evolves. Our approach adaptively tunes the low-dimensional latent embedding of a generative autoencoder, enabling a computationally efficient manner to account for time-varying shifting distributions in real-time. Analytic proof of convergence is provided as well as numerical demonstration of sample tracking with noisy measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Prediction of Dielectric Constant in Series of Polymers by Quantitative Structure-Property Relationship (QSPR)

This work is devoted to the investigation of dielectric permittivity which is influenced by electronic, ionic, and dipolar polarization mechanisms, contributing to the material’s capacity to store electrical energy. In this study, an extended dataset of 86 polymers was analyzed, and two quantitative structure–property relationship (QSPR) models were developed to predict dielectric permittivity. From an initial set of 1273 descriptors, the most relevant ones were selected using a genetic algorithm, and machine learning models were built using the Gradient Boosting Regressor (GBR). In contrast to Multiple Linear Regression (MLR)- and Partial Least Squares (PLS)-based models, the gradient boosting models excel in handling nonlinear relationships and multicollinearity, iteratively optimizing decision trees to improve accuracy without overfitting. The developed GBR models showed high R2 coefficients of 0.938 and 0.822, for the training and test sets, respectively. An Accumulated Local Effect (ALE) technique was applied to assess the relationship between the selected descriptors—eight for the GB_A model and six for the GB_B model, and their impact on target property. ALE analysis revealed that descriptors such as TDB09m had a strong positive effect on permittivity, while MLOGP2 showed a negative effect. These results highlight the effectiveness of the GBR approach in predicting the dielectric properties of polymers, offering improved accuracy and interpretability.

Ascencio-Medina, Estefania↗
NASA NTRS1976

Electrostatic analysis of charge-coupled structures

An analysis is presented which is based upon a numerical solution of Gauss's law for the multiple dielectric semiconductor and electrode structure. The formulation resulted in a large set of equations, usually nonlinear, which were solved by an iterative scheme based upon the Gauss-Seidel method employing a relaxation parameter. Proper consideration of the nonlinearity of the space-charge in the semiconductor allowed convergent solutions which can give reasonable approximations to the channel potential profiles though not as good for estimating the space charge itself. The results of this work, which are three computer programs, are listed. None of the programs give the electric field explicitly as output data. However, when this information is desired, the programs can be expanded to include field estimations based on a polynominal fit to the potential field, or they may serve as subprograms for main programs dealing with general aspects of charge transfer.

Gassaway, J. D.↗
DOE OSTI2022

Particulate Fuel Modeling of MC 2 -3 using Iterative Local Spatial Self-shielding Method

We report a new spatial self-shielding method for particulate fuels has been developed based on disadvantage factors and implemented in the MC 2 -3 code. This method named the iterative local spatial self-shielding (ILSS) method considers the shadowing effect of randomly distributed particles on spatial self-shielding in particles through a homogenized composition region added outside the particle of interest at the center. The self-shielded cross sections of the central particle are determined iteratively since they are used in determining the cross sections of the homogenized composition region. The ILSS method was verified for infinite stochastic medium problems of single and multiple types of particles, VHTR unit cell problems, and HTTR assembly problems. The verification test results show that the ILSS method accurately predicts the stochastic particle shadowing effect and reaction rates in particles, whereas the regular array model and the stochastic collision probability method underpredict the particle shadowing effect and overestimate reaction rates in particles.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass-or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood---allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS2017

Gravity-Assist Trajectories to the Ice Giants: An Automated Method to Catalog Mass- Or Time-Optimal Solutions

This work presents an automated method of calculating mass (or time) optimal gravity-assist trajectories without a priori knowledge of the flyby-body combination. Since gravity assists are particularly crucial for reaching the outer Solar System, we use the Ice Giants, Uranus and Neptune, as example destinations for this work. Catalogs are also provided that list the most attractive trajectories found over launch dates ranging from 2024 to 2038. The tool developed to implement this method, called the Python EMTG Automated Trade Study Application (PEATSA), iteratively runs the Evolutionary Mission Trajectory Generator (EMTG), a NASA Goddard Space Flight Center in-house trajectory optimization tool. EMTG finds gravity-assist trajectories with impulsive maneuvers using a multiple-shooting structure along with stochastic methods (such as monotonic basin hopping) and may be run with or without an initial guess provided. PEATSA runs instances of EMTG in parallel over a grid of launch dates. After each set of runs completes, the best results within a neighborhood of launch dates are used to seed all other cases in that neighborhood-allowing the solutions across the range of launch dates to improve over each iteration. The results here are compared against trajectories found using a grid-search technique, and PEATSA is found to outperform the grid-search results for most launch years considered.

Hughes, Kyle M.↗
NASA NTRS1993

A global approach to kinematic path planning to robots with holonomic and nonholonomic constraints

Robots in applications may be subject to holonomic or nonholonomic constraints. Examples of holonomic constraints include a manipulator constrained through the contact with the environment, e.g., inserting a part, turning a crank, etc., and multiple manipulators constrained through a common payload. Examples of nonholonomic constraints include no-slip constraints on mobile robot wheels, local normal rotation constraints for soft finger and rolling contacts in grasping, and conservation of angular momentum of in-orbit space robots. The above examples all involve equality constraints; in applications, there are usually additional inequality constraints such as robot joint limits, self collision and environment collision avoidance constraints, steering angle constraints in mobile robots, etc. The problem of finding a kinematically feasible path that satisfies a given set of holonomic and nonholonomic constraints, of both equality and inequality types is addressed. The path planning problem is first posed as a finite time nonlinear control problem. This problem is subsequently transformed to a static root finding problem in an augmented space which can then be iteratively solved. The algorithm has shown promising results in planning feasible paths for redundant arms satisfying Cartesian path following and goal endpoint specifications, and mobile vehicles with multiple trailers. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima.

Divelbiss, Adam↗
DOE OSTI2022

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Expert‐in‐the‐loop design of integral nuclear data experiments

Abstract Nuclear data are fundamental inputs to radiation transport codes used for reactor design and criticality safety. The design of experiments to reduce nuclear data uncertainty has been a challenge for many years, but advances in the sensitivity calculations of radiation transport codes within the last two decades have made optimal experimental design possible. The design of integral nuclear experiments poses numerous challenges not emphasized in classical optimal design, in particular, constrained design spaces (in both a statistical and engineering sense), severely under‐determined systems, and optimality uncertainty. We present a design pipeline to optimize critical experiments that uses constrained Bayesian optimization within an iterative expert‐in‐the‐loop framework. We show a successfully completed experiment campaign designed with this framework that involved two critical configurations and multiple measurements that targeted compensating errors in 239 Pu nuclear data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Building bases of loop integrands

We describe a systematic approach to the construction of loop-integrand bases at arbitrary loop-order, sufficient for the representation of general quantum field theories. We provide a graph-theoretic definition of ‘power-counting’ for multi-loop integrands beyond the planar limit, and show how this can be used to organize bases according to ultraviolet behavior. This allows amplitude integrands to be constructed iteratively. We illustrate these ideas with concrete applications. In particular, we describe complete integrand bases at two loops sufficient to represent arbitrary-multiplicity amplitudes in four (or fewer) dimensions in any massless quantum field theory with the ultraviolet behavior of the Standard Model or better. We also comment on possible extensions of our framework to arbitrary (including regulated) numbers of dimensions, and to theories with arbitrary mass spectra and charges. At three loops, we describe a basis sufficient to capture all ‘leading-(transcendental-)weight’ contributions of any four-dimensional quantum theory; for maximally supersymmetric Yang-Mills theory, this basis should be sufficient to represent all scattering amplitude integrands in the theory — for generic helicities and arbitrary multiplicity.

1/NExpansion↗
DOE OSTI2021

Inversion of dynamical Bragg intensities to complex structure factors by iterated projections. For Ultramic. 2020. ("Pico" Festschrift, May 2021)

We discuss a method for recovering complex structure factors from many simultaneously excited Bragg beam intensities is described. The method is applied to simulated transmission electron diffraction data over a wide range of crystal thickness and beam energies. The method is based on iterated projections between structure and scattering matrices, which are related by a matrix unitary transformation, exponential, which we invert. The algorithm removes multiple-scattering perturbations from diffraction data and might be extended to other fields, including X-ray and neutron diffraction and cryo-electron microscopy. Because coherent multiple scattering involves interference between Bragg beams, the method also solves the phase problem. Unlike dynamical inversion from electron microscope images or ptychography data, the method, which starts with Bragg beam intensities, provides complex structure factors unaffected by focusing errors or resolution limitations imposed by lenses. We provide inversions from simulated data with 441 simultaneously excited Bragg beams over a range of thickness and beam energy. We discuss the retrieval of chirality information from enantiomorphs, the efficient incorporation of symmetry information using the irreducible representation of the group of structure matrices, and the effect of HOLZ lines to provide three-dimensional information.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Solving the electronic structure problem for over 100000 atoms in real space

Using a real-space high-order finite-difference approach, we investigate the electronic structure of large spherical silicon nanoclusters. Within Kohn-Sham density functional theory and using pseudopotentials, we report the self-consistent field convergence of a system with over 100000 atoms: a Si 107,641 ⁢H 9,084 nanocluster with a diameter of 16 nm. Our approach uses Chebyshev-filtered subspace iteration to speed up the convergence of the eigenspace, and blockwise Hilbert space-filling curves to speed up sparse matrix-vector multiplications, all of which are implemented in the parsec code. For the largest system, we utilized 2048 nodes (114 688 cores) on the Frontera machine in the Texas Advanced Computing Center. Our quantitative analysis of the electronic structure shows how it gradually approaches its bulk counterpart as a function of nanocluster size. The band gap is enlarged due to quantum confinement in nanoclusters, but decreases as the system size increases, as expected. In conclusion, our work serves as a proof of concept for the capacity of the real-space approach in efficiently parallelizing very large calculations using high-performance computer platforms, which can straightforwardly be replicated in other systems with more than 10 5 atoms.

0-dimensional systems↗
NASA NTRS1992

Learning to improve iterative repair scheduling

This paper presents a general learning method for dynamically selecting between repair heuristics in an iterative repair scheduling system. The system employs a version of explanation-based learning called Plausible Explanation-Based Learning (PEBL) that uses multiple examples to confirm conjectured explanations. The basic approach is to conjecture contradictions between a heuristic and statistics that measure the quality of the heuristic. When these contradictions are confirmed, a different heuristic is selected. To motivate the utility of this approach we present an empirical evaluation of the performance of a scheduling system with respect to two different repair strategies. We show that the scheduler that learns to choose between the heuristics outperforms the same scheduler with any one of two heuristics alone.

Zweben, Monte↗
NASA NTRS2012

Design and Parametric Sizing of Deep Space Habitats Supporting NASA'S Human Space Flight Architecture Team

NASA's Human Space Flight Architecture Team (HAT) is a multi-disciplinary, cross-agency study team that conducts strategic analysis of integrated development approaches for human and robotic space exploration architectures. During each analysis cycle, HAT iterates and refines the definition of design reference missions (DRMs), which inform the definition of a set of integrated capabilities required to explore multiple destinations. An important capability identified in this capability-driven approach is habitation, which is necessary for crewmembers to live and work effectively during long duration transits to and operations at exploration destinations beyond Low Earth Orbit (LEO). This capability is captured by an element referred to as the Deep Space Habitat (DSH), which provides all equipment and resources for the functions required to support crew safety, health, and work including: life support, food preparation, waste management, sleep quarters, and housekeeping.The purpose of this paper is to describe the design of the DSH capable of supporting crew during exploration missions. First, the paper describes the functionality required in a DSH to support the HAT defined exploration missions, the parameters affecting its design, and the assumptions used in the sizing of the habitat. Then, the process used for arriving at parametric sizing estimates to support additional HAT analyses is detailed. Finally, results from the HAT Cycle C DSH sizing are presented followed by a brief description of the remaining design trades and technological advancements necessary to enable the exploration habitation capability.

Toups, Larry↗
NASA NTRSDate not supplied

Generalized Linear Targeting For Cislunar Flight

An important element of Artemis and NASA’s campaign to explore the Moon is the autonomous onboard two-level targeter (TLT) used during all cislunar flight phases. The function of the TLT is to autonomously recompute the burn targets for the upcoming burn (or multiple burns) in response to navigation and vehicle dispersion providing a solution that meets all of the trajectory constraints. Although the TLT has been utilized previously as a ground-based planning tool, and flown onboard during the Artemis I mission, it’s complexity and iterative nature make is difficult to incorporate into and support rapid analyses such as robust optimal trajectory design applications where speed is essential. In this paper, a set of generalized linear targeting algorithms that mimics many of the properties of the TLT is derived. The generalized algorithms can handle single or multiple impulsive maneuvers, with multiple constraints at multiple fixed or variable times. A linear targeting algorithm for finite burn maneuvers is also derived. The generalized linear targeting algorithms are exceptionally fast and easy to implement in Monte Carlo analysis, linear covariance (LinCov) analysis, and robust optimal trajectory design. Several cislunar flight examples are provided.

Linear Covariance Analysis↗
DOE OSTI2025

Parallel derivative-free optimization for simulation-based design of behind-the-meter energy systems

In this work, the integrated design and dispatch of behind-the-meter or distributed resources (e.g. stationary battery storage and solar PV generation) is considered. A simulation-based framework is employed, generating high-fidelity results with closed-loop predictive control at a fine resolution, at the expense of high computational cost (several minutes to a few hours per design point). To address this challenge, parallel derivative-free design methods are considered. Four methods are compared, including state-of-the-art surrogate-based methods (Radial-Basis Functions and Gaussian processes) and sampling strategies, an evolutionary-based method, and a simple sequential grid refinement method. As a case study, two types of design problem with increasing complexity are considered, namely, the design of behind-the-meter resources (three design variables) and the inclusion of grid capacity (four design variables). The second yields a constrained design problem for which violations can only be determined after solving the computationally expensive simulation. For the three-dimensional case, all methods present a good performance, achieving a solution within 1% of the optimum after the first iteration, with the sequential grid refinement exhibiting the fastest convergence and achieving the best final objective value. This indicates that the parallel evaluation of multiple sampling points may be more important than the choice of method for small decision spaces. For the four-dimensional constrained case, the Genetic Algorithm presents the best tradeoff between performance and computational effort, while the rough objective function terrain generated by constraint violation penalties reduces the performance of surrogate-based methods. Contour plots with flat regions indicate flexibility in the optimal design and highlight the importance of characterizing the solution space.

24 POWER TRANSMISSION AND DISTRIBUTION↗