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.

SourceResearch connectionFrom yearThrough year

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

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Optimizing Sensor Count and Placement to Detect Bond Wire Lift-Offs and Surface Defects in High-Power IGBT Modules Using Low-Cost Piezo-Electric Resonators

This manuscript presents the most recent results and findings to identify bond wire lift-offs and surface defects in high-power isolated gate bipolar junction transistor (IGBT) modules. The authors of this manuscript formerly proposed a low-cost, piezoelectric resonator-based measurement unit to detect bond wire related degradation in larger IGBT modules. Since high-power IGBT modules are expensive, it was apparent that evaluating our proposed method by inducing controlled damage to fresh (new) IGBTs may not be cost-effective especially when multiple sets of data need to be captured by inducing damage to different levels. In order to overcome this limitation, IGBT bond wires have been mimicked using a 3D printed enclosure, a PCB, and copper wires with dimensions very closely resembling a real IGBT. Using this method, multiple test devices can be built at the cost of a real IGBT, and the proposed technique could be fine-tuned without damaging expensive, real IGBTs. Our recent findings can be used to determine real IGBT degradation and bond wire lift-offs using only two sensors, as opposed to six transducers used in the first iteration of the setup. In addition to optimizing the sensor count, we have also identified the best possible locations of these sensors by attempting multiple placements inside the IGBT casing.

condition monitoring↗

DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Validating a large geophysical data set: Experiences with satellite-derived cloud parameters

We are validating the global cloud parameters derived from the satellite-borne HIRS2 and MSU atmospheric sounding instrument measurements, and are using the analysis of these data as one prototype for studying large geophysical data sets in general. The HIRS2/MSU data set contains a total of 40 physical parameters, filling 25 MB/day; raw HIRS2/MSU data are available for a period exceeding 10 years. Validation involves developing a quantitative sense for the physical meaning of the derived parameters over the range of environmental conditions sampled. This is accomplished by comparing the spatial and temporal distributions of the derived quantities with similar measurements made using other techniques, and with model results. The data handling needed for this work is possible only with the help of a suite of interactive graphical and numerical analysis tools. Level 3 (gridded) data is the common form in which large data sets of this type are distributed for scientific analysis. We find that Level 3 data is inadequate for the data comparisons required for validation. Level 2 data (individual measurements in geophysical units) is needed. A sampling problem arises when individual measurements, which are not uniformly distributed in space or time, are used for the comparisons. Standard 'interpolation' methods involve fitting the measurements for each data set to surfaces, which are then compared. We are experimenting with formal criteria for selecting geographical regions, based upon the spatial frequency and variability of measurements, that allow us to quantify the uncertainty due to sampling. As part of this project, we are also dealing with ways to keep track of constraints placed on the output by assumptions made in the computer code. The need to work with Level 2 data introduces a number of other data handling issues, such as accessing data files across machine types, meeting large data storage requirements, accessing other validated data sets, processing speed and throughput for interactive graphical work, and problems relating to graphical interfaces.

Kahn, Ralph↗

DOE OSTI2022

Radiocarbon analysis as a method for verifying atmospheric CO 2 uptake during carbon mineralization

Sequestration of atmospheric CO 2 is required to constrain the warming of Earth’s climate. Carbon mineralization refers to the precipitation of carbonate minerals by reaction of CO 2 and Mg- and Ca-rich rocks; if the source of the CO 2 is atmospheric and the precipitated carbonate is protected from subsequent dissolution, this process at sufficient scale may be able to reliably draw down atmospheric greenhouse gas levels. Such reactions occur passively in ultramafic settings and previous work has demonstrated that they actively draw down local CO 2 (g) concentrations. However, a method for unambiguously attributing the sequestered carbon solid product to atmospheric sources is still lacking. Here, we test if radiocarbon can be used to verify that the carbon being incorporated into carbonate minerals during carbon mineralization is atmospheric in origin. Additionally, samples from recently exposed ultramafic sites are analyzed and the results demonstrate the utility of this technique for verifying true atmospheric carbon reduction.

58 GEOSCIENCES↗

DOE OSTI2022

Using Direct Numerical Simulation of Pore-Level Events to Improve Pore-Network Models for Prediction of Residual Trapping of CO2

Direct numerical simulation and pore-network modeling are common approaches to study the physics of two-phase flow through natural rocks. For assessment of the long-term performance of geological sequestration of CO 2 , it is important to model the full drainage-imbibition cycle to provide an accurate estimate of the trapped CO 2 . While direct numerical simulation using pore geometry from micro-CT rock images accurately models two-phase flow physics, it is computationally prohibitive for large rock volumes. On the other hand, pore-network modeling on networks extracted from micro-CT rock images is computationally efficient but utilizes simplified physics in idealized geometric pore elements. This study uses the lattice-Boltzmann method for direct numerical simulation of CO 2 -brine flow in idealized pore elements to develop a new set of pore-level flow models for the pore-body filling and snap-off events in pore-network modeling of imbibition. Lattice-Boltzmann simulations are conducted on typical idealized pore-network configurations, and the interface evolution and local capillary pressure are evaluated to develop modified equations of local threshold capillary pressure of pore elements as a function of shape factor and other geometrical parameters. The modified equations are then incorporated into a quasi-static pore-network flow solver. The modified model is applied on extracted pore-network of sandstone samples, and saturation of residual trapped CO 2 is computed for a drainage-imbibition cycle. The modified model yields different statistics of pore-level events compared with the original model; in particular, the occurrence of snap-off in pore-throats is reduced resulting in a more frontal displacement pattern along the main injection direction. Compared to the original model, the modified model is in closer agreement with the residual trapped CO 2 obtained from core flow experiments and direct numerical simulation.

Kohanpur, Amir H.↗

DOE OSTI2022

IMPROVING THE ACCURACY OF COMPOSITE METHODS: A G4MP2 METHOD WITH G4-LIKE ACCURACY AND IMPLICATIONS FOR MACHINE LEARNING

G4MP2 theory has proven to be a reliable and accurate quantum chemical composite method for the calculation of molecular energies using an approximation based on second-order perturbation theory to lower computational costs compared to G4 theory. However, it has been found to have significantly increased errors when applied to larger organic molecules with 10 or more nonhydrogen atoms. We report here on an investigation of the cause of the failure of G4MP2 theory for such larger molecules. One source of error is found to be the "higher-level correction (HLC)", which is meant to correct for deficiencies in correlation contributions to the calculated energies. This is because the HLC assumes that the contribution is independent of the element and the type of bonding involved, both of which become more important with larger molecules. We address this problem by adding an atom-specific correction, dependent on atom type but not bond type, to the higher-level correction. We find that a G4MP2 method that incorporates this modification of the higher-level correction, referred to as G4MP2A, becomes as accurate as G4 theory (for computing enthalpies of formation) for a test set of molecules with less than 10 nonhydrogen atoms as well as a set with 10-14 such atoms, the set of molecules considered here, with a much lower computational cost. The G4MP2A method is also found to significantly improve ionization potentials and electron affinities. Finally, we implemented the G4MP2A energies in a machine learning method to predict molecular energies.

Dandu, Naveen↗

DOE OSTI2023

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Hardware-Conscious Optimization of the Quantum Toffoli Gate

While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can mitigate the effects of imperfect hardware by optimizing quantum circuits for objectives such as critical path length. Few approaches consider quantum circuits in terms of the set of vendor-calibrated operations (i.e., native gates) available on target hardware. This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Although we focus on optimizing Toffoli gates on the IBMQ native gate set, the methods presented are generalizable to any gate and superconducting qubit architecture. Our optimized Toffoli gate implementation demonstrates an 18% reduction in infidelity compared with the canonical implementation as benchmarked on IBM Jakarta with quantum process tomography. Assuming the inclusion of multi-qubit cross-resonance (MCR) gates in the IBMQ native gate set, we produce Toffoli implementations with only six multi-qubit gates, a 25% reduction from the canonical eight multi-qubit implementations for linearly connected qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1997

Determination of Residual Stress in Composite Materials Using Ultrasonic Waves

The performance of high temperature composites can be significantly affected by the presence of residual stresses. These stresses arise during cooling processes from fabrication to room temperature due to mismatch of thermal expansion coefficients between matrix and fiber materials. This effect is especially pronounced in metal matrix and intermetallic composites. It can lead to plastic deformations, matrix cracking and fiber/matrix interface debonding. In this work the feasibility of ultrasonic techniques for residual stress assessment in composites is addressed. A novel technique for absolute stress determination in orthotropic materials from angular dependencies of ultrasonic velocities is described. The technique is applicable for determination of both applied and residual stresses and does not require calibration measurements on a reference sample. The important advantage of this method is that stress is determined simultaneously with stress-dependent elastic constants and is thus decoupled from the material texture. It is demonstrated that when the principal plane stress directions coincide with acoustical axes, the angular velocity data in the plane perpendicular to the stress plane may be used to determine both stress components. When the stress is off the acoustical axes, the shear and the difference of the normal stress components may be determined from the angular dependence of group velocities in the plane of stresses. Synthetic sets of experimental data corresponding to materials with different anisotropy and stress levels are used to check the applicability of the technique. The method is also verified experimentally. A high precision ultrasonic wave transmission technique is developed to measure angular dependence of ultrasonic velocities. Examples of stress determination from experimental velocity data are given. A method is presented for determination of velocities of ultrasonic waves propagating through the composite material with residual stresses. It is based on the generalized self-consistent multiple scattering model. Calculation results for longitudinal and shear ultrasonic wave velocities propagating perpendicular to the fibers direction in SCS-6/Ti composite with and without residual stresses are presented. They show that velocity changes due to presence of stresses are of order 1%.

Rokhlin, S. I.↗

DOE OSTI2023

TopoSZ: Preserving Topology in Error-Bounded Lossy Compression

Existing error-bounded lossy compression techniques control the pointwise error during compression to guarantee the integrity of the decompressed data. However, they typically do not explicitly preserve the topological features in data. When performing post hoc analysis with decompressed data using topological methods, preserving topology in the compression process to obtain topologically consistent and correct scientific insights is desirable. In this paper, we introduce TopoSZ, an error-bounded lossy compression method that preserves the topological features in 2D and 3D scalar fields. Specifically, we aim to preserve the types and locations of local extrema as well as the level set relations among critical points captured by contour trees in the decompressed data. The main idea is to derive topological constraints from contour-tree-induced segmentation from the data domain, and incorporate such constraints with a customized error-controlled quantization strategy from the SZ compressor (version 1.4). In conclusion, our method allows users to control the pointwise error and the loss of topological features during the compression process with a global error bound and a persistence threshold.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Noise robust detection of quantum phase transitions

Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the study of ground-states of condensed matter models, and the transitions between them. However, current levels of hardware noise can require extensive application of error-mitigation techniques to achieve reliable computations. In this work, we use several IBM devices to explore a finite-size spin model with multiple “phaselike” regions characterized by distinct ground-state configurations. Using preoptimized Variational Quantum Eigensolver (VQE) solutions, we demonstrate that in contrast to calculating the energy, where zero-noise extrapolation is required in order to obtain qualitatively accurate yet still unreliable results, calculations of the energy derivative, two-site spin correlation functions, and the fidelity susceptibility yield accurate behavior across multiple regions, even with minimal or no application of error-mitigation approaches. Taken together, these sets of observables could be used to identify level crossings in a simple, noise-robust manner which is agnostic to the method of ground state preparation. This work shows promising potential for near-term application to identifying quantum phase transitions, including avoided crossings and nonadiabatic conical intersections in electronic structure calculations. Published by the American Physical Society 2024

Lively, Kevin (ORCID:0000000320981494)↗

DOE OSTI2023

Searches for lepton-flavour-violating decays of the Higgs boson into $eτ$ and $μτ$ in $ \sqrt{s}$ = 13 TeV pp collisions with the ATLAS detector

This paper presents direct searches for lepton flavour violation in Higgs boson decays, H → eτ and H → μτ, performed using data collected with the ATLAS detector at the LHC. The searches are based on a data sample of proton-proton collisions at a centre-of-mass energy $\sqrt{s}$ = 13 TeV, corresponding to an integrated luminosity of 138 fb –1 . Leptonic (τ → ℓν ℓ ν τ ) and hadronic (τ → hadrons ν τ ) decays of the τ-lepton are considered. Two background estimation techniques are employed: the MC-template method, based on data-corrected simulation samples, and the Symmetry method, based on exploiting the symmetry between electrons and muons in the Standard Model backgrounds. No significant excess of events is observed and the results are interpreted as upper limits on lepton-flavour-violating branching ratios of the Higgs boson. The observed (expected) upper limits set on the branching ratios at 95% confidence level, $\mathcal{B}$(H → eτ) < 0.20% (0.12%) and $\mathcal{B}$(H → μτ ) < 0.18% (0.09%), are obtained with the MC-template method from a simultaneous measurement of potential H → eτ and H → μτ signals. The best-fit branching ratio difference, $\mathcal{B}$(H → μτ) → $\mathcal{B}$(H → eτ), measured with the Symmetry method in the channel where the τ-lepton decays to leptons, is (0.25 ± 0.10)%, compatible with a value of zero within 2.5σ.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

On the Efficient Evaluation of the Exchange Correlation Potential on Graphics Processing Unit Clusters

The predominance of Kohn–Sham density functional theory (KS-DFT) for the theoretical treatment of large experimentally relevant systems in molecular chemistry and materials science relies primarily on the existence of efficient software implementations which are capable of leveraging the latest advances in modern high-performance computing (HPC). With recent trends in HPC leading toward increasing reliance on heterogeneous accelerator-based architectures such as graphics processing units (GPU), existing code bases must embrace these architectural advances to maintain the high levels of performance that have come to be expected for these methods. In this work, we purpose a three-level parallelism scheme for the distributed numerical integration of the exchange-correlation (XC) potential in the Gaussian basis set discretization of the Kohn–Sham equations on large computing clusters consisting of multiple GPUs per compute node. In addition, we purpose and demonstrate the efficacy of the use of batched kernels, including batched level-3 BLAS operations, in achieving high levels of performance on the GPU. We demonstrate the performance and scalability of the implementation of the purposed method in the NWChemEx software package by comparing to the existing scalable CPU XC integration in NWChem.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Deriving Essential Climate Variable Data from Multiple Satellite Remote Sensors Using a Consistent Fingerprinting Method

Hyperspectral observations from satellite-based sensors provide high information content for the Earth’s atmospheric and surface properties. Traditionally, long-term climate products are derived by performing spatial and temporal averaging of level-2 satellite products. It is a time-consuming process to generate level-2 data products since modern hyperspectral satellite sensors have millions of observations each day with thousands of spectral channels for each observation. Additionally, differences in level-2 retrieval algorithms can lead to errors in the climate products when fusing data from different satellite sensors. We have developed a radiometrically consistent spectral fingerprinting method, which overcomes the above-mentioned shortcomings, to derive climate change signals from multiple satellite sensors using spatiotemporally averaged level-1 data. We have applied this method to Atmospheric Infrared Sounder (AIRS) and Cross-track Infrared Sounder (CrIS) data and generated decade-long climate data records for atmospheric temperature, water vapor, cloud, trace gases, and surface skin temperature. A key component to this work is a set of observational-based radiative kernels produced from CrIS level-1 data using a single field of view (SFOV) optimal estimation retrieval algorithm. Only limited CrIS level-1 data (e.g., 1-2 years of data) are needed to the derive radiative kernels. Our Principal Component-based Radiative Model (PCRTM) enables us to perform SFOV retrievals under all sky conditions and provides radiative kernels (including those for clouds) needed by the spectral fingerprinting method. In this presentation, we will describe the basic methodology, the details of the algorithm, and results from NASA Aqua AIRS and Suomi-NPP CrIS data. The method can be applied to study future hyperspectral remote sensors such as CLARREO (Climate Absolute Radiance and Refractivity Observatory) Pathfinder (CPF), Tropospheric Emissions: Monitoring of Pollution (TEMPO), Surface Biology and Geology (SBG), Aerosol and Cloud, Convection and Precipitation (ACCP).

Xu Liu↗

DOE OSTI2022

Calculating the grain boundary inclination of voxelated grain structures using a smoothing algorithm

We have developed a flexible method for calculating the grain boundary (GB) inclinations of voxelated grain structure data using smoothing algorithms. We compared the performance of four algorithms: the linear interpolation, Allen–Cahn, level-set, and vertex algorithms. We assessed their accuracy using 2D and 3D cases with known inclinations. The vertex algorithm provided the best balance between accuracy and efficiency for 2D structures while the linear interpolation algorithm provided the best balance for 3D structures. We compared the GB inclinations calculated using our smoothing method on a 3D high energy X-ray diffraction microscopy (HEDM) dataset to those determined by meshing the GBs. The two approaches determined similar GB plane distributions, though they varied significantly at triple junctions. In conclusion, the smoothing method was demonstrated for two sources of 3D voxelated grain structures: HEDM data and results from Monte Carlo Potts grain growth simulations.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Beyond pinball loss: Quantile methods for calibrated uncertainty quantification

Amongthemanywaysofquantifying uncertainty in a regression setting, specifying the full quantile function is attractive, as quantiles are amenable to interpretation and evaluation. A model that predicts the true conditional quantiles for each input, at all quantile levels, presents a correct and efficient representation of the underlying uncertainty. To achieve this, many current quantile-based methods focus on optimizing the pinball loss. However, this loss restricts the scope of applicable regression models, limits the ability to target many desirable properties (e.g. calibration, sharpness, centered intervals), and may produce poor conditional quantiles. In this work, we develop new quantile methods that address these shortcomings. In particular, we propose methods that can apply to any class of regression model, select an explicit balance between calibration and sharpness, optimize for calibration of centered intervals, and produce more accurate conditional quantiles. We provide a thorough experimental evaluation of our methods, which includes a high dimensional uncertainty quantification task in nuclear fusion.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2005

Integrated System-Level Optimization for Concurrent Engineering With Parametric Subsystem Modeling

The introduction of concurrent design practices to the aerospace industry has greatly increased the productivity of engineers and teams during design sessions as demonstrated by JPL's Team X. Simultaneously, advances in computing power have given rise to a host of potent numerical optimization methods capable of solving complex multidisciplinary optimization problems containing hundreds of variables, constraints, and governing equations. Unfortunately, such methods are tedious to set up and require significant amounts of time and processor power to execute, thus making them unsuitable for rapid concurrent engineering use. This paper proposes a framework for Integration of System-Level Optimization with Concurrent Engineering (ISLOCE). It uses parametric neural-network approximations of the subsystem models. These approximations are then linked to a system-level optimizer that is capable of reaching a solution quickly due to the reduced complexity of the approximations. The integration structure is described in detail and applied to the multiobjective design of a simplified Space Shuttle external fuel tank model. Further, a comparison is made between the new framework and traditional concurrent engineering (without system optimization) through an experimental trial with two groups of engineers. Each method is evaluated in terms of optimizer accuracy, time to solution, and ease of use. The results suggest that system-level optimization, running as a background process during integrated concurrent engineering sessions, is potentially advantageous as long as it is judiciously implemented.

Schuman, Todd↗

DOE OSTI2021

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗