Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive algorithm”

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,639 records · Page 91

Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks

Here we propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.

97 MATHEMATICS AND COMPUTING↗

SAGE: The Self-Adaptive Grid Code

The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

Davies, Carol B.↗

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

A conservative phase-space moving-grid strategy for a 1D-2V Vlasov–Fokker–Planck Solver

In this work, we develop a conservative configuration- and velocity-space (i.e., phase-space) moving-grid strategy for the Vlasov–Fokker–Planck (VFP) equation in a planar geometry. The velocity-space grid is normalized and shifted in terms of the thermal speed and the bulk-fluid velocity, respectively. The configuration-space grid is moved according to a mesh-motion-partial-differential equation (MMPDE), which equidistributes a monitor function that is inversely proportional to the gradient-length scales of the macroscopic plasma quantities. The resulting inertial terms in the transformed VFP equations are discretized to ensure the discrete conservation of mass, momentum, and energy. To satisfy the discrete conservation theorems in the presence of phase-space mesh motion, we employ the method of discrete nonlinear constraints – explored in previous studies – but the underlying symmetries are determined in a much more efficient manner than before. The conservative grid-adaptivity strategy provides an efficient scheme that resolves important physical structures in the phase-space while controlling the computational complexity at all times. We demonstrate the favorable features of the proposed algorithm through a set of test cases of increasing complexity. The problems test independent components of the algorithms, as well as the integrated capability on settings relevant to inertial confinement fusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient, conservative, time-implicit solver for the fully kinetic arbitrary-species 1D-2V Vlasov-Ampère system

In this paper, we consider the solution of the fully kinetic (including electrons) Vlasov-Ampère system in a one-dimensional physical space and two-dimensional velocity space (1D-2V) for an arbitrary number of species with a time-implicit Eulerian algorithm. The problem of velocity-space meshing for disparate thermal and bulk velocities is dealt with by an adaptive coordinate transformation of the Vlasov equation for each species, which is then discretized, including the resulting inertial terms. Mass, momentum, and energy are conserved, and Gauss's law is enforced to within the nonlinear convergence tolerance of the iterative solver through a set of nonlinear constraint functions while permitting significant flexibility in choosing discretizations in time, configuration, and velocity space. We mitigate the temporal stiffness introduced by, e.g., the plasma frequency through the use of high-order/low-order (HOLO) acceleration of the iterative implicit solver. We present several numerical results for canonical problems of varying degrees of complexity, including the multiscale ion-acoustic shock wave problem, which demonstrate the efficacy, accuracy, and efficiency of the scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Localization dynamics in a centrally coupled system

In systems in which interactions couple a central degree of freedom and a bath, one would expect signatures of the bath's phase to be reflected in the dynamics of the central degree of freedom. This has been recently explored in connection with many-body localized baths coupled with a central qubit or a single-cavity mode - systems with growing experimental relevance in various platforms. Such models also have an interesting connection with Floquet many-body localization via quantizing the external drive, although this has been relatively unexplored. Here we adapt the multilayer multiconfigurational time-dependent Hartree (ML-MCTDH) method, a well-known tree tensor network algorithm, to numerically simulate the dynamics of a central degree of freedom, represented by a d-level system (qudit), coupled to a disordered interacting one-dimensional spin bath. ML-MCTDH allows us to reach ≈10 2 lattice sites, a far larger system size than what is feasible with exact diagonalization or kernel polynomial methods. From the intermediate time dynamics, we find a well-defined thermodynamic limit for the qudit dynamics upon appropriate rescaling of the system-bath coupling. The spin system shows similar scaling collapse in the Edward-Anderson spin-glass order parameter or entanglement entropy at relatively short times. At longer timescales, we see slow growth of the entanglement, which may arise from dephasing mechanisms in the localized system or long-range interactions mediated by the central degree of freedom. Similar signs of localization are shown to appear as well with unscaled system-bath coupling.

1-dimensional spin chains↗

Fast widefield imaging of neuronal structure and function with optical sectioning in vivo

Optical microscopy, owing to its noninvasiveness and subcellular resolution, enables in vivo visualization of neuronal structure and function in the physiological context. Optical-sectioning structured illumination microscopy (OS-SIM) is a widefield fluorescence imaging technique that uses structured illumination patterns to encode in-focus structures and optically sections 3D samples. However, its application to in vivo imaging has been limited. In this study, we optimized OS-SIM for in vivo neural imaging. We modified OS-SIM reconstruction algorithms to improve signal-to-noise ratio and correct motion-induced artifacts in live samples. Incorporating an adaptive optics (AO) module to OS-SIM, we found that correcting sample-induced optical aberrations was essential for achieving accurate structural and functional characterizations in vivo. With AO OS-SIM, we demonstrated fast, high-resolution in vivo imaging with optical sectioning for structural imaging of mouse cortical neurons and zebrafish larval motor neurons, and functional imaging of quantal synaptic transmission at Drosophila larval neuromuscular junctions.

42 ENGINEERING↗

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗

Some practical universal noiseless coding techniques

Some practical adaptive techniques for the efficient noiseless coding of a broad class of such data sources are developed and analyzed. Algorithms are designed for coding discrete memoryless sources which have a known symbol probability ordering but unknown probability values. A general applicability of these algorithms to solving practical problems is obtained because most real data sources can be simply transformed into this form by appropriate preprocessing. These algorithms have exhibited performance only slightly above all entropy values when applied to real data with stationary characteristics over the measurement span. Performance considerably under a measured average data entropy may be observed when data characteristics are changing over the measurement span.

Rice, R. F.↗

A structured and unstructured remeshing method for high speed flows

An adaptive remeshing method using both triangular and quadrilateral elements suitable for high speed flows is presented. For inviscid flows the method generates completely unstructured meshes. For viscous flows the boundary layer edge is identified adaptively and a structured mesh is generated in the boundary layer, and an unstructured mesh is generated in the inviscid region. Examples of inviscid and viscous mesh adaptations for high speed flows are presented. A comparison is made between first order and higher order finite element algorithms when used in association with the remeshing method.

Vemaganti, Gururaja R.↗

Nonlinear stability and control study of highly maneuverable high performance aircraft, phase 2

Research leading to the development of new nonlinear methodologies for the adaptive control and stability analysis of high angle of attack aircraft such as the F-18 is discussed. The emphasis has been on nonlinear adaptive control, but associated model development, system identification, stability analysis, and simulation were studied in some detail as well. Studies indicated that nonlinear adaptive control can outperform linear adaptive control for rapid maneuvers with large changes in angle of attack. Included here are studies on nonlinear model algorithmic controller design and an analysis of nonlinear system stability using robust stability analysis for linear systems.

Mohler, R. R.↗

Direct adaptive impedance control of manipulators

An adaptive scheme for controlling the end-effector impedance of robot manipulators is presented. The proposed control system consists of three subsystems: a simple filter which characterizes the desired dynamic relationship between the end-effector position error and the end-effector/environment contact force, an adaptive controller which produces the Cartesian-space control input required to provide this desired dynamic relationship, and an algorithm for mapping the Cartesian-space control input to a physically realizable joint-space control torque. The controller does not require knowledge of either the structure or the parameter values of the robot dynamics, and it is implemented without calculation of the robot inverse kinematic transformation. As a result, the scheme represents a very general and computationally efficient approach to controlling the impedance of both nonredundant and redundant manipulators. Furthermore, the method can be applied directly to trajectory tracking in free-space motion by removing the impedance filter.

Colbaugh, R.↗

High Performance Parallel Methods for Space Weather Simulations

This is the final report of our NASA AISRP grant entitled 'High Performance Parallel Methods for Space Weather Simulations'. The main thrust of the proposal was to achieve significant progress towards new high-performance methods which would greatly accelerate global MHD simulations and eventually make it possible to develop first-principles based space weather simulations which run much faster than real time. We are pleased to report that with the help of this award we made major progress in this direction and developed the first parallel implicit global MHD code with adaptive mesh refinement. The main limitation of all earlier global space physics MHD codes was the explicit time stepping algorithm. Explicit time steps are limited by the Courant-Friedrichs-Lewy (CFL) condition, which essentially ensures that no information travels more than a cell size during a time step. This condition represents a non-linear penalty for highly resolved calculations, since finer grid resolution (and consequently smaller computational cells) not only results in more computational cells, but also in smaller time steps.

Hunter, Paul↗

Aeroservoelastic Model Validation and Test Data Analysis of the F/A-18 Active Aeroelastic Wing

Model validation and flight test data analysis require careful consideration of the effects of uncertainty, noise, and nonlinearity. Uncertainty prevails in the data analysis techniques and results in a composite model uncertainty from unmodeled dynamics, assumptions and mechanics of the estimation procedures, noise, and nonlinearity. A fundamental requirement for reliable and robust model development is an attempt to account for each of these sources of error, in particular, for model validation, robust stability prediction, and flight control system development. This paper is concerned with data processing procedures for uncertainty reduction in model validation for stability estimation and nonlinear identification. F/A-18 Active Aeroelastic Wing (AAW) aircraft data is used to demonstrate signal representation effects on uncertain model development, stability estimation, and nonlinear identification. Data is decomposed using adaptive orthonormal best-basis and wavelet-basis signal decompositions for signal denoising into linear and nonlinear identification algorithms. Nonlinear identification from a wavelet-based Volterra kernel procedure is used to extract nonlinear dynamics from aeroelastic responses, and to assist model development and uncertainty reduction for model validation and stability prediction by removing a class of nonlinearity from the uncertainty.

Brenner, Martin J.↗

Modifications to Axially Symmetric Simulations Using New DSMC (2007) Algorithms

Several modifications aimed at improving physical accuracy are proposed for solving axially symmetric problems building on the DSMC (2007) algorithms introduced by Bird. Originally developed to solve nonequilibrium, rarefied flows, the DSMC method is now regularly used to solve complex problems over a wide range of Knudsen numbers. These new algorithms include features such as nearest neighbor collisions excluding the previous collision partners, separate collision and sampling cells, automatically adaptive variable time steps, a modified no-time counter procedure for collisions, and discontinuous and event-driven physical processes. Axially symmetric solutions require radial weighting for the simulated molecules since the molecules near the axis represent fewer real molecules than those farther away from the axis due to the difference in volume of the cells. In the present methodology, these radial weighting factors are continuous, linear functions that vary with the radial position of each simulated molecule. It is shown that how one defines the number of tentative collisions greatly influences the mean collision time near the axis. The method by which the grid is treated for axially symmetric problems also plays an important role near the axis, especially for scalar pressure. A new method to treat how the molecules are traced through the grid is proposed to alleviate the decrease in scalar pressure at the axis near the surface. Also, a modification to the duplication buffer is proposed to vary the duplicated molecular velocities while retaining the molecular kinetic energy and axially symmetric nature of the problem.

Liechty, Derek S.↗

Hard X-Ray Flare Source Sizes Measured with the Ramaty High Energy Solar Spectroscopic Imager

Ramaty High Energy Solar Spectroscopic Imager (RHESSI) observations of 18 double hard X-ray sources seen at energies above 25 keV are analyzed to determine the spatial extent of the most compact structures evident in each case. The following four image reconstruction algorithms were used: Clean, Pixon, and two routines using visibilities maximum entropy and forward fit (VFF). All have been adapted for this study to optimize their ability to provide reliable estimates of the sizes of the more compact sources. The source fluxes, sizes, and morphologies obtained with each method are cross-correlated and the similarities and disagreements are discussed. The full width at half-maximum (FWHM) of the major axes of the sources with assumed elliptical Gaussian shapes are generally well correlated between the four image reconstruction routines and vary between the RHESSI resolution limit of approximately 2" up to approximately 20" with most below 10". The FWHM of the minor axes are generally at or just above the RHESSI limit and hence should be considered as unresolved in most cases. The orientation angles of the elliptical sources are also well correlated. These results suggest that the elongated sources are generally aligned along a flare ribbon with the minor axis perpendicular to the ribbon. This is verified for the one flare in our list with coincident Transition Region and Coronal Explorer (TRACE) images. There is evidence for significant extra flux in many of the flares in addition to the two identified compact sources, thus rendering the VFF assumption of just two Gaussians inadequate. A more realistic approximation in many cases would be of two line sources with unresolved widths. Recommendations are given for optimizing the RHESSI imaging reconstruction process to ensure that the finest possible details of the source morphology become evident and that reliable estimates can be made of the source dimensions.

Dennis, Brian R.↗

Functional Near-Infrared Spectroscopy Signals Measure Neuronal Activity in the Cortex

Functional near infrared spectroscopy (fNIRS) is an emerging optical neuroimaging technology that indirectly measures neuronal activity in the cortex via neurovascular coupling. It quantifies hemoglobin concentration ([Hb]) and thus measures the same hemodynamic response as functional magnetic resonance imaging (fMRI), but is portable, non-confining, relatively inexpensive, and is appropriate for long-duration monitoring and use at the bedside. Like fMRI, it is noninvasive and safe for repeated measurements. Patterns of [Hb] changes are used to classify cognitive state. Thus, fNIRS technology offers much potential for application in operational contexts. For instance, the use of fNIRS to detect the mental state of commercial aircraft operators in near real time could allow intelligent flight decks of the future to optimally support human performance in the interest of safety by responding to hazardous mental states of the operator. However, many opportunities remain for improving robustness and reliability. It is desirable to reduce the impact of motion and poor optical coupling of probes to the skin. Such artifacts degrade signal quality and thus cognitive state classification accuracy. Field application calls for further development of algorithms and filters for the automation of bad channel detection and dynamic artifact removal. This work introduces a novel adaptive filter method for automated real-time fNIRS signal quality detection and improvement. The output signal (after filtering) will have had contributions from motion and poor coupling reduced or removed, thus leaving a signal more indicative of changes due to hemodynamic brain activations of interest. Cognitive state classifications based on these signals reflect brain activity more reliably. The filter has been tested successfully with both synthetic and real human subject data, and requires no auxiliary measurement. This method could be implemented as a real-time filtering option or bad channel rejection feature of software used with frequency domain fNIRS instruments for signal acquisition and processing. Use of this method could improve the reliability of any operational or real-world application of fNIRS in which motion is an inherent part of the functional task of interest. Other optical diagnostic techniques (e.g., for NIR medical diagnosis) also may benefit from the reduction of probe motion artifact during any use in which motion avoidance would be impractical or limit usability.

Harrivel, Angela↗