SEARCH · Engineering Papers
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.
A steepest descent variable step-size algorithm has been designed using dynamic programming for a mean-square-error adaptive equalizer. Additive noise and a constraint have been included. It is found that the new algorithm converges faster than the common fixed step-size algorithm.
Description of an analytically obtained optimum adaptive delta modulator-demodulator configuration. The device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov-Gaussian source. The optimum system is compared, using computer simulations, with a linear delta modulator and an enhanced Abate delta modulator. In addition, the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The highly nonlinear equations obtained for the optimum transmitter and receiver are approximated by piecewise-linear equations in order to obtain system equations which can be transformed into hardware. The derivation of the experimental system is presented.
The nonequilibrium Green's function gives access to one-body observables for quantum systems. Of particular interest are quantities such as density, currents, and absorption spectra which are important for interpreting experimental results in quantum transport and spectroscopy. We present an integration scheme for the Green's function's equations of motion, the Kadanoff-Baym equations (KBE), which is both adaptive in the time integrator step size and method order as well as the history integration order. We analyze the importance of solving the KBE self-consistently and show that adapting the order of history integral evaluation is important for obtaining accurate results. To examine the efficiency of our method, we compare runtimes to a state-of-the-art fixed time step integrator for several test systems and show an order of magnitude speedup at similar levels of accuracy. Published by the American Physical Society 2024
Infrared (IR) telescopes, such as Spitzer and SOFIA, have revealed a rich variety of chemical species trapped in interstellar ices. The most fundamental parameters to be derived from observed IR spectra are the identity and abundance of each component. Several compounds have been conclusively or tentatively identified, but the band strengths and optical constants needed to derive accurate abundances for many of these are poorly constrained. We have developed a modified approach to the extraction of the real and imaginary parts of the refractive index (optical constants) of a thin film from a single transmission spectrum measured in the IR spectral range. Our algorithm is similar to those implemented by previous authors, with some major changes that yield results for strong absorptions where previous approaches fail: (1) an adaptive k-correction step size, (2) the use of a root-finding algorithm to obtain a more accurate k-correction at each iteration, and (3) a k-correction step that prevents non-physical results such as negative n-values that prevent convergence in the calculation algorithm. The algorithm is presented and described, with examples to show agreement with some existing results and improvements upon others. New optical-constants calculations for CH3OH, CO2, N2O, and CH4 are presented, and potential implications for the modeling of interstellar and planetary ice data from space telescopes are discussed. With the objective of being open-source and transparent, the full source code in the free Python programming language is made available along with the compiled version and the laboratory data used to produce the results shown.
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.
Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.
Abstract An iterative dynamic chemical stiffness removal method (IDCSR) based on quasi-steady-state approximation (QSSA) is proposed. The IDCSR method is built on a previously developed non-iterative method which has proved to work well for small timestep sizes. A novel iterative procedure is designed in IDCSR to enable explicit time integration of stiff chemistry at relatively large timestep sizes relevant to practical reacting flow simulations. The effectiveness of the iterative procedure is first demonstrated with a toy problem and homogeneous auto-ignition with fixed integration step sizes, showing that larger timestep sizes can be allowed for explicit time integration using IDCSR compared with the previous non-iterative method. IDCSR is then compared with existing explicit chemistry solvers for simulations of homogeneous auto-ignition and shows similar or lower computational cost but significantly higher accuracy across a wide range of timestep sizes. IDCSR is further combined with an automatic adaptive time-stepping scheme for simulations of 0-D homogeneous auto-ignition and a 2-D laminar lifted n -dodecane jet flame. For the 0-D auto-ignition simulations, IDCSR is shown to reduce both the error (by 43%–90%) and computational cost (by 6–15 times) compared with existing explicit solvers, while achieving speed-up factors of up to 400 compared with VODE for a wide range of timestep sizes and reaction mechanisms. For the 2-D jet flame simulations, speed-up factors of 15 and 31 for chemistry integration, and 5 and 9 for overall simulation, are achieved by IDCSR compared with CVODE with and without analytic Jacobian, respectively.
There is no difficulty in identifying the criteria involved in the computer selection process; complexity arises in objectively evaluating various candidate configurations against the criteria, based on the user's specific needs. A model for formalizing the selection process consists of two major steps: verifying that the candidate configuration is adequate to the user's programming requirements, and determining an overall system evaluation rating based on cost, usability, adaptability, and availability. A 36 step instruction for computer sizing evaluation is included in the appendix along with a sample application of the configuration adequacy model. Selection criteria and the weighting process are also discussed.
Rapidly converging first order training algorithm for adaptive equalizer design in PAM signal reception, using variable step sizes for mean- square error minimization
Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.
A computer program suppresses the effects of narrow-band radio-frequency interference (RFI) on the data collected by a wide-band radar system. The need for this program arises because some advanced wide-band synthetic-aperture radar systems utilize frequency bands that include frequencies used by other radio services. In this program, the RFI environment is represented by an auto-regressive process, the frequency band of which is narrow relative to that of the radar. Most of the RFI signals, both narrow- and wide-band, are estimated in one pass of a least-mean-square (LMS) adaptive filter. The program implements three popular LMS algorithms: the time-domain LMS, the frequency-domain LMS, and the filter-bank LMS adaptive-filter algorithms. The program can be run in a manual or automatic mode. In the manual mode, the user selects the filter parameters prior to execution. In the automatic mode, the program utilizes median-filter and spectral-estimation techniques plus the variable-step-size LMS algorithm for automatic determination of filter parameters, and the parameters are adaptively changed as functions of the inputs, resulting in better overall performance.
We have considered the response of a variable step size delta modulator communication system, to errors caused by a noisy channel. For the particular adaptive delta modulation scheme proposed by Song, Garodnick, and Schilling (1971), we have a simple analytic formulation of the output error propagation due to a single channel error. It is shown that single channel errors cause a change in the amplitude and dc level of the output, but do not otherwise affect the shape of the output waveform. At low channel error rates, these effects do not cause any degradation in audio transmission. Higher channel error rates cause overflow or saturation of the step size register. We present relationships between channel error rate, register size, and the probability of register overflow.
Traditional trial-and-error methods for materials discovery are inefficient to meet the urgent demands posed by the rapid progression of climate change. This urgency has driven the increasing interest in integrating robotics and machine learning into materials research to accelerate experimental learning. However, idealized decision-making frameworks to achieve maximum sampling efficiency are not always compatible with high-throughput experimental workflows inside a laboratory. For multi-step chemical processes, differences in hardware capacities can complicate the digital framework by introducing constraints on the maximum number of samples in each step of the experiment, hence causing varying batch sizes in variable selection within the same batch. Therefore, designing flexible sampling algorithms is necessary to accommodate the multi-step synthesis with practical constraints unique to each high-throughput workflow. In this work, we designed and employed three strategies on a high-throughput robotic platform to optimize the sulfonation reaction of redox-active molecules used in flow batteries. Our strategies adapt to the multi-step experimental workflow, where their formulation and heating steps are separate, causing varying batch size requirements. By strategically sampling using clustering and mixed-variable batch Bayesian optimization, we were able to iteratively identify optimal conditions that maximize the yields. Our work presents a flexible approach that allows tailoring the machine learning decision-making to suit the practical constraints in individual high-throughput experimental platforms, followed by performing resource-efficient yield optimization using available open-source Python libraries.
The atypical combustion properties of hydrogen have long provided an interest for hydrogen-enriched combustion, emphasized in recent years by increasingly stringent emission regulations. Significant work has been focused on the small hydrocarbon(C1-C3)/hydrogen blends, but much less is known about the effect of hydrogen on heavier hydrocarbon combustion, of interest for the aviation and automotive industry. In this work, we perform direct numerical simulations (DNS) of spherically expanding laminar n-dodecane/H2 flames in a constant-volume vessel at elevated pressure and a range of hydrogen seeding levels. A low Mach number model is used to represent the gas and flame dynamics allowing for a temporally varying, spatially homogeneous pressure field, while also enabling numerical evolution of the system numerically at time step sizes governed by the advective CFL limit rather than acoustic processes. We use an adaptive mesh refinement (AMR) approach to tackle the large separation of scales associated with high pressure premixed flame surfaces propagating in a laboratory-scale closed domain. We incorporate detailed chemistry and transport models for the reacting flow and focus the analysis on the effects of the pressure rise on the flame propagation characteristics and morphology as the hydrogen content is increased. The presence of fast diffusive H2 and the pressure rise results in dramatic thinning of the flame and the potential onset of hydrodyanmic and theromdiffusive instabilities. We assess the potential role of these instabilities on the ability to accurately measure laminar burning speed experimentally based on the mean flame surface propagation speed.
Synthetic aperture radar (SAR) has high data rate because it collects and processes the data coherently. The data rate limitation of the system has to be satisfied while maintaining good image quality. Thus, a quantizer with minimum data rate and high SNR should be employed. An adaptive quantization method is proposed for the burst mode SAR. This adaptive quantizer uses uniformly quantized data to select a subset of bits which is equivalent to changing the step size of the uniform quantizer. A simple implementation which uses the previous burst data to compute the local statistics for the bit selection is presented. The use of previous burst simplifies the implementation because it does not require storage or delay; however, an abrupt change in the terrain could result in incorrect bit selection. An error analysis of this implementation and comparison of two burst mode SAR images formed using the uniformly quantized and adaptively quantized data is presented.
Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored variational quantum eigensolver), which iteratively builds up variational a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled- gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. Published by the American Physical Society 2024
An optimum adaptive delta modulator-demodulator configuration is derived. This device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov Gaussian source. The optimum system is compared using computer simulations with the linear delta modulator and an enhanced Abate delta modulator. In addition the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The results show that the output signal-to-noise ratio is independent of the input signal power and is subject only to the limitations of the hardware employed. In addition, voice was recorded using these systems. The demodulated voice indicates negligible degradation is caused by the optimum system and by the enhanced Abate system while the linear delta modulator suffers significant degradation at a sampling frequency of 56 kilobits/sec.
Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.