Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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 1,783 records · Page 99

B-spline Method in Fluid Dynamics

B-spline functions are bases for piecewise polynomials that possess attractive properties for complex flow simulations : they have compact support, provide a straightforward handling of boundary conditions and grid nonuniformities, and yield numerical schemes with high resolving power, where the order of accuracy is a mere input parameter. This paper reviews the progress made on the development and application of B-spline numerical methods to computational fluid dynamics problems. Basic B-spline approximation properties is investigated, and their relationship with conventional numerical methods is reviewed. Some fundamental developments towards efficient complex geometry spline methods are covered, such as local interpolation methods, fast solution algorithms on cartesian grid, non-conformal block-structured discretization, formulation of spline bases of higher continuity over triangulation, and treatment of pressure oscillations in Navier-Stokes equations. Application of some of these techniques to the computation of viscous incompressible flows is presented.

Botella, Olivier↗

Statistical Studies on Thin Cirrus from MODIS Data

The 1.38 micron channel on the MODerate resolution Imaging Spectroradiomater (MODIS) is an ideal channel to identify and quantify thin cirrus on a global basis. This channel is used to produce the cirrus reflectance product in MOD06 and also used extensively by the MODIS aerosol algorithms to mask clouds for the MOD04 product. The aerosol product uses a lower threshold of the 1.38 micron channel reflectance of 0.01. A cirrus channel reflectance of 0.01 corresponds to approximately an aerosol optical thickness of 0.10. Therefore, the ambiguity due to the minor cirrus contamination may introduce artificial optical thickness in the aerosol products. The questions arise: How prevalent are the thinnest cirrus clouds over the globe? Do they persist over specific regions and seasons? Can we distinguish between the noise of the channel and the actual cloudiness by extrapolating the cloudiness signal to very dark scenes, statistically. We analyze the Terra data, over land and ocean to answer these questions.

Li, Rong-Rong↗

Morphing: A Novel Approach to Astronaut Suit Sizing

The fitting of a spacesuit to an astronaut is an iterative process consisting of two parts. The first uses anthropometric data to provide an approximation of the suit components that will fit the astronaut. The second part is the subjective fitting, where small adjustments are made based on the astronaut s preference. By providing a better approximation of the correct suit components, the entire fit process time can be reduced significantly. The goals of this project are twofold: (1) To evaluate the effectiveness of the existing sizing algorithm for the Mark III Hybrid suit and (2) to determine what additional components are needed in order to provide adequate sizing for the existing astronaut population. A single subject was scanned using a 3D whole-body scanner (VITUS 3D) in the Mark III suit in eight different poses and four subjects in minimal clothing were also scanned in similar poses. The 3D external body scans of the suit and the subject are overlaid and visually aligned in a customized MATLAB program. The suit components were contracted or expanded linearly along the subjects limbs to match the subjects segmental lengths. Two independent measures were obtained from the morphing program on four subjects and compared with the existing sizing information. Two of the four subjects were in correspondence with the sizing algorithm and morphing results. The morphing outcome for a third subject, incompatible with the suit, suggested that an additional arm element at least 6 inches smaller than the existing smallest suit component would need to be acquired. The morphing result of the fourth subject, deemed incompatible with the suit using the sizing algorithm, indicated a different suit configuration which would be compatible. This configuration matched with the existing suit fit check data.

Margerum, Sarah↗

Progress on the National Solar Radiation Data Base (NSRDB): A New DNI Computation

This study introduces a new technique to compute direct normal irradiance (DNI) for improving the National Solar Radiation Data Base (NSRDB). A finite-surface integration algorithm is developed to compute solar radiation in differential solid angles and efficiently infer its contribution to a surface perpendicular to the solar direction. A lookup table of cloud bi-directional transmittance distribution function (BTDF) is developed by use of the discrete ordinates radiative transfer (DISORT) model for possible solar and observing directions and various cloud optical and microphysical properties. In each solar incident direction, DNI is given by the cloud BTDFs from approximately 200 differential solid angles. The simulated DNI is calibrated and evaluated using surface observations at the National Renewable Energy Laboratory's (NREL's) Solar Energy Research Laboratory (SRRL) and the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) facility.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Predicting survival in heart failure case and control subjects by use of fully automated methods for deriving nonlinear and conventional indices of heart rate dynamics

BACKGROUND: Despite much recent interest in quantification of heart rate variability (HRV), the prognostic value of conventional measures of HRV and of newer indices based on nonlinear dynamics is not universally accepted. METHODS AND RESULTS: We have designed algorithms for analyzing ambulatory ECG recordings and measuring HRV without human intervention, using robust methods for obtaining time-domain measures (mean and SD of heart rate), frequency-domain measures (power in the bands of 0.001 to 0.01 Hz [VLF], 0.01 to 0.15 Hz [LF], and 0.15 to 0.5 Hz [HF] and total spectral power [TP] over all three of these bands), and measures based on nonlinear dynamics (approximate entropy [ApEn], a measure of complexity, and detrended fluctuation analysis [DFA], a measure of long-term correlations). The study population consisted of chronic congestive heart failure (CHF) case patients and sex- and age-matched control subjects in the Framingham Heart Study. After exclusion of technically inadequate studies and those with atrial fibrillation, we used these algorithms to study HRV in 2-hour ambulatory ECG recordings of 69 participants (mean age, 71.7+/-8.1 years). By use of separate Cox proportional-hazards models, the conventional measures SD (P<.01), LF (P<.01), VLF (P<.05), and TP (P<.01) and the nonlinear measure DFA (P<.05) were predictors of survival over a mean follow-up period of 1.9 years; other measures, including ApEn (P>.3), were not. In multivariable models, DFA was of borderline predictive significance (P=.06) after adjustment for the diagnosis of CHF and SD. CONCLUSIONS: These results demonstrate that HRV analysis of ambulatory ECG recordings based on fully automated methods can have prognostic value in a population-based study and that nonlinear HRV indices may contribute prognostic value to complement traditional HRV measures.

Non-NASA Center↗

Implementation of Stochastic Gradient Descent in an Automated Glow Peak Identification Software for Multiple Thermoluminescent Dosimeter Types

A glow-curve analysis code was previously developed in C++ to analyze thermoluminescent dosimeter glow curves using automated peak detection while applying a first-order kinetics model. A newer version of this code was implemented to improve the automated peak detection and curve fitting models. The Stochastic Gradient Descent Algorithm was introduced to replace the prior approach of taking first and second-order derivatives for peak detection. Additionally, early stopping mechanisms were invoked to improve the previously used Levenberg-Marquardt Algorithm employed for curve fitting. The two software versions were compared through glow curve analysis of different thermoluminescent dosimeter materials and calculation of the corresponding figures of merit. Altogether improvements were shown, namely an increase in the number of peaks detected and a reduction of the mean figure of merit by approximately 46%.

137Cs↗

A Bayesian approach to microwave precipitation profile retrieval

A multichannel passive microwave precipitation retrieval algorithm is developed. Bayes theorem is used to combine statistical information from numerical cloud models with forward radiative transfer modeling. A multivariate lognormal prior probability distribution contains the covariance information about hydrometeor distribution that resolves the nonuniqueness inherent in the inversion process. Hydrometeor profiles are retrieved by maximizing the posterior probability density for each vector of observations. The hydrometeor profile retrieval method is tested with data from the Advanced Microwave Precipitation Radiometer (10, 19, 37, and 85 GHz) of convection over ocean and land in Florida. The CP-2 multiparameter radar data are used to verify the retrieved profiles. The results show that the method can retrieve approximate hydrometeor profiles, with larger errors over land than water. There is considerably greater accuracy in the retrieval of integrated hydrometeor contents than of profiles. Many of the retrieval errors are traced to problems with the cloud model microphysical information, and future improvements to the algorithm are suggested.

Evans, K. Franklin↗

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved Understanding of Multicentury Greenland Ice Sheet Response to Strong Warming in the Coupled CESM2‐CISM2 With Regional Grid Refinement

The simulation of ice sheet‐climate interactions, such as surface mass balance fluxes, is sensitive to model grid resolution. Here we simulate the multi‐century evolution of the Greenland Ice Sheet (GrIS) and its interaction with the climate using the Community Earth System Model version 2.2 (CESM2.2) including an interactive GrIS component (the Community Ice Sheet Model v2.1 [CISM2.1]) under an idealized warming scenario (atmospheric CO 2 increases by 1% yr -1 until quadrupling the pre‐industrial level and then is held fixed). A variable‐resolution (VR) grid with 1/4° regional refinement over the broader Arctic and 1° resolution elsewhere is applied to the atmosphere and land components, and the results are compared with conventional 1° lat‐lon grid simulations to investigate the impact of grid refinement. Compared with the 1° runs, the VR run features a slower rate of surface melt, especially over the western and northern GrIS, where the ice surface slopes gently toward the periphery. This difference pattern originates primarily from higher snow albedo and, thus, weaker albedo feedback in the VR run. The VR grid better captures the CISM ice sheet topography by reducing elevation discrepancies between CAM and CISM and is, therefore, less reliant on the downscaling algorithm, which is known to underestimate albedo gradients. The sea level rise contribution from the GrIS in the VR run is 53 mm by year 150 and 831 mm by year 350, approximately 40% and 20% less than that of the 1° runs, respectively.

Earth System Model↗

Preparation of excited states for nuclear dynamics on a quantum computer

We study two different methods to prepare excited states on a quantum computer, a key initial step to study dynamics within linear response theory. The first method uses unitary evolution for a short time T = O(√1 - F) to approximate the action of an excitation operator Ô with fidelity F and success probability P ≈ 1 – F. The second method probabilistically applies the excitation operator using the Linear Combination of Unitaries (LCU) algorithm. We benchmark these techniques on emulated and real quantum devices, using a toy model for thermal neutron-proton capture. Despite its larger memory footprint, the LCU-based method is efficient even on current generation noisy devices and can be implemented at a lower gate cost than a naive analysis would suggest. Here, these findings show that quantum techniques designed to achieve good asymptotic scaling on fault tolerant quantum devices might also provide practical benefits on devices with limited connectivity and gate fidelity.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\)

Here, this work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in H(div). The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation–histopolation basis, efficient matrix-free preconditioners can be constructed for the (1, 1)-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the “crooked pipe” grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

97 MATHEMATICS AND COMPUTING↗

How Good Is Your Location? Comparing and Understanding the Uncertainties in Location for the 1993 Rock Valley Sequence

Accurate event locations are important for many endeavors in seismology, and understanding the factors that contribute to uncertainties in those locations is complex. In this article, we present a case study that takes an in-depth look at the accuracy and precision possible for locating nine shallow earthquakes in the Rock Valley fault zone in southern Nevada. These events are targeted by the Rock Valley Direct Comparison phase of the Source Physics Experiment, as candidates for the colocation of a chemical explosion with an earthquake hypocenter to directly compare earthquake and explosion sources. For this comparison, it is necessary to determine earthquake hypocenters as accurately as possible so that different source types have nearly identical locations. Our investigations include uncertainty analysis from different sets of phase arrivals, stations, velocity models, and location algorithms. For a common set of phase arrivals and stations, we find that epicentral locations from different combinations of velocity models and algorithms are within 600 m of one another in most cases. Event depths exhibit greater uncertainties, but focusing on the S-P times at the nearest station allows for estimates within approximately 500 m.

58 GEOSCIENCES↗

Acoustic Tomography of the Atmosphere: A Large-Eddy Simulation Sensitivity Study

Accurate measurement of atmospheric turbulent fluctuations is critical for understanding environmental dynamics and improving models in applications such as wind energy. Advanced remote sensing technologies are essential for capturing instantaneous velocity and temperature fluctuations. Acoustic tomography (AT) offers a promising approach that utilizes sound travel times between an array of transducers to reconstruct turbulence fields. This study presents a systematic evaluation of the time-dependent stochastic inversion (TDSI) algorithm for AT using synthetic travel-time measurements derived from large-eddy simulation (LES) fields under both neutral and convective atmospheric boundary-layer conditions. Unlike prior work that relied on field observations or idealized fields, the LES framework provides a ground-truth atmospheric state, enabling quantitative assessment of TDSI retrieval reliability, sensitivity to travel-time measurement noise, and dependence on covariance model parameters and temporal data integration. A detailed sensitivity analysis was conducted to determine the best-fit model parameters, identify the tolerance thresholds for parameter mismatch, and establish a maximum spatial resolution. The TDSI algorithm successfully reconstructed large-scale velocity and temperature fluctuations with root mean square errors ( RMSE s) below 0.35 m/s and 0.12 K, respectively. Spectral analysis established a maximum spatial resolution of approximately 1.4 m, and reconstructions remained robust for travel-time measurement uncertainties up to 0.002 s. These findings provide critical insights into the operational limits of TDSI and inform future applications of AT for atmospheric turbulence characterization and system design.

17 WIND ENERGY↗

Refinement of the Goloseyev catalog point coordinates in the limb zone and determination of point coordinates on the back side of the moon

Lunar photography from Zond 6 showed half the side of the moon which is not visible from the earth, and this made it possible to construct a photogrammetric grid encompassing the entire Western Hemisphere and referenced to points of the visible side, whose coordinates were taken from the Goloseyev catalog. The problem was solved using two pictures taken from approximately 9000 km above the lunar surface. The photogrammetric grid was constructed by joint statistical analysis of the measurements of both pictures and the selenographic coordinates of the catalog points. A special algorithm was developed and a program compiled realizing the maximum likelihood method which permitted working with up to 120 catalog points simultaneously.

Krasikov, V. A.↗

Implicit finite difference simulation of flow about arbitrary geometries with application to airfoils

Finite difference procedures are used to solve either the Euler equations or the 'thin layer' Navier-Stokes equations subject to arbitrary boundary conditions. An automatic grid generation program is employed, and because an implicit finite difference algorithm for the flow equations is used, time steps are not severely limited when grid points are finely distributed. Computational efficiency and compatibility to vectorized computer processors is maintained by use of approximate factorization techniques. Computed results for both inviscid and viscous flow about airfoils are described and compared to various known solutions.

Steger, J. L.↗

A comparative study of nonreflecting far-field boundary condition procedures for unsteady transonic flow computation

Various nonreflecting far-field boundary condition procedures are compared by implementing them in the computer code LTRAN2. This code solves the implicit finite-difference representation of the small-disturbance equations for transonic flows about airfoils. The first- and second-approximate nonreflecting conditions, as proposed by Engquist and Majda, are compared with the condition derived from the full-characteristic equation. The far-field boundary conditions and the description of the algorithm for implementing these conditions in LTRAN2 are discussed. Various cases are computed and compared with results from the older, more conventional procedures. One concludes that the full-characteristic equation produces the most effective results, thus allowing the far-field boundary to be located closer to the airfoil; this decreases the computer time required to obtain the solution because fewer mesh points are required.

Kwak, D.↗

A statistical model for radar images of agricultural scenes

The presently derived and validated statistical model for radar images containing many different homogeneous fields predicts the probability density functions of radar images of entire agricultural scenes, thereby allowing histograms of large scenes composed of a variety of crops to be described. Seasat-A SAR images of agricultural scenes are accurately predicted by the model on the basis of three assumptions: each field has the same SNR, all target classes cover approximately the same area, and the true reflectivity characterizing each individual target class is a uniformly distributed random variable. The model is expected to be useful in the design of data processing algorithms and for scene analysis using radar images.

Frost, V. S.↗