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 1,351 records · Page 75

Multi-Objective Adaptive Mesh Refinement Using Reinforcement Learning

Finite element methods approximate the solution to a partial differential equation (PDE) on a mesh consisting of many elements. In general, using more, smaller elements results in a lower error in the approximation. However, it is often possible to lower the error substantially by only refining, or decreasing the size of, the few elements in the mesh that have the highest error. Adaptive mesh refinement (AMR) is a process that selectively refines regions of a mesh with high error to achieve a desired accuracy in as few degrees of freedom (DOFs) as possible. AMR is favorable compared to uniform refinement, which refines all elements of the mesh equally, because it can often achieve the same accuracy without wasting extra computation time on refinement of elements that already have low error. However, it is difficult to know which elements to refine. In this report we explore ways to choose which elements to refine such that we minimize both the resulting error and the cumulative DOFs used in computation. In particular, we introduce a Pareto-front learning algorithm that trains a policy to give the optimal refinement actions to minimize the cumulative DOFs used to achieve a given target error. Such a policy is useful because it can be deployed on many different problem types where different accuracy levels are desired. Furthermore, training a single policy for a range of target errors allows us to use transfer learning to reduce the required training time.

97 MATHEMATICS AND COMPUTING↗

The evaluation of evaporation by infrared thermography: A critical analysis of the measurements on the Crau test site

Evapotranspiration was calculated for both the dry and irrigated zone by four methods which were compared with the energy balance method serving as a reference. Two methods did not involve the surface temperature. They are ETR(n) = R(n), liable to be valid under wet conditions and ET(eq) = (delta/delta + gamma) R(n) i.e, the first term of Penman's equation, adapted to moderately dry conditions. The methods using surface temperature were the combined energy balance aerodynamic approach and a simplified approach proposed by Jackson et al. Tests show the surface temperature methods give relatively satisfactory results both in the dry and wet zone, with a precision of 10% to 15% compared with the reference method. As was to be expected, ET(eq) gave satisfactory results only in the dry zone and ET(Rn) in the irrigated zone. Thermography increased the precision in the estimate of ET relative to the most suitable classical method by 5% to 8% and is equally suitable for both dry and wet conditions. The Jackson method does not require extensive ground measurements and the evaluation of the surface roughness.

Seguin, B.↗

Residual interference assessment in adaptive wall wind tunnels

A two-variable method is presented which is suitable for on-line calculation of residual interference in airfoil testing in the Langley 0.3-Meter Transonic Cryogenic Tunnel (0.3-M TCT). The method applies the Cauchy's integral formula to the closed contour formed by the contoured top and bottom walls, and the upstream and downstream ends. The measured top and bottom wall pressures and position are used to calculate the correction to the test Mach number and the airfoil angle of attack. Application to specific data obtained in the 0.3-M TCT adaptive wall test section demonstrates the need to assess residual interference to ensure that the desired level of wall streamlining is achieved. A FORTRAN computer program was developed for on-line calculation of the residual corrections during airfoil tests in the 0.3-M TCT.

Murthy, A. V.↗

Robust adaptive kinematic control of redundant robots

The paper presents a general method for the resolution of redundancy that combines the Jacobian pseudoinverse and augmentation approaches. A direct adaptive control scheme is developed to generate joint angle trajectories for achieving desired end-effector motion as well as additional user defined tasks. The scheme ensures arbitrarily small errors between the desired and the actual motion of the manipulator. Explicit bounds on the errors are established that are directly related to the mismatch between actual and estimated pseudoinverse Jacobian matrix, motion velocity and the controller gain. It is shown that the scheme is tolerant of the mismatch and consequently only infrequent pseudoinverse computations are needed during a typical robot motion. As a result, the scheme is computationally fast, and can be implemented for real-time control of redundant robots. A method is incorporated to cope with the robot singularities allowing the manipulator to get very close or even pass through a singularity while maintaining a good tracking performance and acceptable joint velocities. Computer simulations and experimental results are provided in support of the theoretical developments.

Tarokh, M.↗

Direct calculation of wall interferences and wall adaptation for two-dimensional flow in wind tunnels with closed walls

A method for the direct calculation of the wall induced interference velocity in two dimensional flow based on Cauchy's integral formula was derived. This one-step method allows the calculation of the residual corrections and the required wall adaptation for interference-free flow starting from the wall pressure distribution without any model representation. Demonstrated applications are given.

Amecke, Juergen↗

Prediction of tip vortex self-induced motion parameters in terms of rotor blade loading

The self-induced motion of curved vortex filaments at the tip of a helicopter rotor blade is investigated analytically. The derivation of a method for inviscid roll-up (IRU) is presented in detail, with attention to the cutoff-distance reformulation of the problem, a control-volume analysis of the self-induction properties of the vortex core, the adaptation of the roll-up method of Betz (1932) to IRU in three dimensions, the treatment of linear and elliptic loading, vortices with turbulent central cores, and the effect of cutoff distance on helicopter free-wake computations. Numerical results showing the significant effect of core properties on the geometry of a rotor wake in hover are presented in graphs and briefly characterized.

Bliss, Donald B.↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

Attack detection and localization with adaptive thresholding

According to some embodiments, a system, method, and non-transitory computer readable medium are provided comprising a plurality of real-time monitoring nodes to receive streams of monitoring node signal values over time that represent a current operation of the cyber physical system; and a threat detection computer platform, coupled to the plurality of real-time monitoring nodes, to: receive the monitoring node signal values; compute an anomaly score; compare the anomaly score with an adaptive threshold; and detect that one of a particular monitoring node and a system is outside a decision boundary based on the comparison, and classify that particular monitoring node or system as anomalous. Numerous other aspects are provided.

Abbaszadeh, Masoud↗

An adaptive embedded mesh procedure for leading-edge vortex flows

A procedure for solving the conical Euler equations on an adaptively refined mesh is presented, along with a method for determining which cells to refine. The solution procedure is a central-difference cell-vertex scheme. The adaptation procedure is made up of a parameter on which the refinement decision is based, and a method for choosing a threshold value of the parameter. The refinement parameter is a measure of mesh-convergence, constructed by comparison of locally coarse- and fine-grid solutions. The threshold for the refinement parameter is based on the curvature of the curve relating the number of cells flagged for refinement to the value of the refinement threshold. Results for three test cases are presented. The test problem is that of a delta wing at angle of attack in a supersonic free-stream. The resulting vortices and shocks are captured efficiently by the adaptive code.

Powell, Kenneth G.↗

Rapid Structured Volume Grid Smoothing and Adaption Technique

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reduction in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

Alter, Stephen J.↗

Rapid Structured Volume Grid Smoothing and Adaption Technique

A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reductions in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

Alter, Stephen J.↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

Electrification Futures Study: Methodological Approaches for Assessing Long-Term Power System Impacts of End-Use Electrification

By its nature, electrification enhances the coupling between the electric sector and end-use sectors. Assessing the impacts of electrification requires both an examination of the complex interactions between sectors and a broader assessment of multiple parts of the energy system. The Electrification Futures Study (EFS) uses several complementary modeling and analysis tools to analyze the impacts of electrification on the U.S. energy system. In particular, the EFS relies on an overarching scenario analysis approach, but through the use of separate modeling approaches designed to assess various electricity demand- and supply-side futures. The primary model employed to generate the supply-side scenarios is the Regional Energy Deployment System (ReEDS) model, which is a capacity expansion model for the U.S. electricity system through 2050. Traditionally, the model has been primarily exercised in scenario analysis that implicitly assumed limited electrification. Because of this assumption, resulting future load profiles are approximated by historical ones, load growth is driven primarily by population and economic growth only, and changes in direct end-use natural gas consumption do not effect natural gas costs for electricity generation. In this report, we (1) reflect the potential for resource sharing between regions given these changes in demand, (2) represent how changes in natural gas consumption in end-use sectors could impact the economics of natural gas-fired generation, and (3) document a new model representation of demand-side flexibility used for the EFS. These improvements to ReEDS are employed for the EFS supply-wide analysis, which is summarized in a companion EFS report titled Electrification Futures Study: Scenarios of Power System Evolution and Infrastructure Development for the United States (Murphy et al. 2019). The data and methods documented in this report could also be adapted for other models with similar scope and limitations as ReEDS, and these data and methods could be used to assess future electric system scenarios.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

S-Band complex-weight module for adaptive processing

S-band complex weight for adaptive processing is fabricated as microwave integrated circuit. When interfaced with suitable control component, it is potentially capable of producing 25 dB rejection of interface with bandwidth of 500 MHz. Performance inproves with decreased bandwidth. Versatility stems from numerous control methods available in broadening field of adaptive processing.

Gianatasio, A. J.↗

Native Chemical Ligation of Peptoid Oligomers

Bioorganic chemists are inspired by natural biopolymers to design peptidomimetic oligomers that can exhibit sequence-structure-function relationships. Biomimetic polymers can be synthesized to incorporate a specific sequence of nonbiological monomer units using a variety of iterative solution-phase or solid-phase reaction schemes. These protocols generally provide access to a vast diversity of oligomeric compounds but are limited with respect to their ability to attain protein-like chain lengths. This constraint can preclude access to sequence-defined synthetic macromolecules with sufficient sizes required to exhibit tertiary structure and other protein-mimetic attributes. In contrast, peptide chemists have overcome this limitation by developing convergent synthetic methods, such as native chemical ligation, to join individual, smaller peptide chains together to make larger peptides or full proteins. A similar convergent approach is needed to establish efficient synthetic routes to non-natural sequence-defined macromolecules. Herein, we adapt the peptide native chemical ligation method to peptoid oligomers, demonstrating how short chains can be conjoined to create sequence-defined peptoid macromolecules. Nanosheet-forming peptoid polymers with distinct surface loop display domains were generated by sequential ligation of several discrete fragments. This method provides a reliable convergent ligation route for sequence-defined polypeptoids that results in a native amide bond joining the fragments. We envision that this strategy will be useful in synthesizing peptoid-based proteomimetics that incorporate diverse chemical features.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Strip Yield Model Numerical Application to Different Geometries and Loading Conditions

A new numerical method based on the strip-yield analysis approach was developed for calculating the Crack Tip Opening Displacement (CTOD). This approach can be applied for different crack configurations having infinite and finite geometries, and arbitrary applied loading conditions. The new technique adapts the boundary element / dislocation density method to obtain crack-face opening displacements at any point on a crack, and succeeds by obtaining requisite values as a series of definite integrals, the functional parts of each being evaluated exactly in a closed form.

Hatamleh, Omar↗

Phased-array optical whispering gallery mode modulation and method

A whispering gallery mode (WGM) resonator device and method capable of filtering sidebands of optical modulators are provided. The method includes providing an optical resonator adapted to support whispering gallery modes and forming a first field and a second field from a first location and a second location, respectively, at the circumference of the optical resonator and being separated by an arc angle, .alpha.. The method includes adjusting relative phase between the first field and the second field in accordance to a differential phase, .beta., and combining the first and the second fields into an output. Particular selection of the arc angle, .alpha., and the differential phase, .beta., can determine the function of the output.

Strekalov, Dmitry V.↗

The multidimensional self-adaptive grid code, SAGE

This report describes the multidimensional self-adaptive grid code SAGE. A two-dimensional version of this code was described in an earlier report by the authors. The formulation of the multidimensional version is described in the first section of this document. The second section is presented in the form of a user guide that explains the input and execution of the code and provides many examples. Successful application of the SAGE code in both two and three dimensions for the solution of various flow problems has proven the code to be robust, portable, and simple to use. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for complex grid structures. Modifications to the method and the simplified input options make this a flexible and user-friendly code. The new SAGE code can accommodate both two-dimensional and three-dimensional flow problems.

Davies, Carol B.↗