Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Level Set Method”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Graphics Processing Unit Assisted Thermographic Compositing

Objective: To develop a software application utilizing general purpose graphics processing units (GPUs) for the analysis of large sets of thermographic data. Background: Over the past few years, an increasing effort among scientists and engineers to utilize the GPU in a more general purpose fashion is allowing for supercomputer level results at individual workstations. As data sets grow, the methods to work them grow at an equal, and often great, pace. Certain common computations can take advantage of the massively parallel and optimized hardware constructs of the GPU to allow for throughput that was previously reserved for compute clusters. These common computations have high degrees of data parallelism, that is, they are the same computation applied to a large set of data where the result does not depend on other data elements. Signal (image) processing is one area were GPUs are being used to greatly increase the performance of certain algorithms and analysis techniques. Technical Methodology/Approach: Apply massively parallel algorithms and data structures to the specific analysis requirements presented when working with thermographic data sets.

Ragasa, Scott↗
NASA NTRS2013

Graphics Processing Unit Assisted Thermographic Compositing

Objective: To develop a software application utilizing general purpose graphics processing units (GPUs) for the analysis of large sets of thermographic data. Background: Over the past few years, an increasing effort among scientists and engineers to utilize the GPU in a more general purpose fashion is allowing for supercomputer level results at individual workstations. As data sets grow, the methods to work them grow at an equal, and often greater, pace. Certain common computations can take advantage of the massively parallel and optimized hardware constructs of the GPU to allow for throughput that was previously reserved for compute clusters. These common computations have high degrees of data parallelism, that is, they are the same computation applied to a large set of data where the result does not depend on other data elements. Signal (image) processing is one area were GPUs are being used to greatly increase the performance of certain algorithms and analysis techniques.

Ragasa, Scott↗
DOE OSTI2021

Reconstructing magnetic deflections from sets of proton images using differential evolution

Proton imaging is a powerful technique for imaging electromagnetic fields within an experimental volume, in which spatial variations in proton fluence are a result of deflections to proton trajectories due to interaction with the fields. When deflections are large, proton trajectories can overlap, and this nonlinearity creates regions of greatly increased proton fluence on the image, known as caustics. The formation of caustics has been a persistent barrier to reconstructing the underlying fields from proton images. We have developed a new method for reconstructing the path-integrated magnetic fields, which begins to address the problem posed by caustics. Our method uses multiple proton images of the same object, each image at a different energy, to fill in the information gaps and provide some uniqueness when reconstructing caustic features. We use a differential evolution algorithm to iteratively estimate the underlying deflection function, which accurately reproduces the observed proton fluence at multiple proton energies simultaneously. We test this reconstruction method using synthetic proton images generated for three different, cylindrically symmetric field geometries at various field amplitudes and levels of proton statistics and present reconstruction results from a set of experimental images. Here, the method we propose requires no assumption of deflection linearity and can reliably solve for fields underlying linear, nonlinear, and caustic proton image features for the selected geometries and is shown to be fairly robust to noise in the input proton intensity.

47 OTHER INSTRUMENTATION↗
NASA NTRS1985

Satellite observed thermodynamics during FGGE

During the First Global Atmospheric Research Program (GARP) Global Experiment (FGGE), determinations of temperature and moisture were made from TIROS-N and NOAA-6 satellite infrared and microwave sounding radiance measurements. The data were processed by two methods differing principally in their horizontal resolution. At the National Earth Satellite Service (NESS) in Washington, D.C., the data were produced operationally with a horizontal resolution of 250 km for inclusion in the FGGE Level IIb data sets for application to large-scale numerical analysis and prediction models. High horizontal resolution (75 km) sounding data sets were produced using man-machine interactive methods for the special observing periods of FGGE at the NASA/Goddard Space Flight Center and archived as supplementary Level IIb. The procedures used for sounding retrieval and the characteristics and quality of these thermodynamic observations are given.

Smith, W. L.↗
DOE OSTI2022

A critical comparison of CH∙∙∙π versus π∙∙∙π interactions in the benzene dimer: obtaining benchmarks at the CCSD(T) level and assessing the accuracy of lower scaling methods

In this study, we have established CCSD(T)/CBS (Complete Basis Set) limits for 3 stationary points on the benzene dimer potential energy surface, corresponding to the π∙∙∙π (parallel displaced or PD(C 2h ), minimum) and CH∙∙∙π (T-shaped or T(C 2v ), transition state) and tilted T-shaped (or TT(Cs), minimum) bonding scenarios considering both the structure and binding energy. The CCSD(T)/CBS binding energies are -2.65 ± 0.02 (PD), -2.74 ± 0.03 (T), and -2.83 ± 0.01 kcal mol -1 (TT). To this end, the CH∙∙∙π is ~0.2 kcal mol -1 stronger than the π∙∙∙π interaction, whereas the tilting of the CH donating benzene molecule with respect to the other benzene is worth 0.1 kcal mol -1 . As previously discussed in the literature, the MP2 level of theory does not provide a close match for either the energy or structure, yet the SCS-MP2 yields structures in excellent agreement with respect to the CCSD(T) result. It is found that the SCS-MI-MP2 also gives optimized structures very close to SCS-MP2 (within ~0.01 Å of the benchmark). Despite the closer match in structure, the spin-biased MP2 methods (SCS-, SCS-MI-, and SOS-MP2) incorrectly predict the relative stabilities of the isomers. That said, none of the spin biased MP2 methods offers a good compromise between energy and structure for the systems examined. Finally, the CCSD(T)/CBS benchmarks were used to assess the performance of 13 DFT functionals selected from different rungs of Jacob's ladder. Several functionals such as TPSS-D3, B3LYP-D3, B97-D, B97-D3, and B2PLYP-D3 provided a good description of the binding energies for both CH∙∙∙π and π∙∙∙π interactions, yielding values within 6% of the CCSD(T)/CBS benchmark values. Unlike the MP2 methods, these functionals correctly predict the relative stability of the PD(C 2h ) and T(C 2v ) dimers. Further, we find that there is no systematic improvement as Jacob's ladder is ascended (increased complexity of functional). The best functionals that result in a good compromise between structure and energy accuracy are B97-D3 and B2PLYP-D3 for both the CH∙∙∙π and π∙∙∙π interaction. Despite the impressive performance of these functionals, a challenge that remains is ensuring the transferability of these density functionals in accurately describing the interaction between dimers of larger aromatic molecules, the latter requiring high-level benchmarks for these systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2012

Graphics Processing Unit Assisted Thermographic Compositing

Objective Develop a software application utilizing high performance computing techniques, including general purpose graphics processing units (GPGPUs), for the analysis and visualization of large thermographic data sets. Over the past several years, an increasing effort among scientists and engineers to utilize graphics processing units (GPUs) in a more general purpose fashion is allowing for previously unobtainable levels of computation by individual workstations. As data sets grow, the methods to work them grow at an equal, and often greater, pace. Certain common computations can take advantage of the massively parallel and optimized hardware constructs of the GPU which yield significant increases in performance. These common computations have high degrees of data parallelism, that is, they are the same computation applied to a large set of data where the result does not depend on other data elements. Image processing is one area were GPUs are being used to greatly increase the performance of certain analysis and visualization techniques.

Ragasa, Scott↗
NASA NTRS1989

Cloud field classification based on textural features

An essential component in global climate research is accurate cloud cover and type determination. Of the two approaches to texture-based classification (statistical and textural), only the former is effective in the classification of natural scenes such as land, ocean, and atmosphere. In the statistical approach that was adopted, parameters characterizing the stochastic properties of the spatial distribution of grey levels in an image are estimated and then used as features for cloud classification. Two types of textural measures were used. One is based on the distribution of the grey level difference vector (GLDV), and the other on a set of textural features derived from the MaxMin cooccurrence matrix (MMCM). The GLDV method looks at the difference D of grey levels at pixels separated by a horizontal distance d and computes several statistics based on this distribution. These are then used as features in subsequent classification. The MaxMin tectural features on the other hand are based on the MMCM, a matrix whose (I,J)th entry give the relative frequency of occurrences of the grey level pair (I,J) that are consecutive and thresholded local extremes separated by a given pixel distance d. Textural measures are then computed based on this matrix in much the same manner as is done in texture computation using the grey level cooccurrence matrix. The database consists of 37 cloud field scenes from LANDSAT imagery using a near IR visible channel. The classification algorithm used is the well known Stepwise Discriminant Analysis. The overall accuracy was estimated by the percentage or correct classifications in each case. It turns out that both types of classifiers, at their best combination of features, and at any given spatial resolution give approximately the same classification accuracy. A neural network based classifier with a feed forward architecture and a back propagation training algorithm is used to increase the classification accuracy, using these two classes of features. Preliminary results based on the GLDV textural features alone look promising.

Sengupta, Sailes Kumar↗
NASA NTRS1975

A combined representation method for use in band structure calculations. 1: Method

A representation was described whose basis levels combine the important physical aspects of a finite set of plane waves with those of a set of Bloch tight-binding levels. The chosen combination has a particularly simple dependence on the wave vector within the Brillouin Zone, and its use in reducing the standard one-electron band structure problem to the usual secular equation has the advantage that the lattice sums involved in the calculation of the matrix elements are actually independent of the wave vector. For systems with complicated crystal structures, for which the Korringa-Kohn-Rostoker (KKR), Augmented-Plane Wave (APW) and Orthogonalized-Plane Wave (OPW) methods are difficult to apply, the present method leads to results with satisfactory accuracy and convergence.

Friedli, C.↗
NASA NTRS1980

Status of linear boundary-layer stability and the e to the nth method, with emphasis on swept-wing applications

The-state-of-the-art for the application of linear stability theory and the e to the nth power method for transition prediction and laminar flow control design are summarized, with analyses of previously published low disturbance, swept wing data presented. For any set of transition data with similar stream distrubance levels and spectra, the e to the nth power method for estimating the beginning of transition works reasonably well; however, the value of n can vary significantly, depending upon variations in disturbance field or receptivity. Where disturbance levels are high, the values of n are appreciably below the usual average value of 9 to 10 obtained for relatively low disturbance levels. It is recommended that the design of laminar flow control systems be based on conservative estimates of n and that, in considering the values of n obtained from different analytical approaches or investigations, the designer explore the various assumptions which entered into the analyses.

Hefner, J. N.↗
NASA NTRS1987

Optimal application of Morrison's iterative noise removal for deconvolution. Appendices

Morrison's iterative method of noise removal, or Morrison's smoothing, is applied in a simulation to noise-added data sets of various noise levels to determine its optimum use. Morrison's smoothing is applied for noise removal alone, and for noise removal prior to deconvolution. For the latter, an accurate method is analyzed to provide confidence in the optimization. The method consists of convolving the data with an inverse filter calculated by taking the inverse discrete Fourier transform of the reciprocal of the transform of the response of the system. Various length filters are calculated for the narrow and wide Gaussian response functions used. Deconvolution of non-noisy data is performed, and the error in each deconvolution calculated. Plots are produced of error versus filter length; and from these plots the most accurate length filters determined. The statistical methodologies employed in the optimizations of Morrison's method are similar. A typical peak-type input is selected and convolved with the two response functions to produce the data sets to be analyzed. Both constant and ordinate-dependent Gaussian distributed noise is added to the data, where the noise levels of the data are characterized by their signal-to-noise ratios. The error measures employed in the optimizations are the L1 and L2 norms. Results of the optimizations for both Gaussians, both noise types, and both norms include figures of optimum iteration number and error improvement versus signal-to-noise ratio, and tables of results. The statistical variation of all quantities considered is also given.

Ioup, George E.↗
NASA NTRS2003

Anharmonic Vibrational Spectroscopy of the F-(H20)n, complexes, n=1,2

We report anharmonic vibrational spectra (fundamentals, first overtones) for the F-(H(sub 2)O) and F-(H(sub 2)O)2 clusters computed at the MP2 and CCSD(T) levels of theory with basis sets of triple zeta quality. Anharmonic corrections were estimated via the correlation-corrected vibrational self-consistent field (CC-VSCF) method. The CC-VSCF anharmonic spectra obtained on the potential energy surfaces evaluated at the CCSD(T) level of theory are the first ones reported at a correlated level beyond MP2. We have found that the average basis set effect (TZP vs. aug-cc-pVTZ) is on the order of 30-40 cm(exp -1), whereas the effects of different levels of electron correlation [MP2 vs. CCSD(T)] are smaller, 20-30 cm(exp -1). However, the basis set effect is much larger in the case of the H-bonded O-H stretch of the F-(H(sub 2)O) cluster amounting to 100 cm(exp -1) for the fundamentals and 200 cm (exp -1) for the first overtones. Our calculations are in agreement with the limited available set of experimental data for the F-(H(sub 2)O) and F-(H(sub 2)O)2 systems and provide additional information that can guide further experimental studies.

Chaban, Galina M.↗
DOE OSTI2025

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗
DOE OSTI2024

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation: Preprint

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

distribution system operator↗
DOE OSTI2020

A reduced-order shifted boundary method for parametrized incompressible Navier–Stokes equations

Here, we investigate a projection-based reduced order model of the steady incompressible Navier–Stokes equations for moderate Reynolds numbers. In particular, we construct an “embedded” reduced basis space, by applying proper orthogonal decomposition to the Shifted Boundary Method, a high-fidelity embedded method recently developed. We focus on the geometrical parametrization through level-set geometries, using a fixed Cartesian background geometry and the associated mesh. This approach avoids both remeshing and the development of a reference domain formulation, as typically done in fitted mesh finite element formulations. Two-dimensional computational examples for one and three parameter dimensions are presented to validate the convergence and the efficacy of the proposed approach.

"embedded" basis↗
DOE OSTI2026

Third moments of nucleon unpolarized, polarized, and transversity parton distribution functions from physical-point lattice QCD

Using forward matrix elements of local leading-twist operators, we present a determination of the isovector third Mellin moments ⟨𝑥 2 ⟩ of nucleon unpolarized, polarized, and transversity parton distribution functions. Two lattice QCD ensembles at the physical pion mass are used, which were generated using a tree-level Symanzik-improved gauge action and 2+1 flavor tree-level improved Wilson Clover fermions coupling via 2-level HEX-smearing. Leveraging a wide set of operators, two extraction methods for the matrix elements, and the automatic inclusion of model uncertainties via bootstrapped model averages, we extract values of the third Mellin moments. Furthermore, this is the first direct calculation of these observables performed at the physical pion mass.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1975

Review of Terrestrial Photovoltaic Measurements Workshop

Measurement methods for terrestrial solar cells require calibration standards to set simulator irradiance levels or to monitor solar irradiance in outdoor measurements. Measurements of solar cell performance in terrestrial sunlight are the most acceptable, but an artificial light source can be used for laboratory measurements.

Brandhorst, H. W., Jr.↗
NASA NTRS1981

Using rewards and penalties to obtain desired subject performance

Operant conditioning procedures, specifically the use of negative reinforcement, in achieving stable learning behavior is described. The critical tracking test (CTT) a method of detecting human operator impairment was tested. A pass level is set for each subject, based on that subject's asymptotic skill level while sober. It is critical that complete training take place before the individualized pass level is set in order that the impairment can be detected. The results provide a more general basis for the application of reward/penalty structures in manual control research.

Cook, M.↗
NASA NTRS1988

Extensions of the CSCM methodology for nonequilibrium reacting gas flows

The paper describes the extension of the CSCM flux difference splitting to produce conservative unconditionally stable implicit upwind methods for the extended equation set. The CSCM-S single data level relaxation algorithm is argued to be particularly advantageous for efficiently solving the set of equations. Attention is given to issues of alternative state variable representations and to complementary thermodynamic relations that parameterize and need to be effectively coupled with the solution procedure for the partial differential equations. Within the framework of iteration, consideration is given to more efficient approximate solution procedures than the full block coupled LU decomposition. Results of early numerical experiments are given to illustrate the developments.

Lombard, C. K.↗