Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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.

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

At least 991 records · Page 55

Measurements of Ocean Features With AIRSAR

Here we discuss an indirect approach for measuring ocean features from synthetic aperture radar (SAR) imagery. The approach is based on the refraction of swell that can be seen in the SAR imagery. Locally, swell refraction is due only to changes in bathymetry and surface current shear and it is easy to separate these two effects. It has been shown that linear energetic shears can be detected and measured from high resolution images of the ocean. A simple approach to measuring surface velocity and shear is to divide the imagery into smaller segments where the shear in each segment is approximately linear. The known linear algorithm would then be applied to each segment and the velocity/shear distribution can then be determined by assembling the segments with linear shear into an estimate of the actual shear/velocity distribution.

Sheres, David↗

On the Retrieval of Ice Cloud Particle Shapes from POLDER Measurements

Shapes of ice crystals can significantly affect the radiative transfer in ice clouds. The angular distribution of the polarized reflectance over ice clouds strongly depends on ice crystal shapes. Although the angular-distribution features of the total or polarized reflectance over ice clouds implies a possibility of retrieving ice cloud particle shapes by use of remote sensing data, the accuracy of the retrieval must be evaluated. In this study, a technique, which applies single ice crystal habit and multidirectional polarized radiance to retrieve ice cloud particle shapes, is assessed. Our sensitivity studies show that the retrieved particle shapes &om this algorithm can be considered good approximations to those in actual clouds in calculation of the phase matrix elements. Although a fractal poly-crystal shape or an inhomogeneous hexagonal column may also produce this type of phase functions, more representative single-scattering properties from combinations of natural particle shapes and size distributions may still be necessary in accurate retrieval of other cloud properties such as optical thickness and particle size.

Sun, W.↗

A Highly Accurate Voight Function Algorithm

A complex Voight lineshape algorithm is presented whose maximum relative error over the complex plane is less than 1 x 10 super minus 8. The algorithm consists of series, rational approximations and Gauss-Hermite integrations which makes it suitable as a general purpose software module for a wide variety of uses, including a Voight function standard.

Voight lineshape Doppler velocity distribution col↗

Improved Heat-Stress Algorithm

NASA Dryden presents an improved and automated site-specific algorithm for heat-stress approximation using standard atmospheric measurements routinely obtained from the Edwards Air Force Base weather detachment. Heat stress, which is the net heat load a worker may be exposed to, is officially measured using a thermal-environment monitoring system to calculate the wet-bulb globe temperature (WBGT). This instrument uses three independent thermometers to measure wet-bulb, dry-bulb, and the black-globe temperatures. By using these improvements, a more realistic WBGT estimation value can now be produced. This is extremely useful for researchers and other employees who are working on outdoor projects that are distant from the areas that the Web system monitors. Most importantly, the improved WBGT estimations will make outdoor work sites safer by reducing the likelihood of heat stress.

Teets, Edward H., Jr.↗

On the Use of a Range Trigger for the Mars Science Laboratory Entry Descent and Landing

In 2012, during the Entry, Descent, and Landing (EDL) of the Mars Science Laboratory (MSL) entry vehicle, a 21.5 m Viking-heritage, Disk-Gap-Band, supersonic parachute will be deployed at approximately Mach 2. The baseline algorithm for commanding this parachute deployment is a navigated planet-relative velocity trigger. This paper compares the performance of an alternative range-to-go trigger (sometimes referred to as Smart Chute ), which can significantly reduce the landing footprint size. Numerical Monte Carlo results, predicted by the POST2 MSL POST End-to-End EDL simulation, are corroborated and explained by applying propagation of uncertainty methods to develop an analytic estimate for the standard deviation of Mach number. A negative correlation is shown to exist between the standard deviations of wind velocity and the planet-relative velocity at parachute deploy, which mitigates the Mach number rise in the case of the range trigger.

Way, David W.↗

Retrievals of Cloud Droplet Size from the Research Scanning Polarimeter Data: Validation Using In Situ Measurements

We present comparisons of cloud droplet size distributions (DSDs) retrieved from the research scanning polarimeter (RSP) data with correlative in situ measurements made during the North Atlantic Aerosols and Marine Ecosystems Study (NAAMES). The airborne portion of this field experiment was based out of St. John's airport, Newfoundland, Canada with the focus of this paper being on the deployment in May - June 2016. RSP was onboard the NASA C-130 aircraft together with an array of in situ and other remote sensing instrumentation. The RSP is an along-track scanner measuring the polarized and total reflectance in 9 spectral channels. Its uniquely high angular resolution allows for characterization of liquid water droplet sizes using the rainbow structure observed in the polarized reflectance over the scattering angle range from 135 to 165.degrees The rainbow is dominated by single scattering of light by cloud droplets, so its structure is characteristic specifically of the droplet sizes at cloud top (within unit optical depth into the cloud, equivalent to approximately 50m). A parametric fitting algorithm applied to the polarized reflectance provides retrievals of the droplet effective radius and variance assuming a prescribed size distribution shape (gamma distribution). In addition to this, we use a non-parametric method, the Rainbow Fourier Transform (RFT), which allows us to retrieve the droplet size distribution itself. The latter is important in the case of clouds with complex microphysical structure, or multiple layers of cloud, which result in multi-modal DSDs. During NAAMES the aircraft performed a number of flight patterns specifically designed for comparisons between remote sensing retrievals and in situ measurements. These patterns consisted of two flight segments above the same straight ground track. One of these segments was flown above clouds allowing for remote sensing measurements, while the other was near the cloud top where cloud droplets were sampled. We compare the DSDs retrieved from the RSP data with in situ measurements made by the Cloud Droplet Probe (CDP). The comparisons generally show good agreement (better than 1 micron for effective radius and in most cases better than 0.02 for effective variance) with deviations explainable by the position of the aircraft within the cloud, or by the presence of additional cloud layers between the cloud being sampled by the in situ instrumentation and the altitude of the remote sensing segment. In the latter case, the multi-modal DSDs retrieved from the RSP data were consistent with the multi-layer cloud structures observed in the correlative High Spectral Resolution Lidar (HSRL) profiles. The results of these comparisons provide a rare validation of polarimetric droplet size retrieval techniques, demonstrating their accuracy and robustness and the potential of satellite data of this kind on a global scale.

Remote Sensing↗

Optimal filtering of overlapped pulses in microcalorimeter data

In this study, we present a general algorithm for processing microcalorimeter data with special applicability to data with high photon count rates. Conventional optimal filtering, which has become ubiquitous in microcalorimeter data processing, suffers from its inability to recover overlapped pulses without sacrificing spectral resolution. The technique presented here was developed to address this particular shortcoming and does so without imposing any assumptions beyond those made by the conventional technique. We demonstrate the performance of the algorithm with a dataset that approximately satisfies these assumptions and which is representative of a wide range of microcalorimeter applications. We also apply the technique to a highly non-linear dataset, examining the impact on performance in the limit that these assumptions break down.

Dallas Wulf↗

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗

First Estimation of Model Parameters for Neutrino-Induced Nucleon Knockout Using Simulation-Based Inference

To enable an accurate determination of oscillation parameters, accelerator-based neutrino experiments require detailed simulations of nuclear interaction physics in the GeV regime. While substantial effort from both theory and experiment is currently being invested to improve the fidelity of these simulations, their present deficiencies typically oblige experimental collaborations to resort to empirical tuning of simulation model parameters. As the precision requirements of the field continue to become more stringent, machine learning techniques may provide a powerful means of handling corresponding growth in the complexity of future neutrino interaction model tuning exercises. To study the suitability of simulation-based inference (SBI) for this physics application, in this paper we revisit a tuned configuration of the GENIE neutrino event generator that was originally developed by the MicroBooNE collaboration. Despite closely reproducing the adopted values of four physics parameters when confronted with the tuned cross-section predictions as input, we find that our trained SBI algorithm prefers modestly different values (within MicroBooNE's assigned uncertainties) and achieves slightly better goodness-of-fit when inference is run on the experimental data set originally used by MicroBooNE. We also find that our trained algorithm can create a fair approximation of an alternative neutrino scattering simulation, NuWro, that shares only a subset of its physics model parameters with GENIE.

Tame-Narvaez, Karla [Fermilab] (ORCID:000000022249↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

Demodulation of a single complex fringe interferogram with a path-independent regularized phase-tracking technique

The two-dimensional regularized phase-tracking (RPT) technique is one of the most powerful approaches to demodulate a single interferogram with either open or closed fringes. However, it often fails in the cases of complex interferograms and needs well-defined scanning strategies. An improved algorithm based on the RPT is presented in this paper. We use a paraboloid phase model to approximate the phase function and modify the cost functional to search the smoothest phase solutions in the function space C{sup 2}. With these modifications, the phase tracker preserves the robustness of the RPT while at the same time it is no more sensitive to stationary points and is capable of demodulating complex interferograms with arbitrary scanning schemes. Moreover, the phase reconstructed by the proposed algorithm is normally more accurate than that of the RPT both for noiseless and noisy interferograms under the same conditions. Computer simulations and experimental results are both presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quadrature algorithms to the luminosity distance with a time-dependent dark energy model

In our previous work [1], we have proposed two methods for computing the luminosity distance d{sub L}{sup Λ} in ΛCDM model. In this paper, two effective quadrature algorithms, known as Romberg Integration and composite Gaussian Quadrature, are presented to calculate the luminosity distance d{sub L}{sup CPL} in the Chevallier-Polarski-Linder parametrization(CPL) model. By comparing both the efficiency and accuracy of the two algorithms, we find that the second is more promising. Moreover, we develop another strategy adapted for approximating d{sub L}{sup Λ} in flat ΛCDM universe. To some extent, our methods can make contributions to the recent numerical stimulation for the investigation of dark energy cosmology.

79 ASTRONOMY AND ASTROPHYSICS↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Fluid preconditioning for Newton–Krylov-based, fully implicit, electrostatic particle-in-cell simulations

A recent proof-of-principle study proposes an energy- and charge-conserving, nonlinearly implicit electrostatic particle-in-cell (PIC) algorithm in one dimension [9]. The algorithm in the reference employs an unpreconditioned Jacobian-free Newton–Krylov method, which ensures nonlinear convergence at every timestep (resolving the dynamical timescale of interest). Kinetic enslavement, which is one key component of the algorithm, not only enables fully implicit PIC as a practical approach, but also allows preconditioning the kinetic solver with a fluid approximation. This study proposes such a preconditioner, in which the linearized moment equations are closed with moments computed from particles. Effective acceleration of the linear GMRES solve is demonstrated, on both uniform and non-uniform meshes. The algorithm performance is largely insensitive to the electron–ion mass ratio. Numerical experiments are performed on a 1D multi-scale ion acoustic wave test problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convex Interpolating Splines of Arbitrary Degree

Shape preserving approximations are constructed by interpolating the data with polynomial splines of arbitrary degree. A regularity condition is formulated on the data which insures the existence of such a shape preserving spline, an algorithm is presented for its construction, and the uniform norm of the error is bound which results when the algorithm is used to produce an approximation to a given f epsilon Ca,b.

Neuman, E.↗

Physics-Driven Construction of Compact Primitive Gaussian Density Fitting Basis Sets

We present a model-assisted density fitting (MADF) basis set generator, an algorithm for generating primitive atomic Gaussian density fitting (DF) basis sets (DFBSs) from a contracted Gaussian orbital basis set (OBS). The MADF algorithm produces DFBSs suitable for accurate robust DF approximation of 2-particle interactions in mean-field and correlated electronic structures. The algorithm is designed to (a) saturate the OBS product space by a large regularized set of primitive solid-harmonic Gaussian shells with nonuniform distribution of exponents, followed by (b) pruning of the shells according to their contributions to the 2- body energy of a correlated atomic ensemble. Building the DFBS generator model almost exclusively on mathematical and physical principles allows one to limit the number of parameters that control the density fitting error to three, with a single set of parameters sufficient for computations with all basis cardinal numbers, with and without correlation of core electrons, with and without scalar and spin-dependent relativistic effects, spanning almost all of the Periodic Table. Performance assessment included basis sets up to quadruple-ζ quality from several major basis set families, using molecules composed of main-group, d-block, and f-block elements. The resulting DF errors in Hartree−Fock and second-order MP2 energies (with relativistic all-electron treatments, when appropriate) were on the order of 20 and 10 μE h per electron, respectively.

Approximation↗

Prototype Vector Machine for Large Scale Semi-Supervised Learning

Practicaldataminingrarelyfalls exactlyinto the supervisedlearning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised learning (SSL). We note that the computationalintensivenessofgraph-based SSLarises largely from the manifold or graph regularization, which in turn lead to large models that are dificult to handle. To alleviate this, we proposed the prototype vector machine (PVM), a highlyscalable,graph-based algorithm for large-scale SSL. Our key innovation is the use of"prototypes vectors" for effcient approximation on both the graph-based regularizer and model representation. The choice of prototypes are grounded upon two important criteria: they not only perform effective low-rank approximation of the kernel matrix, but also span a model suffering the minimum information loss compared with the complete model. We demonstrate encouraging performance and appealing scaling properties of the PVM on a number of machine learning benchmark data sets.

97 MATHEMATICS AND COMPUTING↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗