Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Simulated annealing”

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 55 records · Page 3

A minimum assumption approach to MEG sensor array design

Objective. Our objective is to formulate the problem of the magnetoencephalographic (MEG) sensor array design as a well-posed engineering problem of accurately measuring the neuronal magnetic fields. This is in contrast to the traditional approach that formulates the sensor array design problem in terms of neurobiological interpretability the sensor array measurements. Approach. We use the vector spherical harmonics (VSH) formalism to define a figure-of-merit for an MEG sensor array. We start with an observation that, under certain reasonable assumptions, any array of m perfectly noiseless sensors will attain exactly the same performance, regardless of the sensors' locations and orientations (with the exception of a negligible set of singularly bad sensor configurations). We proceed to the conclusion that under the aforementioned assumptions, the only difference between different array configurations is the effect of (sensor) noise on their performance. We then propose a figure-of-merit that quantifies, with a single number, how much the sensor array in question amplifies the sensor noise. Main results. We derive a formula for intuitively meaningful, yet mathematically rigorous figure-of-merit that summarizes how desirable a particular sensor array design is. We demonstrate that this figure-of-merit is well-behaved enough to be used as a cost function for a general-purpose nonlinear optimization methods such as simulated annealing. We also show that sensor array configurations obtained by such optimizations exhibit properties that are typically expected of 'high-quality' MEG sensor arrays, e.g. high channel information capacity. Significance. Our work paves the way toward designing better MEG sensor arrays by isolating the engineering problem of measuring the neuromagnetic fields out of the bigger problem of studying brain function through neuromagnetic measurements.

60 APPLIED LIFE SCIENCES↗

Spin-orbital liquids and insulator-metal transitions on the pyrochlore lattice

The two orbital Hubbard model, with the electrons additionally coupled to a complex magnetic background, arises in the pyrochlore molybdates. The background involves local moments Hund's coupled to the electrons, driving double exchange ferromagnetism, and antiferromagnetic (AF) tendency arising from competing superexchange. The key scales include the Hubbard repulsion and the superexchange, both of which can be tuned in these materials. They control the phase transition from a ferromagnetic metal to a spin glass metal and then to a spin glass (Mott) insulator. We provide a comprehensive description of the ground state of this model using an unrestricted Hartree-Fock scheme implemented via a simulated annealing procedure and establish the metal-insulator transition line for varying Hubbard interaction and superexchange. The electrons see an effective disorder, due to orbital frustration, already in the ferromagnetic phase. The disorder is further enhanced by antiferromagnetic coupling and the resulting magnetic disorder. As a result, increasing AF coupling shifts the metal-insulator transition to lower Hubbard interaction and gives it an additional "Anderson" character. In conclusion, we provide detailed results on the magnetic and orbital correlations, the density of states, and the optical conductivity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum optimization of maximum independent set using Rydberg atom arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Science & Technology - Other Topics↗

ML-PSA

The computer code uses a parallel simulated annealing framework with embedded machine learning components to solve multi-constrained optimization problems. The software automatically balances the execution of low and high fidelity physics models within the optimization procedure. The low fidelity model is used to rapidly explore the design space while the high fidelity physics model is executed sparingly to account for complex design constraints that are not resolved by the quickly executing low fidelity model.

Gurecky, William↗

PWR loading pattern optimization with reinforcement learning

The core loading pattern optimization problem belongs to the class of combinatorial optimization problem and has been studied since the dawn of commercial nuclear energy industry. It is characterized by multiple objectives and constraints, with a very high number of candidate patterns, which makes it impossible to solve explicitly. Stochastic optimization methodologies including Genetic Algorithms and Simulated Annealing are used by different nuclear utilities and vendors to perform fuel cycle reload design. Nevertheless, hand-designed solutions continue to be the prevalent method in the industry. To improve the state-of-the-art core reload patterns, we aim to create a method as scalable as possible, that agrees with the designer's goal of performance and safety. To help in this task Deep Reinforcement Learning (DRL), in particular Proximal Policy Optimization is leveraged. DRL has recently experienced a strong impetus from its successes applied to games, sometimes even reaching 'super-human' performances. This paper lays out the foundation of this method and proposes to study the behavior of several hyper-parameters that influence the DRL algorithm. The algorithm is highly dependent on multiple factors such as an exploration/exploitation trade-off that manifests through different parameters such as the number of loading patterns seen and the number of samples collected before a policy update, but also the shape of the objective function derived for the core design. Experimental results also demonstrate the effectiveness of the method in finding high-quality solutions from scratch within a reasonable amount of time. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Hybrid Method for Tensor Decompositions that Leverages Stochastic and Deterministic Optimization

In this paper, we propose a hybrid method that uses stochastic and deterministic search to compute the maximum likelihood estimator of a low-rank count tensor with Poisson loss via state-of-theart local methods. Our approach is inspired by Simulated Annealing for global optimization and allows for fine-grain parameter tuning as well as adaptive updates to algorithm parameters. We present numerical results that indicate our hybrid approach can compute better approximations to the maximum likelihood estimator with less computation than the state-of-the-art methods by themselves.

97 MATHEMATICS AND COMPUTING↗

ARENA: Adversary-Resistant Evolving Neural Architectures

Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.

97 MATHEMATICS AND COMPUTING↗

Stacked networks improve physics-informed training: Applications to neural networks and deep operator networks

Physics-informed neural networks and operator networks have shown promise for effectively solving equations modeling physical systems. However, these networks can happen to be difficult or impossible to train accurately. Here, we present a novel multifidelity framework for stacking physics-informed neural networks and operator networks that facilitates training. We successively build a chain of networks, where the output at one step can act as a low-fidelity input for training a longer chain, gradually increasing the expressivity of the learnt model. The equations imposed at each step of the iterative process can be the same or different (akin to simulated annealing). The iterative (stacking) nature of the proposed method allows us to learn progressively features of a solution which could have been hard to learn directly. Through benchmark problems including a nonlinear pendulum, the wave equation, and the viscous Burgers equation, we show how stacking can be used to improve the accuracy and reduce the required size of physics-informed neural networks and operator networks.

97 MATHEMATICS AND COMPUTING↗

Lossy compression of statistical data using quantum annealer

Abstract We present a new lossy compression algorithm for statistical floating-point data through a representation learning with binary variables. The algorithm finds a set of basis vectors and their binary coefficients that precisely reconstruct the original data. The optimization for the basis vectors is performed classically, while binary coefficients are retrieved through both simulated and quantum annealing for comparison. A bias correction procedure is also presented to estimate and eliminate the error and bias introduced from the inexact reconstruction of the lossy compression for statistical data analyses. The compression algorithm is demonstrated on two different datasets of lattice quantum chromodynamics simulations. The results obtained using simulated annealing show 3–3.5 times better compression performance than the algorithm based on neural-network autoencoder. Calculations using quantum annealing also show promising results, but performance is limited by the integrated control error of the quantum processing unit, which yields large uncertainties in the biases and coupling parameters. Hardware comparison is further studied between the previous generation D-Wave 2000Q and the current D-Wave Advantage system. Our study shows that the Advantage system is more likely to obtain low-energy solutions for the problems than the 2000Q.

97 MATHEMATICS AND COMPUTING↗

Three-flavor collective neutrino oscillation simulations on a qubit quantum annealer

Neutrinos are unique among elementary particles in that their flavor-compositions oscillate over time. In extreme environments such as core-collapse supernovae, neutron-star mergers, and the early Universe, neutrinos are dense enough that their self-interactions significantly affect, if not dominate, these oscillations. This has implications for several phenomena within these environments, particularly nucleosynthesis. Simulations of these self-interactions have traditionally approximated neutrinos as having two flavors instead of the physical three. In order to develop techniques for characterizing the resulting quantum entanglement, I present the results of simulations of neutrino-neutrino interactions that include all three physical neutrino flavors and were performed on D-Wave Inc.’s Advantage 5000+ qubit quantum annealer. These results are checked against those from exact classical simulations, which are also used to compare the neutrino-neutrino interactions to neutrino-antineutrino and interactions between Majorana neutrinos, which are their own antiparticles. The D-Wave Advantage annealer is shown to be able to reproduce time evolution with the precision of a classical machine for small numbers of neutrinos and to do so without the Trotter errors present in most simulations of dynamics on quantum devices. Furthermore, it suffers from poor scaling in qubit-count with the number of neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A model of thermal creep and annealing in finite domains based on coupled dislocation climb and vacancy diffusion

Here, we develop a framework to investigate thermal creep and annealing in finite domains, where the climb motion of discrete dislocations is coupled to the diffusion of a continuum vacancy field. The model is first formulated in a continuum finite-deformation setting. All governing equations and boundary conditions are obtained from a unified irreversible thermodynamics principle. The resulting model couples a mechanical boundary value problem (BVP), a vacancy diffusion BVP, and the climb and glide motion of the discrete dislocation network within the crystal. The framework is then linearized for implementation in three-dimensional (3D) discrete dislocation dynamics (DDD) simulations for arbitrary anisotropic crystals. A solution scheme is developed based on the superposition principle, which is imposed weakly on the dislocation network to obtain a Galerkin solution for the nodal climb velocities. The framework includes diffusional (Nabarro–Herring) creep deformation as well as dislocation creep by climb-assisted-glide. The method is applied to simulate the annealing of vacancy loops in Al, with good agreement to experimental measurements by Silcox and Hirsch. We further consider the effects of annealing under stress, and of the proximity of the vacancy loops to loaded and free boundaries Simulations in polycrystalline materials are carried out to highlight the effects of the grain size on dislocation climb and vacancy loop annealing. The method is also applied to estimate the creep rate due to climb-assisted glide of jogged-screw dislocations in γ-TiAl, and results are compared to experiments by Viswanathan et al. Finally, we discuss the effects of uniaxial and hydrostatic stresses on the two diffusive deformation pathways of the material, namely Nabarro–Herring creep and dislocation climb.

36 MATERIALS SCIENCE↗

Molecular dynamics on quantum annealers

Abstract In this work we demonstrate a practical prospect of using quantum annealers for simulation of molecular dynamics. A methodology developed for this goal, dubbed Quantum Differential Equations (QDE), is applied to propagate classical trajectories for the vibration of the hydrogen molecule in several regimes: nearly harmonic, highly anharmonic, and dissociative motion. The results obtained using the D-Wave 2000Q quantum annealer are all consistent and quickly converge to the analytical reference solution. Several alternative strategies for such calculations are explored and it was found that the most accurate results and the best efficiency are obtained by combining the quantum annealer with classical post-processing (greedy algorithm). Importantly, the QDE framework developed here is entirely general and can be applied to solve any system of first-order ordinary nonlinear differential equations using a quantum annealer.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum annealing for jet clustering with thrust

Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might accelerate the clustering of particles into jets. In this study, we benchmark quantum annealing strategies for jet clustering based on optimizing a quantity called “thrust” in electron-positron collision events. Here, we find that quantum annealing yields similar performance to exact classical approaches and classical heuristics, after tuning the annealing parameters. Without tuning, comparable performance can be obtained through a hybrid quantum/classical approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Degeneracy engineering for classical and quantum annealing: A case study of sparse linear regression in collider physics

Classical and quantum annealing are computing paradigms that have been proposed to solve a wide range of optimization problems. In this paper, we aim to enhance the performance of annealing algorithms by introducing the technique of degeneracy engineering, through which the relative degeneracy of the ground state is increased by modifying a subset of terms in the objective Hamiltonian. We illustrate this novel approach by applying it to the example of ℓ 0 -norm regularization for sparse linear regression, which is, in general, an NP-hard optimization problem. Specifically, we show how to cast ℓ 0 -norm regularization as a quadratic unconstrained binary optimization (QUBO) problem, suitable for implementation on annealing platforms. As a case study, we apply this QUBO formulation to energy flow polynomials in high-energy collider physics, finding that degeneracy engineering substantially improves the annealing performance. Furthermore, our results motivate the application of degeneracy engineering to a variety of regularized optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complex Dynamics in Argyrodite Solid-State Ion Conductors

Argyrodites are a compositionally diverse family of materials that exhibit remarkable ion transport properties. While the average crystal structures of argyrodites have been extensively studied, ion transport in these materials is governed by a confluence of dynamic processes spanning the cation, anion, and polyanionic sublattices. This Perspective synthesizes recent advances in understanding the role of dynamics in structural behavior and ion transport properties. We examine the compositional and structural motifs that govern order−disorder transitions within the argyrodite family and further explore how ion hopping is facilitated by lattice dynamics, from long-range phonons to local rotational dynamics of polyanionic species. Through the lens of dynamics spanning multiple time and length scales, we establish guiding principles that govern transport phenomena and highlight avenues of future study for the argyrodite family of ion conductors.

36 MATERIALS SCIENCE↗

Simultaneous stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Furthermore, solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

97 MATHEMATICS AND COMPUTING↗

Inference finds consistency between a neutrino flavor evolution model and Earth-based solar neutrino measurements

We continue examining statistical data assimilation (SDA), an inference methodology, to infer solutions to neutrino flavor evolution, for the first time using real - rather than simulated - data. The model represents neutrinos streaming from the Sun's center and undergoing a Mikheyev-Smirnov-Wolfenstein (MSW) resonance in flavor space, due to the radially-varying electron number density. The model neutrino energies are chosen to correspond to experimental bins in the Sudbury Neutrino Observatory (SNO) and Borexino experiments, which measure electron-flavor survival probability at Earth. In conclusion, the procedure successfully finds consistency between the observed fluxes and the model, if the MSW resonance - that is, flavor evolution due to solar electrons - is included in the dynamical equations representing the model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗