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,369 records · Page 76

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

41 EE - Solar Energy Technologies Office (EE-4S)↗

FIB-ToF-SIMS characterization of irradiated U-10Zr

Post-irradiation examination (PIE) is critical for the performance assessment and qualification of nuclear fuels. Secondary ion mass spectrometry (SIMS) is a powerful materials characterization technique that allows for elemental and isotopic mapping with a depth resolution greater than EDS and EPMA. However, it has not yet been applied to PIE of metallic nuclear fuel. Here, in this work, we characterize an fast neutron spectrum irradiated U-10Zr fuel sample using a time-of-flight SIMS (ToF-SIMS) system connected to a FIB/SEM system, which allows for flexible sample analysis compared to a dedicated ToF-SIMS instrument. Analysis of the resulting hyperspectral micrograph data was aided by the development of an unsupervised machine learning (ML) algorithm that iterates on existing methods to segment the 3D micrographic datasets based on the similarity of mass spectra. The results showed that the FIB-ToF-SIMS instrument was potentially capable of spatially resolving closed fission gas bubbles in 3D by continued ion sputtering of the analyzed volume. Additionally, the ML algorithm proved useful in revealing the chemical segregation of light fission products (those with an atomic mass between approximately 85–105 amu, such as ruthenium and rhodium) plus matrix zirconium, heavy fission products (those with an atomic mass between approximately 135–150 amu, such as the lanthanides) and uranium. Future studies are planned to conduct FIB-ToF-SIMS analysis on more irradiated U-Zr samples to study the constituent redistribution.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Integration of sensing and computing in an intelligent decision support system for homeland security defense

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme to achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.

59 BASIC BIOLOGICAL SCIENCES↗

Photoionization cross section by Stieltjes imaging applied to coupled cluster Lanczos pseudo-spectra

A recently implemented asymmetric Lanczos algorithm for computing (complex) linear response functions within the coupled cluster singles (CCS), coupled cluster singles and iterative approximate doubles (CC2), and coupled cluster singles and doubles (CCSD) is coupled to a Stieltjes imaging technique in order to describe the photoionization cross section of atoms and molecules, in the spirit of a similar procedure recently proposed by Averbukh and co-workers within the Algebraic Diagrammatic Construction approach. Pilot results are reported for the atoms He, Ne, and Ar and for the molecules H{sub 2}, H{sub 2}O, NH{sub 3}, HF, CO, and CO{sub 2}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reconstruction and analysis of exploding wire particle trajectories via automatic calibration of stereo images

Quantitative understanding of the physics of dust or granular matter transport significantly impacts several aspects of burning plasma science and technology. Here, this work takes machine vision techniques popular in robotics and self-driving cars and applies them to identification and analysis of microparticles generated from exploding wires. Using only the image frames and knowledge of the intrinsic properties of the cameras, a Python code was written to identify the particles, automatically calibrate the relative image positions, and extract trajectory data. After identifying approximately 50 particles based on the timing of secondary particle explosions, the eight point and random sample consensus algorithms were used to determine the geometric correlation between the cameras. Over 100 particle matches were found between the two camera views. These correlated trajectories were used in subsequent 3D track reconstruction and analysis of the physics behind the particle motion. The 3D reconstruction resulted in accurate positioning of the particles with respect to the experimental setup. The particle motion was consistent with the effects of a 1 g gravitational field modified by drag forces. Lastly, the methods and analyses presented here can be used in many facets of high temperature plasma diagnostics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Operation of the ATLAS trigger system in Run 2

The ATLAS experiment at the Large Hadron Collider employs a two-level trigger system to record data at an average rate of 1 kHz from physics collisions, starting from an initial bunch crossing rate of 40 MHz. During the LHC Run 2 (2015–2018), the ATLAS trigger system operated successfully with excellent performance and flexibility by adapting to the various run conditions encountered and has been vital for the ATLAS Run-2 physics programme. For proton-proton running, approximately 1500 individual event selections were included in a trigger menu which specified the physics signatures and selection algorithms used for the data-taking, and the allocated event rate and bandwidth. The trigger menu must reflect the physics goals for a given data collection period, taking into account the instantaneous luminosity of the LHC and limitations from the ATLAS detector readout, online processing farm, and offline storage. This document discusses the operation of the ATLAS trigger system during the nominal proton-proton data collection in Run 2 with examples of special data-taking runs. Aspects of software validation, evolution of the trigger selection algorithms during Run 2, monitoring of the trigger system and data quality as well as trigger configuration are presented.

43 PARTICLE ACCELERATORS↗

Phase diagram of the hard-core Bose-Hubbard model on a checkerboard superlattice

We obtain the complete phase diagram of the hard-core Bose-Hubbard model in the presence of a period-two superlattice in two and three dimensions. First we acquire the phase boundaries between the superfluid phase and the 'trivial' insulating phases of the model (the completely-empty and completely-filled lattices) analytically. Next, the boundary between the superfluid phase and the half-filled Mott-insulating phase is obtained numerically, using the stochastic series expansion algorithm followed by finite-size scaling. We also compare our numerical results against the predictions of several approximation schemes, including two mean-field approaches and a fourth-order strong-coupling expansion, where we show that the latter method in particular is successful in producing an accurate picture of the phase diagram. Finally, we examine the extent to which several approximation schemes, such as the random phase approximation and the strong-coupling expansion, give an accurate description of the momentum distribution of the bosons inside the insulating phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗

FLC Nomination: Stephen R. Lee

STEM Mentorship Award: Given to an individual who may or may not be a direct employee of a government laboratory or facility in the Mid Continent Region, but has demonstrated exceptional character, mentorship, and creativity in the areas of science and math or by promoting the development of young people in grades K-12 or higher in technical career fields. Contributions must be unique and show measurable benefit to the laboratory, school system/students and must have occurred within the past three calendar years. Stephen R. Lee is the division leader of the Computer, Computational, and Statistical Sciences Division (CCS) at Los Alamos National Laboratory (LANL or the Laboratory). He holds a Bachelor of Science in Physics from New Mexico State University and a Master of Science in Physics from Kansas State University and began his 27-year career at the Laboratory in 1986. As division leader of CCS, Stephen is responsible for the management and oversight of CCS and all of its activities, as well as approximately 200 technical staff engaged in computer and computational, and statistical sciences. His experience and interests include computational algorithm development for largescale parallel computing (peta-scale and beyond), predictive simulations for nuclear weapons, simulation capabilities for non-nuclear weapons applications such as bioscience, homeland defense, nanotechnology, advanced computational platform research and development.

97 MATHEMATICS AND COMPUTING↗

L-BFGS Class Implementation in C++

This report presents a header-only C++ class implementation of the Limited-memory BroydenFletcher-Goldfarb-Shanno (L-BFGS) algorithm. The L-BFGS method is a general purpose quasi-Netwon optimization method that builds an approximation of the descent direction from consecutive iterate and gradient vectors. The limited-memory aspect stems from the replacement of the N × N approximation matrix of the original BFGS method with M vectors of length N. An example usage of the class is included along with the reference source code.

97 MATHEMATICS AND COMPUTING↗

Design and Manufacturing of High Performance, Reduced Charge Heat Exchangers

Air-to-fluid heat exchangers (HXs) play a critical role as the main heat transfer component in Heating, Ventilation, Air-Conditioning, and Refrigeration (HVAC&R) systems. However, their airside thermal resistance significantly inhibits their overall performance. Furthermore, these HXs must be continually more compact to meet the latest refrigerant charge limits to reduce emissions. Recent literature suggests that traditional HX geometries (e.g., round or flat tubes with fins), have reached their limits, and more sophisticated shape- and topology-optimized designs are required to achieve the next jump in performance. This research sheds light on the next generation of air-to-refrigerant HXs and aims to address several practical issues to commercialization such as novelty challenges (improved performance for significant charge reduction; modeling expertise & time investment), manufacturing challenges (non-round tube manufacturing; tube-header integration; product qualification, e.g., burst pressure testing, extreme operational environment, etc.), and operational challenges (flow maldistribution, fouling & wetting, noise & vibration). For example, a >20% improvement on one (or more) HX-level performance metrics (e.g., envelope volume, airside pressure drop, face area, capacity, refrigerant charge, weight, cost, etc.) must be achieved before a HX design is considered for commercialization. We present a new, comprehensive and experimentally validated air-to-refrigerant HX optimization framework with simultaneous thermal-hydraulic performance and mechanical strength considerations for novel, non-round, shape- and topology-optimized tubes capable of optimizing single and two-phase HX designs for any refrigerant choice and performance requirement with significant engineering time savings compared to conventional design practices. The framework was exercised for a wide range of applications and refrigerants, resulting in HXs which achieved greater than 20% improved performance, 20% reductions in size, and 25% reductions in refrigerant charge. To enable non-round tube bundle use in next generation HVAC&R equipment, novel manufacturing techniques were investigated, including the development of conventional manufacturing methods for small diameter, non-round tubes and novel tube-header integration strategies. In total, ten HX prototypes were manufactured, nine using conventional methods directly attributed to this project and one using advanced additive manufacturing methods. The five-year manufacturing feasibility of the proposed HXs was found to have a good outlook. The non-round tube HX simulated performance was validated through comprehensive experimental testing, including nine in-house component-level tests, one independent component-level test at an industry partner laboratory, and in-house system-level tests of using a commercially-available, residential packaged A/C unit which was retrofitted with a non-round tube prototype HX. It was found that HX designs proposed by the new framework can successfully predict experimental thermal-hydraulic performance within ±10-20% the first time with no manual design changes, eliminating the need for time-consuming and expensive prototyping efforts. This work will accelerate design and time to market for next generation HXs while simultaneously facilitating industry transition to new refrigerants at lower charge.

42 ENGINEERING↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

QUEST: QUantum Electron Simulation Toolbox

QUEST is a part of the SciDAC project on next generation multi-scale quantum simulation software for strongly correlated materials. It is a Fortran 90/95 package that implements the determinant quantum Monte Carlo (DQMC) method for simulation of magnetic, superconducting, and metal-insulator transitions in model Hamiltonians. In this paper, we show how QUEST is capable of treating lattices of unprecedentedly large sizes and how this can be fruitful in the study of the physics of trapped fermionic system, in the development of more efficient solvers for Dynamical Mean Field Theory (DMFT) and as a tool to test and, in the future, improve diagrammatic approaches such as the Parquet approximation. We will also present a range of synergistic activities on the development of stable and robust numerical algorithms and hybrid granularity parallelization scheme that combines algorithmic and implementation techniques to high-performance DQMC simulation. The work reported here is a key step forward in achieving the goals of our SciDAC project.

97 MATHEMATICS AND COMPUTING↗

Fourier analysis of cell-wise Block-Jacobi splitting in two-dimensional geometry

A Fourier analysis is conducted in two-dimensional (2D) geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) using the cell-wise Block-Jacobi (B1) algorithm. The results of the Fourier analysis show that convergence of cell-wise BJ can degrade, leading to a spectral radius equal to 1, in problems containing optically thin cells. For problems containing cells that are optically thick, instead, the spectral radius tends to O. Hence, in the optically thick-cell regime, cell-wise BJ is rapidly convergent even for problems that are scattering dominated, with a scattering ratio c close to I.

97 MATHEMATICS AND COMPUTING↗

Technical Note: Improving the VMERGE treatment planning algorithm for rotational radiotherapy

Purpose: The authors revisit the VMERGE treatment planning algorithm by Craft et al. [“Multicriteria VMAT optimization,” Med. Phys. 39, 686–696 (2012)] for arc therapy planning and propose two changes to the method that are aimed at improving the achieved trade-off between treatment time and plan quality at little additional planning time cost, while retaining other desirable properties of the original algorithm. Methods: The original VMERGE algorithm first computes an “ideal,” high quality but also highly time consuming treatment plan that irradiates the patient from all possible angles in a fine angular grid with a highly modulated beam and then makes this plan deliverable within practical treatment time by an iterative fluence map merging and sequencing algorithm. We propose two changes to this method. First, we regularize the ideal plan obtained in the first step by adding an explicit constraint on treatment time. Second, we propose a different merging criterion that comprises of identifying and merging adjacent maps whose merging results in the least degradation of radiation dose. Results: The effect of both suggested modifications is evaluated individually and jointly on clinical prostate and paraspinal cases. Details of the two cases are reported. Conclusions: In the authors’ computational study they found that both proposed modifications, especially the regularization, yield noticeably improved treatment plans for the same treatment times than what can be obtained using the original VMERGE method. The resulting plans match the quality of 20-beam step-and-shoot IMRT plans with a delivery time of approximately 2 min.

60 APPLIED LIFE SCIENCES↗

SU-E-J-195: Quantification of Rotations and Deformations in Head and Heck Radiotherapy

Purpose: To quantify the magnitude of patient rotations and deformations over the course of head and neck radiotherapy. Methods: 45 CBCT images acquired weekly were selected retrospectively from 5 head and neck cancer patients. CBCT images were registered to the corresponding planning CT images using translation, rigid-body, and cubic B-spline deformable transformations. Elastix ( elastix.isi.uu.nl ), an open-source public domain registration algorithm, was used for all registrations with mutual information as similarity metric and gradient descent as optimization. Four-level multiresolution approach was employed with 2 cm B-spline grid spacing at the finest resolution. Registration qualities were visually verified. Rotational occurrences were quantified from the rigid-body registrations. The magnitude of deformations in planning target volumes (PTV) and organs were quantified from the deformation vector fields with rigid registrations as baseline. Results: The measured rotations (mean±std) were 1.0±1.0 deg, - 0.3±1.0 deg, and 0.1±0.8 deg in the sagittal, coronal, and axial plains respectively. The estimated magnitudes of deformations (mean±std) were 3.4±2.1 mm for PTVs, 2.9±1.2 mm for parotid glands, 2.8±1.2 mm for mandible, and 2.2±1.1 mm for spinal cord. The overall deformation in the body contour was 4.3±4.3 mm. The organ spatial deviation due to rotation was small and approximately 8.4% of that from deformations. Results varied among patients. Conclusion: Rotations occurred about 1.0 deg (1SD) in the H'N area. Daily geometric deviation of target volumes was considerable and mainly from tissue deformation than rotations. Proper safety margin is necessary for adequate target coverage. Online plan adaptation may mitigate the daily differences between the plan and actual patient poses. Partially supported by a grant from Varian Medical Systems, Palo Alto, CA.

60 APPLIED LIFE SCIENCES↗

Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivity, and coherence times, a quantum circuit optimization is essential to make the best use of near-term quantum devices. We introduce a new circuit optimizer called AQCEL, which aims to remove redundant controlled operations from controlled gates, depending on initial states of the circuit. Especially, the AQCEL can remove unnecessary qubit controls from multi-controlled gates in polynomial computational resources, even when all the relevant qubits are entangled, by identifying zero-amplitude computational basis states using a quantum computer. As a benchmark, the AQCEL is deployed on a quantum algorithm designed to model final state radiation in high energy physics. For this benchmark, we have demonstrated that the AQCEL-optimized circuit can produce equivalent final states with much smaller number of gates. Moreover, when deploying AQCEL with a noisy intermediate scale quantum computer, it efficiently produces a quantum circuit that approximates the original circuit with high fidelity by truncating low-amplitude computational basis states below certain thresholds. Our technique is useful for a wide variety of quantum algorithms, opening up new possibilities to further simplify quantum circuits to be more effective for real devices.

97 MATHEMATICS AND COMPUTING↗

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗