Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical benchmark”

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
NASA NTRS2007

Evolutionary Optimization of a Geometrically Refined Truss

Structural optimization is a field of research that has experienced noteworthy growth for many years. Researchers in this area have developed optimization tools to successfully design and model structures, typically minimizing mass while maintaining certain deflection and stress constraints. Numerous optimization studies have been performed to minimize mass, deflection, and stress on a benchmark cantilever truss problem. Predominantly traditional optimization theory is applied to this problem. The cross-sectional area of each member is optimized to minimize the aforementioned objectives. This Technical Publication (TP) presents a structural optimization technique that has been previously applied to compliant mechanism design. This technique demonstrates a method that combines topology optimization, geometric refinement, finite element analysis, and two forms of evolutionary computation: genetic algorithms and differential evolution to successfully optimize a benchmark structural optimization problem. A nontraditional solution to the benchmark problem is presented in this TP, specifically a geometrically refined topological solution. The design process begins with an alternate control mesh formulation, multilevel geometric smoothing operation, and an elastostatic structural analysis. The design process is wrapped in an evolutionary computing optimization toolset.

Hull, P. V.↗
NASA NTRS2023

Radiative interaction of atmosphere and surface: write up with elements of code

In passive satellite remote sensing of the Earth, separation of the path radiance (atmosphere-only contribution) from the surface reflection remains a “significant challenge”. Recent literature names it among the gaps in radiative transfer (RT) topics that “require continued research in the near future”. The challenge comes from multiple reflections (bouncing) between the atmosphere and surface – radiative interaction. In this paper we use a known RT technique, the matrix-operator method (MOM), and a new modification of the monochromatic vector RT (vRT) code IPOL (Intensity and POLarization) to simulate the interaction of a plane-parallel atmosphere and a few widely used surface reflection models. Following the idea of the Green’s function method, IPOL no longer takes the surface model parameters on input. Instead, it provides the path radiance, and the atmospheric reflection and transmission matrices as output. Despite many RT codes use the MOM formalism, this output does not seem common. The surface reflection matrix is computed externally. Therefore, this paper extends the Green’s function atmospheric correction technique to the case of polarized light. Aiming clarity rather than performance, we explain in Python the structure of the surface matrices for the isotropic (Lambertian), directional unpolarized, and polarized ocean reflection models. We then combine these surface matrices and the precomputed IPOL output to get numerically accurate signal at the top of atmosphere (TOA) and test it vs. published benchmarks. Then, for each benchmark scenario we show how to get the surface from the TOA signal, i.e. perform the RT-based atmospheric correction.

radiative transfer↗
DOE OSTI2022

An Online Dynamic Amplitude-Correcting Gradient Estimation Technique to Align X-ray Focusing Optics

High-brightness X-ray pulses, as generated at synchrotrons and X-ray free electron lasers (XFELs), are used in a variety of scientific experiments. At these facilities, measurements often require optical equipment, e.g Compound Refractive Lenses (CRLs) to be precisely aligned and focused. The lateral alignment of CRLs to a beamline requires precise positioning along four axes: two translational, and the two rotational. At a synchrotron, alignment is often accomplished manually. However, XFEL beamlines present a beam brightness that fluctuates stochastically, making manual alignment a time-consuming endeavor. Automation using simplex or classic stochastic descent often fails, given the errant gradient estimates. Herein we present a dynamic-amplitude correction to the usual gradient based on the combination of a generalized finite difference stencil and a time-dependent sampling pattern. Intensity is recorded periodically, then used to normalize numerical derivatives against fluctuations. Error expectation is analyzed, and efficacy is demonstrated on classic benchmarks. We provide a proof of concept by laterally aligning optics on a simulated XFEL beamline using data recorded at both synchrotron and XFEL facilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast: Preprint

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗
DOE OSTI2018

The 2018 Edition of the IRPhEP Handbook

The International Reactor Physics Experiment Evaluation Project (IRPhEP) was established to preserve and evaluate integral reactor physics experiment data, including separate or special effects measurements for nuclear energy and technology applications. Numerous international experiments have been performed over the past several decades to support reactor operations, safety, measurements, and design. Those experiments represent a significant investment of infrastructure, cost, and expertise that, in many instances, cannot be as easily reproduced. They represent valuable resources of data for present and future research, and provide the basis for recording, development, and validation of methods. Contributors worldwide collaborate to evaluate and review selected benchmark experiments for inclusion in the International Handbook of Evaluated Reactor Physics Benchmark Experiments (IRPhEP Handbook). Several new evaluations, and revisions to existing benchmarks have been prepared for inclusion in the 2018 edition of the IRPhEP Handbook. Additionally, an IRPhEP Uncertainty Guide was discussed to provide further guidance regarding the evaluation of reactor physics measurements besides criticality. Recent changes to the IRPhEP Handbook include five minor revisions, the revision of a previous benchmark evaluation to include new data, publication of a new draft benchmark evaluation, final approval for the formal publication of two formerly draft benchmark evaluations, and the inclusion of ten new benchmark evaluations. The IRPhEP Handbook now contains a total of 159 experimental measurement series from 54 unique reactor facilities. International participants are actively engaged in ongoing evaluation activities to prepare content for future editions of the IRPhEP Handbook. There are numerous experiment and reactor facilities worldwide from which benchmark data can be evaluated. Those interested in serving as evaluators and/or reviewers for the IRPhEP are encouraged to participate.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2015

A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗
DOE OSTI2013

Verification of the three-dimensional tetrahedral grid S{sub N} code THOR

In this work current capabilities implemented in the novel, arbitrary-order, tetrahedral-grid short characteristics S{sub N} radiation transport code THOR are verified based on four benchmark problems: (1) A one-group Method of Manufactured Solution (MMS) problem on a cuboidal domain, (2) an infinite medium eigenvalue problem with up-scattering, (3) a homogeneous torus and (4) a bare cube eigenvalue problem with anisotropic scattering up to order three. The first benchmark problem exercises the various spatial discretization options available in THOR: The short characteristics method in conjunction with polynomial expansions of the source and face fluxes either using the complete or Lagrange family of arbitrary orders. Using the numerical solution's order of convergence test in the framework of a mesh refinement study, correct implementation of a selection of spatial expansion orders is demonstrated for two meshes with tetrahedral aspect ratios close to unity and 50. The second benchmark problem exercises the implementation of angular fluxes on reflective boundary faces that are implicit within a mesh sweep, and up-scattering. The third benchmark problem comprises cyclic dependencies within the mesh sweep thus exercising the algorithm devised for 'breaking' the cyclic dependencies. Finally, the fourth benchmark problem, a simple bare cube, is used to test correct implementation of the anisotropic scattering capability. For all test problems THOR obtains solutions that converge to the reference/exact solution with the expected rate thereby contributing to our confidence in the correctness of its tested features in the present implementation. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

DLIO: A DATA-CENTRIC BENCHMARK FOR DEEP LEARNING APPLICATIONS

SF-22-136 Deep learning has been shown as a successful method for various tasks, and its popularity results in numerous open-source deep learning software tools. Deep learning has been applied to a broad spectrum of scientific domains such as cosmology, particle physics, computer vision, fusion, and astrophysics. Scientists have performed a great deal of work to optimize the computational performance of deep learning frameworks. However, the same cannot be said for I/O performance. As deep learning algorithms rely on big-data volume and variety to effectively train neural networks accurately, I/O is a significant bottleneck on large-scale distributed deep learning training. DLIO, is a novel representative benchmark suite built based on the I/O profiling of the selected workloads. DLIO can be utilized to accurately emulate the I/O behavior of modern deep learning applications. Using DLIO, application developers and system software solution architects can identify potential I/O bottlenecks in their applications and guide optimizations to boost the I/O performance leading to lower training times. The storage vendor can also use DLIO as a guide for designing and optimize the storage and filesystem targeting at deep learning application.

ZHENG, HUIHUO↗
NASA NTRS2003

Spectral Characteristics of Wake Vortex Sound During Roll-Up

This report presents an analysis of the sound spectra generated by a trailing aircraft vortex during its rolling-up process. The study demonstrates that a rolling-up vortex could produce low frequency (less than 100 Hz) sound with very high intensity (60 dB above threshold of human hearing) at a distance of 200 ft from the vortex core. The spectrum then drops o rapidly thereafter. A rigorous analytical approach has been adopted in this report to derive the spectrum of vortex sound. First, the sound pressure was solved from an alternative treatment of the Lighthill s acoustic analogy approach [1]. After the application of Green s function for free space, a tensor analysis was applied to permit the removal of the source term singularity of the wave equation in the far field. Consequently, the sound pressure is expressed in terms of the retarded time that indicates the time history and spacial distribution of the sound source. The Fourier transformation is then applied to the sound pressure to compute its spectrum. As a result, the Fourier transformation greatly simplifies the expression of the vortex sound pressure involving the retarded time, so that the numerical computation is applicable with ease for axisymmetric line vortices during the rolling-up process. The vortex model assumes that the vortex circulation is proportional to the time and the core radius is a constant. In addition, the velocity profile is assumed to be self-similar along the aircraft flight path, so that a benchmark vortex velocity profile can be devised to obtain a closed form solution, which is then used to validate the numerical calculations for other more realistic vortex profiles for which no closed form solutions are available. The study suggests that acoustic sensors operating at low frequency band could be profitably deployed for detecting the vortex sound during the rolling-up process.

Booth, Earl R., Jr.↗
DOE OSTI2016

Neutronics/Thermal-hydraulics coupling with RMC and CTF for BEAVRS benchmark calculation

As the computational accuracy required for design and safety analysis of current and future nuclear reactors is continuously increasing, high fidelity numerical reactor simulations including different physics raise wide concern of researchers. The interplay between neutronic and thermal-hydraulic (N-TH) effects of a nuclear reactor core plays an important role in reactor design, safety analysis and core performance. Monte Carlo method can provide high fidelity neutronics analysis of different nuclear reactors, owing to its advantages of the flexible geometry modeling and the use of continuous-energy nuclear cross sections. Armed with the massively parallel algorithms, the computational cost of Monte Carlo codes can be greatly reduced. Compared to single channel thermal process, sub-channel codes have enormous advantages of detailed modeling of full-core reactor or single assembly and high accuracy of calculation results. Detailed sub-channel modeling of a full-core also needs running in parallel, otherwise the computational cost will be relatively high. In this paper, a new hybrid coupling with continuous-energy Monte Carlo code RMC and the sub-channel code CTF has been developed. The coupling codes are applied to steady-state simulations of BEAVRS benchmark in hot full power condition. In order to deal with the temperature dependence of cross sections for Monte Carlo code, the on-the-fly cross sections treatment has been developed in RMC. The on-the-fly method was applied to the N-TH coupling in this work. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1997

A Three-Dimensional Linearized Unsteady Euler Analysis for Turbomachinery Blade Rows

A three-dimensional, linearized, Euler analysis is being developed to provide an efficient unsteady aerodynamic analysis that can be used to predict the aeroelastic and aeroacoustic responses of axial-flow turbo-machinery blading.The field equations and boundary conditions needed to describe nonlinear and linearized inviscid unsteady flows through a blade row operating within a cylindrical annular duct are presented. A numerical model for linearized inviscid unsteady flows, which couples a near-field, implicit, wave-split, finite volume analysis to a far-field eigenanalysis, is also described. The linearized aerodynamic and numerical models have been implemented into a three-dimensional linearized unsteady flow code, called LINFLUX. This code has been applied to selected, benchmark, unsteady, subsonic flows to establish its accuracy and to demonstrate its current capabilities. The unsteady flows considered, have been chosen to allow convenient comparisons between the LINFLUX results and those of well-known, two-dimensional, unsteady flow codes. Detailed numerical results for a helical fan and a three-dimensional version of the 10th Standard Cascade indicate that important progress has been made towards the development of a reliable and useful, three-dimensional, prediction capability that can be used in aeroelastic and aeroacoustic design studies.

Montgomery, Matthew D.↗
DOE OSTI2015

A DEMO relevant fast wave current drive high harmonic antenna exploiting the high impedance technique

Ion Cyclotron (IC) antennas are routinely adopted in most of the existing nuclear fusion experiments, even though their main goal, i.e. to couple high power to the plasma (MW), is often limited by rather severe drawbacks due to high fields on the antenna itself and on the unmatched part of the feeding lines. In addition to the well exploited auxiliary ion heating during the start-up phase, some non-ohmic current drive (CD) at the IC range of frequencies may be explored in view of the DEMO reactor. In this work, we suggest and describe a compact high frequency DEMO relevant antenna, based on the high impedance surfaces concept. High-impedance surfaces are periodic metallic structures (patches) usually displaced on top of a dielectric substrate and grounded by means of vertical posts embedded inside the dielectric, in a mushroom-like shape. These structures present a high impedance, within a given frequency band, such that the image currents are in-phase with the currents of the antenna itself, thus determining a significant efficiency increase. After a general introduction on the properties of high impedance surfaces, we analyze, by means of numerical codes, a dielectric based and a full metal solution optimized to be tested and benchmarked on the FTU experiment fed with generators at 433MHz.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Simulated Stochastic Approximation Annealing for Global Optimization with a Square-Root Cooling Schedule

Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to have such a long CPU time. This paper proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation Markov chain Monte Carlo, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, e.g., a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors.

Liang, Faming↗
DOE OSTI2022

Spectral function for 4 He using the Chebyshev expansion in coupled-cluster theory

Here, we compute spectral function for 4 He by combining coupled-cluster theory with an expansion of integral transforms into Chebyshev polynomials. Our method allows us to estimate the uncertainty of spectral reconstruction. The properties of the Chebyshev polynomials make the procedure numerically stable and considerably lower in memory usage than the typically employed Lanczos algorithm. We benchmark our predictions with other calculations in the literature and with electron-scattering data in the quasi-elastic peak. The spectral function formalism allows one to extend ab initio lepton-nucleus cross sections into the relativistic regime. This makes it a promising tool for modeling this process at higher-energy transfers. The results we present open the door for studies of heavier nuclei, important for the neutrino oscillation programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Primordial black holes from bubble collisions during a first-order phase transition

We study the possibility of production of primordial black holes (PBHs) from bubble collisions during a first-order phase transition. While typical colliding bubbles are small and irrelevant for PBH production, we find that those that can produce PBHs must have a macroscopically thick fluid shell and have been born much before the typical nucleation time. Particularly large uncertainties arise from an exponential sensitivity of the nucleation rate on the required duration of bubble growth which depends on the details of the collisions and the evolution of the spacetime metric toward the end of the phase transition. We introduce a few parameters to be obtained from future numerical simulation to represent those unknowns, and estimate the PBH abundance in an Abelian Higgs benchmark model and show that it can be significant. We predict an approximately monochromatic PBH mass spectrum, and find regions in the parameter space where the PBHs can constitute entire dark matter or even overclose the Universe. Our result thus shows that models with a first-order phase transition can be constrained by overabundant PBHs or null results of other PBH searches. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Benchmark problems for the Me soscale M ultiphysics Ph ase F i eld S imulator (MEMPHIS)

This report details the current benchmark results to verify, validate and demonstrate the capabilities of the in-house multi-physics phase-field modeling framework Me soscale M ultiphysics Ph ase F i eld S imulator (MEMPHIS) developed at the Center for Integrated Nanotechnologies (CINT). MEMPHIS is a general phase-field capability to model various nanoscience and materials science phenomena related to microstructure evolution. MEMPHIS has been benchmarked against a suite of reported 'classical' phase-field benchmark problems to verify and validate the correctness, accuracy and precision of the models and numerical methods currently implemented into the code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗