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 955 records · Page 53

Modeling and experimental validation of dynamical effects in Bragg coherent x-ray diffractive imaging of finite crystals

Bragg coherent diffractive imaging (BCDI) is a noninvasive microscopy technique that can visualize the shape and internal lattice deviations of crystals with nanoscale spatial resolution and picometer deformation sensitivity. Its strain imaging capability relies on Fourier transform–based iterative phase retrieval algorithms, which are mostly developed under the kinematical approximation. Such approximation prohibits the application of BCDI on larger crystals, which are commonly seen in most emerging functional materials. Understanding the dynamical effect in BCDI, as well as developing a validated method for modeling BCDI at the dynamical diffraction limit, is crucial for applying BCDI to hierarchical systems that contain micron-sized crystals and grains. Thus we report a comparative study on the impact of dynamical diffraction effects by comparing the reconstruction results from two measurements of the same crystal. Forward simulation is implemented to show subtle changes of interference fringes in the diffraction pattern due to the dynamical diffraction, and is compared directly with the experimental data.

36 MATERIALS SCIENCE↗

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. However, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. Here, in this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

TU-H-BRC-05: Stereotactic Radiosurgery Optimized with Orthovoltage Beams

Purpose: To achieve improved stereotactic radiosurgery (SRS) dose distributions using orthovoltage energy fluence modulation with inverse planning optimization techniques. Methods: A pencil beam model was used to calculate dose distributions from the institution’s orthovoltage unit at 250 kVp. Kernels for the model were derived using Monte Carlo methods as well as measurements with radiochromic film. The orthovoltage photon spectra, modulated by varying thicknesses of attenuating material, were approximated using open-source software. A genetic algorithm search heuristic routine was used to optimize added tungsten filtration thicknesses to approach rectangular function dose distributions at depth. Optimizations were performed for depths of 2.5, 5.0, and 7.5 cm, with cone sizes of 8, 10, and 12 mm. Results: Circularly-symmetric tungsten filters were designed based on the results of the optimization, to modulate the orthovoltage beam across the aperture of an SRS cone collimator. For each depth and cone size combination examined, the beam flatness and 80–20% and 90–10% penumbrae were calculated for both standard, open cone-collimated beams as well as for the optimized, filtered beams. For all configurations tested, the modulated beams were able to achieve improved penumbra widths and flatness statistics at depth, with flatness improving between 33 and 52%, and penumbrae improving between 18 and 25% for the modulated beams compared to the unmodulated beams. Conclusion: A methodology has been described that may be used to optimize the spatial distribution of added filtration material in an orthovoltage SRS beam to result in dose distributions at depth with improved flatness and penumbrae compared to standard open cones. This work provides the mathematical foundation for a novel, orthovoltage energy fluence-modulated SRS system.

60 APPLIED LIFE SCIENCES↗

Exponential time differencing scheme for mass transport and depletion in molten salt reactors

This work extends the capability previously shown for addressing the problem of computing depletion and mass transport calculations in molten salt reactors (MSRs) by calculating matrix exponentials. Additional algorithms are implemented to compute the matrix exponential and the action of the matrix exponential on a matrix. These algorithms include two methods based on the Pade approximation, a Taylor series method, and three methods based on Cauchy's integral formula. In addition to the added matrix exponential solvers, a variable-order total variation diminishing scheme is applied to the convective flux approximation to provide enhanced accuracy. Finally, a simplified MSR problem is shown for each of the exponential time differencing solvers along with classical backwards differencing integrators. The results show excellent convergence for exponential time differencing methods. Computation time is a key element for selecting the optimal solver in these problems, and this work shows that Pade and Cauchy-based solvers may provided the fastest and most accurate solutions. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Soil emissivity and reflectance spectra measurements

We present an analysis of the laboratory reflectance and emissivity spectra of 11 soil samples collected on different field campaigns carried out over a diverse suite of test sites in Europe, North Africa, and South America from 2002 to 2008. Hemispherical reflectance spectra were measured from 2.0 to 14 {mu}m with a Fourier transform infrared spectrometer, and x-ray diffraction analysis (XRD) was used to determine the mineralogical phases of the soil samples. Emissivity spectra were obtained from the hemispherical reflectance measurements using Kirchhoff's law and compared with in situ radiance measurements obtained with a CIMEL Electronique CE312-2 thermal radiometer and converted to emissivity using the Advanced Spaceborne Thermal Emission and Reflection Radiometer (ASTER) temperature and emissivity separation algorithm. The CIMEL has five narrow bands at approximately the same positions as the ASTER. Results show a root mean square error typically below 0.015 between laboratory emissivity measurements and emissivity measurements derived from the field radiometer.

54 ENVIRONMENTAL SCIENCES↗

Structure Learning and Statistical Estimation in Distribution Networks - Part II

Limited placement of real-time monitoring devices in the distribution grid, recent trends notwithstanding, has prevented the easy implementation of demand-response and other smart grid applications. Part I of this paper discusses the problem of learning the operational structure of the grid from nodal voltage measurements. In this work (Part II), the learning of the operational radial structure is coupled with the problem of estimating nodal consumption statistics and inferring the line parameters in the grid. Based on a Linear-Coupled(LC) approximation of AC power flows equations, polynomial time algorithms are designed to identify the structure and estimate nodal load characteristics and/or line parameters in the grid using the available nodal voltage measurements. Then the structure learning algorithm is extended to cases with missing data, where available observations are limited to a fraction of the grid nodes. The efficacy of the presented algorithms are demonstrated through simulations on several distribution test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Milestone Completion Report WBS 1.3.5.05 ECP/VTK-m FY17Q4 [MS-17/03-06] Key Reduce / Spatial Division / Basic Advect / Normals STDA05-4.

The FY17Q4 milestone of the ECP/VTK-m project includes the completion of a key-reduce scheduling mechanism, a spatial division algorithm, an algorithm for basic particle advection, and the computation of smoothed surface normals. With the completion of this milestone, we are able to, respectively, more easily group like elements (a common visualization algorithm operation), provide the fundamentals for geometric search structures, provide the fundamentals for many flow visualization algorithms, and provide more realistic rendering of surfaces approximated with facets.

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Aerodynamic Designs

This project created a framework for efficient, accurate, and scalable deep neural network representations of design optimization problem solutions. The inputs to these DNN representations are the vector of design requirement parameters, the outputs are the optimal design variables, and the goal is to learn the map from inputs to outputs (i.e., inverse design). The team addressed the problem of the optimal shape design of aerodynamic lifting surfaces—in particular aircraft wings—using a Reynolds-Average Navier Stokes model to govern the CFD-based aerodynamic shape optimization. The inverse design map for such problems is very complex and high-dimensional, involving inputs and outputs on the order of 1000s. To approximate this inverse design map, the team developed algorithms to construct parsimonious DNN architectures, which automatically identify low-dimensional manifolds in which design requirements affect optimal shape parameters, and trained these architectures with multifidelity optimization methods. The resulting methodology accurately and automatically designs optimal aerodynamic lifting surfaces with very high accuracy (99%) at interactive speeds, of the order of milliseconds, resulting in factors of one million or more speedup relative to CFD-based design optimization.

97 MATHEMATICS AND COMPUTING↗

Building thermal model development of typical house in U.S. for virtual storage control of aggregated building loads based on limited available information

A building thermal model is an essential component for achieving optimal control of a building’s heating, ventilation, and air conditioning (HVAC). A self-learning grey-box model has been developed by implementing data-driven techniques and utilizing limited available information about the building. In previous research, detailed foreknown knowledge/information, e.g. physical and thermal properties of building materials, as well as sufficient number of observation points, e.g. indoor temperature sensors in different zones, are available for making the decision of model structure and parameters searching range easier. The availability of measured data and a narrowed searching range of model parameters, e.g. resistance and capacity for each wall, made the adopted algorithms quickly achieve near optimal values, which closely approximate the actual heat transfer of a building. Meanwhile, the details of pre-processing of the key inputs were seldom explained. Compared to the previous research, in this study, the available information is assumed to be limited which can fill the requirement for large scale virtual storage control of real residential community in near future, where it may be impractically or over time-consuming to acquire the detailed information for each single house. The developed model is validated by comparing the results to measured data in a recently-built home typical of the southeastern United States.

Cui, Borui↗

Trigger Rate of High Energy Electrons in the Mu2e Experiment

aThe Mu2e Collaboration will look for Charged Lepton Flavor Violation (CLFV) decay processes, with a sensitivity goal of 10E-17. The experiment is searching for a 105 MeV electron, which will be detected using a straw tracker solenoid and a crystal calorimeter. With a goal processing time of less than 5 milliseconds per event and a target rejection greater than 100, it is critical that the trigger software is optimized for speed and performance. The trigger is responsible for parsing data from the detector and determining which events to keep. By examining the properties CLFV event helices are expected to have, a specific set of parameters, or cuts, were used to create Mu2e triggering algorithms. The following research is an investigation into the efficiency of the trigger and a calculation of the rate at which these events will be triggered. With the combined contribution of two helix reconstruction algorithms, the trigger will be expected to accept approximately on e CLFV candidate electron event per second, with a triggering rate of .86 Hz.

43 PARTICLE ACCELERATORS↗

PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems

Preventing and slowing the spread of epidemics is achieved through techniques such as vaccination and social distancing. Given practical limitations on the number of vaccines and cost of administration, optimization becomes a necessity. Previous approaches using mathematical programming methods have shown to be effective but are limited by computational costs. In this work, we make several contributions: First, we present a new approach for intervention via maximizing the influence of vaccinated nodes on the network. We call this method \preempt. Next, we prove submodular properties associated with the objective function of our method so that it aids in construction of an efficient greedy approximation strategy. Consequently, we present a new parallel algorithm based on greedy hill climbing for \preempt, and present an efficient parallel implementation for distributed CPU-GPU heterogeneous platforms. Our results demonstrate that \preempt{} is able to achieve a significant reduction (up to 6.75$\times$) in the percentage of people infected on a city-scale network. We also show strong scaling results of \preempt{} on 128 nodes of the Summit supercomputer. Our parallel implementation is able to significantly reduce time to solution, from hours to minutes on large networks. This work represents a first-of-its-kind effort in parallelizing greedy hill climbing and applying it toward devising effective interventions for epidemics.

Minutoli, Marco↗

An improved phase shift reconstruction algorithm of fringe scanning technique for X-ray microscopy

The X-ray phase imaging method has been applied to observe soft biological tissues, and it is possible to image the soft tissues by using the benefit of the so-called “Talbot effect” by an X-ray grating. One type of the X-ray phase imaging method was reported by combining an X-ray imaging microscope equipped by a Fresnel zone plate with a phase grating. Using the fringe scanning technique, a high-precision phase shift image could be obtained by displacing the grating step by step and measuring dozens of sample images. The number of the images was selected to reduce the error caused by the non-sinusoidal component of the Talbot self-image at the imaging plane. A larger number suppressed the error more but increased radiation exposure and required higher mechanical stability of equipment. In this paper, we analyze the approximation error of fringe scanning technique for the X-ray microscopy which uses just one grating and proposes an improved algorithm. We compute the approximation error by iteration and substitute that into the process of reconstruction of phase shift. This procedure will suppress the error even with few sample images. The results of simulation experiments show that the precision of phase shift image reconstructed by the proposed algorithm with 4 sample images is almost the same as that reconstructed by the conventional algorithm with 40 sample images. We also have succeeded in the experiment with real data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Patient-Specific Monte Carlo-Based Dose-Kernel Approach for Inverse Planning in Afterloading Brachytherapy

Purpose: Brachytherapy planning software relies on the Task Group report 43 dosimetry formalism. This formalism, based on a water approximation, neglects various heterogeneous materials present during treatment. Various studies have suggested that these heterogeneities should be taken into account to improve the treatment quality. The present study sought to demonstrate the feasibility of incorporating Monte Carlo (MC) dosimetry within an inverse planning algorithm to improve the dose conformity and increase the treatment quality. Methods and Materials: The method was based on precalculated dose kernels in full patient geometries, representing the dose distribution of a brachytherapy source at a single dwell position using MC simulations and the Geant4 toolkit. These dose kernels are used by the inverse planning by simulated annealing tool to produce a fast MC-based plan. A test was performed for an interstitial brachytherapy breast treatment using two different high-dose-rate brachytherapy sources: the microSelectron iridium-192 source and the electronic brachytherapy source Axxent operating at 50 kVp. Results: A research version of the inverse planning by simulated annealing algorithm was combined with MC to provide a method to fully account for the heterogeneities in dose optimization, using the MC method. The effect of the water approximation was found to depend on photon energy, with greater dose attenuation for the lower energies of the Axxent source compared with iridium-192. For the latter, an underdosage of 5.1% for the dose received by 90% of the clinical target volume was found. Conclusion: A new method to optimize afterloading brachytherapy plans that uses MC dosimetric information was developed. Including computed tomography-based information in MC dosimetry in the inverse planning process was shown to take into account the full range of scatter and heterogeneity conditions. This led to significant dose differences compared with the Task Group report 43 approach for the Axxent source.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Topological Quantum Hashing with the Icosahedral Group

We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log{sup 2}(1/{epsilon})), we can approximate all SU(2) matrices to an average error {epsilon} with a cost of O(log(1/{epsilon})) in time. The algorithm is applicable to generic quantum compiling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parareal in time 3D numerical solver for the LWR Benchmark neutron diffusion transient model

In this paper we present a time-parallel algorithm for the 3D neutrons calculation of a transient model in a nuclear reactor core. The neutrons calculation consists in numerically solving the time dependent diffusion approximation equation, which is a simplified transport equation. The numerical resolution is done with finite elements method based on a tetrahedral meshing of the computational domain, representing the reactor core, and time discretization is achieved using a θ-scheme. The transient model presents moving control rods during the time of the reaction. Therefore, cross-sections (piecewise constants) are taken into account by interpolations with respect to the velocity of the control rods. The parallelism across the time is achieved by an adequate use of the parareal in time algorithm to the handled problem. This parallel method is a predictor corrector scheme that iteratively combines the use of two kinds of numerical propagators, one coarse and one fine. Our method is made efficient by means of a coarse solver defined with large time step and fixed position control rods model, while the fine propagator is assumed to be a high order numerical approximation of the full model. The parallel implementation of our method provides a good scalability of the algorithm. Numerical results show the efficiency of the parareal method on large light water reactor transient model corresponding to the Langenbuch–Maurer–Werner benchmark.

97 MATHEMATICS AND COMPUTING↗

Convex Q-Learning in Continuous Time with Application to Dispatch of Distributed Energy Resources

Convex Q-learning is a recent approach to reinforcement learning, motivated by the possibility of a firmer theory for convergence, and the possibility of making use of greater a priori knowledge regarding policy or value function structure. This paper explores algorithm design in the continuous time domain, with a finite-horizon optimal control objective. The main contributions are (i) The new Q-ODE: a model-free characterization of the Hamilton-Jacobi-Bellman equation. (ii) A formulation of Convex Q-learning that avoids approximations appearing in prior work. The Bellman error used in the algorithm is defined by filtered measurements, which is necessary in the presence of measurement noise. (iii) Convex Q-learning with linear function approximation is a convex program. It is shown that the constraint region is bounded, subject to an exploration condition on the training input. (iv) The theory is illustrated in application to resource allocation for distributed energy resources, for which the theory is ideally suited.

Lu, Fan↗

Real and complex valued geometrical optics inverse ray-tracing for inline field calculations

In this work, a 3-D ray based model for computing laser fields in dissipative and amplifying media is presented. The eikonal equation is solved using inverse ray-tracing on a dedicated nonstructured 3-D mesh. Inverse ray-tracing opens the possibility of using Complex Geometrical Optics (CGO), for which we propose a propagation formalism in a finite element mesh. Divergent fields at caustics are corrected using an etalon integral method for fold-type caustics. This method is successfully applied in dissipative media by modifying the ray-ordering and root selection rules, thereby allowing one to reconstruct the field in the entire caustic region. In addition, we demonstrate how caustics in the CGO framework can disappear entirely for sufficiently dissipative media, making the complex ray approach valid in the entire medium. CGO is shown to offer a more precise modeling of laser refraction and absorption in a dissipative medium when compared to Geometrical Optics (GO). In the framework of Inertial Confinement Fusion (ICF), this occurs mostly at intermediate temperatures or at high temperatures close to the critical density. Additionally, GO is invalid at low temperatures if an approximated expression of the permittivity is used. The inverse ray-tracing algorithm for GO and CGO is implemented in the IFRIIT code, in the framework of a dielectric permittivity described in 3-D using a piecewise linear approximation in tetrahedrons. Fields computed using GO and CGO are compared to results from the electromagnetic wave solver LPSE. Excellent agreement is obtained in 1-D linear and nonlinear permittivity profiles. Good agreement is also obtained for ICF-like Gaussian density profiles in 2-D. Finally, we demonstrate how the model reproduces Gaussian beam diffraction using CGO. The IFRIIT code will be interfaced inline to 3-D radiative hydrodynamic codes to describe the nonlinear laser plasma interaction in ICF and high-energy-density plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Many-body calculations of low energy eigenstates in magnetic and periodic systems with self healing diffusion Monte Carlo: steps beyond the fixed-phase

The self-healing diffusion Monte Carlo algorithm (SHDMC) [Reboredo, Hood and Kent, Phys. Rev. B {\bf 79}, 195117 (2009), Reboredo, {\it ibid.} {\bf 80}, 125110 (2009)] is extended to study the ground and excited states of magnetic and periodic systems. A recursive optimization algorithm is derived from the time evolution of the mixed probability density. The mixed probability density is given by an ensemble of electronic configurations (walkers) with complex weight. This complex weigh allows the amplitude of the fix-node wave function to move away from the trial wave function phase. This novel approach is both a generalization of SHDMC and the fixed-phase approximation [Ortiz, Ceperley and Martin Phys Rev. Lett. {\bf 71}, 2777 (1993)]. When used recursively it improves simultaneously the node and phase. The algorithm is demonstrated to converge to the nearly exact solutions of model systems with periodic boundary conditions or applied magnetic fields. The method is also applied to obtain low energy excitations with magnetic field or periodic boundary conditions. The potential applications of this new method to study periodic, magnetic, and complex Hamiltonians are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗