SEARCH · Engineering Papers

Results for “experimental algorithms”

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 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Experiments in robotic catching

Real-time coordination of visual information with high-speed manipulator control is studied in the context of three-dimensional robotic catching. All path planning for the catch occurs in real-time during the half-second that the targeted object is airborne. A trajectory-matching algorithm is used that combines an observer with a varying-strength filter, an error estimator, and an initial motion algorithm. The results are demonstrated experimentally using a real-time vision system and a four-degree-of-freedom, cable-driven arm with a workspace of 4.2 m3 and speed capabilities of up to 2.0 m/s.

Hove, Barbara↗

NASA NTRS1993

An application of artificial neural networks to experimental data approximation

As an initial step in the evaluation of networks, a feedforward architecture is trained to approximate experimental data by the backpropagation algorithm. Several drawbacks were detected and an alternative learning algorithm was then developed to partially address the drawbacks. This noniterative algorithm has a number of advantages over the backpropagation method and is easily implemented on existing hardware.

Meade, Andrew J., Jr.↗

NASA NTRS1993

Space marching calculations about hypersonic configurations using a solution-adaptive mesh algorithm

A solution-adaptive marching algorithm is developed and applied to a three-dimensional parabolized Navier-Stokes equation solver. The resulting algorithm obtains accurate solutions by using a spatial-marching/adaptive grid procedure. The adaptation step redistributes grid points line by line in both crossflow directions, with grid point motion controlled by forces analogous to tensional and torsional spring forces with the tensional force proportional to the error measure or weighting functions. The solution-adaptive marching procedure is applied to the hypersonic flow about two generic aircraft configurations. The first of these is an all-body-type geometry with elliptical cross sections and is studied at angles of attack of 0.5, and 15 deg. The second geometry is a generic blended-wing-body design. Results are presented that demonstrate the improvements in flowfield resolution obtainable with the solution-adaptive marching procedure over conventional fixed grid techniques. Computed pitot pressure profiles obtained using the solution-adaptive algorithm show improved agreement with experimental data compared to predictions obtained using a fixed grid.

Harvey, Albert D.↗

NASA NTRS1993

A study of the compressible flow through a diffusing S-duct

Benchmark aerodynamic data are presented for compressible flow through a representative S-duct configuration. A numerical prediction of the S-duct flow field, obtained from a subsonic parabolized Navier-Stokes algorithm, is also shown. The experimental and numerical results are compared. Measurements of the three-dimensional velocity field, total pressures, and static pressures were obtained at five cross-sectional planes. Aerodynamic data were gathered with calibrated pneumatic probes. Surface static pressure and surface flow visualization data were also acquired. All reported tests were conducted with an inlet centerline Mach number of 0.6. The Reynolds number, based on the inlet centerline velocity and duct inlet diameter, was 2.6 x 10(exp 6). Thin inlet turbulent boundary layers existed. The collected data should be beneficial to aircraft inlet designers and the measurements are suitable for the validation of computational codes. The results show that a region of streamwise flow separation occurred within the duct. Details about the separated flow region, including mechanisms which drive this complicated flow phenomenon, are discussed. Results also indicate that the duct curvature induces strong pressure driven secondary flows. The cross flows evolve into counter-rotating vortices. These vortices convect low momentum fluid of the boundary layer toward the center of the duct, degrading both the uniformity and magnitude of the total pressure profile.

Wellborn, Steven R.↗

NASA NTRS1987

A Diagonal Algorithm for the Method of Pseudocompressibility

The method of pseudocompressibility has been found to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The computing efficiency of these algorithms are compared. Identical solutions are obtained from both algorithms which compare well with experimental results.

Rogers, Stuart E.↗

NASA NTRS2002

Adaptive Load-Balancing Algorithms using Symmetric Broadcast Networks

In a distributed computing environment, it is important to ensure that the processor workloads are adequately balanced, Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three efficient SBN-based dynamic load-balancing algorithms, and implement them on an SGI Origin2000. A thorough experimental study with Poisson distributed synthetic loads demonstrates that our algorithms are effective in balancing system load. By optimizing completion time and idle time, the proposed algorithms are shown to compare favorably with several existing approaches.

Das, Sajal K.↗

NASA NTRS2012

Intelligent Systems Approach for Automated Identification of Individual Control Behavior of a Human Operator

Results have been obtained using conventional techniques to model the generic human operator?s control behavior, however little research has been done to identify an individual based on control behavior. The hypothesis investigated is that different operators exhibit different control behavior when performing a given control task. Two enhancements to existing human operator models, which allow personalization of the modeled control behavior, are presented. One enhancement accounts for the testing control signals, which are introduced by an operator for more accurate control of the system and/or to adjust the control strategy. This uses the Artificial Neural Network which can be fine-tuned to model the testing control. Another enhancement takes the form of an equiripple filter which conditions the control system power spectrum. A novel automated parameter identification technique was developed to facilitate the identification process of the parameters of the selected models. This utilizes a Genetic Algorithm based optimization engine called the Bit-Climbing Algorithm. Enhancements were validated using experimental data obtained from three different sources: the Manual Control Laboratory software experiments, Unmanned Aerial Vehicle simulation, and NASA Langley Research Center Visual Motion Simulator studies. This manuscript also addresses applying human operator models to evaluate the effectiveness of motion feedback when simulating actual pilot control behavior in a flight simulator.

Zaychik, Kirill B.↗

NASA NTRSDate not supplied

NASA and Blue Origin Collaborative Assessment of Precision Landing Algorithms and Computing

NASA’s Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project is developing sensor, algorithm, and compute technologies for precision landing and hazard avoidance. These technologies are being tested as an integrated Precision Landing and Hazard Avoidance (PL&HA) system on Blue Origin’s New Shephard suborbital vehicle. A key goal for the computing element of this technology development is to characterize the performance of the SPLICE software workloads on the project’s Descent and Landing Computer (DLC). The DLC is a multi-core processor designed as a surrogate for NASA’s High-Performance Space Computer (HPSC). Measurements of the SPLICE workload performance on the DLC provides NASA insight on how PL&HA capabilities will perform on the HPSC, and guidance on how the SPLICE algorithms can be implemented to best utilize the DLC platform. This insight can also be used to derive requirements to guide trade studies on candidate computing architectures, for use on platforms like Blue Moon. NASA and Blue Origin are collaborating under an agreement to pursue this mutual benefit. Performance metrics collected are based on measurement of common compute resources such as percentage used of memory bandwidth, I/O utilization, interrupt latency, and kernel vs. user space code residency. Where possible existing performance counters and metrics that are part of the operating system kernel are used. As the design has a significant FPGA component, performance counters are identified and instantiated in the fabric to measure DMA performance and interface metrics. Collection of metrics is performed on the DLC with a representative workload that simulates a full landing cycle of the Blue Origin New Shepard vehicle. Consideration is given to the other compute implementations and whether they can run SPLICE algorithms at the same rate and with the same latency as the DLC. One option being considered is the use of a RISC-V soft core instantiated in a radiation resilient FPGA fabric such as the Xilinx KU60. Select algorithms from the SPLICE code will be run for comparison with the DLC. This paper describes how the DLC is instrumented to collect performance measurements of the SPLICE workloads, preliminary results from these measurements, and their implications on SPLICE algorithm implementation. The results of experimentation to derive candidate requirements for architecture trades on a PL&HA computing system are also presented.

computer performance↗

NASA NTRSDate not supplied

Twenty-Five Years of Background-Oriented Schlieren: Advances and Novel Applications

Since its introduction in the year 2000, background-oriented schlieren (BOS) has become acornerstone technique for visualizing variable-density flows. In this review, we provide a rigorousexamination of the optical principles underpinning BOS and related refractive-index-basedtechniques, complemented by an appendix linking schlieren imaging to Maxwell’s equations.The core sections delve into the practical aspects of BOS, with detailed discussions on imageprocessing algorithms and critical considerations for experimental setups. We then explorerecent advancements and innovations, including extensions of BOS with tomography, dataassimilation, and event-based imaging. Finally, we present notable applications of BOS inchallenging and unconventional environments, showcasing the method’s versatility and offerinspiration for future research directions.

Background-Oriented Schlieren↗

NASA NTRSDate not supplied

Considerations for High-Speed Background-Oriented Schlieren Visualization Capability for Ground Test Facilities

Since its introduction in the year 2000, background-oriented schlieren (BOS) has become a cornerstone technique for visualizing variable-density flows. In this review, we provide a rigorous examination of the optical principles underpinning BOS and related refractive-index-based techniques, complemented by an appendix linking schlieren imaging to Maxwell’s equations. The core sections delve into the practical aspects of BOS, with detailed discussions on image processing algorithms and critical considerations for experimental setups. We then explore recent advancements and innovations, including extensions of BOS with tomography, data assimilation, and event-based imaging. Finally, we present notable applications of BOS in challenging and unconventional environments, showcasing the method’s versatility and offer inspiration for future research directions.

Brett Bathel↗

DOE OSTI2021

A Contrast Calibration Protocol for X-ray Speckle Visibility Spectroscopy

X-ray free electron lasers, with their ultrashort highly coherent pulses, opened up the opportunity of probing ultrafast nano- and atomic-scale dynamics in amorphous and disordered material systems via speckle visibility spectroscopy. However, the anticipated count rate in a typical experiment is usually low. Therefore, visibility needs to be extracted via photon statistics analysis, i.e., by estimating the probabilities of multiple photons per pixel events using pixelated detectors. Considering the realistic X-ray detector responses including charge cloud sharing between pixels, pixel readout noise, and gain non-uniformity, speckle visibility extraction relying on photon assignment algorithms are often computationally demanding and suffer from systematic errors. In this paper, we present a systematic study of the commonly-used algorithms by applying them to an experimental data set containing small-angle coherent scattering with visibility levels ranging from below 1% to ∼60%. We also propose a contrast calibration protocol and show that a computationally lightweight algorithm can be implemented for high-speed correlation evaluation.

47 OTHER INSTRUMENTATION↗

DOE OSTI2023

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

DOE OSTI2021

Radiation-Induced Error Mitigation by Read-Retry Technique for MLC 3-D NAND Flash Memory

Here, we have evaluated the Read-Retry (RR) functionality of the 3-D NAND chip of multilevel-cell (MLC) configuration after total ionization dose (TID) exposure. The RR function is typically offered in the high-density state-of-the-art NAND memory chips to recover data once the default memory read method fails to correct data with error correction codes (ECCs). In this work, we have applied the RR method on the irradiated 3-D NAND chip that was exposed with a Co-60 gamma-ray source for TID up to 50 krad (Si). Based on our experimental evaluation results, we have proposed an algorithm to efficiently implement the RR method to extend the radiation tolerance of the NAND memory chip. Our experimental evaluation shows that the RR method coupled with ECC can ensure data integrity of MLC 3-D NAND for TID up to 50 krad (Si).

3-D NAND↗

DOE OSTI2024

General algorithm for characterization of donor-acceptor pair recombination processes in solid-state materials

Radiative recombination processes can occur in solid-state systems through the pairing of donor and acceptor defects of the lattice. Recently, donor-acceptor pairs (DAP) have been proposed as promising candidates for quantum applications, and their signature has been observed in emerging low-dimensional materials. Therefore, the identification of such processes is gaining interest and requires methods to efficiently and reliably characterize them. Here, we introduce a general algorithm to identify DAP processes starting from the experimental photoluminescence (PL) emission spectrum and basic material parameters, including the lattice structure and dielectric constant. The algorithm recognizes possible DAP transitions from the emission pattern in the spectrum and returns the characteristic energy of the DAP transition and the separation between the donor and acceptor sites. By testing the algorithm on the photoluminescence spectrum of hexagonal boron nitride (hBN), we show that our method is robust against experimental errors and adds new capabilities to the investigation toolbox of semiconductors and their optical properties.

36 MATERIALS SCIENCE↗

NASA NTRS1971

A fast algorithm for the calculation of junction capacitance and its application for impurity profile determination

A fast algorithm is described which calculates the space charge layer width and junction capacitance for an arbitrary impurity profile and for plane, cylindrical and spherical junctions. The algorithm is based on the abrupt space charge edge (ASCE) approximation. A method to use the algorithm for the determination of impurity profiles for two-sided junctions is presented. An expression is derived for the built-in voltage to be used for capacitance calculations with the ASCE approximation. Experimental evidence is given that the algorithm permits very accurate capacitance calculations and also predicts the exact temperature dependence of the junction capacitance.

Deman, H. J. J.↗

NASA NTRS1972

A fast algorithm for the calculation of junction capacitance and its application for impurity profile determination.

De Man, H. J. J.↗

NASA NTRS2011

Actuator Grouping Optimization on Flexible Space Reflectors

With the rapid advances in deployable membrane and mesh antenna technologies, the feasibility of developing large, lightweight reflectors has greatly improved. In order to achieve the required surface accuracy, precision surface control is needed on these lightweight reflectors. For this study, an analytical model is shown which combines a flexible Kapton reflector with Polyvinylidene fluoride (PVDF) actuators for surface control. Surface errors are introduced that are similar to real world scenarios, and a least squares control algorithm is developed for surface control. Experimental results on a 2.4 meter reflector show that while the analytical reflector model is generally correct, due to idiosyncrasies in the reflector it cannot be used for online control. A new method called the En Mass Elimination algorithm is used to determine the optimal grouping of actuators when the number of actuators in the system exceeds the number of power supplies available.

en masse elimination (EME) algorithm↗

DOE OSTI2024

Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration

The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.

complexity theory↗