Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 541 records · Page 30

Greedy Sampling and Incremental Surrogate Model-Based Tailoring of Aeroservoelastic Model Database for Flexible Aircraft

This paper presents a data analysis and modeling framework to tailor and develop linear parameter-varying (LPV) aeroservoelastic (ASE) model database for flexible aircrafts in broad 2D flight parameter space. The Kriging surrogate model is constructed using ASE models at a fraction of grid points within the original model database, and then the ASE model at any flight condition can be obtained simply through surrogate model interpolation. The greedy sampling algorithm is developed to select the next sample point that carries the worst relative error between the surrogate model prediction and the benchmark model in the frequency domain among all input-output channels. The process is iterated to incrementally improve surrogate model accuracy till a pre-determined tolerance or iteration budget is met. The methodology is applied to the ASE model database of a flexible aircraft currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that the proposed method can reduce the number of models in the original database by 67%. Even so the ASE models obtained through Kriging interpolation match the model in the original database constructed directly from the physics-based tool with the worst relative error far below 1%. The interpolated ASE model exhibits continuously-varying gains along a set of prescribed flight conditions. More importantly, the selected grid points are distributed non-uniformly in the parameter space, a) capturing the distinctly different dynamic behavior and its dependence on flight parameters, and b) reiterating the need and utility for adaptive space sampling techniques for ASE model database compaction. The present framework is directly extendible to high-dimensional flight parameter space, and can be used to guide the ASE model development, model order reduction, robust control synthesis and novel vehicle design of flexible aircraft.

numerical analysi↗

Analysis and Application of Novel and Heritage Acceleration Limiting Algorithms for SLS on Ascent

National Aeronautics and Space Administration (NASA) is currently building the Space Launch System (SLS) Block-1 launch vehicle, to be used as the crewed heavy-lift vehicle for the Artemis series of missions. The SLS Block-1 guidance subsystem utilizes a nonlinear algorithm derived from Shuttle heritage for limiting the vehicle’s induced maximum axial acceleration during ascent flight, known as g-limiting. Even though g-limiting has demonstrated stability and robustness through several design analysis cycles and the extensive Shuttle flight history, there are no available documents that demonstrate that this algorithm has been proven stable through conventional controls stability analysis. This paper highlights the non-linear nature of g-limit, presents an alternative methodology to employ a linear version of this algorithm, performs assessment of selected linear gains using classical stability analysis and, conducts a comparison of both approaches through Six Degrees-of-Freedom (6-DOF) Monte Carlo (MC) simulations.

Jason Everett↗

Satellite-To-Satellite Imaging in Support of LEO Optical Navigation, Using the ASTERIA Cubesat

The Arcsecond Space Telescope Enabling Research in Astrophysics (ASTERIA) was a 6-unit CubeSat technology demonstration mission that was built at NASA’s Jet Propulsion Laboratory (JPL) and deployed from the International Space Station (ISS) on November 20th, 2017. After successfully completing its 90-day primary mission that demonstrated arcsecond-level line-of-sight pointing and focal plane thermal stability for exoplanet detection, it entered an extended mission performing onboard software demonstrations alongside science until end of mission in December 2019. At the end of its lifetime it was being used as a demonstration platform for several experiments, including low earth orbit (LEO) optical navigation operations. With its visible light astrometric camera and stable attitude control system, the ASTERIA spacecraft showed itself to be a capable platform for the imaging of geosynchronous satellites from LEO. This paper will describe the imagery attained in flight and also the image processing algorithms that were developed to render that imagery into navigation quality data. These algorithms dealt with hot pixel filtering, noise modeling, attitude registration, star signal rejection and satellite signal identification. Brightness prediction algorithms used for target selection will also be discussed.

Fesq, Lorraine↗

Local Scale (3-M) Soil Moisture Mapping Using SMAP and Planet Superdove

A capability for mapping meter-level resolution soil moisture with frequent temporal sampling over large regions is essential for quantifying local-scale environmental heterogeneity and eco-hydrologic behavior. However, available surface soil moisture (SSM) products generally involve much coarser grain sizes ranging from 30 m to several 10s of kilometers. Hence a new method is proposed to estimate 3-m resolution SSM using a combination of multi-sensor fusion, machine- learning (ML) and Cumulative Distribution Function (CDF) matching approaches. This method established favorable SSM correspondence between 3-m pixels and overlying 9-km grid cells from overlapping Planet SuperDove (PSD) observations and NASA Soil Moisture Active-Passive (SMAP) mission products. The resulting 3-m SSM predictions showed improved accuracy by reducing ab- solute bias and RMSE by ~0.01 cm3/cm3 over the original SMAP data in relation to in-situ soil moisture measurements for the Australian Yanco region, while preserving the high sampling frequency (1-3 day global revisit) and sensitivity to surface wetness (R 0.865) from SMAP. Heterogeneous soil moisture distributions varying with vegetation biomass gradients and irrigation regimes were generally captured within a selected study area. Further algorithm refinement and implementation for regional applications will allow for improvement in water resources management, precision agriculture, and disaster forecasts and responses.

soil moisture↗

Apprentice for Event Generator Tuning

Apprentice is a tool developed for event generator tuning. It contains a range of conceptual improvements and extensions over the tuning tool Professor. Its core functionality remains the construction of a multivariate analytic surrogate model to computationally expensive Monte-Carlo event generator predictions. The surrogate model is used for numerical optimization in chi-square minimization and likelihood evaluation. Apprentice also introduces algorithms to automate the selection of observable weights to minimize the effect of mis-modeling in the event generators. We illustrate our improvements for the task of MC-generator tuning and limit setting.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Classification based anomaly detection

An example device includes processing circuitry and a memory. The memory includes instructions that cause the device to perform various functions. The functions include receiving datastreams from a plurality of sensors of a high performance computing system, classifying each datastream of the each sensor to one of a plurality of datastream models, selecting an anomaly detection algorithm from a plurality of anomaly detection algorithms for each datastream, determining parameters of the each anomaly detection algorithm, determining an anomaly threshold for each datastream, and generating an indication that the sensor associated with the datastream is acting anomalously.

Serebryakov, Sergey↗

Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method

Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians. In this work, we build on recent advances from the adaptive sampling configuration interaction (ASCI) algorithm. We show that a useful paradigm for generating efficient selected CI/exact diagonalization algorithms is driven by fast sorting algorithms, much in the same way iterative diagonalization is based on the paradigm of matrix vector multiplication. We present several new algorithms for all parts of performing a selected CI, which includes new ASCI search, dynamic bit masking, fast orbital rotations, fast diagonal matrix elements, and residue arrays. The ASCI search algorithm can be used in several different modes, which includes an integral driven search and a coefficient driven search. The algorithms presented here are fast and scalable, and we find that because they are built on fast sorting algorithms they are more efficient than all other approaches we considered. After introducing these techniques, we present ASCI results applied to a large range of systems and basis sets to demonstrate the types of simulations that can be practically treated at the full-CI level with modern methods and hardware, presenting double- and triple-ζ benchmark data for the G1 data set. The largest of these calculations is Si$_2$H$_6$ which is a simulation of 34 electrons in 152 orbitals. We also present some preliminary results for fast deterministic perturbation theory simulations that use hash functions to maintain high efficiency for treating large basis sets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Inelastic transient dynamic analysis of three-dimensional problems by BEM

A general direct boundary element formulation and its numerical implementation for solving transient dynamic problems of three-dimensional isotropic homogeneous or piecewise homogeneous solids involving material nonlinearities are presented. The algorithm produces accurate results for static nonlinear problems by using large time steps. When a large value of yield stress is selected, the incremental inelastic transient algorithm produces results identical to those obtained by elastodynamic analysis.

Ahmad, S.↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

Development of online pulse-finding algorithms for the Mu2e Stopping Target Monitor and an evaluation of the signal to background ratio for the Mu2e stopped-muon rate determination

This thesis presents a determination of the acceptance of the Mu2e Stopping Target Monitor (STM) detector for both signal and background events. The rate of X-rays of a specific energy in the STM is used to determine the rate of stopped muons in the aluminium stopping target, which is used as the normalisation for all Mu2e measurements, particularly the branching ratio for a charged lepton flavour violating (cLFV) process. The acceptance for the 347\,keV $2p-1s$ aluminium signal X-ray is determined to be $(8.03 \pm 0.05) \times 10^{-10}$\,cm$^{-2}$ and the acceptance for the background photons (at 347\,keV) to be $(3.19 \pm 0.21) \times 10^{-8}$\,cm$^{-2}$. This results in a signal-to-background ratio of approximately two which is significantly higher than had previously been estimated. These signal-to-background rates are used to determine the time required to achieve a statistical uncertainty of 10\% on the number of 347\,keV X-rays as a function of the detector resolution and back ground rate. For a resolution of 2\,keV, and the background rate determined in this thesis, approximately one minute of data is required. The three corrections needed to be applied to the measured 347\,keV rate to determine the rate of stopped muons are also determined and potential sources of bias arising from the background shape, background fit range and energy calibration are investigated and found to be insignificant. The raw energy of the particles in the STM detector comes from a 16-bit ADC digitising at $\sim 300$\,MHz. It is not possible to store all the raw digitisations and online algorithms have been developed to rapidly select pulses in the detector and reconstruct their energy. The performance of these algorithms has been characterised with simulated data as a function of detector rate and resolution and optimum operating points for the algorithms have been defined. The integrity of the algorithms has also been demonstrated and characterised on test-beam data at high r ates and with radioactive sources at low rates.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parallel unstructured grid generation

A parallel unstructured grid generation algorithm is presented and implemented on the Hypercube. Different processor hierarchies are discussed, and the appropraite hierarchies for mesh generation and mesh smoothing are selected. A domain-splitting algorithm for unstructured grids which tries to minimize the surface-to-volume ratio of each subdomain is described. This splitting algorithm is employed both for grid generation and grid smoothing. Results obtained on the Hypercube demonstrate the effectiveness of the algorithms developed.

Loehner, Rainald↗

Large space structure flight experiment

The primary purpose of this work is to provide a first order feasibility analysis of a large space structure flight experiment. The feasibility issues are addressed from the control technologist's point of view. Control and system identification techniques and algorithms are evaluated with a selected experiment antenna structure through analysis and computer simulation. The required and actuator hardware is assessed and its requirements examined with respect to the current state-of-the-art. The results of this study show that a shuttle attached flight experiment is feasible with moderate advancement of current control technology. The control and identification algorithms are well understood and can be adapted to the flight computers with additional dedicated processors. Although it is necessary to select a focused flight configuration to produce quantitative results, it is believed that, in general, performance requirements and capabilities, timelines, hardware, and algorithms are sufficiently generic in nature and can be applied to other configurations.

Schwab, D. C.↗

Investigation of soil properties using different techniques of mid‐infrared spectroscopy

Summary Diffuse reflectance spectroscopy (DRF), attenuated total reflectance spectroscopy (ATR) and Fourier transform infrared photoacoustic spectroscopy (PAS) are useful techniques that are commonly used to characterize soil properties. Here, these techniques were used to evaluate individual properties of 1456 paddy soil samples from Nanjing, China, to explore their features in the mid‐infrared range. The diffuse reflectance spectroscopy showed broad and shouldered peaks that ranged from 4000 to 500 cm −1 . Attenuated total reflectance spectroscopy produced main peaks around 1000 cm −1 . Fourier transform infrared photoacoustic spectroscopy spectra showed several moderate intensity peaks in the regions of 4000–2600 and 2500–500 cm −1 . The effective variables (wavenumbers) were selected using an uninformative variable elimination (UVE) algorithm to predict soil pH, and soil organic matter (SOM), total nitrogen (TN) and available phosphorus (AP) contents; it used a self‐adaptive partial least squares model (SAM–PLS). The results showed that selected wavenumbers improved the accuracy of prediction for pH, and SOM, TN and AP contents. For the prediction of pH, ATR spectra showed marginally better performance than the other spectra. The DRF spectroscopy was the optimal method for SOM and TN prediction. Available phosphorus contents were predicted poorly by all three spectra. Furthermore, mid‐infrared incident light paths, absorption modes, sensing styles, as well as peak interference and the prediction model, were the main factors that affected the assessment of soil properties in the three types of spectroscopy. Highlights Soil spectra data were measured with DRF, ATR and PAS spectrometers over the range 4000–500 cm −1 . A UVE algorithm was used to select effective wavenumbers from the full spectrum. The pH, SOM, TN and AP were estimated using three techniques based on a SAM–PLS model. Mid‐infrared incident light paths and absorption modes affected prediction performance of the three techniques.

Ma, F.↗

Performance of some block codes on a Gaussian channel

A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.

Baumert, L. D.↗

Genetic-Algorithm Tool For Search And Optimization

SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

Wang, Lui↗

Balancing Vibrations at Harmonic Frequencies by Injecting Harmonic Balancing Signals into the Armature of a Linear Motor/Alternator Coupled to a Stirling Machine

Vibrations at harmonic frequencies are reduced by injecting harmonic balancing signals into the armature of a linear motor/alternator coupled to a Stirling machine. The vibrations are sensed to provide a signal representing the mechanical vibrations. A harmonic balancing signal is generated for selected harmonics of the operating frequency by processing the sensed vibration signal with adaptive filter algorithms of adaptive filters for each harmonic. Reference inputs for each harmonic are applied to the adaptive filter algorithms at the frequency of the selected harmonic. The harmonic balancing signals for all of the harmonics are summed with a principal control signal. The harmonic balancing signals modify the principal electrical drive voltage and drive the motor/alternator with a drive voltage component in opposition to the vibration at each harmonic.

Holliday, Ezekiel S.↗

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (<10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Marusiak, Angela G.↗