Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive methods”

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

Load Balancing Using Time Series Analysis for Soft Real Time Systems with Statistically Periodic Loads

This thesis provides design and analysis of techniques for global load balancing on ensemble architectures running soft-real-time object-oriented applications with statistically periodic loads. It focuses on estimating the instantaneous average load over all the processing elements. The major contribution is the use of explicit stochastic process models for both the loading and the averaging itself. These models are exploited via statistical time-series analysis and Bayesian inference to provide improved average load estimates, and thus to facilitate global load balancing. This thesis explains the distributed algorithms used and provides some optimality results. It also describes the algorithms' implementation and gives performance results from simulation. These results show that our techniques allow more accurate estimation of the global system load ing, resulting in fewer object migration than local methods. Our method is shown to provide superior performance, relative not only to static load-balancing schemes but also to many adaptive methods.

REAL TIME↗

Technical support for digital systems technology development. Task order 1: ISP contention analysis and control

Alternatives for realizing a packet-based network switch for use on a frequency division multiple access/time division multiplexed (FDMA/TDM) geostationary communication satellite were investigated. Each of the eight downlink beams supports eight directed dwells. The design needed to accommodate multicast packets with very low probability of loss due to contention. Three switch architectures were designed and analyzed. An output-queued, shared bus system yielded a functionally simple system, utilizing a first-in, first-out (FIFO) memory per downlink dwell, but at the expense of a large total memory requirement. A shared memory architecture offered the most efficiency in memory requirements, requiring about half the memory of the shared bus design. The processing requirement for the shared-memory system adds system complexity that may offset the benefits of the smaller memory. An alternative design using a shared memory buffer per downlink beam decreases circuit complexity through a distributed design, and requires at most 1000 packets of memory more than the completely shared memory design. Modifications to the basic packet switch designs were proposed to accommodate circuit-switched traffic, which must be served on a periodic basis with minimal delay. Methods for dynamically controlling the downlink dwell lengths were developed and analyzed. These methods adapt quickly to changing traffic demands, and do not add significant complexity or cost to the satellite and ground station designs. Methods for reducing the memory requirement by not requiring the satellite to store full packets were also proposed and analyzed. In addition, optimal packet and dwell lengths were computed as functions of memory size for the three switch architectures.

Stehle, Roy H.↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

Directionally adaptive finite element method for multidimensional Euler and Navier-Stokes equations

A directionally adaptive finite element method for multidimensional compressible flows is presented. Quadrilateral and hexahedral elements are used because they have several advantages over triangular and tetrahedral elements. Unlike traditional methods that use quadrilateral/hexahedral elements, our method allows an element to be divided in each of the three directions in 3D and two directions in 2D. Some restrictions on mesh structure are found to be necessary, especially in 3D. The refining and coarsening procedures, and the treatment of constraints are given. A new implementation of upwind schemes in the constrained finite element system is presented. Some example problems, including a Mach 10 shock interaction with the walls of a 2D channel, a 2D viscous compression corner flow, and inviscid and viscous 3D flows in square channels, are also shown.

Tan, Zhiqiang↗

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗

SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification

SInkhorn Dynamic Domain Adaptation (SIDDA) supplements the experiments presented in 2501.14048, SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks. SIDDA introduces a semi-supervised, automatic domain adaptation method that leverages Sinkhorn divergences to dynamically adjust the regularization in the optimal transport plan and the weighting between classification and domain adaptation loss terms during training.

Pandya, Sneh [Fermi National Accelerator Laborator↗

Interactive grid adaption

An interactive grid adaption method is developed, discussed and applied to the unsteady flow about an oscillating airfoil. The user is allowed to have direct interaction with the adaption of the grid as well as the solution procedure. Grid points are allowed to adapt simultaneously to several variables. In addition to the theory and results, the hardware and software requirements are discussed.

Abolhassani, Jamshid S.↗

Comparing Unstructured Adaptive Mesh Solutions for the High Lift Common Research Model Airfoil

Discretization error is a common source of uncertainty in Computational Fluid Dynamics (CFD) analyses. Traditional means of controlling discretization error through fixed-mesh refinement studies has proven to be difficult particularly when modeling complex geometries and flow fields. One reason for this is that mesh generation in today’s production CFD workflow is often a labor intensive process that is heavily dependent on user judgment. Unstructured mesh adaptation is known to be an efficient way to control discretization errors in CFD. Adaptive methods replace user based decision making with automated processes that optimize a mesh to reduce discretization error. This paper compares the application of multiple solution adaptive techniques in combination with multiple flow solvers to solve for the flow field about a 2D airfoil section of the NASA High-Lift Common Research Model (HL-CRM). By driving the adaptive mesh processes to a similar level of mesh convergence, the ability to achieve consistent results between multiple adaptive techniques and flow solvers is demonstrated. Mesh convergence for the various adaptive mesh approaches is compared identifying potential areas for improvement and providing mesh generation guidance for future workshops.

mesh adaptation high-lift 2D airfoil↗

Comparing Unstructured Adaptive Mesh Solutions for the High Lift Common Research Model Airfoil

Discretization error is a common source of uncertainty in Computational Fluid Dynamics (CFD) analyses. Traditional means of controlling discretization error through fixed-mesh refinement studies has proven to be difficult particularly when modeling complex geometries and flow fields. One reason for this is that mesh generation in today’s production CFD workflow is often a labor intensive process that is heavily dependent on user judgment. Unstructured mesh adaptation is known to be an efficient way to control discretization errors in CFD. Adaptive methods replace user based decision making with automated processes that optimize a mesh to reduce discretization error. This paper compares the application of multiple solution adaptive techniques in combination with multiple flow solvers to solve for the flow field about a 2D airfoil section of the NASA High-Lift Common Research Model (HL-CRM). By driving the adaptive mesh processes to a similar level of mesh convergence, the ability to achieve consistent results between multiple adaptive techniques and flow solvers is demonstrated. Mesh convergence for the various adaptive mesh approaches is compared identifying potential areas for improvement and providing mesh generation guidance for future workshops.

mesh adaptation↗

International Conference on Numerical Methods in Fluid Dynamics, 11th, Williamsburg, VA, June 27-July 1, 1988, Proceedings

Recent advances in computational fluid dynamics (CFD) are discussed in reviews and reports. Topics addressed include CFD models in plasma dynamics, parallel computation for simulation studies, CFD for hypersonic airbreathing aircraft, multigrid methods for the steady incompressible Navier-Stokes equations, upwind differencing techniques, TV stable schemes for shock-interacting flows, Euler models of hypersonic vortex flows, parallel multilevel adaptive methods, and vortex methods for slightly viscous three-dimensional flows. Consideration is given to the accuracy of node-based solutions on irregular meshes, multigrid calculations for cascades, a finite-volume-element method for planar cavity flow, parallel heterogeneous mesh refinement for advection-diffusion equations, the convergence of the spectral-viscosity method for nonlinear conservation laws, and numerical simulations of Taylor vortices in a spherical gap.

Dwoyer, D. L.↗

h-p adaptive finite element methods in computational fluid dynamics

The principal ideas of h-p adaptive finite element methods for fluid dynamics problems are discussed. Applications include acoustics, compressible Euler and both compressible and incompressible Navier-Stokes equations. Several numerical examples illustrate the presented concepts.

Oden, J. T.↗

An adaptive finite element method for high speed flows

The solution of the equations of compressible high speed flow, on unstructured triangular grids in 2D and tetrahedral grids in 3D, is considered. Solution methods based upon both Taylor-Galerkin and Runge-Kutta time-stepping techniques are presented and the incorporation of the ideas of flux corrected transport (FCT) is discussed. These methods are combined with an adaptive mesh regeneration procedure and are employed in the solution of several examples, consisting of Euler flows in both 2D and 3D and Navier-Stokes flows in 2D.

Peraire, J.↗

An Improved Risk Priority Measure for the Management of Project Risk

Monte Carlo-based project risk models are essential tools in project risk management, particularly for large, complex projects in which it is difficult to glean intuitively the importance of individual risks to the overall project. Conventional correlation-based methods for measuring the importance of contributing risks in such models are argued here to be both statistically flawed and unintuitive in the importance metrics they produce. Drawing on and adapting methods more traditionally associated with engineering risk models, Risk Reduction Worth (RRW) is introduced as an importance measure. RRW is shown to be statistically robust and provide an easily interpretable, quantitative measure of the importance of a risk to the overall performance of a project; specifically, measuring the extent to which removal of a risk would improve confidence in project outcomes. To ensure practicality of the method, an approach is described in which RRWs can be produced for all contributing risks based on a single Monte Carlo sample. This is demonstrated through application to a large, complex project risk model from which intuitive risk importance insights provide a robust, transparent basis for the allocation of risk management resources.

Risk↗

Automating methods for estimating metabolite volatility

The volatility of metabolites can influence their biological roles and inform optimal methods for their detection. Yet, volatility information is not readily available for the large number of described metabolites, limiting the exploration of volatility as a fundamental trait of metabolites. Here, we adapted methods to estimate vapor pressure from the functional group composition of individual molecules (SIMPOL.1) to predict the gas-phase partitioning of compounds in different environments. We implemented these methods in a new open pipeline called volcalc that uses chemoinformatic tools to automate these volatility estimates for all metabolites in an extensive and continuously updated pathway database: the Kyoto Encyclopedia of Genes and Genomes (KEGG) that connects metabolites, organisms, and reactions. We first benchmark the automated pipeline against a manually curated data set and show that the same category of volatility (e.g., nonvolatile, low, moderate, high) is predicted for 93% of compounds. We then demonstrate how volcalc might be used to generate and test hypotheses about the role of volatility in biological systems and organisms. Specifically, we estimate that 3.4 and 26.6% of compounds in KEGG have high volatility depending on the environment (soil vs. clean atmosphere, respectively) and that a core set of volatiles is shared among all domains of life (30%) with the largest proportion of kingdom-specific volatiles identified in bacteria. With volcalc , we lay a foundation for uncovering the role of the volatilome using an approach that is easily integrated with other bioinformatic pipelines and can be continually refined to consider additional dimensions to volatility. The volcalc package is an accessible tool to help design and test hypotheses on volatile metabolites and their unique roles in biological systems.

59 BASIC BIOLOGICAL SCIENCES↗

Flow Characterization of the NASA Langley Unitary Plan WindTunnel, Test Section 2: Computational Results

Flow in the empty Unitary Planform Wind Tunnel at the NASA Langley Research Center issimulated with computational fluid dynamics methods. The objectives are to assess CFD’s truepredictive capability and to generate flow-field maps upstream of the tunnel’s test section foruse in associated vehicle tests. Multiple CFD solvers, grid adaption methods, and turbulencemodels are used by five teams doing the simulations. The simulation domain is as large aspractical: from the start of the settling chamber, just downstream of the last set of turningvanes, to well downstream of the test section. Simulations are done at three Mach numbers andseveral Reynolds numbers that cover most of the tunnel’s operating range. The sensitivity ofthe CFD solutions to simulation process details, including turbulence model, spatial resolutionand settling-chamber inflow velocity profile, is characterized. Significant sensitivities in somedetails of the predicted test section flow are described. CFD predicts that details of flow inthe settling chamber can affect the flow in the test section. Turning of the flow through thetunnel contraction and past nozzle-block hardware generates streamwise vortices, some ofwhich survive into the core of the test section, principally at low Mach number. Preliminarycomparisons to experimental measurements are given. The major flow characteristics andthe dynamical vortices predicted by CFD exist in the experiment. Several details in CFD andexperiment are observed to differ, including the effects of the vortices and features that appearto be Mach waves in the test section. Sensitivity to grid resolution and turbulence modelingis noted in the vortices; no potential cause for the differences in Mach waves has yet beenidentified in the CFD sensitivity studies.

wind tunnel↗

Mitigating Impact Through Community-Engaged Flood Modeling

Urban pluvial flooding poses a growing threat to the city of Baltimore, driven by heavy rainfall, increased impervious area, and aging infrastructure. Adapting to the risks posed by pluvial flooding is critical for building greater climate resiliency in Baltimore's Inner Harbor Watershed. This study addresses these challenges through community-informed decision analysis, which uses hydrologic modeling and optimization tools to identify robust flooding adaptation pathways. We will collaborate with community partners to identify key concerns and objectives regarding flooding. These concerns have been purposefully built in to a combined surface-subsurface dynamic flow simulation model. Model outputs are used to identify flooding locations within the Inner Harbor, and to test adaptation methods. Machine learning will be used search for solutions which meet diverse environmental, financial, and social goals, and solution performance will be examined under a wide range of potential future climatic conditions and integrated with an adaptive planning approach. This novel set of adaptation pathways will enhance the City's capacity to respond to evolving pluvial flood risk.

climate resilience↗

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗