Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative limiters”

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 289 records · Page 16

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗

Survey of Dynamic Mode Decomposition Methods

Dynamic mode decomposition (DMD) is a data-driven reduced order modeling (ROM) technique used for dynamic systems. The widely adopted algorithm was first introduced and demonstrated on fluid flow data by Schmid. In recent years, various other fields, such as nuclear engineering, have begun to adopt this method. For example, DMD has been used for estimating α-eigenvalues, as an ROM for pulsed neutron problems, for predicting isotopic composition in burnup calculations, as acceleration techniques for iterative methods, and in capturing dynamic behaviors in molten salt reactor transients. This report seeks to demonstrate the capabilities and limits of the standard DMD algorithm, and identify problem spaces where variants may be better suited. The primary variant this report considers is Multi-Resolution DMD (mrDMD). Because this serves as a survey, synthetically produced data is used in lieu of simulation results. The remainder of this report will go into detail on the DMD theory, outline the standard DMD and mrDMD algorithms, present test cases highlighting the applicability of each, and finally present a discussion on how to determine the best suited algorithm for a given problem. All calculations performed in this report are carried out using the open source DMD library, PyDMD.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Decay of homogeneous turbulence from a specified state

The homogeneous turbulence problem is formulated by first specifying the multipoint velocity correlations or their spectral equivalents at an initial time. Those quantities, together with the correlation or spectral equations, are then used to calculate initial time derivatives of correlations or spectra. The derivatives in turn are used in time series to calculate the evolution of turbulence quantities with time. When the problem is treated in this way, the correlation equations are closed by the initial specification of the turbulence and no closure assumption is necessary. An exponential series which is an iterative solution of the Navier stokes equations gave much better results than a Taylor power series when used with the limited available initial data. In general, the agreement between theory and experiment was good.

Deissler, R. G.↗

Iterative Mechanism Solutions with Scenario and ADAMS

This slide presentation reviews the use of iterative solutions using Scenario for Motion (UG NX 2 Motion) to assist in designing the Mars Science Laboratory (MSL). The MSL will have very unique design requirements, and in order to meet these requirements the system must have the ability to design for static stability, simulate mechanism kinematics, simulate dynamic behaviour and be capable of reconfiguration, and iterations as designed. The legacy process used on the Mars Exploration rovers worked, but it was cumbersome using multiple tools, limited configuration control, with manual process and communication, and multiple steps. The aim is to develop a mechanism that would reduce turn around time, and make more reiterations possible, to improve the quality and quantity of data, and to enhance configuration control. Currently for NX Scenario for Motion uses are in the articulation studies, the simulations of traverse motions,and subsystem simulations. The design of the Rover landing model requires accurate results, flexible elements, such as beams, and the use of the full ADAMS solver has been used. In order to achieve this, when required, there has been a direct translation from Scenario to ADAMS, with additional data in ascii format. The process that has been designed to move from Scenario to ADAMS is reviewed.

Mars Science Laboratory (MSL)↗

Aerodynamic optimization by simultaneously updating flow variables and design parameters

The application of conventional optimization schemes to aerodynamic design problems leads to inner-outer iterative procedures that are very costly. An alternative approach is presented based on the idea of updating the flow variable iterative solutions and the design parameter iterative solutions simultaneously. Two schemes based on this idea are applied to problems of correcting wind tunnel wall interference and optimizing advanced propeller designs. The first of these schemes is applicable to a limited class of two-design-parameter problems with an equality constraint. It requires the computation of a single flow solution. The second scheme is suitable for application to general aerodynamic problems. It requires the computation of several flow solutions in parallel. In both schemes, the design parameters are updated as the iterative flow solutions evolve. Computations are performed to test the schemes' efficiency, accuracy, and sensitivity to variations in the computational parameters.

Rizk, M. H.↗

Enhancement of disposal efficiency for deep geological repositories based on three design factors - Decay heat optimization, increased thermal limit of the buffer and double-layer concept

This study investigates the enhancement of disposal efficiency for deep geological repositories (DGRs) based on three design factors: decay heat optimization, increased thermal limit of the buffer, and double-layer concept using coupled thermo-hydro-mechanical (THM) numerical simulations. Decay heat optimization is achieved by iteratively emplacing spent nuclear fuels having the maximum and minimum decay heat in a canister. Disposal areas can be reduced by 20 % to 40 % compared to the current reference disposal system in Korea (KRS+) in accordance with the combinations of the three design factors, alleviating challenges in site selection for the DGR. This study additionally identifies an optimal layer spacing of 500 m for the double-layer concept in the viewpoint of the buffer temperature, where thermal interaction between the upper and lower layers nearly disappears. However, determining the ultimate disposal and layer spacing requires engineering judgement, considering not only the thermal performance of the DGR but also various factors such as cost and difficulties of the construction and rock mass stability. DGRs designed with an increased thermal limit of the buffer poses a greater probability of rock mass failure around disposal tunnels and deposition holes due to elevated thermal stresses. Densely arranged heat sources for the DGRs with enhanced disposal efficiency lead to larger temperature increase even at the far-field scale, raising a possibility of thermally driven fracture shear activation with associated hydraulic, mechanical, and seismic changes.

58 GEOSCIENCES↗

Development of a framework for sequential Bayesian design of experiments: Application to a pilot-scale solvent-based CO 2 capture process

In this paper, a methodology is developed for sequential design of experiments (SDoE) for process systems and applied to a solvent-based CO 2 capture system. In this approach, the prior knowledge of the system is used to prioritize process data collection at specific operating conditions. These data are then incorporated into a Bayesian inference methodology for updating a stochastic model by refining estimations of its underlying parameters, and the updated model is then used to generate the next set of test runs. Thus, the new knowledge obtained from the data is used to guide subsequent iterations of the experimental runs, ensuring that the overall data collection is maximally informative given that most experimental campaigns, especially at pilot or higher-scale plants, are costly, time-consuming, and resource-limited. The test run objective for this work was to minimize the maximum model prediction uncertainty for key output variables, but the methodology is generic and can be readily applied to other test run objectives. This methodology is applied to an aqueous monoethanolamine (MEA) pilot plant campaign at the National Carbon Capture Center (NCCC) in Wilsonville, Alabama, USA. The SDoE framework was utilized for two iterations, while collecting 18 sets of data representing different process conditions, and this resulted in an overall average reduction in uncertainty of approximately 50% in the prediction of CO 2 capture percentage. Moreover, 11 additional data sets were obtained with variation of absorber packing height for further model validation. This work shows the capability of the SDoE framework to maximize learning given limited resources, allowing for the reduction of model uncertainty, which is of great importance for many applications including reduction of technical risk associated with scale-up and economic analysis.

20 FOSSIL-FUELED POWER PLANTS↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

Time-accurate Navier-Stokes calculations with multigrid acceleration

A numerical scheme to solve the unsteady Navier-Stokes equations is described. The scheme is implemented by modifying the multigrid-multiblock version of the steady Navier-Stokes equations solver, TLNS3D. The scheme is fully implicit in time and uses TLNS3D to iteratively invert the equations at each physical time step. The design objective of the scheme is unconditional stability (at least for first- and second-order discretizations of the physical time derivatives). With unconditional stability, the choice of the time step is based on the physical phenomena to be resolved rather than limited by numerical stability which is especially important for high Reynolds number viscous flows, where the spatial variation of grid cell size can be as much as six orders of magnitude. An analysis of the iterative procedure and the implementation of this procedure in TLNS3D are discussed. Numerical results are presented to show both the capabilities of the scheme and its speed up relative to the use of global minimum time stepping. Reductions in computational times of an order of magnitude are demonstrated.

Melson, N. Duane↗

Interpretative 3D MHD modelling of deuterium SPI into a JET H-mode plasma

Abstract The pre-thermal quench (pre-TQ) dynamics of a pure deuterium ( D 2 ) shattered pellet injection (SPI) into a 3 MA / 7 MJ JET H-mode plasma is studied via 3D non-linear MHD modelling with the JOREK code. The interpretative modelling captures the overall evolution of the measured density and radiated power. The simulations also identify the importance of the drifts of ablation plasmoids towards the tokamak low field side (LFS) and the impurities in the background plasma in fragment penetration, assimilation, radiative cooling and MHD activity in D 2 SPI experiments. It is found that plasmoid drifts lead to an about 70% reduction of the central line-integrated density (compared to a simulation without drifts) in the JET D 2 SPI discharge considered. Impurities that pre-exist before the SPI as well as those from possible impurity influxes related to the SPI are shown to dominate the radiation in the considered discharge. With inputs from JOREK simulations, modelling with the Lagrangian particle-based pellet code PELOTON reproduces the deviation of the SPI fragments in the direction of the major radius as observed by the fast camera. This confirms the role of rocket effects and plasmoid drifts in the considered discharge and reinforces the validity of the JOREK modelling. The limited core density rise due to plasmoid drifts and the strong radiative cooling and MHD activity with impurities (depending on their species and concentration) could limit the effectiveness of LFS D 2 SPI in runaway electron avoidance and are worth considering in the design of the ITER disruption mitigation system.

Physics↗

Initial Refinement and Optimization of the Image Reconstruction (U-MBIR) Algorithm to Optimize its Performance in Detecting Damage and Flaws

Concrete is a critical component of nuclear power plants; thus, its safety and reliability must be thoroughly examined throughout the life cycle of the structural system. During the life cycle of this infrastructure, monitoring of the concrete for signs of degradation should be performed through nondestructive evaluation (NDE). Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. As such, Oak Ridge National Laboratory (ORNL) is developing advanced image reconstruction algorithms to overcome the limitations of traditional ultrasonic NDE methodologies. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL.

36 MATERIALS SCIENCE↗

Technical note: A modified formulation of dynamic energy budget theory for faster computation of biological growth

Abstract. The mass conservation equation in the presence of boundary fluxes and chemical reactions from non-equilibrium thermodynamics is used to derive a modified dynamic energy budget (mDEB) model. Compared to the standard dynamic energy budget (sDEB) model (Kooijman, 2009), this modified formulation does not place the dilution effect in the mobilization kinetics of reserve biomass, and it maintains the partition principle for reserve mobilization dynamics for both linear and non-linear kinetics. Overall, the mDEB model shares most features with the sDEB model. However, for biological growth that requires multiple nutrients, the mDEB model is computationally much more efficient by not requiring numerical iterations for obtaining the specific growth rate. In an example of modeling the growth of Thalassiosira weissflogii in a nitrogen-limiting chemostat, the mDEB model was found to have almost the same accuracy as the sDEB model while requiring almost half of the computing time of the sDEB model. Since the sDEB model has been successfully applied in numerous studies, we believe that the mDEB model can help improve the modeling of biological growth and the associated ecosystem processes in various contexts.

Tang, Jinyun↗

Payload crew utilization for spacelab missions

Planned payload crew utilization on Spacelab mission are analyzed to establish trends and guidelines. The study included missions that have flow to date as well as those in planning. Available data were analyzed on the basis of four major timeline iterations that occur during mission design. Data were categorized and assessed by crewmember, flight day, and mission. Based on the results of this analysis, it was recommended that for the Requirements Review and Preliminary Design Review iterations the maximum utilization per shift should be 75 percent for the Payload Specialist (PS) and 65 percent for the Mission Specialist (MS); and for the basic and final iterations, the maximum utilization shift should be 85 percent for the PS and 75 percent for the MS. Additional recommendations include limiting the amount of activity during the first two shifts whenever possible and establishing a common set of guidelines for the calculations of crew utilization.

Ibrahim, K. Y.↗

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback↗

Fermilab Booster loss modelling and rebalancing using Bayesian methods

Fermilab Booster is being upgraded for the PIP-II project to support 20Hz ramp rate at higher intensities. Loss trip limits determine the achievable peak power. To meet PIP-II requirements, losses need to be halved as compared to current levels. Losses primarily occur at injection and transition crossing, with both gradually increasing and threshold-like intensity-dependent behaviors. The existing simulation models are not yet good enough for quantitative loss predictions. In practice, it will be necessary to tune up the Booster using iterative methods and operator intuition. In this paper we present an effort to systematically model Booster losses using active learning (Bayesian exploration) techniques, and subsequently to rebalance them for higher trip limit margins. We first created several sets of spatially and temporally isolated orbit and optics knobs, and trained Gaussian process models for each beam loss monitor as well as beam current. This is a complex task due to safety and timing requirements – we discuss mitigations such as uncertainty constraints and approximate fitting. Once models are stable, we perform large-scale single and multi-objective tuning using scalarized objectives made up of critical beam loss locations. Our results demonstrate significant rebalancing of losses, increasing trip margins, as well as an overall improvement in beam transmission efficiency. We are exploring how to combine existing simulations with experimental data and automate the collection procedure so that more advanced surrogate models can be created over time.

Kuklev, Nikita [Fermilab]↗

A Robust Locally Preconditioned Semi-Coarsening Multigrid Algorithm for the 2-D Navier-Stokes Equations

The goal of this thesis is to develop an efficient and robust locally preconditioned semi-coarsening multigrid algorithm for the two-dimensional Navier-Stokes equations. This thesis examines the performance of the multigrid algorithm with local preconditioning for an upwind-discretization of the Navier-Stokes equations. A block Jacobi iterative scheme is used because of its high frequency error mode damping ability. At low Mach numbers, the performance of a flux preconditioner is investigated. The flux preconditioner utilizes a new limiting technique based on local information that was developed by Siu. Full-coarsening and-semi-coarsening are examined as well as the multigrid V-cycle and full multigrid. The numerical tests were performed on a NACA 0012 airfoil at a range of Mach numbers. The tests show that semi-coarsening with flux preconditioning is the most efficient and robust combination of coarsening strategy, and iterative scheme - especially at low Mach numbers.

Cain, Michael D.↗

An approach to verification and validation of a reliable multicasting protocol: Extended Abstract

This paper describes the process of implementing a complex communications protocol that provides reliable delivery of data in multicast-capable, packet-switching telecommunication networks. The protocol, called the Reliable Multicasting Protocol (RMP), was developed incrementally using a combination of formal and informal techniques in an attempt to ensure the correctness of its implementation. Our development process involved three concurrent activities: (1) the initial construction and incremental enhancement of a formal state model of the protocol machine; (2) the initial coding and incremental enhancement of the implementation; and (3) model-based testing of iterative implementations of the protocol. These activities were carried out by two separate teams: a design team and a V&V team. The design team built the first version of RMP with limited functionality to handle only nominal requirements of data delivery. This initial version did not handle off-nominal cases such as network partitions or site failures. Meanwhile, the V&V team concurrently developed a formal model of the requirements using a variant of SCR-based state tables. Based on these requirements tables, the V&V team developed test cases to exercise the implementation. In a series of iterative steps, the design team added new functionality to the implementation while the V&V team kept the state model in fidelity with the implementation. This was done by generating test cases based on suspected errant or off-nominal behaviors predicted by the current model. If the execution of a test in the model and implementation agreed, then the test either found a potential problem or verified a required behavior. However, if the execution of a test was different in the model and implementation, then the differences helped identify inconsistencies between the model and implementation. In either case, the dialogue between both teams drove the co-evolution of the model and implementation. We have found that this interactive, iterative approach to development allows software designers to focus on delivery of nominal functionality while the V&V team can focus on analysis of off nominal cases. Testing serves as the vehicle for keeping the model and implementation in fidelity with each other. This paper describes (1) our experiences in developing our process model; and (2) three example problems found during the development of RMP. Although RMP has provided our research effort with a rich set of test cases, it also has practical applications within NASA. For example, RMP is being considered for use in the NASA EOSDIS project due to its significant performance benefits in applications that need to replicate large amounts of data to many network sites.

Callahan, John R.↗

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↗