SEARCH · Engineering Papers

Results for “Adaptive step size”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRS2019

Atmospheric Correction of Satellite Ocean-Color Imagery During the PACE Era

The Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission will carry into space the Ocean Color Instrument (OCI), a spectrometer measuring at 5 nm spectral resolution in the ultraviolet (UV) to near infrared (NIR) with additional spectral bands in the shortwave infrared (SWIR), and two multi-angle polarimeters that will overlap the OCI spectral range and spatial coverage, i. e., the Spectrometer for Planetary Exploration (SPEXone) and the Hyper-Angular Rainbow Polarimeter (HARP2). These instruments, especially when used in synergy, have great potential for improving estimates of water reflectance in the post Earth Observing System (EOS) era. Extending the top-of-atmosphere (TOA) observations to the UV, where aerosol absorption is effective, adding spectral bands in the SWIR, where even the most turbid waters are black and sensitivity to the aerosol coarse mode is higher than at shorter wavelengths, and measuring in the oxygen A-band to estimate aerosol altitude will enable greater accuracy in atmospheric correction for ocean color science. The multi-angular and polarized measurements, sensitive to aerosol properties (e.g., size distribution, index of refraction), can further help to identify or constrain the aerosol model, or to retrieve directly water reflectance. Algorithms that exploit the new capabilities are presented, and their ability to improve accuracy is discussed. They embrace a modern, adapted heritage two-step algorithm and alternative schemes (deterministic, statistical) that aim at inverting the TOA signal in a single step. These schemes, by the nature of their construction, their robustness, their generalization properties, and their ability to associate uncertainties, are expected to become the new standard in the future. A strategy for atmospheric correction is presented that ensures continuity and consistency with past and present ocean-color missions while enabling full exploitation of the new dimensions and possibilities. Despite the major improvements anticipated with the PACE instruments, gaps/issues remain to be filled/tackled. They include dealing properly with whitecaps, taking into account Earth-curvature effects, correcting for adjacency effects, accounting for the coupling between scattering and absorption, modeling accurately water reflectance, and acquiring a sufficiently representative dataset of water reflectance in the UV to SWIR. Dedicated efforts, experimental and theoretical, are in order to gather the necessary information and rectify inadequacies. Ideas and solutions are put forward to address the unresolved issues. Thanks to its design and characteristics, the PACE mission will mark the beginning of a new era of unprecedented accuracy in ocean-color radiometry from space.

Robert J Frouin↗

NASA NTRS2019

Atmospheric Correction of Satellite Ocean-Color Imagery During the PACE Era

ocean color↗

DOE OSTI2023

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1995

An hp-adaptivity and error estimation for hyperbolic conservation laws

This paper presents an hp-adaptive discontinuous Galerkin method for linear hyperbolic conservation laws. A priori and a posteriori error estimates are derived in mesh-dependent norms which reflect the dependence of the approximate solution on the element size (h) and the degree (p) of the local polynomial approximation. The a posteriori error estimate, based on the element residual method, provides bounds on the actual global error in the approximate solution. The adaptive strategy is designed to deliver an approximate solution with the specified level of error in three steps. The a posteriori estimate is used to assess the accuracy of a given approximate solution and the a priori estimate is used to predict the mesh refinements and polynomial enrichment needed to deliver the desired solution. Numerical examples demonstrate the reliability of the a posteriori error estimates and the effectiveness of the hp-adaptive strategy.

Bey, Kim S.↗

NASA NTRS2012

Soldering in a Reduced Gravity Environment (SoRGE)

Future long-duration human exploration missions will be challenged by constraints on mass and volume allocations available for spare parts. Addressing this challenge will be critical to the success of these missions. As a result, it is necessary to consider new approaches to spacecraft maintenance and repair that reduce the need for large replacement components. Currently, crew members on the International Space Station (ISS) recover from faults by removing and replacing, using backup systems, or living without the function of Orbital Replacement Units (ORUs). These ORUs are returned to a depot where the root cause of the failure is determined and the ORU is repaired. The crew has some limited repair capability with the Modulation/DeModulation (MDM) ORU, where circuit cards are removed and replace in faulty units. The next step to reducing the size of the items being replaced would be to implement component-level repair. This mode of repair has been implemented by the U.S. Navy in an operational environment and is now part of their standard approach for maintenance. It is appropriate to consider whether this approach can be adapted for future spaceflight operations. To this end, the Soldering in a Reduced Gravity Environment (SoRGE) experiment studied the effect of gravity on the formation of solder joints on electronic circuit boards. This document describes the SoRGE experiment, the analysis methods, and results to date. This document will also contain comments from the crew regarding their experience conducting the SoRGE experiment as well as recommendations for future improvements. Finally, this document will discuss the plans for the SoRGE samples which remain on ISS.

Easton, John W.↗

DOE OSTI2020

Atomic imprinting in the absence of an intrinsic length scale

Bulk metallic glasses (BMGs) have successfully been used to replicate molds that are structured at the nano- and even atomic scale through thermoplastic forming (TPF), an ability that was speculated to be rooted in the glass’ featureless atomic structure. These previous demonstrations of atomically precise imprinting, however, were performed under conditions where mold atomic feature dimensions coincided with the unit cell size of constituents in the BMG. In order to evaluate if accurate atomic-scale replication is possible in general, i.e., independent of the accidental presence of favorable constituent size/feature size relationships, we have used Pt 57.5 Cu 14.7 Ni 5.3 P 22.5 to replicate three different crystalline facets of LaAlO 3 single crystals, each exposing distinct atomic step heights. We find that in all cases, the terraced surface termination can be copied with remarkable fidelity, corroborating that BMGs when thermoplastic formed are capable of adapting to any externally imposed confinement with sub-angstrom precision without being limited by factors related to the specifics of their internal structure. This unprecedented capability of quasi-limitless replication fidelity reveals that the deformation mechanism in the supercooled liquid state of BMGs is essentially homogeneous and suggests TPF of BMGs to be a versatile toolbox for atomic and precision nanoscale imprinting.

36 MATERIALS SCIENCE↗

NASA NTRS1998

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

DOE OSTI2025

Advancing simulations of coupled electron and phonon nonequilibrium dynamics using adaptive and multirate time integration

Electronic structure calculations in the time domain provide a deeper understanding of nonequilibrium dynamics in materials. The real-time Boltzmann equation (rt-BTE), used in conjunction with accurate interactions computed from first principles, has enabled reliable predictions of coupled electron and lattice dynamics. However, the timescales and system sizes accessible with this approach are still limited, with two main challenges being the different timescales of electron and phonon interactions and the cost of computing collision integrals. As a result, only a few examples of these calculations exist, mainly for two-dimensional (2D) materials. Here we leverage adaptive and multirate time integration methods to achieve a major step forward in solving the coupled rt-BTEs for electrons and phonons. Relative to conventional (non-adaptive) time-stepping, our approach achieves a 10x speedup for a target accuracy, or greater accuracy by 3–6 orders of magnitude for the same computational cost, enabling efficient calculations in both 2D and bulk materials. This efficiency is showcased by computing the coupled electron and lattice dynamics in graphene up to ~100 ps, as well as modeling ultrafast lattice dynamics and thermal diffuse scattering maps in bulk materials (silicon and gallium arsenide). In addition to improved efficiency, our adaptive method can resolve the characteristic rates of different physical processes, thus naturally bridging different timescales. This enables simulations of longer timescales and provides a framework for modeling multiscale dynamics of coupled degrees of freedom in matter. Our work opens new opportunities for quantitative studies of nonequilibrium physics in materials, including driven lattice dynamics with phonons coupled to electrons, spin, and other degrees of freedom.

Yao, Jia [California Institute of Technology (CalT↗

DOE OSTI2021

Deep Reinforcement Scheduling of Energy Storage Systems for Real-time Voltage Regulation in Unbalanced LV Networks with High PV Penetration

The ever-growing higher penetration of distributed energy resources (DERs) in low-voltage (LV) distribution systems brings both opportunities and challenges to voltage support and regulation. This paper proposes a deep reinforcement learning (DRL)-based scheduling scheme of energy storage systems (ESSs) to mitigate system voltage deviations in unbalanced LV distribution networks. The ESS-based voltage regulation problem is formulated as a multi-stage quadratic stochastic program, with the objective of minimizing the expected total daily voltage regulation cost while satisfying operational constraints. While existing voltage regulation methods are mostly focused on onetime- step control, this paper explores a day-horizon systemwide voltage regulation problem. In other words, the size of action and state spaces are extremely high-dimensional and need to be delicately handled. Furthermore, in order to overcome the difficulty of modeling uncertainties and develop a realtime solution, a learn-to-schedule feedback control framework is proposed by adapting the problem to a model-free DRL setting. The proposed algorithm is tested on a customized 6-bus system and a modified IEEE 34-bus system. Simulation results validate the effectiveness and near-optimality of voltage regulation by ESS in comparison with a deterministic quadratic program solution.

Wang, Shengyi↗

NASA NTRS1987

Adaptive remeshing for compressible flow computations

The present, quality-enhancing adaptive-mesh procedure for two-dimensional Euler equation steady state solutions is implemented by means of linear triangular elements and an explicit time-stepping scheme, in conjunction with a finite element solution algorithm. The meshes thus generated typically take the form of stretched elements in the vicinity of one-dimensional flow features; a considerable variation in element size may thereby emerge which allows the desired high-quality solutions to be obtained with commensurately high computational efficiency.

Peraire, J.↗

NASA NTRS2009

Algorithm for Detecting a Bright Spot in an Image

An algorithm processes the pixel intensities of a digitized image to detect and locate a circular bright spot, the approximate size of which is known in advance. The algorithm is used to find images of the Sun in cameras aboard the Mars Exploration Rovers. (The images are used in estimating orientations of the Rovers relative to the direction to the Sun.) The algorithm can also be adapted to tracking of circular shaped bright targets in other diverse applications. The first step in the algorithm is to calculate a dark-current ramp a correction necessitated by the scheme that governs the readout of pixel charges in the charge-coupled-device camera in the original Mars Exploration Rover application. In this scheme, the fraction of each frame period during which dark current is accumulated in a given pixel (and, hence, the dark-current contribution to the pixel image-intensity reading) is proportional to the pixel row number. For the purpose of the algorithm, the dark-current contribution to the intensity reading from each pixel is assumed to equal the average of intensity readings from all pixels in the same row, and the factor of proportionality is estimated on the basis of this assumption. Then the product of the row number and the factor of proportionality is subtracted from the reading from each pixel to obtain a dark-current-corrected intensity reading. The next step in the algorithm is to determine the best location, within the overall image, for a window of N N pixels (where N is an odd number) large enough to contain the bright spot of interest plus a small margin. (In the original application, the overall image contains 1,024 by 1,024 pixels, the image of the Sun is about 22 pixels in diameter, and N is chosen to be 29.)

Source record↗

DOE OSTI2026

Explicit Monotone Stable Super-Time-stepping Methods for Finite Time Singularities

We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$⁡(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Space Needle Returns

STEP is imported into Engineering Sketch Pad. Some bodies where slightly scaled and translated in OpenCSM to create a manifold solid for the downstream meshing process. The braces at the base and columns around the core are omitted because their solids are malformed or created nonmanifold intersections. EGADS provides an initial tessellation of the surface. refine adapted the surface mesh to a curvature and feature size metric. TetGen initially filled the volume. The TetGen mesh is adapted to the Spalding Law of the Wall u+ with refine to provide the initial mesh for flow solution. Solution-based mesh adaptation is performed where FUN3D-FV computes the flow solution with the Reynolds-averaged Navier-Stokes equations coupled to the Spalart-Allmaras turbulence model. The freestream Mach number is 4 approaching 40° from the central axis of the Space Needle. The volume and surface mesh is adapted with refine to reduce estimated interpolation error in Mach number via the multiscale metric. The adapted mesh implicitly resolves the boundary layers, shocks, and expansions. The surface mesh is shown for the lee side with a slice through the volume on the left. Computational schlieren in the lower right shows density variations. A slice of the mesh is colored with Mach number in the upper right where mesh with freestream Mach number is not rendered. The volume mesh contains 64 million vertices. A NASA worm logo is sketched and extruded into a solid in OpenCSM. The worm is unioned to the Space Needle roof to produce the inset mesh image.

mesh↗

NASA NTRS1986

Adaptive Quantizer for Burst Synthetic-Aperture Radar

Adaptive quantizer for burst-mode synthetic-aperture radar reduces data rate of return signal. Device, called block floating-point quantizer (BFPQ) basically analog-to-digital converter that covers wide dynamic range and discards appropriate lower order bits. BFPQ is, in effect, digital approximator with automatic gain control. Moves floatingpoint marker binary representation of signal data in accordance with perceived dynamic range. Available step sizes thus limited to multiples of underlying smallest quantization step (represented by lowest order bit). Retains only first K most significant bits of signal; (L,K) BFPQ is one that does K-bit quantization of signal originally quantized to L bits. Quantization error simply difference between actual signal level and its binary approximation. Other potential applications for BFPQ include speech compression and picture data compression.

Joo, T. H.↗

NASA NTRS1987

Finite element methods of analysis for high speed viscous flows

Over the past three years a finite element based procedure for the solution of high speed viscous compressible flows was developed. The approach followed was to compute steady state solutions via a false transient, using an explicit time stepping scheme, and to attempt to improve the solution quality by incorporating adaptive mesh procedures. The main thrust of the work was to continue on the extension of the approach to the solution of some realistic compressible viscous flows. When flows at high Reynolds number are investigated, is soon becomes apparent that explicit techniwues have to be supplemented if they are to deal effectively with the large variations in element size and aspect ratio which characterize the computational grids necessary for adequate resolutin of the primary flow features. For this reason, the Taylor-Galerkin solution algorithm was rewritten in an explicit/implicit form. Solutions were computed for the problems of a flow past a flat plate, M-3, Re-100; shock/boundary layer interaction, M-2, Re-296000; flow over a compression corner, M-11.68, Re246000; and unifrom flow past a circular cylinder, M-6.34, Re-39770. A summary of the results is included and demonstrates the numerical performance of the scheme.

Source record↗

DOE OSTI2023

Wave Detection and Tracking Within a Rotating Detonation Engine Through Object Detection

As the operational time window of experimental rotating detonation engines (RDEs) is expanded and the technology matures toward integration within gas turbines, monitoring techniques must evolve to offer computationally efficient and highly time-resolved diagnostics. In this study, computer vision object detection methodology that seeks to reduce data processing time and calculate wave velocity within drastically reduced time intervals as compared to traditional high-frame-rate RDE images analysis techniques is proposed. The adapted you-only-look-once object detection network is trained to detect individual detonation waves within single down-axis RDE images. The wave location and rotational direction detected within a frame are tracked through a series of high-speed images to calculate the frame-to-frame wave velocity with the time-step resolution of $\mathrm{20 μs}$ across a series of frames. The analysis of the annotation box size and image linearization effects is presented, demonstrating the lowest frame-to-frame velocity total uncertainty of $\mathrm{±3.8\%}$ and the highest classification speed of 9.5 frames per second using linearized images. Linearized images “unwrap” the RDE annulus pixel region to a reduced image size. Here, this new method offers great reductions in data processing times and unsteady detonation behavior insight at intervals more comparable to the timescales of detonation wave interactions via the application of machine learning to experimental RDE data.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2020

PRISMS-PF: A general framework for phase-field modeling with a matrix-free finite element method

Abstract A new phase-field modeling framework with an emphasis on performance, flexibility, and ease of use is presented. Foremost among the strategies employed to fulfill these objectives are the use of a matrix-free finite element method and a modular, application-centric code structure. This approach is implemented in the new open-source PRISMS-PF framework. Its performance is enabled by the combination of a matrix-free variant of the finite element method with adaptive mesh refinement, explicit time integration, and multilevel parallelism. Benchmark testing with a particle growth problem shows PRISMS-PF with adaptive mesh refinement and higher-order elements to be up to 12 times faster than a finite difference code employing a second-order-accurate spatial discretization and first-order-accurate explicit time integration. Furthermore, for a two-dimensional solidification benchmark problem, the performance of PRISMS-PF meets or exceeds that of phase-field frameworks that focus on implicit/semi-implicit time stepping, even though the benchmark problem’s small computational size reduces the scalability advantage of explicit time-integration schemes. PRISMS-PF supports an arbitrary number of coupled governing equations. The code structure simplifies the modification of these governing equations by separating their definition from the implementation of the numerical methods used to solve them. As part of its modular design, the framework includes functionality for nucleation and polycrystalline systems available in any application to further broaden the phenomena that can be used to study. The versatility of this approach is demonstrated with examples from several common types of phase-field simulations, including coarsening subsequent to spinodal decomposition, solidification, precipitation, grain growth, and corrosion.

36 MATERIALS SCIENCE↗