SEARCH · Engineering Papers

Results for “numerical approximation & analysis”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Degradation of performance in ICF implosions due to Rayleigh–Taylor instabilities: A Hamiltonian perspective

The Rayleigh–Taylor instability (RTI) is an ubiquitous phenomenon that occurs in inertial-confinement-fusion (ICF) implosions and is recognized as an important limiting factor of ICF performance. To analytically understand the RTI dynamics and its impact on ICF capsule implosions, we develop a first-principle variational theory that describes an imploding spherical shell undergoing RTI. The model is based on a thin-shell approximation and includes the dynamical coupling between the imploding spherical shell and an adiabatically compressed fluid within its interior. Using a quasilinear analysis, we study the degradation trends of key ICF performance metrics (e.g., stagnation pressure, residual kinetic energy, and areal density) as functions of initial RTI parameters (e.g., the initial amplitude and Legendre mode), as well as the 1D implosion characteristics (e.g., the convergence ratio). We compare analytical results from the theory against nonlinear results obtained by numerically integrating the governing equations of this reduced model. Our findings emphasize the need to incorporate polar flows in the calculation of residual kinetic energy and demonstrate that higher convergence ratios in ICF implosions lead to significantly greater degradation of key performance metrics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Mixing bispectrum multipoles under geometric distortions

We derive general expressions for how the Alcock–Paczynski distortions affect the power spectrum and the bispectrum of cosmological fields. We compute explicit formulas for the mixing coefficients of bispectrum multipoles in the linear approximation. The leading-order effect for the bispectrum is the uniform dilation of all three wavevectors. The mixing coefficients depend on the shape of the bispectrum triplet. Our results for the bispectrum multipoles are framed in terms of the ‘natural’ basis of the lengths of three wavevectors but can be easily generalized for other bases and reduction schemes. Our validation tests confirm that the linear approximation is extremely accurate for all power spectrum multipoles. The linear approximation is accurate for the bispectrum monopole but results in sub-per cent level inaccuracies for the bispectrum quadrupole and fails for the bispectrum hexadecapole. Our results can be used to simplify the analysis of the bispectrum from galaxy surveys, especially the measurement of the baryon acoustic oscillation peak position. They can be used to replace numeric schemes with exact analytical formulae.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

Sensitivity Analysis and Effective Parametrization of PEM Fuel Cell Models

The cost of proton-exchange-membrane fuel cells (PEMFCs) remains a major hurdle in large-scale commercialization of this technology. To improve their performance and reduce cost, novel materials and electrode designs are continuously envisioned, e.g., non-PGM catalyst layers, ultra-thin Pt/Pt-Ni based catalyst layers, structured ionomer arrays or NSTF catalyst layers.1 Understanding the impact of these improvement strategies can be extremely time and cost intensive due to complex physical phenomena and large design space. We have previously developed a PEMFC modeling framework2 which has been a time and cost effective tool for understanding and optimizing the complex multi-physics phenomena within PEMFCs; however, several of the cell parameters used in the modeling have large spread in measured data.3 Furthermore, several transport parameters such as water adsorption kinetics have not been accurately measured and the approximations are spread over several orders of magnitude. These uncertainties cause problems in ascertaining accuracy of the modeling approach and they reduce the predictive power of the numerical models. The aim of this work is to identify the sensitivity of PEFC numerical model outputs to various input parameters. The previously in-house developed MEA modeling framework2 is used for PEMFC modeling. The sensitivity of the model outputs with respect to inputs parameters is obtained by analyzing the condition numbers for different output-input pairs at varying operating conditions. An example of the sensitivity analysis is shown in Figure 1. The condition numbers are obtained for the entire possible range of input parameters at varying operating conditions to identify the most crucial parameters of the PEMFC model. Based on our preliminary analysis, parameters related to kinetics (exchange current density and ECSA) and heat/water management in electrodes and ionomer (ionomer fraction, thermal conductivity) are most crucial. One of the major goals of this work is to identify the most crucial set of parameters towards which the model shows maximum sensitivity. This will guide future experimentalists to measure these properties with higher accuracy. Furthermore, the sensitivity analysis will also enable us to optimize the PEMFC performance by selectively targeting the most sensitive parameters and thereby making the largest impact. Acknowledgements The work is funded under the Fuel Cell Performance and Durability Consortium (FC-PAD), by the Fuel Cell Technologies Office (FCTO), Office of Energy Efficiency and Renewable Energy (EERE), of the U.S. Department of Energy under contract number DE-AC02-05CH11231. The authors would like to thank Nathan Craig at Robert Bosch LLC for his valuable input in designing the sensitivity analysis. The authors would also like to thank Giovanna Bucci and Matthias Hanauer at Robert Bosch for their valuable inputs and discussion. References P. K. Sinha, W. Gu, A. Kongkanand and E. Thompson, J. Electrochem. Soc., 158, B831 (2011). L. M. Pant, M. R. Gerhardt, N. Macauley, R. Mukundan, R. L. Borup and A. Z. Weber, Electrochim. Acta, 326, 134963 (2019). R. Vetter and J. O. Schumacher, ArXiv181110091 Phys. (2018). Figure 1

Pant, Lalit↗

DOE OSTI2024

Random insights into the complexity of two-dimensional tensor network calculations

Projected entangled pair states (PEPS) offer memory-efficient representations of some quantum many-body states that obey an entanglement area law and are the basis for classical simulations of ground states in two-dimensional (2d) condensed matter systems. However, rigorous results show that exactly computing observables from a 2d PEPS state is generically a computationally hard problem. Yet approximation schemes for computing properties of 2d PEPS are regularly used, and empirically seen to succeed, for a large subclass of (“not too entangled”) condensed matter ground states. Adopting the philosophy of random matrix theory, in this work, we analyze the complexity of approximately contracting a 2d random PEPS by exploiting an analytic mapping to an effective replicated statistical mechanics model that permits a controlled analysis at a large bond dimension. Through this statistical-mechanics lens, we argue that (i) although approximately sampling wave-function amplitudes of random PEPS faces a computational-complexity phase transition above a critical bond dimension, and (ii) one can generically efficiently estimate the norm and correlation functions for any finite bond dimension. Furthermore, these results are supported numerically for various bond-dimension regimes. It is an important open question whether the above results for random PEPS apply more generally also to PEPS representing physically relevant ground states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗

DOE OSTI2020

Uncertainty quantification of an empirical shell-model interaction using principal component analysis

Recent investigations have emphasized the importance of uncertainty quantification (UQ) in nuclear theory. Here, we carry out UQ for configuration-interaction shell-model calculations in the 1$\textit{s}$–0$\textit{d}$ valence space, investigating the sensitivity of observables to perturbations in the 66 parameters (matrix elements) of a high-quality empirical interaction. The large parameter space makes computing the corresponding Hessian numerically costly, so we compare a cost-effective approximation, using the Feynman-Hellmann theorem, to the full Hessian and find it works well. Diagonalizing the Hessian yields the principal components of the interaction: linear combinations of parameters ordered by sensitivity. This approximately decoupled distribution of parameters facilitates theoretical uncertainty propagation onto structure observables: electromagnetic transitions, Gamow-Teller decays, and dark matter-nucleus scattering matrix elements.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Error Bounds for Dynamical Spectral Estimation

Dynamical spectral estimation is a well-established numerical approach for estimating eigenvalues and eigenfunctions of the Markov transition operator from trajectory data. Although the approach has been widely applied in biomolecular simulations, its error properties remain poorly understood. Here we analyze the error of a dynamical spectral estimation method called “the variational approach to conformational dynamics" (VAC). We bound the approximation error and estimation error for VAC estimates. Our analysis establishes VAC's convergence properties and suggests new strategies for tuning VAC to improve accuracy.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A Comprehensive Analysis of Real-World Accelerometer Data Quality in a Global Smartphone-based Seismic Network

The proliferation of low-cost sensors in smartphones has facilitated numerous applications; however, large-scale deployments often encounter performance issues. Sensing heterogeneity, which refers to varying data quality due to factors such as device differences and user behaviors, presents a significant challenge. In this research, we perform an extensive analysis of 3-axis accelerometer data from the MyShake system, a global seismic network utilizing smartphones. We systematically evaluate the quality of approximately 22 million 3-axis acceleration waveforms from over 81 thousand smartphone devices worldwide, using metrics that represent sampling rate and noise level. We explore a broad range of factors influencing accelerometer data quality, including smartphone and accelerometer manufacturers, phone specifications (release year, RAM, battery), geolocation, and time. Our findings indicate that multiple factors affect data quality, with accelerometer model and smartphone specifications being the most critical. In addition, we examine the influence of data quality on earthquake parameter estimation and show that removing low-quality accelerometer data enhances the accuracy of earthquake magnitude estimation.

58 GEOSCIENCES↗

DOE OSTI2021

An efficient numerical model for predicting residual stress and strain in parts manufactured by laser powder bed fusion

Abstract Computational modeling of additively manufactured structures plays an increasingly important role in product design and optimization. For laser powder bed fusion processes, the accurate modeling of stress and distortion requires large amount of computational cost due to very localized heat input and evolving complex geometries. The current study takes advantage of a graphics processing unit accelerated explicit finite element analysis code and approximated heat conduction analysis to predict the macroscopic thermo-mechanical behavior in laser selective melting. Adjacent layers and tracks were lumped to reduce the number of time steps and elements in the finite element model. The effects of track and layer grouping on prediction accuracy and solution efficiency are investigated to provide a guidance for a cost-effective simulation. Thin-wall builds from Inconel alloy 625 (IN625) powders were simulated by applying the developed modeling approach to get the detailed residual stress and distortion at a computational speed 50 times higher than conventional approach. Under repeated heating and cooling cycles, a high tensile stress was produced near surfaces of a build due to a larger shrinkage on surface than that in central area. It is also shown that horizontal stresses concentrate near the root and top layers of the IN625 build. The predicted residual elastic strain distribution was validated by the experimental measurement using x-ray synchrotron diffraction.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Code Coverage Status of the ARC Code RCT

The Argonne Reactor Code (ARC) software system supports users in their fast reactor design goals by providing neutronic, thermal-hydraulic, and structural analysis capabilities. REBUS plays a pivotal role in the ARC system as the primary fuel cycle analysis capability for fast reactor problems. Over its 60 year history, ARC software usage with REBUS has been applied to numerous fast and thermal spectrum reactor analysis projects with good to excellent comparison against experiments. The RCT code is a later addition and uses the REBUS restart files to define its input. The RCT code was built to provide pin depletion details on EBR-II models and thus many features of RCT were specifically tailored to the needs of EBR-II models. Additional approximations were invoked which are likely only valid for the EBR-II reactor and the particular fuel management that was done for it. The purpose of the present work is to identify a set of test problems for RCT and assess the code coverage for those test problems. The goal is to document what parts of the existing RCT code are touched by the set of test problems and which are not. Because no detailed verification work has been done on RCT, the existing regression testing suite was chosen for the code coverage assessment. The code coverage analysis of RCT was performed with the Code Coverage Tool of the Intel Fortran compiler which requires modifications to the compilation of RCT. The detailed coverage tables are given for each part of RCT. As will be discussed and shown, some parts of the RCT capability that are known to be used by the EBR-II analysis work are not tested by the regression testing suite. These aspects should be resolved before major source code changes are taken for the RCT software. Because REBUS and DIF3D are not subroutines of RCT, the coverage changes in both of those codes is not altered by RCT. The same is true for all of the modules of DIF3D that are used by RCT such as SYSLIB and SEGLIB.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

DOE OSTI2020

IGA-MPM: The Isogeometric Material Point Method

In this work, we propose the use of Isogeometric Analysis (IGA) within the context of the Material Point Method (MPM), and refer to the approach as IGA-MPM. We use the idea of IGA, and its instantiation based on Non-Uniform Rational B-Splines (NURBS), to build higher-order accurate and smooth approximation for MPM. Higher-order smoothness yields a continuous representation of the strain rate, and, as a result, prevents jumps in the stress and other history variables as the material points cross the element boundaries. Furthermore, NURBS can exactly represent all conic sections and the corresponding symmetries in the solution, which may be important in some applications. Several numerical examples of increasing complexity are presented, and show the ability of IGA-MPM to eliminate the well known cell-crossing instability of the conventional MPM. In addition, the examples presented demonstrate improved accuracy, convergence, and symmetry preservation of IGA-MPM compared to the conventional MPM, both for rectilinear and curved geometries.

42 ENGINEERING↗

DOE OSTI2023

NOW-23: The 2023 National Offshore Wind Data Set

17 WIND ENERGY↗

DOE OSTI2023

NOW-23: the 2023 National Offshore Wind Data Set

In this report, we present the latest wind resource data specifically tailored for offshore regions in the United States. The data set, known as the 2023 National Offshore Wind data set (NOW-23), has been developed by the National Renewable Energy Laboratory (NREL) and its partners, and surpasses the previous resource data set, the Wind Integration National Dataset (WIND) Toolkit, which was released approximately ten years ago, in its offshore component. The WIND Toolkit has been widely utilized by stakeholders involved in wind resource assessments across the continental United States. However, with significant advancements in numerical weather prediction modeling over the past decade, the NOW-23 data set incorporates the latest research and development progress to provide stakeholders with an updated and cutting-edge resource for offshore wind analysis. The NOW-23 data set is created using the Weather Research and Forecasting (WRF) model and its output is available, as for its predecessor, at 5-minute time resolution and 2-kilometer horizontal spatial resolution. However, the NOW-23 data set improves upon the WIND Toolkit through: 1. A modeling period of at least 20 years (and as long as 23 years in selected regions), starting in 2000 (compared to the 7-year 2007–2013 modeling period in the WIND Toolkit). 2. For several offshore regions, a region-specific sensitivity analysis, driven by an ensemble of WRF simulations, to assess the most adequate region-specific WRF setup. 3. An updated WRF model, from Version 3.4 used in the WIND Toolkit to Version 4.2.1 used for the NOW-23 data set, which incorporates significant research advancements. 4. The use of the state-of-the-art reanalysis product ERA5 (which supersedes the older ERA-Interim used in the WIND Toolkit) to provide atmospheric forcing at the WRF domain boundaries. Figure 1 shows the NOW-23 mean wind speed at 160 m above sea level (asl), which we use as proxy for hub-height of a commercial offshore wind turbine in this report across all regions.

17 WIND ENERGY↗

DOE OSTI2023

Multipoint Turbulence Analysis with HelioSwarm

Exploration of plasma dynamics in space, including turbulence, is entering a new era of multisatellite constellation measurements that will determine fundamental properties with unprecedented precision. Familiar but imprecise approximations will need to be abandoned and replaced with more-advanced approaches. We present a preparatory study of the evaluation of second- and third-order statistics, using simultaneous measurements at many points. Here, for specificity, the orbital configuration of the NASA Swarm mission is employed in conjunction with 3D magnetohydrodynamics numerical simulations of turbulence. The HelioSwarm nine-spacecraft constellation flies virtually through the turbulence to compare results with the exact numerical statistics. We demonstrate novel increment-based techniques for the computation of (1) the multidimensional spectra and (2) the turbulent energy flux. This latter increment-space estimate of the cascade rate, based on the third-order Yaglom–Politano–Pouquet theory, uses numerous increment-space tetrahedra. Our investigation reveals that HelioSwarm will provide crucial information on the nature of astrophysical turbulence.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations

In this work, we present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the butterfly algorithm and its hierarchical matrix extension for compressing and factorizing large frontal matrices via graph-distance guided entry evaluation or randomized matrix-vector multiplication-based schemes. Complexity analysis and numerical experiments demonstrate $\mathcal{O}(N\log^2 N)$ computation and $\mathcal{O}(N)$ memory complexity when applied to an $N\times N$ sparse system arising from 3D high-frequency Helmholtz and Maxwell problems.

97 MATHEMATICS AND COMPUTING↗