Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

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 1,765 records · Page 98

Virtual-Voltage Partition-Based Approach to Optimal Transmission Switching

This article deals with optimal transmission switching (OTS) problems involving binary decisions about network topology and nonconvex power flow constraints. We adopt a semidefinite programming formulation for the optimal power flow (OPF) problem that, however, remains nonconvex due to the presence of discrete variables and bilinear products between the decision variables. To tackle the latter, we introduce a physically inspired, virtual-voltage approximation that leads to provable lower and upper bounds on the solution of the original problem. To deal with the exponential complexity caused by the discrete variables, we introduce a graph partition-based algorithm that breaks the problem into several parallel mixed-integer subproblems of smaller size. Simulations on the IEEE bus test cases demonstrate the high degree of accuracy and affordable computational requirements of our approach.

42 ENGINEERING↗

Machine Learning for Turbulence Model Development Using a High-Fidelity HPT Cascade Simulation

The validity of the Boussinesq approximation in the wake behind a high-pressure turbine blade is explored. We probe the mathematical assumptions of such a relationship by employing a least-squares technique. Next, we use an evolutionary algorithm to modify the anisotropy tensor a priori using highly resolved LES data. In the latter case we build a non-linear stress-strain relationship. Results show that the standard eddy-viscosity assumption underpredicts turbulent diffusion and is theoretically invalid. By increasing the coefficient of the linear term, the farwake prediction shows minor improvement. By using additional non-linear terms in the stress-strain coupling relationship, created by the evolutionary algorithm, the near-wake can also be improved upon. Terms created by the algorithm are scrutinized and the discussion is closed by suggesting a tentative non-linear expression for the Reynolds stress, suitable for the wake behind a high-pressure turbine blade.

Weatheritt, Jack↗

Large-Scale Optimization for Bayesian Inference in Complex Systems (Final Report)

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focuses on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. Our research is directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. Our efforts are integrated in the context of a challenging testbed problem that considers subsurface reacting flow and transport. The MIT component of the SAGUARO Project addresses the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas-Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to- observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗

Advanced Imaging Algorithms for Radiation Imaging Systems

Radiation-imaging devices are important to the nuclear security and safeguards communities due to their ability to detect and localize radioactive sources. Because of their low natural background, difficulty to shield, and unique association with SNM, fast-neutron imaging provides a promising means for the detection of SNM. To make these R&D systems useful for end-user applications, robust reconstruction and analysis algorithms must be developed that provide detailed information on the location, energy spectrum, and intervening material. To date, deconvolution, match filtering, and MLEM have been demonstrated. However, the information provided is limited to an approximate location of the source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

MCNPs Easy Sources for (α,n) (MESA):Verification with Sources4c

MESA is intended to be a direct re-implementation of the algorithms documented in the Sources manual in C++. However, some fundamental changes to the computational structure and logic were made to avoid the use of goto, require consistency in input definition, and reduce computational approximations in later steps of three-layer problems. In addition, MESA uses α-decay information from ISC libraries (based on ENDF). In most cases, differences between Sources4c and MESA are dominated by differences in decay energy spectra and intensities. To verify this we have reproduced 6 problems that are documented examples or samples in Sources4c. These problems cover the three types of problems MESA currently supports: homogeneous, interface, and three-layer.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗

Determination of nuclear PDFs using Markov chain Monte Carlo methods

Global QCD analyses of nuclear parton distribution functions (nPDFs) have traditionally relied on the Hessian method for uncertainty estimation. However, the inherent Gaussian approximation and reliance on local curvature often prove insufficient for nPDF fits, which are frequently characterized by limited data constraints and non-Gaussian likelihoods. In this paper, we present the first nPDF determination based on Markov Chain Monte Carlo (MCMC) techniques, implemented within the nCTEQ framework using an adaptive Metropolis-Hastings algorithm. The MCMC approach enables a direct mapping of the posterior distribution and reveals a highly nontrivial parameter-space structure, including multiple modes and pronounced non-Gaussian behavior, particularly for the valence PDFs. We perform the first single-nucleus global analysis of lead PDFs using exclusively lead data and compare it to a multi-nuclei fit employing a standard analytic A dependence. The inclusion of lighter nuclei reduces quark uncertainties and modifies the shape of the lead PDFs, while leaving the gluon distribution largely unaffected. A complementary Hessian analysis exposes systematic limitations of the Gaussian approximation. Our results demonstrate that MCMC methods provide a more reliable framework for uncertainty quantification in nPDF determinations.

Derakhshanian, N. [Institute of Nuclear Physics Po↗

Elastic and resonance structures of the nucleon from the hadronic tensor in lattice QCD: Implications for neutrino-nucleon scattering and hadron physics

We compute the Euclidean hadronic tensor from charge density operators and extract elastic and resonance structures by employing exponential fits to the four-point function correlator, as well as a Bayesian reconstruction inverse algorithm to obtain the corresponding spectral density for qualitative comparison. We present the determination of the nucleon’s Sachs electric form factor using the hadronic tensor formalism and verify that it is consistent with that from the conventional three-point function calculation. Beyond the elastic peak, we observe a structure located approximately 0.5–0.7 GeV above the nucleon mass in the Bayesian reconstruction. This structure is interpreted as a mixture of the Roper resonance [𝑁⁡(1440)], and states with both positive and negative parities in this mass region, as well as multihadron states. Assuming the observed structure is dominated by 𝐽 𝑃 = 1/2 ± states, we extract the transition electric form factor 𝐺$^*_𝐸$⁡(𝑄 2 ) and the corresponding longitudinal helicity amplitude 𝑆 1/2 ⁡(𝑄 2 ), and compare them with those determined from the CLAS experimental data of nucleon-to-Roper transition. Although fitting to the four-point correlation function or using the inverse algorithm does not resolve individual resonances, it nevertheless enables the determination of total inclusive lepton–nucleon scattering cross sections in appropriate energy bins. This lattice QCD calculation presents the first major step toward studying the inclusive 𝑁 → 𝑋 contributions within the hadronic tensor formalism.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast String Search on Multicore Processors: Mapping fundamental algorithms onto parallel hardware

String searching is one of these basic algorithms. It has a host of applications, including search engines, network intrusion detection, virus scanners, spam filters, and DNA analysis, among others. The Cell processor, with its multiple cores, promises to speed-up string searching a lot. In this article, we show how we mapped string searching efficiently on the Cell. We present two implementations: • The fast implementation supports a small dictionary size (approximately 100 patterns) and provides a throughput of 40 Gbps, which is 100 times faster than reference implementations on x86 architectures. • The heavy-duty implementation is slower (3.3-4.3 Gbps), but supports dictionaries with tens of thousands of strings.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Modified thermal-optical analysis using spectral absorption selectivity to distinguish black carbon from pyrolized organic carbon

Black carbon (BC), a main component of combustion-generated soot, is a strong absorber of sunlight and contributes to climate change. Measurement methods for BC are uncertain, however. This study presents a method for analyzing the BC mass loading on a quartz fiber filter using a modified thermal-optical analysis method, wherein light transmitted through the sample is measured over a spectral region instead of at a single wavelength as the sample is heated. Evolution of the spectral light transmission signal depends on the relative amounts of light-absorbing BC and char, the latter of which forms when organic carbon in the sample pyrolyzes during heating. Absorption selectivities of BC and char are found to be distinct and are used to apportion the amount of light attenuated by each component in the sample. Light attenuation is converted to mass concentration based on derived mass attenuation efficiencies (MAE) of BC and char. The fraction of attenuation due to each component are scaled by their individual MAE values and added together as the total mass of light absorbing carbon (LAC). An iterative algorithm is used to find the MAE values for both BC and char that provide the best fit to the carbon mass remaining on the filter (derived from direct measurements of thermally evolved CO{sub 2}) at temperatures higher than 480 C. This method was applied to measure the BC concentration in precipitation samples collected from coastal and mountain sites in Northern California. The uncertainty in measured BC concentration of samples that contained a high concentration of organics susceptible to char ranged from 12 to 100 percent, depending on the mass loading of BC on the filter. The lower detection limit for this method was approximately 0.35 {micro}g BC and uncertainty approached 20 percent for BC mass loading greater than 1.0 {micro}g BC.

54 ENVIRONMENTAL SCIENCES↗

Deconvoluting experimental decay energy spectra: The O 26 case

In nuclear reaction experiments, the measured decay energy spectra can give insights into the shell structure of decaying systems. However, extracting the underlying physics from the measurements is challenging due to detector resolution and acceptance effects. The Richardson-Lucy (RL) algorithm, a deblurring method that is commonly used in optics and has proven to be a successful technique for restoring images, was applied to our experimental nuclear physics data. The only inputs to the method are the observed energy spectrum and the detector's response matrix also known as the transfer matrix. We demonstrate that the technique can help access information about the shell structure of particle-unbound systems from the measured decay energy spectrum that is not immediately accessible via traditional approaches such as χ-square fitting. For a similar purpose, we developed a machine learning model that uses a deep neural network (DNN) classifier to identify resonance states from the measured decay energy spectrum. We tested the performance of both methods on simulated data and experimental measurements. Then, we applied both algorithms to the decay energy spectrum of 26 O → 24 O + n + n measured via invariant mass spectroscopy. Here, the resonance states restored using the RL algorithm to deblur the measured decay energy spectrum agree with those found by the DNN classifier. Both deblurring and DNN approaches suggest that the raw decay energy spectrum of 26 O exhibits three peaks at approximately 0.15 MeV, 1.50 MeV, and 5.00 MeV, with half-widths of 0.29 MeV, 0.80 MeV, and 1.85 MeV, respectively.

Spectrometers & spectroscopic techniques↗

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↗

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗

Time dependent supervisory control update with FARM using rolling window

This report describes improvements to the Feasible Actuator Range Modifier (FARM) component of the RAVEN-based HYBRID framework for analysis of Integrated Energy Systems (IES). FARM supports the HERON plug-in that solves the power dispatch problem. The solution to the dispatch problem involves economically optimal dispatches that satisfy limits on production variables and their rates of variation (explicit constraints) as well as process variables tied to the service life of equipment (implicit constraints). FARM serves to validate or confirm that a HERON solution for explicit constraints also satisfies the implicit constraints. FARM-alpha was released by Argonne National Laboratory in January 2021 followed by FARM-Beta in January 2022 with the latter providing increased flexibility for the user. In this report, FARM-Gamma, the latest version of the code, is described. The major improvement is the implementation of a system identification algorithm based on the Dynamic Mode Decomposition with Control (DMDc) coupled with a “Rolling Window” scheme that allows obtaining linear time-varying state-space models. This feature equips FARM with the most accurate approximation of system dynamics, and it relieves the user from the burden of performing an exhaustive off-line characterization of the dynamics. FARM-Gamma capabilities are assessed by solving the power dispatch problem for a representative IES unit. The simulation times corresponding to the different releases are estimated and compared. These values capture the increasing computational burden of the successively higher fidelity state-space models adopted by FARM-Alpha, FARM-Beta and FARM-Gamma. The code implementation provides significant flexibility, i.e., the user can always select the most suitable version of FARM according to the problem to be solved and the available computational resources. It is anticipated that FARM will play a role in addressing several future IES applications. We outline how it can support the coordinated management and safe operation of a nuclear plant coupled to industrial processes to produce hydrogen and synfuels.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

TEAMER - Acoustic Particle Velocity Measurements - CRADA 601 (Abstract)

With relatively few deployments of tidal turbines, the extent and effect of underwater sounds generated from these turbines is not well understood. The University of Washington (UW) is deploying a cross-flow turbine system, the Turbine Lander, in the entrance channel to Sequim Bay. The deployment of this system provides an opportunity to understand the noise radiated by the turbine and its sources. There are three hypothesized sound sources associated with operation of the turbine: 1) a continuous tone associated with energized power electronics; 2) sound associated with the generator when the turbine is rotating; and 3) sound associated with the bearing pack that supports the rotor. PNNL is collaborating with UW and Integral Consulting Inc. (Integral) to simultaneously measure sound sources using three different devices. The NoiseSpotter®, an acoustic sensor system designed by Integral, measures acoustic pressure and a three-dimensional particle velocity vector. The NoiseSpotter, along with a commercial-off-the-shelf acoustic particle motion and pressure sensor (M20-105, Geospectrum Technologies Inc.) owned by PNNL will be deployed on the seabed approximately 50-100 m from the Turbine Lander. UW will concurrently deploy Drifting Acoustic Instrumentation SYstems (DAISYs) to characterize acoustic pressure near the Turbine Lander and localize sounds using a Time Delay of Arrival (TDOA) algorithm. Integral, UW, and PNNL will collaborate on data analysis and interpretation, with the intention of jointly authoring an archival paper on the results. The noise generated from the Turbine Lander is not expected to be significant, yet this experiment will help to evaluate the efficacy of combining technologies to characterize noise and provide insights for approaches to consider for future turbine deployments at other locations.

16 TIDAL AND WAVE POWER↗

Representing Small Commercial Building Faults in EnergyPlus, Part I: Model Development

Small commercial buildings (those with less than approximately 1000 m2 of total floor area) often do not have access to cost-effective automated fault detection and diagnosis (AFDD) tools for maintaining efficient building operations. AFDD tools based on machine-learning algorithms hold promise for lowering cost barriers for AFDD in small commercial buildings; however, such algorithms require access to high-quality training data that is often difficult to obtain. To fill the gap in this research area, this study covers the development (Part I) and validation (Part II) of fault models that can be used with the building energy modeling software EnergyPlus® and OpenStudio® to generate a cost-effective training data set for developing AFDD algorithms. Part I (this paper) presents a library of fault models, including detailed descriptions of each fault model structure and their implementation with EnergyPlus. This paper also discusses a case study of training data set generation, representing an actual building.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗