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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Procedures for Computing Transonic Flows for Control of Adaptive Wind Tunnels

Numerical methods are developed for control of three dimensional adaptive test sections. The physical properties of the design problem occurring in the external field computation are analyzed, and a design procedure suited for solution of the problem is worked out. To do this, the desired wall shape is determined by stepwise modification of an initial contour. The necessary changes in geometry are determined with the aid of a panel procedure, or, with incident flow near the sonic range, with a transonic small perturbation (TSP) procedure. The designed wall shape, together with the wall deflections set during the tunnel run, are the input to a newly derived one-step formula which immediately yields the adapted wall contour. This is particularly important since the classical iterative adaptation scheme is shown to converge poorly for 3D flows. Experimental results obtained in the adaptive test section with eight flexible walls are presented to demonstrate the potential of the procedure. Finally, a method is described to minimize wall interference in 3D flows by adapting only the top and bottom wind tunnel walls.

Rebstock, Rainer↗
NASA NTRS1990

Limits of adaptation, residual interferences

Methods of determining linear residual wall interference appear to be well established theoretically; however they need to be validated, for example by comparative studies of test data on the same model in different adaptive-wall wind tunnels as well as in passive, ventilated-wall tunnels. The GARTEur CAST 7 and the CAST 10/DOA 2 investigations are excellent examples of such comparative studies. Results to date in both one-variable and two-variable methods for nonlinear wall interference indicate that a great deal more research and validation are required. The status in 2D flow is advanced over that in 3D flow as is the case generally with adaptive-wall development. Nevertheless, it is now well established that for transonic testing with extensive supercritical flow present, significant wall interference is likely to exist in conventional ventilated test sections. Consequently, residual correction procedures require further development hand-in-hand with further adaptive-wall development.

Mokry, Miroslav↗
DOE OSTI2022

Adaptive Mesh Refinement Large Eddy Simulation of the Supercritical Carbon Dioxide Round Turbulent Jet

Supercritical carbon dioxide (sCO2) is of interest to a range of engineering problems, including carbon capture, utilization, and storage (CCUS) as well as advanced cycles for power generation. Non-ideal variations in physical properties of sCO2 impact the physics of these systems. In this study, we simulate turbulent sCO2 jets to gain a better understanding of these physics.We use a second order finite volume method with adaptive mesh refinement as implemented in the first-principles simulation code PeleC to perform a Large Eddy Simulation (LES) of three turbulent jets of sCO2. Additionally, we use the Soave-Redlich-Kwong equation of state to close the system and examine the impact of a cubic equation of state on the turbulent flow physics. We look at velocity and Reynolds stress profiles at different downstream locations for three cases in which the temperature of the jet andthat of the ambient fluid differ in order to capture the effects of widely varying thermal properties in the pseudocritical region. These results are then contrasted with established theory for ideal gas jets.

adaptive mesh refinement↗
NASA NTRS1972

Profile inversion in presence of ray bending

Inversion of radio occultation data for planetary atmospheres and ionospheres has been performed using the seismological Herglotz-Wiechert method, as adapted by Phinney and Anderson to the radio-occultation case. Profile reconstruction performed in computer simulated experiments with this approach have been compared with the ones obtained with the straight-ray Abel transform. For a thin atmosphere and ionosphere, like the ones encountered on Mars, microwave occultation data can be inverted accurately with both methods. For a dense ionosphere like the sun's corona, ray bending of microwaves is severe, and recovered refractivity by the Herglotz-Wiechert method provides significant improvement over the straight-ray Abel transform: the error reduces from more than 60% to less than 20% at a height of 60,000 km above the base of the corona.

Wallio, H. A.↗
NASA NTRS1991

Turbulent flow calculations using unstructured and adaptive meshes

A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of the flow field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptaive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with expeirmental data.

Mavriplis, Dimitri J.↗
DOE OSTI2025

Geometry-aware framework for deep energy method: An application to structural mechanics with hyperelastic materials

Here, in this work, we introduce a novel physics-informed framework named the Geometry-Aware Deep Energy Method (GADEM) for solving structural mechanics problems on different geometries. As the weak form of the physical system equation (or the energy-based approach) has demonstrated clear advantages compared to the strong form for solving solid mechanics problems, GADEM employs the weak form and aims to infer the solution on multiple shapes of geometries. Integrating a geometry-aware framework into an energy-based method results in an effective physics-informed deep learning model in terms of accuracy and computational cost. Different ways to represent the geometric information and to encode the geometric latent vectors are investigated in this work. We introduce a loss function of GADEM which is minimized based on the potential energy of all considered geometries. An adaptive learning method is also employed for the sampling of collocation points to enhance the performance of GADEM. We present some applications of GADEM to solve solid mechanics problems, including a loading simulation of a toy tire involving contact mechanics and large deformation hyperelasticity. The numerical results of this work demonstrate the remarkable capability of GADEM to infer the solution on various and new shapes of geometries using only one trained model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Studies of leading-edge thrust phenomena

A study of practical limitations on achievement of theoretical leading-edge thrust has been made and an empirical method for estimation of attainable thrust has been developed. The method is based on a theoretical analysis of a set of two-dimensional airfoils to define thrust dependence on airfoil geometric characteristics and arbitrarily defined limiting pressures, an examination of two-dimensional airfoil experimental data to provide an estimate of limiting pressure dependence on local Mach number and Reynolds number, and employment of simple sweep theory to adapt the method to three-dimensional wings. Because the method takes into account the spanwise variation of airfoil section characteristics, an opportunity is afforded for design by iteration to maximize the attainable thrust and the attendant performance benefits. The applicability of the method was demonstrated by comparisons of theoretical and experimental aerodynamic characteristics for a series of wing-body configurations. Generally, good predictions of the attainable thrust and its influence on lift and drag characteristics were obtained over a range of Mach numbers from 0.24 to 2.0.

Carlson, H. W.↗
DOE OSTI2022

ASDFL: An adaptive super‐pixel discriminative feature‐selective learning for vehicle matching

Abstract There are a large number of cameras in modern transportation system that capture numerous vehicle images continuously. Therefore, automatic analysis of these vehicle images is helpful for traffic flow management, criminal investigations and vehicle inspections. Vehicle matching, which aims to determine whether two input images depict an identical vehicle, is one of the core tasks in vehicle analysis. Recent relevant studies have focused on local feature extraction instead of global extraction, since local details can provide crucial cues to distinguish between cars. However, these methods do not select local features; that is, they do not assign weights to local features. Therefore, in this research, we systematically study the vehicle matching task, and present a novel annotation‐free local‐based deep learning method called Adaptive super‐pixel discriminative feature‐selective learning (ASDFL) to address this issue. In ASDFL, vehicle images are segmented into clusters of super‐pixels of similar size by considering the location and colour similarities of pixels without using any component‐level annotation. These super‐pixels are deemed to be the virtual components of vehicles. Moreover, a convolutional neural network is used to extract the deep features of these virtual components. Thereafter, an instance‐specific mask generation module driven by the extracted global features is enhanced to produce a mask to select the most distinctive virtual components of each vehicle image pair in the feature space. Finally, the vehicle matching task is accomplished by classifying the selected virtual component features of each imaged vehicle pair. Extensive experiments on two popular vehicle identification benchmarks demonstrate that our method is 1.57% and 0.8% more accurate than the previous baselines in a vehicle matching task on the VeRi and VehicleID datasets, respectively, which demonstrates the effectiveness of our method.

Qin, Rong↗
DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Chordwise and compressibility corrections for arbitrary planform slender wings

The Lomax and Sluder method for adapting slender-wing theory to delta or rectangular wings by making chordwise and compressibility corrections is extended to cover wings of any arbitrary planform in subsonic and supersonic flows. The numerical accuracy of the present work is better than that of the Lomax-Sluder results. Comparison of the results of this work with those of the vortex-lattice method and Kernel function method for a family of Gothic and arrowhead wings shows good agreement. A universal curve is proposed for the evaluation of the lift coefficient of a low aspect ratio wing of an arbitrary planform in subsonic flow. The location of the center of pressure can also be estimated.

Levin, D.↗
NASA NTRS1990

Turbulent flow calculations using unstructured and adaptive meshes

A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow-field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of flow-field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with experimental data.

Mavriplis, Dimitri J.↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
DOE OSTI2021

Optoelectronic system with a wedge-shaped adapter

Optoelectronic systems with an adapter and methods of manufacturing or assembling the same are provided. An example of an optoelectronic system according to the present disclosure includes a substrate, an interposer, an electronic component disposed on the interposer, and an optical component. The optoelectronic system includes a ferrule and an optical fiber coupled to the ferrule. The optoelectronic system also includes an optical socket configured to receive the ferrule therein. The optoelectronic system further includes an adapter positioned between the interposer and the optical socket. The adapter has a wedge-shaped configuration such that the ferrule is disposed at a non-zero angle relative to the interposer when the ferrule is received in the optical socket and the optical socket is coupled to the adapter.

Mathai, Sagi Varghese↗
DOE OSTI2022

Embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods

We construct a family of embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods of order 2 ≤ p ≤ 4 to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction, the goals include non-defective property, large stability region, and small error values as defined in Dekker and Verwer (1984) and Kennedy et al. (2000). The new family of embedded pairs offer the ability for strong stability preserving (SSP) methods to adapt by varying the step-size. Through several numerical experiments, we assess the overall effectiveness in terms of work versus precision while also taking into consideration accuracy and stability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Leveraging generative adversarial networks to create realistic scanning transmission electron microscopy images

Abstract The rise of automation and machine learning (ML) in electron microscopy has the potential to revolutionize materials research through autonomous data collection and processing. A significant challenge lies in developing ML models that rapidly generalize to large data sets under varying experimental conditions. We address this by employing a cycle generative adversarial network (CycleGAN) with a reciprocal space discriminator, which augments simulated data with realistic spatial frequency information. This allows the CycleGAN to generate images nearly indistinguishable from real data and provide labels for ML applications. We showcase our approach by training a fully convolutional network (FCN) to identify single atom defects in a 4.5 million atom data set, collected using automated acquisition in an aberration-corrected scanning transmission electron microscope (STEM). Our method produces adaptable FCNs that can adjust to dynamically changing experimental variables with minimal intervention, marking a crucial step towards fully autonomous harnessing of microscopy big data.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
NASA NTRS1999

A New Method for Nonlinear and Nonstationary Time Series Analysis and Its Application to the Earthquake and Building Response Records

A new method for analyzing nonlinear and nonstationary data has been developed. The key part of the method is the Empirical Mode Decomposition method with which any complicated data set can be decomposed into a finite and often small number of Intrinsic Mode Functions (IMF). An IMF is defined as any function having the same numbers of zero-crossing and extrema, and also having symmetric envelopes defined by the local maxima and minima respectively. The IMF also admits well-behaved Hilbert transform. This decomposition method is adaptive, and, therefore, highly efficient. Since the decomposition is based on the local characteristic time scale of the data, it is applicable to nonlinear and nonstationary processes. With the Hilbert transform, the Intrinsic Mode Functions yield instantaneous frequencies as functions of time that give sharp identifications of imbedded structures. The final presentation of the results is an energy-frequency-time distribution, designated as the Hilbert Spectrum, Example of application of this method to earthquake and building response will be given. The results indicate those low frequency components, totally missed by the Fourier analysis, are clearly identified by the new method. Comparisons with Wavelet and window Fourier analysis show the new method offers much better temporal and frequency resolutions.

Huang, Norden E.↗
DOE OSTI2025

Model-based iterative reconstruction with adaptive regularization for artifact reduction in electron tomography

Obtaining high-quality 3D reconstructions from electron tomography of crystalline particles embedded in lighter support elements is crucial for various material systems such as catalysts for fuel cell applications. However, significant challenges arise due to the limited tilt range, sparse and low signal-to-noise ratio of the measurements. In addition, small metal particles can cause strong streaking and shading artifacts in the 3D reconstructions when using conventional reconstruction algorithms due to the presence of Bragg diffraction and the large scattering cross-section difference between the materials of the particles and the background support regions. These artifacts lead to errors in the downstream characterization affecting extraction of critical features such as the size of the metal particles, their distribution and the volume of the lighter support regions. In this paper, we present a two-stage algorithm based on metal artifact reduction, utilizing model-based iterative reconstruction methods with adaptive adjustment of regularization parameters. Our approach yields high-quality 3D reconstructions compared to traditional algorithms, accurately capturing both the metal particles as well as the background support. We demonstrate the effectiveness of our algorithm through simulated and experimental bright-field electron tomography data, showing significant improvements in reconstruction quality compared to traditional methods.

97 MATHEMATICS AND COMPUTING↗