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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Documenting numerical experiments in support of the Coupled Model Intercomparison Project Phase 6 (CMIP6)

Abstract. Numerical simulation, and in particular simulation of the earth system, relies on contributions from diverse communities, from those who develop models to those involved in devising, executing, and analysing numerical experiments. Often these people work in different institutions and may be working with significant separation in time (particularly analysts, who may be working on data produced years earlier), and they typically communicate via published information (whether journal papers, technical notes, or websites). The complexity of the models, experiments, and methodologies, along with the diversity (and sometimes inexact nature) of information sources, can easily lead to misinterpretation of what was actually intended or done. In this paper we introduce a taxonomy of terms for more clearly defining numerical experiments, put it in the context of previous work on experimental ontologies, and describe how we have used it to document the experiments of the sixth phase for the Coupled Model Intercomparison Project (CMIP6). We describe how, through iteration with a range of CMIP6 stakeholders, we rationalized multiple sources of information and improved the clarity of experimental definitions. We demonstrate how this process has added value to CMIP6 itself by (a) helping those devising experiments to be clear about their goals and their implementation, (b) making it easier for those executing experiments to know what is intended, (c) exposing interrelationships between experiments, and (d) making it clearer for third parties (data users) to understand the CMIP6 experiments. We conclude with some lessons learnt and how these may be applied to future CMIP phases as well as other modelling campaigns.

Pascoe, Charlotte (ORCID:0000000223616778)↗
NASA NTRS1978

Marching methods for elliptic problems. II, III

Higher-order operators for marching methods for elliptic equations are considered. Higher-order is understood in the sense of higher-order accuracy solutions to second-order Poisson equations, and in the sense of higher-order elliptic equations such as the biharmonic equation. The use of deferred corrections for overcoming stability problems is illustrated. Direct and iterative methods of extending the mesh size are considered. Multiple marching, patching, and influence extending techniques are described.

Roache, P. J.↗
NASA NTRS1981

Relations between information system engineering and software engineering

This paper examines some of the relations between information system engineering and software engineering. A model for the development process of an information system is presented that focuses on problems common to both disciplines. The concepts of complexity, multiplicity of view, distortion in communication, and concurrency and iteration in implementation are treated. A set of design constructs for the description of an information system is presented. The role of project management is treated. The issue of how to characterize requirements analysis is answered by making it a design activity from the point of view of a user of the product system.

Callender, E. D.↗
NASA NTRS2001

Using abstraction in multi-rover scheduling

r describes how an iterative repair planner/scheduler can reason about the activities of multiple spacecraft at abstract levels in order to greatly improve the scheduling of their use of shared resources.

abstraction planning rovers multiple agents↗
NASA NTRS2021

Feasibility Analysis of Unmanned Aerial Vehicle Based on Tensegrity Structure

For future unmanned aerial vehicles to be ubiquitous, they need to be safe to other aircraft and people on the ground even in the event of unintended collisions. Unfortunately, this is difficult for current rigid designs as a crash of all but the smallest aircraft will have a significant impact on its target. As an alternative, this pa-per explores using a soft tensegrity structure (interconnected cables and rods) as a lightweight, robust chassis for a UAS and analyze its ability to achieve stable, controllable flight and mitigate damage during a collision. Tensegrity structures are three dimensional geometric constructions which are able to undergo severe deformations without permanent damage, and can immediately return to their original shape. Experiments and analysis are performed using a simple physics simulation environment, allowing for rapid design iteration and thorough exploration of system behavior. We test multiple configurations of the vehicle to understand impacts of changing various physical characteristics, and take limitations such as modern propeller thrust coefficients and motor speeds into account to ensure our results are inline with those of a real world vehicle. We ultimately find that such a vehicle has considerable real world potential, and that a physical prototype could theoretically be constructed and flown with current technology.

Bjorn Johnson↗
DOE OSTI2023

Nonlinear, real-time optimization for actuator management in tokamaks

Experiments in DIII-D have been carried out to test a novel actuator management approach in tokamaks. Here, the actuator management scheme is posed as a nonlinear-optimization problem in which the actuator commands are calculated in real time according to the changing control priorities, plasma state, and actuator availability. Such optimization problem is solved using the augmented Lagrangian method, combined with a gradient projection method and a conjugate-gradient iteration algorithm. The algorithmic approach followed in this work does not depend on the particular control objectives or actuators considered, which facilitates its integration with other independently-designed control components within a plasma-control system. In addition, the actuator-management algorithm is able to handle the optimization problem in a computationally efficient manner, making it suitable for real-time implementations. Initial DIII-D results in the steady-state high-q min scenario have demonstrated the capabilities of the actuator manager to perform both simultaneous multiple mission and repurposing sharing, which will be required in ITER.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗
DOE OSTI2025

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗
DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2009

Optimization of OT-MACH Filter Generation for Target Recognition

An automatic Optimum Trade-off Maximum Average Correlation Height (OT-MACH) filter generator for use in a gray-scale optical correlator (GOC) has been developed for improved target detection at JPL. While the OT-MACH filter has been shown to be an optimal filter for target detection, actually solving for the optimum is too computationally intensive for multiple targets. Instead, an adaptive step gradient descent method was tested to iteratively optimize the three OT-MACH parameters, alpha, beta, and gamma. The feedback for the gradient descent method was a composite of the performance measures, correlation peak height and peak to side lobe ratio. The automated method generated and tested multiple filters in order to approach the optimal filter quicker and more reliably than the current manual method. Initial usage and testing has shown preliminary success at finding an approximation of the optimal filter, in terms of alpha, beta, gamma values. This corresponded to a substantial improvement in detection performance where the true positive rate increased for the same average false positives per image.

false alarm reduction↗
DOE OSTI2020

Distributed Outage Detection in Power Distribution Networks

Real time topology knowledge is essential for situational awareness of power distribution networks. Line outages change the topology of a distribution network. Hence, outage detection is an important task. Most of the existing outage detection algorithms are centralized, in which sensors communicate their data to a control center which performs outage detection using the received data. However, with the increasing size of the distribution network and with different areas of the network being monitored by different operators, communication is a bottleneck and scalability is a major concern. To address these issues, we propose a novel outage detection algorithm using a divide and conquer approach. First, we divide a distribution network into sub-networks, such that outage detection can be run in parallel in each sub-network independently ensuring scalability to large networks. Further, to reduce the latency, bandwidth and attenuation challenges associated with communications in a large network, we divide each sub-network into multiple control areas which communicate only with their neighbors. We employ a distributed iterative load estimation across the control areas of each sub-network and then use the load estimate for local outage detection in each control area. Here, the performance of our algorithm is evaluated for multiple feeder models and compared against traditional centralized outage detection algorithms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1977

Analytical model of the combustion of multicomponent solid propellants

Multiple flame models derived for simple composite propellants are extended to describe the combustion of propellants containing multimodal particle sizes, mixed oxidizers and monopropellant binders. Models combining the component contributions to propellant surface structure, flame structure and energy distribution are based in part upon experimental observations and in part upon hypotheses constrained to provide reasonable agreement with measured burning rate characteristics. The methods employed consist of superposition, interaction and iteration. The computerized model is applied to explain the effects of multiple ingredients and to discuss burning rate tailoring problems of current interest.

Cohen, N. S.↗
DOE OSTI2026

A Unified Design Theory for Multi-Port Polyphase Transformers Enabling Scalable Power-Multiplexed EV Fleet Charging Systems

This paper presents a unified analytical design theory for multi-port polyphase transformers, targeting scalable and isolated high-power Electric Vehicle (EV) fleet charging systems with power multiplexing capability. As fleet electrification accelerates, conventional one-to-one charger architectures face significant challenges in infrastructure cost, peak power demand, and low utilization of installed power electronics. Power-multiplexed charging architectures, which dynamically distribute power from a shared pool of converter modules across multiple vehicles, have emerged as a promising solution. However, such architectures require scalable, isolated multi-port power interfaces capable of routing energy among multiple inputs and outputs, whose design remains complex and dependent on iterative modeling. To address this gap, the proposed theory provides closed-form expressions for self-inductance, leakage inductance, and mutual coupling terms for arbitrary multi-phase, multi-port transformer structures. The formulation enables direct synthesis of isolated multi-input and multi-output resonant converter systems without reliance on geometry-specific finite-element analysis or extensive parameter extraction. This capability is particularly critical for power-multiplexed systems, where modular converter structures must interface with multiple vehicles while maintaining galvanic isolation and flexible power allocation. The effectiveness of the proposed framework is demonstrated through the design of a 360 kW multi-phase system operating over a 700–900 VDC input and 400–1250 VDC output range. PLECS simulation results confirm accurate prediction of system behavior and validate the applicability of the approach to multi-port, power-multiplexed charging scenarios. The proposed method significantly reduces design complexity while enabling scalable, cost-effective, and fully utilized EV fleet charging infrastructure.

Asa, Erdem [ORNL] (ORCID:0000000190884812)↗
DOE OSTI2024

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗
NASA NTRS2016

TAT-C: A Trade-Space Analysis Tool for Constellations

Under a changing technological and economic environment, there is growing interest in implementing future NASA Earth Science missions as Distributed Spacecraft Missions (DSM). The objective of our project is to provide a framework that facilitates DSM Pre-Phase A investigations and optimizes DSM designs with respect to a-priori Science goals. In this first version of our Trade-space Analysis Tool for Constellations (TAT-C), we are investigating questions such as: Which type of constellations should be chosen? How many spacecraft should be included in the constellation? Which design has the best costrisk value? This paper describes the overall architecture of TAT-C including: a User Interface (UI) interacting with multiple users - scientists, missions designers or program managers; an Executive Driver gathering requirements from UI and formulating Trade-space Search Requests for the Trade-space Search Iterator, which in collaboration with the Orbit Coverage, Reduction Metrics, and Cost Risk modules generates multiple potential architectures and their associated characteristics. UI will include Graphical, Command Line and Application Programmer Interfaces to respond to the demands of various levels of users expertise. Science inputs are grouped into various mission concepts, satellite specifications, and payload specifications, while science outputs are grouped into several types of metrics - spatial, temporal, angular and radiometric. Orbit Coverage leverages the use of the Goddard Mission Analysis Tool (GMAT) to compute coverage and ancillary data that are passed to Reduction Metrics. Then, for each architecture design, Cost Risk will provide estimates of the cost and life cycle cost as well as technical and cost risk of the proposed mission. Additionally, the Knowledge Base module is a centralized store of structured data readable by humans and machines. It will support both TAT-C analysis when composing new mission concepts from existing model inputs, and TAT-C exploration when discovering new mission concepts by querying previous results.

Science Data Processing↗
NASA NTRS1989

A fully-coupled implicit method for thermo-chemical nonequilibrium air at sub-orbital flight speeds

A CFD technique is described in which the finite-rate chemistry in thermal and chemical nonequilibrium air is fully and implicitly coupled with the fluid motion. Developed for use in the suborbital hypersonic flight speed range, the method accounts for nonequilibrium vibrational and electronic excitation and dissociation, but not ionization. The steady-state solution to the resulting system of equations is obtained by using a lower-upper factorization and symmetric Gauss-Seidel sweeping technique through Newton iteration. Inversion of the left-hand-side matrices is replaced by scalar multiplications through the use of the diagonal dominance algorithm. The code, named CENS2H (Compressible-Euler-Navier-Stokes Two-Dimensional Hypersonic), is fully vectorized and requires about 8.8 x 10 to the -5th sec per node point per iteration using a Cray X-MP computer. Converged solutions are obtained after about 2400 iterations. Sample calculations are made for a circular cylinder and a 10 percent airfoil at 5 deg angle of attack. The calculated cylinder flow field agrees with that obtained experimentally. The code predicts a 10 percent change in lift, drag, and pitching moment for the airfoil due to the thermochemical phenomena.

Park, Chul↗
DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗