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,081 records · Page 60

SU-E-T-504: Intensity-Modulated Radiosurgery Treatments Derived by Optimizing Delivery of Sphere Packing Treatment Plans

Purpose To minimize the number of monitor units required to deliver a sphere packing stereotactic radiosurgery (SRS) plan by eliminating overlaps of individual beam projections. Methods An algorithm was written in C{sup ++} to calculate SRS treatment doses using sphere packing. Three fixed beams were used to approximate each arc in a typical SRS treatment plan. For cases involving multiple isocenters, at each gantry and table angle position beams directed to individual spheres overlap to produce regions of high dose, resulting in intensity modulated beams. These high dose regions were dampened by post-processing of the combined beam profile. The post-process dampening involves removing the excess overlapping fluence from all but the highest contributing beam. The dampened beam profiles at each table and gantry angle position were then summed to produce the new total dose distribution. Results Delivery times for even the most complex multiple sphere plans can be reduced to consistent times of about 20 to 30 minutes. The total MUs required to deliver the plan can also be reduced by as much as 85% of the original plan’s MUs. Conclusion Regions of high dose are removed. Dampening overlapping radiation fluence can produce the new beam profiles that have more uniform dose distributions using less MUs. This results in a treatment that requires significantly fewer intensity values than traditional IMRT or VAMT planning.

60 APPLIED LIFE SCIENCES↗

Studies of Front-End Electronics for High-Precision Timing Measurements with LGADs [Poster]

In Time-of-Arrival (ToA) measurements, simulations can be used to optimize precision detection and implementation methods of front-end electronics. The simulation tested in this project takes the response of a filter (in the s-domain) from a noisy input current signal from the detector, an LGAD (Low-Gain Avalanche Diode), and uses a threshold to determine the ToA value for the signal. Measuring the ToA values for a large sample of events and comparing them to a reference statistically produces the timing precision of the simulation. Here, the sub-algorithm to model LGAD events with piecewise linear (PWL) approximations (for more efficient Laplace transforms) was optimized. Using the Fourier Discrete Cosine Transform, 25 points could be selected to describe the primary behavior of the signal. Results showed that timing precision is on par with previous methods. We also found that the new algorithm is faster and equally consistent in producing accurate PWL approximations. Testi ng with larger samples is required to fully verify the new algorithm.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Asynchronously parallel optimization solver for finding multiple minima

This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, high-quality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finite number of local optimization runs and identifies, or has a single local optimization run converging to, every minimum. The algorithm is applicable to general optimization settings, but our numerical results focus on the case when derivatives are unavailable. In numerical tests, a PYTHON implementation of the algorithm is shown to yield good approximations of many minima (including a global minimum), and this ability scales well with additional resources. Our implementation’s time to solution is shown also to scale well even when the time to evaluate the function evaluation is highly variable.

97 MATHEMATICS AND COMPUTING↗

Thermo Field Dynamics on a Quantum Computer

In this project we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we implemented a real-time therom field dynamics formalism, which has the added benefit of being able to compute quantities that are both time-and temperature-dependent. To implement thermo field dynamics we apply a unitary transformation [1] to discrete quantum mechanical operators to make new Hamiltoni-ans with encoded temperature dependence. The method works normally for fermions, which have a finite representation, but needs some modification to work with bosons. These Hamilto-nians are then processed into a Pauli matrix representation in order to be used as input for IBM's Qiskit package [2]. We then use IBM's quantum simulator to calculate an approximation to the Hamiltonaian's ground state energy via the variational quantum eigensolver (VQE) algorithm [3]. This approximation is then compared to a classically calculated value for the exact energy. The thermo field dynamics quantum algorithm has general applications to material science, high-energy physics and nuclear physics, particularly in those situations involving realtime evolution at high temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Step Bunch Evolution on Vicinal Faces of KDP

For in-situ studies of the formation and evolution of step patterns in solution growth, we have assembled an experimental setup based on Michelson interferometry with the growing crystal surface as one of the reflective surfaces. The device allows data collection over a relatively large area (approximately 4 sq. mm) in situ and in real time during growth. The depth resolution is improved over traditional interferometry using phase-shifted images combining by a suitable algorithm. We achieve a depth resolution of approximately 50 Angstroms. Lateral resolution, dependent on the degree of magnification, is around 0.3 to 5 microns. The crystal chosen as a model in this work is potassium dihydrogen phosphate (KDP), the optically non-linear material widely used in frequency doubling applications. Kinetics of KDP crystallization is well studied so that KDP can serve as a benchmark for our investigations. We present quantitative results on the onset, initial stages and development of instabilities in moving step trains on vicinal crystal surfaces at varying supersaturation, flow rate, and flow direction. The kinetics data suggest that at low supersaturations, step bunching is caused by impurity retardation of the steps, while at higher supersaturations, we link the non-linearity during growth to interdependence of the velocity and density of the steps evidenced in independent experiments. The behavior on the surface is very dynamic, small bunches both merge and split from larger bunches as they travel across the facet. We present evidence that despite these dynamics, under steady conditions there exists a limiting value to step bunch height. This height is reached at distances between 600 and 1000 microns from the step source. In our experiments, we observed the retention of this step bunch height limit up to the path of 1500 microns.

Booth, N. A.↗

Ensemble-type numerical uncertainty information from single model integrations

We suggest an algorithm that quantifies the discretization error of time-dependent physical quantities of interest (goals) for numerical models of geophysical fluid dynamics. The goal discretization error is estimated using a sum of weighted local discretization errors. The key feature of our algorithm is that these local discretization errors are interpreted as realizations of a random process. The random process is determined by the model and the flow state. From a class of local error random processes we select a suitable specific random process by integrating the model over a short time interval at different resolutions. The weights of the influences of the local discretization errors on the goal are modeled as goal sensitivities, which are calculated via automatic differentiation. The integration of the weighted realizations of local error random processes yields a posterior ensemble of goal approximations from a single run of the numerical model. From the posterior ensemble we derive the uncertainty information of the goal discretization error. This algorithm bypasses the requirement of detailed knowledge about the models discretization to generate numerical error estimates. The algorithm is evaluated for the spherical shallow-water equations. For two standard test cases we successfully estimate the error of regional potential energy, track its evolution, and compare it to standard ensemble techniques. The posterior ensemble shares linear-error-growth properties with ensembles of multiple model integrations when comparably perturbed. The posterior ensemble numerical error estimates are of comparable size as those of a stochastic physics ensemble.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis

Recently, Ospadov and Rothstein published a pure-sampling quantum Monte Carlo algorithm (PSQMC) that features an auxiliary Path Z that connects the midpoints of the current and proposed Paths X and Y, respectively. When sufficiently long, Path Z provides statistical independence of Paths X and Y. Under those conditions, the Metropolis decision used in PSQMC is done without any approximation, i.e., not requiring microscopic reversibility and without having to introduce any G(x → x′; τ) factors into its decision function. This is a unique feature that contrasts with all competing reptation algorithms in the literature. An example illustrates that dependence of Paths X and Y has adverse consequences for pure sampling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A comparison of global optimization algorithms with standard benchmark functions and real-world applications using Energy Plus

There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerically using building energy simulation programs. As these programs contain iterative solution algorithms, they introduce discontinuities in the numerical approximation to the objective function. Metaheuristics often work well for such problems, but their convergence to a global optimum cannot be established formally. Moreover, different algorithms tend to be suited to particular classes of optimization problems. To shed light on this issue we compared the performance of two metaheuristics, the hybrid CMA-ES/HDE and the hybrid PSO/HJ, in minimizing standard benchmark functions and real-world building energy optimization problems of varying complexity. From this we find that the CMA-ES/HDE performs well on more complex objective functions, but that the PSO/HJ more consistently identifies the global minimum for simpler objective functions. Both identified similar values in the objective functions arising from energy simulations, but with different combinations of model parameters. This may suggest that the objective function is multi-modal. The algorithms also correctly identified some non-intuitive parameter combinations that were caused by a simplified control sequence of the building energy system that does not represent actual practice, further reinforcing their utility.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A multi-scale network method for two-phase flow in porous media

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces within each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A CRITICAL ASSESSMENT OF NONLINEAR FORCE-FREE FIELD MODELING OF THE SOLAR CORONA FOR ACTIVE REGION 10953

Nonlinear force-free field (NLFFF) models are thought to be viable tools for investigating the structure, dynamics, and evolution of the coronae of solar active regions. In a series of NLFFF modeling studies, we have found that NLFFF models are successful in application to analytic test cases, and relatively successful when applied to numerically constructed Sun-like test cases, but they are less successful in application to real solar data. Different NLFFF models have been found to have markedly different field line configurations and to provide widely varying estimates of the magnetic free energy in the coronal volume, when applied to solar data. NLFFF models require consistent, force-free vector magnetic boundary data. However, vector magnetogram observations sampling the photosphere, which is dynamic and contains significant Lorentz and buoyancy forces, do not satisfy this requirement, thus creating several major problems for force-free coronal modeling efforts. In this paper, we discuss NLFFF modeling of NOAA Active Region 10953 using Hinode/SOT-SP, Hinode/XRT, STEREO/SECCHI-EUVI, and SOHO/MDI observations, and in the process illustrate three such issues we judge to be critical to the success of NLFFF modeling: (1) vector magnetic field data covering larger areas are needed so that more electric currents associated with the full active regions of interest are measured, (2) the modeling algorithms need a way to accommodate the various uncertainties in the boundary data, and (3) a more realistic physical model is needed to approximate the photosphere-to-corona interface in order to better transform the forced photospheric magnetograms into adequate approximations of nearly force-free fields at the base of the corona. We make recommendations for future modeling efforts to overcome these as yet unsolved problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributed Controllers Seeking AC Optimal Power Flow Solutions Using ADMM

This paper focuses on power distribution systems with inverter-interfaced renewable energy sources (RESs), and develops a distributed control framework to steer the RES output powers to solutions of ac optimal power flow (OPF) problems. The design of the distributed control algorithm is based on suitable linear approximation of the ac power-flow equations, and leverages the so-called alternating direction method of multipliers (ADMM). Convergence of the RES-inverter output powers to solutions of the approximate ac OPF problem is established under suitable conditions on the mismatches between the commanded setpoints and actual RES output powers. Overall, since the proposed scheme can be cast as an ADMM with inexact primal and dual updates, the convergence results can be applied to more general distributed optimization settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Parallel, Fully Coupled, Fully Implicit Solution to Reactive Transport in Porous Media Using the Preconditioned Jacobian-Free Newton-Krylov Method

Modeling large multicomponent reactive transport systems in porous media is particularly challenging when the governing partial differential algebraic equations (PDAEs) are highly nonlinear and tightly coupled due to complex nonlinear reactions and strong solution-media interactions. Here we present a preconditioned Jacobian-Free Newton-Krylov (JFNK) solution approach to solve the governing PDAEs in a fully coupled and fully implicit manner. A well-known advantage of the JFNK method is that it does not require explicitly computing and storing the Jacobian matrix during Newton nonlinear iterations. Our approach further enhances the JFNK method by utilizing physics-based, block preconditioning and a multigrid algorithm for efficient inversion of the preconditioner. This preconditioning strategy accounts for self- and optionally, cross-coupling between primary variables using diagonal and off-diagonal blocks of an approximate Jacobian, respectively. Numerical results are presented demonstrating the efficiency and massive scalability of the solution strategy for reactive transport problems involving strong solution-mineral interactions and fast kinetics. We found that the physics-based, block preconditioner significantly decreases the number of linear iterations, directly reducing computational cost; and the strongly scalable algebraic multigrid algorithm for approximate inversion of the preconditioner leads to excellent parallel scaling performance.

97 MATHEMATICS AND COMPUTING↗

MODELING COLLISIONAL CASCADES IN DEBRIS DISKS: THE NUMERICAL METHOD

We develop a new numerical algorithm to model collisional cascades in debris disks. Because of the large dynamical range in particle masses, we solve the integro-differential equations describing erosive and catastrophic collisions in a particle-in-a-box approach, while treating the orbital dynamics of the particles in an approximate fashion. We employ a new scheme for describing erosive (cratering) collisions that yields a continuous set of outcomes as a function of colliding masses. We demonstrate the stability and convergence characteristics of our algorithm and compare it with other treatments. We show that incorporating the effects of erosive collisions results in a decay of the particle distribution that is significantly faster than with purely catastrophic collisions.

79 ASTRONOMY AND ASTROPHYSICS↗

Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation

Whittle index policy is a heuristic to the intractable restless multi-armed bandits (RMAB) problem. Although it is provably asymptotically optimal, finding Whittle indices remains difficult. In this paper, we present Neural-Q-Whittle, a Whittle index based Q-learning algorithm for RMAB with neural network function approximation, which is an example of nonlinear two-timescale stochastic approximation with Q-function values updated on a faster timescale and Whittle indices on a slower timescale. Despite the empirical success of deep Q-learning, the non-asymptotic convergence rate of Neural-Q-Whittle, which couples neural networks with two-timescale Q-learning largely remains unclear. This paper provides a finite-time analysis of Neural-Q-Whittle, where data are generated from a Markov chain, and Q-function is approximated by a ReLU neural network. Our analysis leverages a Lyapunov drift approach to capture the evolution of two coupled parameters, and the nonlinearity in value function approximation further requires us to characterize the approximation error. Combing these provide Neural-Q-Whittle with convergence rate, where is the number of iterations.

reinforcement learning, structured learning, conve↗

Surface hopping with a manifold of electronic states. I. Incorporating surface-leaking to capture lifetimes

We investigate the incorporation of the surface-leaking (SL) algorithm into Tully’s fewest-switches surface hopping (FSSH) algorithm to simulate some electronic relaxation induced by an electronic bath in conjunction with some electronic transitions between discrete states. The resulting SL-FSSH algorithm is benchmarked against exact quantum scattering calculations for three one-dimensional model problems. The results show excellent agreement between SL-FSSH and exact quantum dynamics in the wide band limit, suggesting the potential for a SL-FSSH algorithm. Discrepancies and failures are investigated in detail to understand the factors that will limit the reliability of SL-FSSH, especially the wide band approximation. Considering the easiness of implementation and the low computational cost, we expect this method to be useful in studying processes involving both a continuum of electronic states (where electronic dynamics are probabilistic) and processes involving only a few electronic states (where non-adiabatic processes cannot ignore short-time coherence)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms

The implementation of the algorithms used in the flight program to approximate elementary functions and mathematical procedures was checked. This was done by verifying that at least one, and in most cases, more than one function computed through the use of the algorithms was calculated properly. The following algorithms were checked: sine-cosine, arctangent, natural logarithm, square root, inverse square root, as well as the vector dot and cross products.

Source record↗

Artificial neural network algorithms for pulse shape discrimination and recovery of piled-up pulses in organic scintillators

We developed two neural-network (NN)-based algorithms (fully-connected neural network (Fc-NN) and recurrent neural network (RNN)) to perform pulse shape discrimination (PSD) and identification of piled-up pulses produced by organic scintillators, upon interaction with neutrons and gamma rays. We tested the algorithms on measured and verification sets of data and compared their classification performances to standard approaches. At a high acquisition count rate (100,000 counts per second, cps), in the presence of a gamma-to-neutron ratio of approximately 400–1, the proposed NN-based algorithm achieves a fraction of misclassified neutron, gamma, and piled-up pulses of approximately 1%, 1.8%, and 0.6%, respectively. Compared to the traditional approach, it exhibits 3×, 14×, and 11× improved (lower) miscalculation rates for neutron, gamma, and piled-up pulses, respectively. Here, we also demonstrate the capability of NN-based algorithms of successfully recovering and identifying neutron and gamma ray compositions from piled-up pulses in challenging, high pulse count rate conditions.

42 ENGINEERING↗