Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “gradient 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 127 records · Page 7

MHOST: An efficient finite element program for inelastic analysis of solids and structures

An efficient finite element program for 3-D inelastic analysis of gas turbine hot section components was constructed and validated. A novel mixed iterative solution strategy is derived from the augmented Hu-Washizu variational principle in order to nodally interpolate coordinates, displacements, deformation, strains, stresses and material properties. A series of increasingly sophisticated material models incorporated in MHOST include elasticity, secant plasticity, infinitesimal and finite deformation plasticity, creep and unified viscoplastic constitutive model proposed by Walker. A library of high performance elements is built into this computer program utilizing the concepts of selective reduced integrations and independent strain interpolations. A family of efficient solution algorithms is implemented in MHOST for linear and nonlinear equation solution including the classical Newton-Raphson, modified, quasi and secant Newton methods with optional line search and the conjugate gradient method.

Nakazawa, S.↗

Optimal surface-tension isotropy in the Rothman-Keller color-gradient lattice Boltzmann method for multiphase flow

The Rothman-Keller color-gradient (CG) lattice Boltzmann method is a popular method to simulate two-phase flow because of its ability to deal with fluids with large viscosity contrasts and a wide range of interfacial tensions. Here, two fluids are labeled red and blue, and the gradient in the color difference is used to compute the effect of interfacial tension. It is well known that finite-difference errors in the color-gradient calculation lead to anisotropy of interfacial tension and errors such as spurious currents. Here, we investigate the accuracy of the CG calculation for interfaces between fluids with several radii of curvature and find that the standard CG calculations lead to significant inaccuracy. Specifically, we observe significant anisotropy of the color gradient of order 7% for high curvature of an interface such as when a pinchout occurs. We derive a second order accurate color gradient and find that the diagonal nearest neighbors can be weighted differently than in the usual color-gradient calculation such that anisotropy is minimized to a fraction of a percent. The optimal weights that minimize anisotropy for the smallest radius of curvature interface are found to be w = (0.298, 0.284, 0.275) for diagonal nearest neighbors for the cases of the interface smoothing parameter β = (0.5, 0.7, 0.99), somewhat higher than the w = 0.25 value derived by Leclaire et al. [Leclaire, Reggio, and Trepanier, Computers and Fluids 48, 98 (2011)] based on obtaining isotropic errors to second order. We find that use of these optimal w values yields over a factor of 10 decrease in anisotropy and over a factor of 30 decrease in mean anisotropy relative to using the standard w = 1 value. And we find a factor of about 2 decrease in the anisotropic error and up to factor 15 decrease in mean anisotropic error relative to the choice of w = 0.25 for small radius of curvature interfaces. The improved CG calculations will allow the method to be more reliably applied to studies of phenomenology and pore scale processes such as viscous and capillary fingering, and droplet formation where surface-tension isotropy of narrow fingers and small droplets plays a crucial role in correctly capturing phenomenology. We present an example illustrating how different phenomena can be captured using the improved color-gradient method. Namely, we present simulations of a wetting fluid invading a fluid filled pipe where the viscosity ratio of fluids is unity in which droplets form at the transition to fingering using the improved CG calculations that are not captured using the standard CG calculations. We present an explanation of why this is so which relates to anisotropy of the surface tension, which inhibits the pinchouts needed to form droplets.

58 GEOSCIENCES↗

Estimating SHmax azimuth with P sources and vertical geophones: Use P-P reflection amplitudes or use SV-P reflection times?

We compared two methods for extracting the azimuth of maximum horizontal stress (SHmax) from 3D land-based seismic data generated by a P source and recorded with vertical geophones. In the first method, we used the direct-SV mode that is produced by all land-based P sources. P sources generate SV illumination that radiates in all azimuth directions from a source station and creates SV-P reflections that are recorded by vertical geophones. Unless stratigraphy has steep dip, SV-P raypaths recorded by vertical geophones are the reverse of P-SV raypaths recorded by horizontal geophones. Thus, SV-P data provide the same S-wave sensitivity to stress fields as popular P-SV data do. In the second method, we retrieved P-P reflections and then performed an amplitude-variation-with-azimuth (AVA) analysis of the amplitude-gradient behavior of P-P reflection wavelets. We did this analysis in narrow azimuth corridors to determine the gradient of reflection-wavelet amplitudes as a function of azimuth. This P-P AVA amplitude-gradient method has been of great interest in the reflection seismology community since it was introduced in the late 1990s. Each of these methods, AVA analysis of the gradient of P-P reflection amplitudes and azimuth-dependent arrival times of SV-P reflections, can be used to determine the azimuth of SHmax stress. We compare the results of the two methods with ground truth measurements of SHmax azimuth at a CO 2 sequestration site in the Michigan Basin. SHmax azimuths were determined from P-P and SV-P data at three major boundaries at depths of approximately 3500 ft (1067 m), 5500 ft (1676 m), and 7500 ft (2286 m). Two estimates of SHmax azimuth (one using SV-P data and one using P-P data) were made at each stacking bin inside a 24 mi 2 (62 km 2 ) image space. The result was approximately 98,000 estimates of SHmax azimuth across each of these three boundaries for each of these two prediction strategies. Histogram displays of PP AVA gradient estimates had peaks at correct azimuths of SHmax at all three depths, but the spread of the distributions widened with depth and split into two peaks at the deepest boundary. In contrast, each histogram of SHmax azimuth predicted by azimuth-dependent SV-P traveltimes had a single, definitive peak that was positioned at the correct SHmax azimuth at all three boundary depths.

Geochemistry & Geophysics↗

Detection of Sub-Surface Water on Mars by Controlled and Natural Source Electromagnetic Induction

Detection of subsurface liquid water on Mars is a leading scientific objective for Mars exploration in this decade. We describe electromagnetic induction (EM) methods that are both uniquely well suited for detection of subsurface liquid water on Mars and practical within the context of a Mars exploration program. EM induction methods are ideal for detection of more highly conducting (liquid water bearing) soils and rock beneath a more resistive overburden. A combined natural source and controlled source method offers an efficient and unambiguous characterization of the depth to liquid water and the extent of the aqueous region. The controlled source method employs an ac vertical dipole source (horizontal loop) to probe the depth to the conductor and a natural source method (gradient sounding) to characterize its conductivity-thickness product. These methods are proven in geophysical exploration and can be tailored to cope with any reasonable Mars crustal electrical conductivity. We describe a practical experiment and discuss experiment optimization to address the range of material properties likely encountered in the Mars crust.

Connerney, J. E. P.↗

Spectral ordering techniques for incomplete LU preconditoners for CG methods

The effectiveness of an incomplete LU (ILU) factorization as a preconditioner for the conjugate gradient method can be highly dependent on the ordering of the matrix rows during its creation. Detailed justification for two heuristics commonly used in matrix ordering for anisotropic problems is given. The bandwidth reduction and weak connection following heuristics are implemented through an ordering method based on eigenvector computations. This spectral ordering is shown to be a good representation of the heuristics. Analysis and test cases in two and three dimensional diffusion problems demonstrate when ordering is important, and when an ILU decomposition will be ordering insensitive. The applicability of the heuristics is thus evaluated and placed on a more rigorous footing.

Clift, Simon S.↗

Minimum impulse three-body trajectories.

A rapid and accurate method of calculating optimal impulsive transfers in the restricted problem of three bodies has been developed. The technique combines a multi-conic method of trajectory integration with primer vector theory and an accelerated gradient method of trajectory optimization. A unique feature is that the state transition matrix and the primer vector are found analytical without additional integrations or differentiations. The method has been applied to the determination of optimal two and three impulse transfers between the L2 libration point and circular orbits about both the earth and the moon.

D'Amario, L.↗

Electromagnetic characterization of conformal antennas

The ultimate objective of this project is to develop a new technique which permits an accurate simulation of microstrip patch antennas or arrays with various feed, superstrate and/or substrate configurations residing in a recessed cavity whose aperture is planar, cylindrical or otherwise conformed to the substructure. The technique combines the finite element and boundary integral methods to formulate a system suitable for solution via the conjugate gradient method in conjunction with the fast Fourier transform. The final code is intended to compute both scattering and radiation patterns of the structure with an affordable memory demand. With upgraded capabilities, the four included papers examined the radar cross section (RCS), input impedance, gain, and resonant frequency of several rectangular configurations using different loading and substrate/superstrate configurations.

Volakis, John L.↗

Computational methods to obtain time optimal jet engine control

Dynamic Programming and the Fletcher-Reeves Conjugate Gradient Method are two existing methods which can be applied to solve a general class of unconstrained fixed time, free right end optimal control problems. New techniques are developed to adapt these methods to solve a time optimal control problem with state variable and control constraints. Specifically, they are applied to compute a time optimal control for a jet engine control problem.

Basso, R. J.↗

Integral boundary conditions in phase field models

Modeling the chemical, electric and thermal transport as well as phase transitions and the accompanying mesoscale microstructure evolution within a material in an electronic device setting involves the solution of partial differential equations often with integral boundary conditions. Employing the familiar Poisson equation describing the electric potential evolution in a material exhibiting insulator to metal transitions, we exploit a special property of such an integral boundary condition, and we properly formulate the variational problem and establish its well-posedness. Next, we compare our method with the commonly-used Lagrange multiplier method that can also handle such boundary conditions. Numerical experiments demonstrate that our new method achieves optimal convergence rate in contrast to the conventional Lagrange multiplier method. Furthermore, the linear system derived from our method is symmetric positive definite, and can be efficiently solved by Conjugate Gradient method with algebraic multigrid preconditioning.

97 MATHEMATICS AND COMPUTING↗

Towards Enhancing Coding Productivity for GPU Programming Using Static Graphs

The main contribution of this work is to increase the coding productivity of GPU programming by using the concept of Static Graphs. GPU capabilities have been increasing significantly in terms of performance and memory capacity. However, there are still some problems in terms of scalability and limitations to the amount of work that a GPU can perform at a time. To minimize the overhead associated with the launch of GPU kernels, as well as to maximize the use of GPU capacity, we have combined the new CUDA Graph API with the CUDA programming model (including CUDA math libraries) and the OpenACC programming model. We use as test cases two different, well-known and widely used problems in HPC and AI: the Conjugate Gradient method and the Particle Swarm Optimization. In the first test case (Conjugate Gradient) we focus on the integration of Static Graphs with CUDA. In this case, we are able to significantly outperform the NVIDIA reference code, reaching an acceleration of up to 11x thanks to a better implementation, which can benefit from the new CUDA Graph capabilities. In the second test case (Particle Swarm Optimization), we complement the OpenACC functionality with the use of CUDA Graph, achieving again accelerations of up to one order of magnitude, with average speedups ranging from 2x to 4x, and performance very close to a reference and optimized CUDA code. Our main target is to achieve a higher coding productivity model for GPU programming by using Static Graphs, which provides, in a very transparent way, a better exploitation of the GPU capacity. The combination of using Static Graphs with two of the current most important GPU programming models (CUDA and OpenACC) is able to reduce considerably the execution time w.r.t. the use of CUDA and OpenACC only, achieving accelerations of up to more than one order of magnitude. Finally, we propose an interface to incorporate the concept of Static Graphs into the OpenACC Specifications.

58 GEOSCIENCES↗

Random Phase Approximation Correlation Energy Using Real-Space Density Functional Perturbation Theory

We present a real-space method for computing the random phase approximation (RPA) correlation energy within Kohn–Sham density functional theory, leveraging the low-rank nature of the frequency-dependent density response operator. In particular, we employ a cubic-scaling formalism based on density functional perturbation theory that circumvents the calculation of the response function matrix, instead relying on the ability to compute its product with a vector through the solution of the associated Sternheimer linear systems. We develop a large-scale parallel implementation of this formalism using the subspace iteration method in conjunction with the spectral quadrature method while employing the Kronecker product-based method for the application of the Coulomb operator and the conjugate orthogonal conjugate gradient method for the solution of the linear systems. We demonstrate convergence with respect to key parameters and verify the method’s accuracy by comparing with plane-wave results. We show that the framework achieves good strong scaling to many thousands of processors, reducing the time to solution for a lithium hydride system with 128 electrons to around 150 s on 4608 processors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Krylov subspace methods on supercomputers

A short survey of recent research on Krylov subspace methods with emphasis on implementation on vector and parallel computers is presented. Conjugate gradient methods have proven very useful on traditional scalar computers, and their popularity is likely to increase as three-dimensional models gain importance. A conservative approach to derive effective iterative techniques for supercomputers has been to find efficient parallel/vector implementations of the standard algorithms. The main source of difficulty in the incomplete factorization preconditionings is in the solution of the triangular systems at each step. A few approaches consisting of implementing efficient forward and backward triangular solutions are described in detail. Polynomial preconditioning as an alternative to standard incomplete factorization techniques is also discussed. Another efficient approach is to reorder the equations so as to improve the structure of the matrix to achieve better parallelism or vectorization. An overview of these and other ideas and their effectiveness or potential for different types of architectures is given.

Saad, Youcef↗

Sub-domain decomposition methods and computational controls for multibody dynamical systems

This paper presents a concurrent methodology to simulate the dynamics of flexible multibody systems with a large number of degrees of freedom. A general class of open-loop structures is treated and a redundant coordinate formulation is adopted. A range space method is used in which the constraint forces are calculated using a preconditioned conjugate gradient method. By using a preconditioner motivated by the regular ordering of the directed graph of the structures, it is shown that the method is order N in the total number of coordinates of the system. The overall formulation has the advantage that it permits fine parallelization and does not rely on system topology to induce concurrency. It can be efficiently implemented on the present generation of parallel computers with a large number of processors. Validation of the method is presented via numerical simulations of space structures incorporating large number of flexible degrees of freedom.

Menon, R. G.↗

A Drift‐Kinetic Method for Obtaining Gradients in Plasma Properties From Single‐Point Distribution Function Data

Abstract In this paper, we derive a new drift‐kinetic method for estimating gradients in the plasma properties through a velocity space distribution at a single point. The gradients are intrinsically related to agyrotropic features of the distribution function. This method predicts the gradients in the magnetized distribution function and can predict gradients of arbitrary moments of the gyrotropic background distribution function. The method allows for estimates on density and pressure gradients on the scale of a Larmor radius, proving to resolve smaller scales than any method currently available to spacecraft. The model is verified with a set of fully kinetic VPIC particle‐in‐cell simulations.

Wetherton, B. A.↗

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗

Estimating turbulent energy flux vertical profiles from uncrewed aircraft system measurements: exemplary results for the MOSAiC campaign

This study analyzes turbulent energy fluxes in the Arctic atmospheric boundary layer (ABL) using measurements with a small uncrewed aircraft system (sUAS). Turbulent fluxes constitute a major part of the atmospheric energy budget and influence the surface heat balance by distributing energy vertically in the atmosphere. However, only few in situ measurements of the vertical profile of turbulent fluxes in the Arctic ABL exist. The study presents a method to derive turbulent heat fluxes from DataHawk2 sUAS turbulence measurements, based on the flux gradient method with a parameterization of the turbulent exchange coefficient. This parameterization is derived from high-resolution horizontal wind speed measurements in combination with formulations for the turbulent Prandtl number and anisotropy depending on stability. Measurements were taken during the MOSAiC (Multidisciplinary drifting Observatory for the Study of Arctic Climate) expedition in the Arctic sea ice during the melt season of 2020. For three example cases from this campaign, vertical profiles of turbulence parameters and turbulent heat fluxes are presented and compared to balloon-borne, radar, and near-surface measurements. The combination of all measurements draws a consistent picture of ABL conditions and demonstrates the unique potential of the presented method for studying turbulent exchange processes in the vertical ABL profile with sUAS measurements.

54 ENVIRONMENTAL SCIENCES↗

Some iterative schemes for transonic potential flows

The minimal residual (MR) method for the numerical solution of transonic potential flows is closely related to the conjugate gradient method, which has found widespread use in the solution of large sparse, symmetric, and positive-definite linear equations. The primary advantage of the MR method is its applicability to both symmetric and nonsymmetric matrices.

Wong, Y. S.↗

Microwave Imaging on Metal Objects

This final report for the project discusses the attempts to model, using different methods, microwave image reconstruction. Maximum Entropy Method was not successful. Attempts to use Singular Value Decomposition (SVD) got some good results after initial failure. SVD is based upon a theory of linear algebra, to the effect that any M X N Matrix A whose number of rows M is greater than or equal to its number of columns, N can be written as the product of an M X N column-orthogonal matrix U, an N X N diagonal Matrix, W, with m positive or zero elements (the singular values) and the transposition of an N X N orthogonal matrix V. In microwave imaging, the scattered fields can be expressed by the induced current distribution. The SVD method required more contiguous computer memory than was available. Work was also done on the Conjugate Gradient Method (CGM), which didn't work well when tried earlier. It was found that separation of the imaginary part and the real part during calculation may work. This work was considered incomplete as of the end of the grant period.

Tolliver, C. L.↗