Search NASA⌕ Search

SEARCH · Search NASA

Results for “high performance space computing”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Piston geometry and stroke optimization for high efficiency propane spark ignition engines

Propane has unique properties and offers interesting characteristics for high-efficiency spark ignition engines. Its high volatility reduces or completely eliminates fuel-wall wetting and facilitates fuel air mixing. Furthermore, propane has a research octane number of 112 and a high octane sensitivity of 15. Finally, its laminar flame speed is on the same order as that of conventional gasoline, and it exhibits high dilution tolerance. Modern spark ignition internal combustion engines rely on fast combustion rates and high dilution to achieve high brake thermal efficiencies. To accomplish this, high stroke-to-bore ratios and high geometric compression ratios have been used in new engine designs. Therefore, propane’s relatively high laminar flame speeds, high knock resistance, and dilution tolerance make it an excellent candidate fuel for modern spark ignition engines. The objective of this work is to co-optimize the piston geometry and the engine stroke to maximize the efficiency of a spark-ignition engine fueled with propane. 3D computational fluid dynamics (CFD) simulations employing the extended coherent flamelet model were used to study the parametric effects of piston shape and stroke length. A piston geometry based on high performing pistons was parameterized using four controlling parameters. The piston geometry and engine stroke design space was explored using deterministic and quasi-random sampling techniques. In conclusion, a Gaussian process regression model was built using the simulation data to explain the results observed.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Machine learning framework for quantum sampling of highly constrained, continuous optimization problems

In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Fourier-based three-dimensional multistage transformer for aberration correction in multicellular specimens

High-resolution tissue imaging is often compromised by sample-induced optical aberrations that degrade resolution and contrast. Although wavefront sensor-based adaptive optics (AO) can measure these aberrations, such hardware solutions are typically complex, expensive to implement and slow when serially mapping spatially varying aberrations across large fields of view. Here we introduce AOViFT (adaptive optical vision Fourier transformer)—a machine learning-based aberration sensing framework built around a three-dimensional multistage vision transformer that operates on Fourier domain embeddings. AOViFT infers aberrations and restores diffraction-limited performance in puncta-labeled specimens with substantially reduced computational cost, training time and memory footprint compared to conventional architectures or real-space networks. We validated AOViFT on live gene-edited zebrafish embryos, demonstrating its ability to correct spatially varying aberrations using either a deformable mirror or postacquisition deconvolution. By eliminating the need for the guide star and wavefront sensing hardware and simplifying the experimental workflow, AOViFT lowers technical barriers for high-resolution volumetric microscopy across diverse biological samples.

Alshaabi, Thayer [Howard Hughes Medical Institute,↗
DOE OSTI2021

Computational Fluid Dynamics Using the Adaptive Wavelet-Collocation Method

Advancements to the adaptive wavelet-collocation method over the last decade have opened up a number of new possible areas for active research. Volume penalization techniques allow complex immersed boundary conditions to be used with high efficiency for both internal and external flows. Anisotropic methods make it possible to use body-fitted meshes while still taking advantage of the dynamic adaptability properties wavelet-based methods provide. The parallelization of the approach has made it possible to perform large high-resolution simulations of detonation initiation and fluid instabilities to uncover new physical insights that would otherwise be difficult to discover. Other developments include space-time adaptive methods and nonreflecting boundary conditions. This article summarizes the work performed using the adaptive wavelet-collocation method developed by Vasilyev and coworkers over the past decade.

42 ENGINEERING↗
DOE OSTI2022

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗
DOE OSTI2022

Landmark-Warped Emulators for Models with Misaligned Functional Response

Many computer models output functional data, and in some cases, these functional data have similar, but misaligned, shape characteristics. In this paper, we introduce a general approach for building emulators for computer models that output misaligned functional data when key values in the functional response (landmarks) can be easily identified. This approach has two main parts: modeling the aligned (using the landmarks) functional data, and modeling the functions that map the misaligned data to the aligned space (warping functions). As the warping functions are required to be monotonic, we give special attention to modeling monotonic functional response data. We discuss how our approach can be easily applied for a variety of typical emulators, such as Gaussian processes, Bayesian multivariate adaptive regression splines, and Bayesian additive regression trees, and how sensitivity analysis can be performed. We demonstrate our approach by building emulators for two applications: (1) a high-energy-density physics computer model used to simulate inertial confinement fusion ignition experiments, where model outputs are highly misaligned, and (2) a multiphysics continuum hydrocode used to simulate high-velocity impact experiments, where model outputs are only slightly misaligned. In case (1) traditional methods cannot be applied, while in (2) they can be applied, but the proposed method performs significantly better.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Non-Blind Deblurring for Fluorescence: A Deformable Latent Space Approach with Kernel Parameterization

We report N\non-blind deblurring (NBD) is a modeling method of the image deblurring problem in computer vision, where the blurring kernel is known or can be externally estimated. In this paper, we attempt to solve a parametric NBD problem, inspired by the simultaneous acquisition of ptychography and fluorescent imaging (FI). Ptychography is an imaging method that favors larger probes, i.e. convolutional kernels, while FI relies on a small probe for high resolution. Also, the kernel can be solved during ptychographic reconstruction. With Ptycho-FI using the same larger kernel, we can perform NBD on the blurred fluorescent images to achieve high-resolution FI, and thus speed up the experiments. To this end, we design a deep latent space deformation network that is directly parameterized by the kernel. The network consists of three components: encoder, deformer, and decoder, where the deformer is specifically meant to rectify the latent space representations of blurred images to a standard latent space, regardless of the kernel. The deformation network is trained with a two-stage training scheme. We conduct extensive experiments to confirm that our parametric model can adapt to drastically different blurring kernels and perform robust deblurring.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2020

On decoupling the integrals of cosmological perturbation theory

ABSTRACT Perturbation theory (PT) is often used to model statistical observables capturing the translation and rotation-invariant information in cosmological density fields. PT produces higher order corrections by integration over linear statistics of the density fields weighted by kernels resulting from recursive solution of the fluid equations. These integrals quickly become high dimensional and naively require increasing computational resources the higher the order of the corrections. Here, we show how to decouple the integrands that often produce this issue, enabling PT corrections to be computed as a sum of products of independent 1D integrals. Our approach is related to a commonly used method for calculating multiloop Feynman integrals in quantum field theory, the Gegenbauer Polynomial x-Space Technique. We explicitly reduce the three terms entering the 2-loop power spectrum, formally requiring 9D integrations, to sums over successive 1D radial integrals. These 1D integrals can further be performed as convolutions, rendering the scaling of this method Nglog Ng with Ng the number of grid points used for each fast Fourier transform. This method should be highly enabling for upcoming large-scale structure redshift surveys where model predictions at an enormous number of cosmological parameter combinations will be required by Monte Carlo Markov Chain searches for the best-fitting values.

Slepian, Zachary↗
DOE OSTI2024

An open-source framework for balancing computational speed and fidelity in production cost models

Studies of bulk power system operations need to incorporate uncertainty and sensitivity analyses, especially around exposure to weather and climate variability and extremes, but this remains a computational modeling challenge. Commercial production cost models (PCMs) have shorter runtimes, but also important limitations (opacity, license restrictions) that do not fully support stochastic simulation. Open-source PCMs represent a potential solution. They allow for multiple, simultaneous runs in high-performance computing environments and offer flexibility in model parameterization. Yet, developers must balance computational speed (i.e. runtime) with model fidelity (i.e. accuracy). In this paper, we present Grid Operations (GO), a framework for instantiating open-source, scale-adaptive PCMs. GO allows users to search across parameter spaces to identify model versions that appropriately balance computational speed and fidelity based on experimental needs and resource limits. Results provide generalizable insights on how to navigate the fidelity and computational speed tradeoff through parameter selection. We show that models with coarser network topologies can accurately mimic market operations, sometimes better than higher-resolution models. It is thus possible to conduct large simulation experiments that characterize operational risks related to climate and weather extremes while maintaining sufficient model accuracy.

42 ENGINEERING↗
DOE OSTI2020

Local SU(2) × U(1) quark flavor symmetry in the RS bulk

We propose a model of quark flavor based on an additional SU(2) × U(1) local symmetry in a warped extra dimensional bulk. In contrast to other works, we break the additional gauge symmetry in the bulk via two complex scalars which acquire bulk vevs, rather than relying on brane-localized symmetry breaking. A gauge-covariant Kaluza-Klein decomposition of a theory with a bulk spontaneously broken gauge symmetry is performed, and exact expressions for the bulk profiles of all physical particles in such systems are given. The SM quark masses and mixings are then recreated using gauge-covariant bulk quark mass terms and Yukawa-like couplings to the new bulk scalars. A numerical sampling of points in the model parameter space that recreate the quark masses and mixings is performed at a KK scale of M KK = 5 TeV. We then compute the ΔF = 2 4-quark operators arising from our new flavor gauge bosons and scalars, and those arising from Kaluza-Klein modes of SM gauge bosons. By decoupling one of our bulk scalar fields to all quark fields except the right-handed up-like sector, we find that it is possible to greatly suppress tree-level contributions to the highly constrained Kaon mixing parameters. Instead, the dominant constraints on the model emerge from neutral Bd and D meson mixing. These constraints are explored with our numerical sampling of the model parameter space, and the specific contribution of the new flavor gauge bosons and scalars is discussed. We find that for a significant range of realistic flavor gauge couplings, the new gauge bosons compete with the normally dominant gluon flavor-changing currents, but flavor-changing operators emerging from the bulk scalar fields are highly suppressed. Finally, we briefly comment on flavor constraints that are independent of the flavor gauge sector arising from the Z$\overline{b}$ L b L coupling and rare top decays.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Optimization Through Multi-Fidelity Modeling

We present a novel method for optimizing parameter selection for simulations with an evaluation budget. We start with an existing method for building a multi-fidelity model out of many low-fidelity simulations and few high-fidelity simulations. We propose a novel method to simplify parameter selection without sacrificing performance. We verify these results and compare with existing literature. Next, we propose a novel algorithm which uses this difference model to suggest new points in the parameter design space to simulate. We add each point we simulate to the model to improve its quality for the next iteration. The algorithm trades off reducing the uncertainty of the existing model with optimization of the objective. The first is more useful when a large fraction of the computation budget remains. The second is more useful when a small fraction of the computation budget remains. Our method converges to the optimum by using a high-fidelity evaluation for just 16 of the 427 points. Our method is general enough to work if there is no low-fidelity model. Furthermore, it is agnostic to the underlying physics of the problem. Therefore, both the low-fidelity and high-fidelity models can be generated by any arbitrary function, including simulations and physical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Difference in load predictions obtained with effective turbulence vs. a dynamic wake meandering modeling approach

Abstract. According to the international standard for wind turbine design, the effects of wind turbine wakes on structural loads can be considered in two ways: (1) by augmenting the ambient turbulence levels with the effective turbulence model (EFF) and then calculating the resulting loads and (2) by performing dynamic wake meandering (DWM) simulations, which compute wake effects and loads for all turbines on a farm at once. There is no definitive answer in scientific literature as to the consequences of choosing one model over the other, but the two approaches are unarguably very different. The work presented here expounds on these differences and investigates to what extent they affect the simulated structural loads. We consider an idealized 4×4 rectangular array of National Renewable Energy Laboratory 5 MW wind turbines with a spacing of 5 by 8 rotor diameters and three wind speed scenarios at high ambient turbulence. Load simulations are performed in OpenFAST with EFF and in FAST.Farm with the DWM implementation. We compare ambient turbulence, wind farm turbulence, and loads between both approaches. When omnidirectional results are compared, EFF wind farm turbulence intensity is consistently higher by 0.2 % (above-rated wind speed) to 2.7 % (below-rated wind speed). However, for certain wind directions, the EFF turbulence can be lower than FAST.Farm by almost 9 %. Wind speeds within the farm were found to differ by up to 3 m s−1 due to the lack of wake deficits in the EFF approach, leading to longer tails toward low values in the FAST.Farm mean load distributions. Consistent with the turbulence results, the median EFF load standard deviations are also consistently higher, by a maximum of 20 % and 17 % for blade-root out-of-plane and tower-base fore-aft moments, respectively.

17 WIND ENERGY↗
DOE OSTI2020

Multimodal Nanoscale Tomographic Imaging for Battery Electrodes

Accurate representations of the 3D structure within a lithium-ion battery are key to understanding performance limitations. However, obtaining exact reconstructions of electrodes, where the active particles, the carbon black and polymeric binder domain, and the pore space are visualized is challenging. In this work, it is shown that multimodal imaging can be used to overcome this challenge. High-resolution ptychographic X-ray computed tomography are combined with lower resolution but higher contrast transmission X-ray tomographic microscopy to obtain 3D reconstructions of pristine and cycled graphite-silicon composite electrodes. This cross-correlation enables quantitative analysis of the surface of active particles, including the heterogeneity of carbon-black and binder domain and solid-electrolyte interphase coverage. Capturing the active particles as well as the carbon black-binder domain allows using these segmented structures for electrochemical simulations to highlight the influence of the particle embedding on local state of charge heterogeneities.

25 ENERGY STORAGE↗
DOE OSTI2023

Second release of the CoRe database of binary neutron star merger waveforms

Abstract We present the second data release of gravitational waveforms from binary neutron star (BNS) merger simulations performed by the Computational Relativity ( CoRe ) collaboration. The current database consists of 254 different BNS configurations and a total of 590 individual numerical-relativity simulations using various grid resolutions. The released waveform data contain the strain and the Weyl curvature multipoles up to ℓ = m = 4 . They span a significant portion of the mass, mass-ratio, spin and eccentricity parameter space and include targeted configurations to the events GW170817 and GW190425. CoRe simulations are performed with 18 different equations of state, seven of which are finite temperature models, and three of which account for non-hadronic degrees of freedom. About half of the released data are computed with high-order hydrodynamics schemes for tens of orbits to merger; the other half is computed with advanced microphysics. We showcase a standard waveform error analysis and discuss the accuracy of the database in terms of faithfulness. We present ready-to-use fitting formulas for equation of state-insensitive relations at merger (e.g. merger frequency), luminosity peak, and post-merger spectrum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Multi-Objective Optimization of Uranium Target Assembly–3: A Comparison of Genetic and Traditional Methods

Commonly produced as a byproduct of uranium fission, 99 Mo is a key medical isotope that is in high demand in the United States. An international goal is to switch from medical isotope production technologies that require highly enriched uranium to medical isotope production technologies that require only low-enriched uranium. Niowave Inc. is contributing to this goal by developing an accelerator-driven subcritical assembly called the Uranium Target Assembly (UTA). This work compares the performance of Dakota’s Multi-Objective Genetic Algorithm (MOGA) against traditional sensitivity analysis in the neutronic optimization of the UTA-3 system. The design objectives are k-eigenvalue (k eff ) and natural uranium fission power, which are directly correlated with the amount of 99 Mo produced. Dakota:MOGA did not perform as well as human engineering ingenuity in optimization studies with high numbers of input parameters, such as fuel rod type selection and fuel rod placement. However, Dakota:MOGA did outperform traditional sensitivity analysis in optimization studies with fewer than 20 parameters and revealed the degree to which each parameter influences the optimal design space for k eff and natural uranium fission power (to a lesser extent). As the design model became more complex in the final stage of design, the computational resources required to calculate the design objective values in the Monte Carlo N-Particle transport code from selected input parameter combinations limited Dakota:MOGA’s performance, and, unfortunately, human intervention was required to discern the optimal design space. In conclusion, future work will attempt to reduce computational resource constraints by incorporating areduced-order neutronics model into the optimization cycle.

Accelerator-driven systems↗