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,603 records · Page 89

SPITZER OBSERVATIONS OF THE HH 1/2 SYSTEM: THE DISCOVERY OF THE COUNTERJET

We present unpublished Spitzer IRAC observations of the HH 1/2 young stellar outflow processed with a high angular resolution deconvolution algorithm that produces subarcsecond ({approx}0.''6-0.''8) images. In the resulting mid-infrared images, the optically invisible counterjet is detected for the first time. The counterjet is approximately half as bright as the jet at 4.5 {mu}m (the IRAC band that best traces young stellar outflows) and has a length of {approx}10''. The NW optical jet itself can be followed back in the mid-IR to the position of the exciting VLA 1 source. An analysis of the IRAC colors indicates that the jet/counterjet emission is dominated by collisionally excited H{sub 2} pure rotational lines arising from a medium with a neutral hydrogen gas density of {approx}1000-2000 cm{sup -3} and a temperature of {approx} 1500 K. The observed jet/counterjet brightness asymmetry is consistent with an intrinsically symmetric outflow with extinction from a dense, circumstellar structure of {approx}6'' size (along the outflow axis), and with a mean visual extinction, A{sub V} {approx} 11 mag.

79 ASTRONOMY AND ASTROPHYSICS↗

Non-adiabatic molecular dynamics by accelerated semiclassical Monte Carlo

Non-adiabatic dynamics, where systems non-radiatively transition between electronic states, plays a crucial role in many photo-physical processes, such as fluorescence, phosphorescence, and photoisomerization. Methods for the simulation of non-adiabatic dynamics are typically either numerically impractical, highly complex, or based on approximations which can result in failure for even simple systems. Recently, the Semiclassical Monte Carlo (SCMC) approach was developed in an attempt to combine the accuracy of rigorous semiclassical methods with the efficiency and simplicity of widely used surface hopping methods. However, while SCMC was found to be more efficient than other semiclassical methods, it is not yet as efficient as is needed to be used for large molecular systems. Here, we have developed two new methods: the accelerated-SCMC and the accelerated-SCMC with re-Gaussianization, which reduce the cost of the SCMC algorithm up to two orders of magnitude for certain systems. In most cases shown here, the new procedures are nearly as efficient as the commonly used surface hopping schemes, with little to no loss of accuracy. This implies that these modified SCMC algorithms will be of practical numerical solutions for simulating non-adiabatic dynamics in realistic molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Properties of coupled-cluster equations originating in excitation sub-algebras

In this paper we discuss properties of single-reference coupled cluster (CC) equations associated with the existence of nilpotent sub-algebras of excitations that allow one to represent CC equations in a hybrid fashion where the cluster amplitudes associated with these sub-algebras can be obtained by solving corresponding eigenvalue problem. For closed-shell formulations analyzed in this paper, the hybrid representation of CC equations provides a natural way for extending concepts behind actives-spaces and seniority numbers to provide more accurate description of electron correlation effects. Moreover, new representation can be utilized to re-define iterative algorithms used to solve CC equations, especially for though cases defined by the presence of strong static and dynamic correlation effects. We will also explore invariance properties associated with the nilpotent sub-algebras to define a new class of CC approximations referred in this paper to as the nilpotent-flow-based CC methods. We illustrate the performance of these methods on the example of ground- and excited-state calculations for commonly used small benchmark systems.

Kowalski, Karol↗

TH-AB-207A-05: A Fully-Automated Pipeline for Generating CT Images Across a Range of Doses and Reconstruction Methods

Purpose: To evaluate the robustness of CAD or Quantitative Imaging methods, they should be tested on a variety of cases and under a variety of image acquisition and reconstruction conditions that represent the heterogeneity encountered in clinical practice. The purpose of this work was to develop a fully-automated pipeline for generating CT images that represent a wide range of dose and reconstruction conditions. Methods: The pipeline consists of three main modules: reduced-dose simulation, image reconstruction, and quantitative analysis. The first two modules of the pipeline can be operated in a completely automated fashion, using configuration files and running the modules in a batch queue. The input to the pipeline is raw projection CT data; this data is used to simulate different levels of dose reduction using a previously-published algorithm. Filtered-backprojection reconstructions are then performed using FreeCT-wFBP, a freely-available reconstruction software for helical CT. We also added support for an in-house, model-based iterative reconstruction algorithm using iterative coordinate-descent optimization, which may be run in tandem with the more conventional recon methods. The reduced-dose simulations and image reconstructions are controlled automatically by a single script, and they can be run in parallel on our research cluster. The pipeline was tested on phantom and lung screening datasets from a clinical scanner (Definition AS, Siemens Healthcare). Results: The images generated from our test datasets appeared to represent a realistic range of acquisition and reconstruction conditions that we would expect to find clinically. The time to generate images was approximately 30 minutes per dose/reconstruction combination on a hybrid CPU/GPU architecture. Conclusion: The automated research pipeline promises to be a useful tool for either training or evaluating performance of quantitative imaging software such as classifiers and CAD algorithms across the range of acquisition and reconstruction parameters present in the clinical environment. Funding support: NIH U01 CA181156; Disclosures (McNitt-Gray): Institutional research agreement, Siemens Healthcare; Past recipient, research grant support, Siemens Healthcare; Consultant, Toshiba America Medical Systems; Consultant, Samsung Electronics.

60 APPLIED LIFE SCIENCES↗

Design and global optimization of high-efficiency thermophotovoltaic systems

Despite their great promise, small experimental thermophotovoltaic (TPV) systems at 1000 K generally exhibit extremely low power conversion efficiencies (approximately 1%), due to heat losses such as thermal emission of undesirable mid-wavelength infrared radiation. Photonic crystals (PhC) have the potential to strongly suppress such losses. However, PhC-based designs present a set of non-convex optimization problems requiring efficient objective function evaluation and global optimization algorithms. Both are applied to two example systems: improved micro-TPV generators and solar thermal TPV systems. Micro-TPV reactors experience up to a 27-fold increase in their efficiency and power output; solar thermal TPV systems see an even greater 45-fold increase in their efficiency (exceeding the Shockley–Quiesser limit for a single-junction photovoltaic cell).

14 SOLAR ENERGY↗

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗

Automatic Prostate Tracking and Motion Assessment in Volumetric Modulated Arc Therapy With an Electronic Portal Imaging Device

Purpose: To assess the prostate intrafraction motion in volumetric modulated arc therapy treatments using cine megavoltage (MV) images acquired with an electronic portal imaging device (EPID). Methods and Materials: Ten prostate cancer patients were treated with volumetric modulated arc therapy using a Varian TrueBeam linear accelerator equipped with an EPID for acquiring cine MV images during treatment. Cine MV images acquisition was scheduled for single or multiple treatment fractions (between 1 and 8). A novel automatic fiducial detection algorithm that can handle irregular multileaf collimator apertures, field edges, fast leaf and gantry movement, and MV image noise and artifacts in patient anatomy was used. All sets of images (approximately 25,000 images in total) were analyzed to measure the positioning accuracy of implanted fiducial markers and assess the prostate movement. Results: Prostate motion can vary greatly in magnitude among different patients. Different motion patterns were identified, showing its unpredictability. The mean displacement and standard deviation of the intrafraction motion was generally less than 2.0 ± 2.0 mm in each of the spatial directions. In certain patients, however, the percentage of the treatment time in which the prostate is displaced more than 5 mm from its planned position in at least 1 spatial direction was 10% or more. The maximum prostate displacement observed was 13.3 mm. Conclusion: Prostate tracking and motion assessment was performed with MV imaging and an EPID. The amount of prostate motion observed suggests that patients will benefit from its real-time monitoring. Megavoltage imaging can provide the basis for real-time prostate tracking using conventional linear accelerators.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Algorithm and exploratory study of the Hall MHD Rayleigh-Taylor instability.

This report is concerned with the influence of the Hall term on the nonlinear evolution of the Rayleigh-Taylor (RT) instability. This begins with a review of the magnetohydrodynamic (MHD) equations including the Hall term and the wave modes which are present in the system on time scales short enough that the plasma can be approximated as being stationary. In this limit one obtains what are known as the electron MHD (EMHD) equations which support two characteristic wave modes known as the whistler and Hall drift modes. Each of these modes is considered in some detail in order to draw attention to their key features. This analysis also serves to provide a background for testing the numerical algorithms used in this work. The numerical methods are briefly described and the EMHD solver is then tested for the evolution of whistler and Hall drift modes. These methods are then applied to study the nonlinear evolution of the MHD RT instability with and without the Hall term for two different configurations. The influence of the Hall term on the mixing and bubble growth rate are analyzed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Evaluation of the performance of event reconstruction algorithms in the JSNS 2 experiment using a 252 Cf calibration source

JSNS 2 investigates short-baseline neutrino oscillations using a 24-meter baseline and a 17-tonne Gd-loaded liquid scintillator target. Accurate event-reconstruction algorithms are crucial for analyzing experimental data. The algorithms undergo meticulous validation through calibration with a 252 Cf source. This paper outlines the methodology and evaluates the reconstruction performance, focusing on neutrino interactions up to approximately 50 MeV for sterile neutrino searches. Both 252 Cf and Michel electron events are studied to evaluate reconstruction accuracy. The analysis concludes that the uncertainty of the fiducial volume, with an appropriate correction, is much less than the requirement of JSNS 2 requirement (10%). Furthermore, the energy resolution is measured to be 3.3 ± 0.1% for the Michel electron endpoint and 4.3 ± 0.1% for the n-Gd peak in the central region.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Rare-event Simulation for Stochastic Korteweg-de Vries Equation

An asymptotic analysis of the tail probabilities for the dynamics of a soliton wave $U(x,t)$ under a stochastic time-dependent force is developed. The dynamics of the soliton wave $U(x,t)$ is described by the Korteweg-de Vries Equation with homogeneous Dirichlet boundary conditions under a stochastic time-dependent force, which is modeled as a time-dependent Gaussian noise with amplitude $\epsilon$. The tail probability we considered is $w(b) :=P(\sup_{t\in [0,T]} U(x,t) > b ),$ as $b\rightarrow \infty,$ for some constant $T>0$ and a fixed $x$, which can be interpreted as tail probability of the amplitude of water wave on shallow surface of a fluid or long internal wave in a density-stratified ocean. Our goal is to characterize the asymptotic behaviors of $w(b)$ and to evaluate the tail probability of the event that the soliton wave exceeds a certain threshold value under a random force term. Such rare-event calculation of $w(b)$ is very useful for fast estimation of the risk of the potential damage that could caused by the water wave in a density-stratified ocean modeled by the stochastic KdV equation. In this work, the asymptotic approximation of the probability that the soliton wave exceeds a high-level $b$ is derived. In addition, we develop a provably efficient rare-event simulation algorithm to compute $w(b)$. The efficiency of the algorithm only requires mild conditions and therefore it is applicable to a general class of Gaussian processes and many diverse applications.

Xu, Gongjun↗

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗

Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs

Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.

97 MATHEMATICS AND COMPUTING↗

Shot-noise-induced lower temperature limit of the nonneutral plasma parallel temperature diagnostic

Abstract We develop a new algorithm to estimate the temperature of a nonneutral plasma in a Penning-Malmberg trap. The algorithm analyzes data obtained by slowly lowering a voltage that confines one end of the plasma and collecting escaping charges, and is a maximum likelihood estimator based on a physically-motivated model of the escape protocol presented in (Beck in Measurement of the magnetic and temperature dependence of the electron-electron anisotropic temperature relaxation rate. PhD thesis, 1990). Significantly, our algorithm may be used on single-count data, allowing for improved fits with low numbers of escaping electrons. This is important for low-temperature plasmas such as those used in antihydrogen trapping. We perform a Monte Carlo simulation of our algorithm, and assess its robustness to intrinsic shot noise and external noise. The assumptions in this paper allow for a lower bound for measurable plasma temperatures of approximately $3\,\mathrm{K}$ 3 K for plasmas of length $1\,\mathrm{cm}$ 1 cm , with approximately 100 particle counts needed for an accuracy of $\pm 10 \%$ ± 10 % .

Zhong, Adrianne (ORCID:0000000162618736)↗

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗

Non-uniform Neutron Source Approximation for Iterative Reconstruction of Coded Source Images

X-ray and neutron optics both lack ray focusing capabilities. An x-ray source can be made small and powerful enough to facilitate high-resolution imaging while providing adequate flux. This is not yet possible for neutrons. One remedy is to employ a computational imaging technique such as magnified coded source imaging. The greatest challenge associated with successful reconstruction of high-resolution images from such radiographs is to precisely model the flux distribution for complex non-uniform neutron sources. We have developed a framework based on Monte Carlo simulation and iterative reconstruction that facilitates high- resolution coded source neutron imaging. In this paper, we define a methodology to empirically measure and approximate the flux profile of a non-uniform neutron source, and we show how to incorporate the result within the forward model of an iterative reconstruction algorithm. We assess improvement in image quality by comparing reconstructions based respectively on the new empirical forward model and our previous analytic models.

Gregor, Jens↗

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗

Stout Smearing on a Quantum Computer

Smearing of gauge-field configurations in lattice field theory improves the results of lattice simulations by suppressing high energy modes from correlation functions. In quantum simulations, high kinetic energy eigenstates are introduced when the time evolution operator is approximated such as Trotterization. While improved Trotter product formulae exist to reduce the errors, they have diminishing accuracy returns with respect to resource costs. Therefore having an algorithm that has fewer resources than an improved Trotter formula is desirable. In this work I develop a representation agnostic method for quantum smearing and show that it reduces the coupling to high energy modes in the discrete nonabelian gauge theory $D_4$

Gustafson, Erik J.↗

Numerical simulation of non-viscous liquid pinch-off using a coupled level set-boundary integral method

Simulations of the pinch-off of an inviscid fluid column are carried out based upon a potential flow model with capillary forces. The interface location and the time evolution of the free surface boundary condition are both approximated by means of level set techniques on a fixed domain. The interface velocity is obtained via a Galerkin boundary integral solution of the 3D axisymmetric Laplace equation. A short-time analytical solution of the Raleigh-Taylor instability in a liquid column is available, and this result is compared with our numerical experiments to validate the algorithm. The method is capable of handling pinch-off and after pinch-off events, and simulations showing the time evolution of the fluid tube are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗