Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “INTERPOLATION”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

An improved consistent, conservative, non-oscillatory and high order finite difference scheme for variable density low Mach number turbulent flow simulation

A consistent, conservative and truly high order finite difference scheme for low Mach number turbulent variable density flow simulation is presented. In the present scheme, the scalar transport equation is discretized with the explicit weighted compact nonlinear scheme (WCNS) while the continuity and momentum equations are discretized with a conservative centered high order finite difference scheme on a staggered grid. Bounded hybrid high order upwind interpolation is proposed for the evaluation of density on the cell faces of the staggered grid. The use of explicit WCNS along with the bounded density interpolation resolves the issue of degraded order of accuracy in the existing high order finite difference schemes where the centered finite difference scheme for mass and momentum conservation is combined with a total variation stable scheme for scalar transport. With the same difference operator used for the continuity and scalar transport equations, the present scheme is consistent naturally, and resolves the inconsistency problem reported in Trisjono et al. (J. Comp. Phys., 327, 612-628, 2016) without employing any modification to a scheme. Such improvements are demonstrated for several test cases.

02 PETROLEUM↗
DOE OSTI2018

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A hierarchical butterfly LU preconditioner for two-dimensional electromagnetic scattering problems involving open surfaces

This paper introduces a hierarchical interpolative decomposition butterfly-LU factorization (H-IDBF-LU) preconditioner for solving two-dimensional electric-field integral equations (EFIEs) in electromagnetic scattering problems of perfect electrically conducting objects with open surfaces. H-IDBF-LU leverages the interpolative decomposition butterfly factorization (IDBF) to compress dense blocks of the discretized EFIE operator to expedite its application; this compressed operator also serves as an approximate LU factorization of the EFIE operator leading to an efficient preconditioner in iterative solvers. Both the memory requirement and computational cost of the H-IDBF-LU solver scale as $O$($N$ log 2 $N$) in one iteration; the total number of iterations required for a reasonably good accuracy scales as $O$(1) to O(log 2 $N$) in all of our numerical tests. The efficacy and accuracy of the proposed preconditioned iterative solver are demonstrated via its application to a broad range of scatterers involving up to 100 million unknowns.

Liu, Yang↗
DOE OSTI2022

Parametric dynamic mode decomposition for reduced order modeling

Dynamic Mode Decomposition (DMD) is a model-order reduction approach, whereby spatial modes of fixed temporal frequencies are extracted from numerical or experimental data sets. The DMD low-rank or reduced operator is typically obtained by singular value decomposition of the temporal data sets. For parameter-dependent models, as found in many multi-query applications such as uncertainty quantification or design optimization, the only parametric DMD technique developed was a stacked approach, with data sets at multiple parameter values were aggregated together, increasing the computational work needed to devise low-rank dynamical reduced-order models. Here in this paper, we present two novel approach to carry out parametric DMD: one based on the interpolation of the reduced-order DMD eigen-pair and the other based on the interpolation of the reduced DMD (Koopman) operator. Numerical results are presented for diffusion-dominated nonlinear dynamical problems, including a multiphysics radiative transfer example. All three parametric DMD approaches are compared.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Ensuring Σ s Y s = 1 in transport of species mass fractions

When transporting species mass fractions in reacting flow simulations, there are physical constraints that must be met. Unfortunately, nonlinear transport schemes such as weighted essentially non-oscillatory (WENO) schemes do not ensure that the sum of mass fractions equals 1. In detonation simulations, errors in the sum of mass fractions are observed to worsen over time when the standard WENO scheme is used. To prevent this, typically one species is forced to absorb all or most of the error in the sum of mass fractions. Here, this work presents an alternative method for correcting the WENO-interpolated mass fractions such that inert species do not change. The method is demonstrated for both argon and nitrogen-diluted hydrogen detonations in one dimension. Using the modified WENO interpolations, the error in the sum is reduced significantly. In addition, the new approach is better able to capture the physical instability expected for nitrogen-diluted detonations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Computer-controlled finishing via dynamically constraint position-velocity-time scheduler

In a Computer Numerical Controlled (CNC) finishing process, the target material removal from an optical surface is guided by the convolution between the influence function of a machine tool and its dwell time at certain points over the surface. To reduce dynamics stressing and increase machining efficiency, the dwell time must be converted to varying velocities, which are the actual inputs to the machine tool controller. Conventionally, the conversion assumed constant acceleration and relied on linear motion interpolation, which caused discontinuities in velocities. This unsmooth motion affects the material removal distribution, and, thus, the accuracy of the finished surface shape. Many modern CNC machines support the smoother, cubic-polynomial interpolated Position-Velocity-Time (PVT) motion mode; however, the conventional scheduler may fail to provide suitable velocities for the PVT. Here in this study answers this challenge by proposing a novel PVT-based velocity scheduler that achieves smooth motion while considering CNC dynamic limits. Firstly, the principle of the PVT is explained, and the PVT-based velocity scheduler is formulated. Secondly, a quadratic programming is used to optimize the velocities by imposing the CNC dynamic constraints and the C 1 continuities (zeroth and first derivatives are continuous) simultaneously. Thirdly, the smoothness and accuracy of the scheduled velocities are studied on different kinds of tool paths via simulation. Finally, a sub-0.3 nm level surface finishing experiment using ion beam figuring is demonstrated to verify the feasibility of the proposed method. The PVT-based scheduler and simulator code is open-sourced.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Fast GPU 3D diffeomorphic image registration

3D image registration is one of the most fundamental and computationally expensive operations in medical image analysis. Here, we present a mixed-precision, Gauss–Newton–Krylov solver for diffeomorphic registration of two images. Our work extends the publicly available CLAIRE library to GPU architectures. Despite the importance of image registration, only a few implementations of large deformation diffeomorphic registration packages support GPUs. Our contributions are new algorithms to significantly reduce the run time of the two main computational kernels in CLAIRE: calculation of derivatives and scattered-data interpolation. Additionally, we deploy (i) highly-optimized, mixed-precision GPU-kernels for the evaluation of scattered-data interpolation, (ii) replace Fast-Fourier-Transform (FFT)-based first-order derivatives with optimized 8th-order finite differences, and (iii) compare with state-of-the-art CPU and GPU implementations. As a highlight, we demonstrate that we can register clinical images in less than 6 s on a single NVIDIA Tesla V100. This amounts to over 20 speed-up over the current version of CLAIRE and over 30 speed-up over existing GPU implementations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Thermodynamic modeling of CsF with LiF-NaF-KF for molten fluoride-fueled reactors

Gibbs energy models were developed to describe the thermochemical behavior of CsF in molten FLiNaK (46.5LiF-11.5NaF-42KF mol%), a proposed molten salt reactor (MSR) fuel solvent and coolant, as cesium is of concern due to its high radiotoxicity and volatility. Initially, it was necessary to obtain a more accurate Gibbs energy function for CsF which required fitting parameters to reported vapor pressures over condensed phase CsF. The pseudo-binary systems CsF-LiF, CsF-NaF and CsF-KF were then evaluated utilizing phase equilibria and enthalpy of mixing (Δ mix H) values, together with original differential scanning calorimetry (DSC) measurements performed for the CsF-LiF and CsF-KF systems. The CsF-LiF-NaF, CsF-LiF-KF and CsF-NaF-KF pseudo-ternary system representations were obtained by interpolation of the constituent pseudo-binary systems, with DSC measurements performed for the CsF-LiF-NaF system to corroborate the calculated liquidus temperature. Ultimately, the pseudo-ternary systems were interpolated to obtain Gibbs energy models for the pseudo-quaternary CsF-LiF-NaF-KF system, supported by DSC measurements at low CsF compositions (1–10 mol%), yielding computed equilibria and cesium-containing vapor pressures that compare favorably with reported values. In conclusion, the Molten Salt Thermal Properties Database – Thermochemical (MSTDB-TC) was subsequently expanded to include these Gibbs energy models allowing description of the thermochemical behavior of the CsF-LiF-NaF-KF system.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

Investigation of a digitizer for the plastic scintillation detectors of time-of-flight mass measurements

A CAEN DT5742 digitizer has been investigated to process the fast signals from the photomultiplier tubes of the time-of-flight detectors for fast ion beams. A test setup consisting of two plastic scintillation detectors and a pulsed laser source provided signals which were recorded by the digitizer and systematically analyzed with different algorithms to derive the amplitude, rise time and arrival time of the detection signal. To obtain the best amplitude and time resolutions, various optimization techniques including peak fitting and signal smoothing, interpolation improvement, and time-walk correction by amplitude and rise time have been performed and compared in detail. Here we compared the time resolutions obtained by three digital algorithms of leading-edge, zero-crossing constant-fraction (ZC-CFD) and direct constant-fraction discriminations. Finally, we found that the best time-of-flight resolution between two PMTs can be achieved as 12 ps by the method using sample minimum for peak location and using the time-walk-resistant ZC-CFD with 4-point interpolation for timing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
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 OSTI2017

Modeling the direct sun component in buildings using matrix algebraic approaches: Methods and validation

Simulation tools that enable annual energy performance analysis of optically-complex fenestration systems have been widely adopted by the building industry for use in building design, code development, and the development of rating and certification programs for commercially-available shading and daylighting products. The tools rely on a three-phase matrix operation to compute solar heat gains, using as input low-resolution bidirectional scattering distribution function (BSDF) data (10–15° angular resolution; BSDF data define the angle-dependent behavior of light-scattering materials and systems). Measurement standards and product libraries for BSDF data are undergoing development to support solar heat gain calculations. Simulation of other metrics such as discomfort glare, annual solar exposure, and potentially thermal discomfort, however, require algorithms and BSDF input data that more accurately model the spatial distribution of transmitted and reflected irradiance or illuminance from the sun (0.5° resolution). This study describes such algorithms and input data, then validates the tools (i.e., an interpolation tool for measured BSDF data and the five-phase method) through comparisons with ray-tracing simulations and field monitored data from a full-scale testbed. Simulations of daylight-redirecting films, a micro-louvered screen, and venetian blinds using variable resolution, tensor tree BSDF input data derived from interpolated scanning goniophotometer measurements were shown to agree with field monitored data to within 20% for greater than 75% of the measurement period for illuminance-based performance parameters. The three-phase method delivered significantly less accurate results. We discuss the ramifications of these findings on industry and provide recommendations to increase end user awareness of the current limitations of existing software tools and BSDF product libraries.

14 SOLAR ENERGY↗
DOE OSTI2025

On the effectiveness of neural operators at zero-shot weather downscaling

Machine-learning (ML) methods have shown great potential for weather downscaling. These data-driven approaches provide a more efficient alternative for producing high-resolution weather datasets and forecasts compared to physics-based numerical simulations. Neural operators, which learn solution operators for a family of partial differential equations, have shown great success in scientific ML applications involving physics-driven datasets. Neural operators are grid-resolution-invariant and are often evaluated on higher grid resolutions than they are trained on, i.e., zero-shot super-resolution. Given their promising zero-shot super-resolution performance on dynamical systems emulation, we present a critical investigation of their zero-shot weather downscaling capabilities, which is when models are tasked with producing high-resolution outputs using higher upsampling factors than are seen during training. To this end, we create two realistic downscaling experiments with challenging upsampling factors (e.g., 8x and 15x) across data from different simulations: the European Centre for Medium-Range Weather Forecasts Reanalysis version 5 (ERA5) and the Wind Integration National Dataset Toolkit. While neural operator-based downscaling models perform better than interpolation and a simple convolutional baseline, we show the surprising performance of an approach that combines a powerful transformer-based model with parameter-free interpolation at zero-shot weather downscaling. We find that this Swin-Transformer-based approach mostly outperforms models with neural operator layers in terms of average error metrics, whereas an Enhanced Super-Resolution Generative Adversarial Network-based approach is better than most models in terms of capturing the physics of the ground truth data. We suggest their use in future work as strong baselines.

17 WIND ENERGY↗
DOE OSTI2021

A Fast Algorithm for Scanning Transmission Electron Microscopy Imaging and 4D-STEM Diffraction Simulations

Scanning transmission electron microscopy (STEM) is an extremely versatile method for studying materials on the atomic scale. Many STEM experiments are supported or validated with electron scattering simulations. However, using the conventional multislice algorithm to perform these simulations can require extremely large calculation times, particularly for experiments with millions of probe positions as each probe position must be simulated independently. Recently, the plane-wave reciprocal-space interpolated scattering matrix (PRISM) algorithm was developed to reduce calculation times for large STEM simulations. Here, we introduce a new method for STEM simulation: partitioning of the STEM probe into “beamlets,” given by a natural neighbor interpolation of the parent beams. This idea is compatible with PRISM simulations and can lead to even larger improvements in simulation time, as well requiring significantly less computer random access memory (RAM). We have performed various simulations to demonstrate the advantages and disadvantages of partitioned PRISM STEM simulations. We find that this new algorithm is particularly useful for 4D-STEM simulations of large fields of view. We also provide a reference implementation of the multislice, PRISM, and partitioned PRISM algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Elliptic Cylinder Airborne Sampling and Geostatistical Mass Balance Approach for Quantifying Local Greenhouse Gas Emissions

In this paper, we explore observational, experimental, methodological, and practical aspects of the flux quantification of greenhouse gases from local point sources by using in situ airborne observations, and suggest a series of conceptual changes to improve flux estimates. We address the major sources of uncertainty reported in previous studies by modifying (1) the shape of the typical flight path, (2) the modeling of covariance and anisotropy, and (3) the type of interpolation tools used. We show that a cylindrical flight profile offers considerable advantages compared to traditional profiles collected as curtains, although this new approach brings with it the need for a more comprehensive subsequent analysis. The proposed flight pattern design does not require prior knowledge of wind direction and allows for the derivation of an ad hoc empirical correction factor to partially alleviate errors resulting from interpolation and measurement inaccuracies. Finally, the modified approach is applied to a use-case for quantifying CH 4 emission from an oil field south of San Ardo, CA, and compared to a bottom-up CH 4 emission estimate.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗
DOE OSTI2020

Chemical Robotics Enabled Exploration of Stability in Multicomponent Lead Halide Perovskites via Machine Learning

Metal halide perovskites have attracted immense interest as a promising material for a variety of optoelectronic and sensing applications. However, issues regarding long-term stability have emerged as the key bottleneck for commercialization. Here, we develop an automated experimental workflow based on combinatorial synthesis and rapid throughput characterization to explore long-term stability of these materials in ambient conditions. We apply it to four model perovskite systems: MA x FA y Cs 1–x–y PbBr 3 , MA x FA y Cs 1–x–y PbI 3 , Cs x FA y MA 1–x–y Pb(Br x+y I 1–x–y ) 3 , and Cs x MA y FA 1–x–y Pb(I x+y Br 1–x–y ) 3 . Non-negative matrix factorization and Gaussian process regression are used to interpolate the photoluminescent behavior of the phase diagram. This interpolative regression analysis helps to distinguish mixtures that form solid solutions from those that segregate into multiple materials, pointing out the most stable regions of the phase diagram. Here, we find stability dependence on composition to be nonuniform within the composition space, suggesting the presence of potential preferential compositional regions. This proposed workflow is universal and can be applied to other solution-processable materials.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Reply to Comment by Peterie Et Al. on “Accelerated Fill‐Up of the Arbuckle Group Aquifer and Links to U.S. Midcontinent Seismicity”

Abstract Peterie et al. question one observation in our paper: associating pressure increases to injection volumes at distances of up to 25 km from an injection well. In this reply, we show that the comment misunderstands our analysis and the evidence that led to this conclusion. We also show that gauge‐depth‐corrected pressures, used by the authors to produce statewide pressure maps, are discrepant with the static fluid level data, provided in our original compilation and analysis. The discrepancies are a result of the pressure correction method employed, which naïvely substitutes formation pressure for bottomhole pressure to calculate wellbore fluid density. Their linearly interpolated pressure maps, based on sparse data, contain interpolation and extrapolation artifacts that contradict injection trends in the state, the Theis solution, and the superposition principle. We reiterate that pressure and static fluid level increases in Class I wells existed prior to 2013, most notably in central Kansas, where recent earthquakes are cited in the comment as evidence of a pressure plume emanating from the Kansas‐Oklahoma border, 90 km away. We show that the space‐time pattern of seismicity in this area is inconsistent with a northward propagating pressure plume and, instead, seismicity appears to be centered on and near a cluster of high‐rate injection wells, two of which are among the highest rate wells in the state. These observations, along with recent M4 + earthquakes during continued decreases in wastewater injection in southern Kansas and northern Oklahoma, question the usefulness of the comment for understanding and managing societally significant earthquakes.

Ansari, Esmail↗
DOE OSTI2020

Version 4 of the CRU TS monthly high-resolution gridded multivariate climate dataset

CRU TS (Climatic Research Unit gridded Time Series) is a widely used climate dataset on a 0.5° latitude by 0.5° longitude grid over all land domains of the world except Antarctica. It is derived by the interpolation of monthly climate anomalies from extensive networks of weather station observations. Here we describe the construction of a major new version, CRU TS v4. It is updated to span 1901–2018 by the inclusion of additional station observations, and it will be updated annually. The interpolation process has been changed to use angular-distance weighting (ADW), and the production of secondary variables has been revised to better suit this approach. This implementation of ADW provides improved traceability between each gridded value and the input observations, and allows more informative diagnostics that dataset users can utilise to assess how dataset quality might vary geographically.

54 ENVIRONMENTAL SCIENCES↗