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 451 records · Page 25

Finite element methods for compressible flows

The problems of mesh generation and developing effective algorithms for the solution of the equations of compressible flow on unstructured meshes are discussed. Adaptive mesh refinement methods can be implemented in a straightforward manner. Possible adaptive strategies are examined. A finite element method adapted to problems involving high speed compressible flow is described. The adaptive mesh regeneration procedure appears to offer the possibility of large computational savings in three dimensional flow computation.

Morgan, K.↗

Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation

An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.

Buning, Pieter G.↗

Adamantine 1.0: A Thermomechanical Simulator for Additive Manufacturing

Adamantine is a thermomechanical simulation code that is written in C++ and built on top of deal.II (Arndt et al., 2023), p4est (Burstedde et al., 2011), ArborX (Lebrun-Grandié et al., 2020), Trilinos (The Trilinos Project Team, 2020), and Kokkos (Trott et al., 2022). Adamantine was developed with additive manufacturing in mind and it is particularly well adapted to simulate fused filament fabrication, directed energy deposition, and powder bed fusion. Adamantine employs the finite element method with adaptive mesh refinement to solve a nonlinear anisotropic heat equation, enabling support for various additive manufacturing processes. It can also perform elastoplastic and thermoelastoplastic simulations. It can handle materials in three distinct phases (solid, liquid, and powder) to accurately reflect the physical state during different stages of the manufacturing process. To enhance simulation accuracy, adamantine incorporates data assimilation techniques (Asch et al., 2016). This allows it to integrate experimental data from sensors like thermocouples and infrared (IR) cameras. This combined approach helps account for errors arising from input parameters, material properties, models, and numerical calculations, leading to more realistic simulations that reflect what occurs in a particular print.

36 MATERIALS SCIENCE↗

Stability and Performance Metrics for Adaptive Flight Control

This paper addresses the problem of verifying adaptive control techniques for enabling safe flight in the presence of adverse conditions. Since the adaptive systems are non-linear by design, the existing control verification metrics are not applicable to adaptive controllers. Moreover, these systems are in general highly uncertain. Hence, the system's characteristics cannot be evaluated by relying on the available dynamical models. This necessitates the development of control verification metrics based on the system's input-output information. For this point of view, a set of metrics is introduced that compares the uncertain aircraft's input-output behavior under the action of an adaptive controller to that of a closed-loop linear reference model to be followed by the aircraft. This reference model is constructed for each specific maneuver using the exact aerodynamic and mass properties of the aircraft to meet the stability and performance requirements commonly accepted in flight control. The proposed metrics are unified in the sense that they are model independent and not restricted to any specific adaptive control methods. As an example, we present simulation results for a wing damaged generic transport aircraft with several existing adaptive controllers.

Stepanyan, Vahram↗

Effect of parallel flow on resonant layer responses in high beta plasmas

Abstract Resonant layers in a tokamak respond to non-axisymmetric magnetic perturbations by amplifying the mode amplitude and balancing the plasma rotation through magnetic reconnection and force balance, respectively. This resonant response can be characterized by local layer parameters and especially by a single quantity in the linear regime, the so-called inner-layer Δ. The computation of Δ under two-fluid drift-MHD formalism has been progressed by reducing the order of the system in the phase space, where the shielding current is approximated as being only carried by electrons, a posteriori . In this study, we relax the approximation and compute Δ accounted for by the parallel flow associated with the ion shielding current. The posteriori is numerically verified in great agreement with the original SLAYER developed in a previous paper (J.-K. Park 2022 Phys. Plasmas 29 072506). Extending the resonant layer response theory to high β plasmas, our research findings answer two important questions: how the parallel flow influences the resonant layer response and why the parallel flow effect appears in high β plasmas. The complicated plasma compression in high β regime allows the parallel flow response to give rise to the ion shielding current, which not only shifts the zero-crossing condition of the ExB flow but also enhances the field penetration threshold. Technically, the Riccati matrix transformation method is adapted to handle the numerical stiffness due to the increased order of the system. The high fidelity of this numerical method makes use of further extension of the model to higher-order systems to take other physical phenomena into account. This work is envisaged to predict the resonant layer response under high β fusion reactor conditions.

Lee, Yeongsun (ORCID:000000034474416X)↗

Control strategies

Techniques for improving the performance of robotic-manipulator path-control systems comprising independent SISO feedback controllers for each joint are discussed and illustrated with block diagrams, reviewing the results of recent analytical investigations. Topics examined include the servo design for a single link, the equations of motion for manipulators, SISO servo design for multiple links, inverse methods, pole placement with compensation of the gravity terms, linear state-feedback control based on the perturbation equations, and adaptive control methods. Consideration is given to variable-structure systems, suboptimal controllers, and the optimal-design-strategy approach.

Wang, J. C.↗

Control Systems with Normalized and Covariance Adaptation by Optimal Control Modification

Disclosed is a novel adaptive control method and system called optimal control modification with normalization and covariance adjustment. The invention addresses specifically to current challenges with adaptive control in these areas: 1) persistent excitation, 2) complex nonlinear input-output mapping, 3) large inputs and persistent learning, and 4) the lack of stability analysis tools for certification. The invention has been subject to many simulations and flight testing. The results substantiate the effectiveness of the invention and demonstrate the technical feasibility for use in modern aircraft flight control systems.

Nguyen, Nhan T.↗

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

SIDDA: SInkhorn Dynamic Domain Adaptation for image classification with equivariant neural networks

Modern neural networks (NNs) often do not generalize well in the presence of a ‘covariate shift’; that is, in situations where the training and test data distributions differ, but the conditional distribution of classification labels given the data remains unchanged. In such cases, NN generalization can be reduced to a problem of learning more robust, domain-invariant features. Domain adaptation (DA) methods include a broad range of techniques aimed at achieving this; however, these methods have struggled with the need for extensive hyperparameter tuning, which then incurs significant computational costs. In this work, we introduce SInkhorn Dynamic Domain Adaptation (SIDDA), an out-of-the-box DA training algorithm built upon the Sinkhorn divergence, that can achieve effective domain alignment with minimal hyperparameter tuning and computational overhead. We demonstrate the efficacy of our method on multiple simulated and real datasets of varying complexity, including simple shapes, handwritten digits, real astronomical observations, and remote sensing data. These datasets exhibit covariate shifts due to noise, blurring, differences between telescopes, and variations in imaging wavelengths. SIDDA is compatible with a variety of NN architectures, and it works particularly well in improving classification accuracy and model calibration when paired with symmetry-aware equivariant NNs (ENNs). We find that SIDDA consistently enhances the generalization capabilities of NNs, achieving up to a ${\approx}40\%$ improvement in classification accuracy on unlabeled target data, while also providing a more modest performance gain of $\lesssim 1\%$ on labeled source data. We also study the efficacy of DA on ENNs with respect to the varying group orders of the dihedral group DN, and find that the model performance improves as the degree of equivariance increases. Finally, if SIDDA achieves proper domain alignment, it also enhances model calibration on both source and target data, with the most significant gains in the unlabeled target domain—achieving over an order of magnitude improvement in the expected calibration error and Brier score. SIDDA’s versatility across various NN models and datasets, combined with its automated approach to domain alignment, has the potential to significantly advance multi-dataset studies by enabling the development of highly generalizable models.

79 ASTRONOMY AND ASTROPHYSICS↗

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗

Averaged initial Cartesian coordinates for long lifetime satellite studies

A set of initial Cartesian coordinates, which are free of ambiguities and resonance singularities, is developed to study satellite mission requirements and dispersions over long lifetimes. The method outlined herein possesses two distinct advantages over most other averaging procedures. First, the averaging is carried out numerically using Gaussian quadratures, thus avoiding tedious expansions and the resulting resonances for critical inclinations, etc. Secondly, by using the initial rectangular Cartesian coordinates, conventional, existing acceleration perturbation routines can be absorbed into the program without further modifications, thus making the method easily adaptable to the addition of new perturbation effects. The averaged nonlinear differential equations are integrated by means of a Runge Kutta method. A typical step size of several orbits permits rapid integration of long lifetime orbits in a short computing time.

Pines, S.↗

In vivo evaluation of an adaptive resuscitation controller using whole blood and crystalloid infusates for hemorrhagic shock

Introduction Hemorrhage remains the leading cause of preventable death on the battlefield. The most effective means to increase survivability is early hemorrhage control and fluid resuscitation. Unfortunately, fluid resuscitation requires constant adjustments to ensure casualty is properly managed, which is often not feasible in the pre-hospital setting. In this study, we showed how an adaptive closed-loop controller for hemorrhage resuscitation can be used to automate hemodynamic management using a swine hemorrhagic shock injury model. Methods The adaptive resuscitation controller (ARC) was previously developed to track pressure–volume responsiveness in real time and adjust its infusion rate to reach the target mean arterial pressure (MAP). Swine while maintained under a surgical plane of anesthesia and analgesia underwent a splenectomy, followed by two hemorrhage and resuscitation events. For the first resuscitation event, hemorrhage was induced to reduce the MAP to 35 mmHg until arterial lactate reached 4 mmol/L. The ARC system then infused whole blood (WB) to reach the target MAP and maintained the subject using crystalloids for 120 min. For the second resuscitation event, the subjects were hemorrhaged again but resuscitated using only crystalloid infusion to reach the target MAP and 120-min maintenance. Results The ARC was effective at WB resuscitation, reaching the target MAP in 2.0 ± 1.0 min. The median performance error was 1.1% ± 4.6%, and target overshoot was 14.4% ± 7.0% of the target MAP. The ARC maintained all animals throughout the 120 min maintenance period. For the second crystalloid-based resuscitation, ARC required a longer time to reach the target MAP, at an average rise time of 4.3 ± 4.0 min. However, target overshoot was reduced to 8.4% ± 7.3% of the target MAP. Much higher flow rates were required to maintain the target MAP during the second resuscitation event than during the first resuscitation event. Discussion The ARC was able to rapidly reach and maintain the target MAP effectively. However, this sometimes required large volumes of fluid as the ARC’s only goal was to reach the target MAP. Further clinical insight is needed regarding the preferred aggression level to achieve the target MAP. In conclusion, the ARC was successful in its programmed objective of reaching and maintaining the target MAP for extended periods of time in vivo , a critical next step toward improving hemorrhage treatment in the pre-hospital environment.

Snider, Eric J.↗

Modified Adaptive Control for Region 3 Operation in the Presence of Wind Turbine Structural Modes

Many challenges exist for the operation of wind turbines in an efficient manner that is reliable and avoids component fatigue and failure. Turbines operate in highly turbulent environments resulting in aerodynamic loads that can easily excite turbine structural modes, possibly causing component fatigue and failure. Wind turbine manufacturers are highly motivated to reduce component fatigue and failure that can lead to loss of revenue due to turbine down time and maintenance costs. The trend in wind turbine design is toward larger, more flexible turbines that are ideally suited to adaptive control methods due to the complexity and expense required to create accurate models of their dynamic characteristics. In this paper, we design an adaptive collective pitch controller for a high-fidelity simulation of a utility-scale, variable-speed horizontal axis wind turbine operating in Region 3. The objective of the adaptive pitch controller is to regulate generator speed, accommodate wind gusts, and reduce the excitation of structural modes in the wind turbine. The control objective is accomplished by collectively pitching the turbine blades. The adaptive collective pitch controller for Region 3 was compared in simulations with a baseline classical Proportional Integrator (PI) collective pitch controller. The adaptive controller will demonstrate the ability to regulate generator speed in Region 3, while accommodating gusts, and reducing the excitation of certain structural modes in the wind turbine.

Frost, Susan Alane↗

Demonstration of an AI-driven workflow for dynamic x-ray spectroscopy

X-ray absorption near edge structure (XANES) spectroscopy is a powerful technique for characterizing the chemical state and symmetry of individual elements within materials, but requires collecting data at many energy points which can be time-consuming. While adaptive sampling methods exist for efficiently collecting spectroscopic data, they often lack domain-specific knowledge about the structure of XANES spectra. Here we demonstrate a knowledge-injected Bayesian optimization approach for adaptive XANES data collection that incorporates understanding of spectral features like absorption edges and pre-edge peaks. We show this method accurately reconstructs the absorption edge of XANES spectra using only 15–20% of the measurement points typically needed for conventional sampling, while maintaining the ability to determine the x-ray energy of the sharp peak after the absorption edge with errors less than 0.03 eV, the absorption edge with errors less than 0.1 eV; and overall root-mean-square errors less than 0.005 compared to traditionally sampled spectra. Our experiments on battery materials and catalysts demonstrate the method’s effectiveness for both static and dynamic XANES measurements, improving data collection efficiency and enabling better time resolution for tracking chemical changes. This approach advances the degree of automation in XANES experiments, reducing the common errors of under- or over-sampling points near the absorption edge and enabling dynamic experiments that require high temporal resolution or limited measurement time.

Bayesian optimization↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Comprehensive Material Characterization and Simultaneous Model Calibration for Improved Computational Simulation Credibility

Computational simulation is increasingly relied upon for high-consequence engineering decisions, and a foundational element to solid mechanics simulations is a credible material model. Our ultimate vision is to interlace material characterization and model calibration in a real-time feedback loop, where the current model calibration results will drive the experiment to load regimes that add the most useful information to reduce parameter uncertainty. The current work investigated one key step to this Interlaced Characterization and Calibration (ICC) paradigm, using a finite load-path tree to incorporate history/path dependency of nonlinear material models into a network of surrogate models that replace computationally-expensive finite-element analyses. Our reference simulation was an elastoplastic material point subject to biaxial deformation with a Hill anisotropic yield criterion. Training data was generated using either a space-filling or adaptive sampling method, and surrogates were built using either Gaussian process or polynomial chaos expansion methods. Surrogate error was evaluated to be on the order of 10 ⁻5 and 10 ⁻3 percent for the space-filling and adaptive sampling training data, respectively. Direct Bayesian inference was performed with the surrogate network and with the reference material point simulator, and results agreed to within 3 significant figures for the mean parameter values, with a reduction in computational cost over 5 orders of magnitude. These results bought down risk regarding the surrogate network and facilitated a successful FY22-24 full LDRD proposal to research and develop the complete ICC paradigm.

36 MATERIALS SCIENCE↗

Application of a finite element algorithm for high speed viscous flows using structured and unstructured meshes

A higher-order streamline upwinding Petrov-Galerkin finite element method is employed for high speed viscous flow analysis using structured and unstructured meshes. For a Mach 8.03 shock interference problem, successive mesh adaptation was performed using an adaptive remeshing method. Results from the finite element algorithm compare well with both experimental data and results from an upwind cell-centered method. Finite element results for a Mach 14.1 flow over a 24 degree compression corner compare well with experimental data and two other numerical algorithms for both structured and unstructured meshes.

Vemaganti, Gururaja R.↗

A Chebyshev Collocation Method for Moving Boundaries, Heat Transfer, and Convection During Directional Solidification

Free and moving boundary problems require the simultaneous solution of unknown field variables and the boundaries of the domains on which these variables are defined. There are many technologically important processes that lead to moving boundary problems associated with fluid surfaces and solid-fluid boundaries. These include crystal growth, metal alloy and glass solidification, melting and name propagation. The directional solidification of semi-conductor crystals by the Bridgman-Stockbarger method is a typical example of such a complex process. A numerical model of this growth method must solve the appropriate heat, mass and momentum transfer equations and determine the location of the melt-solid interface. In this work, a Chebyshev pseudospectra collocation method is adapted to the problem of directional solidification. Implementation involves a solution algorithm that combines domain decomposition, finite-difference preconditioned conjugate minimum residual method and a Picard type iterative scheme.

Zhang, Yiqiang↗