Search NASA⌕ Search

SEARCH · Search NASA

Results for “compute intensive problems”

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 325 records · Page 18

Combustion machine learning: Principles, progress and prospects

Progress in combustion science and engineering has led to the generation of large amounts of data from large-scale simulations, high-resolution experiments, and sensors. This corpus of data offers enormous opportunities for extracting new knowledge and insights—if harnessed effectively. Machine learning (ML) techniques have demonstrated remarkable success in data analytics, thus offering a new paradigm for data-intense analyses and scientific investigations through combustion machine learning (CombML). While data-driven methods are utilized in various combustion areas, recent advances in algorithmic developments, the accessibility of open-source software libraries, the availability of computational resources, and the abundance of data have together rendered ML techniques ubiquitous in scientific analysis and engineering. This article examines ML techniques for applications in combustion science and engineering. Starting with a review of sources of data, data-driven techniques, and concepts, we examine supervised, unsupervised, and semi-supervised ML methods. Various combustion examples are considered to illustrate and to evaluate these methods. Next, we review past and recent applications of ML approaches to problems in combustion, spanning fundamental combustion investigations, propulsion and energy-conversion systems, and fire and explosion hazards. Challenges unique to CombML are discussed and further opportunities are identified, focusing on interpretability, uncertainty quantification, robustness, consistency, creation and curation of benchmark data, and the augmentation of ML methods with prior combustion-domain knowledge.

33 ADVANCED PROPULSION SYSTEMS↗

Attractor comparisons based on density

Recognizing a chaotic attractor can be seen as a problem in pattern recognition. Some feature vector must be extracted from the attractor and used to compare to other attractors. The field of machine learning has many methods for extracting feature vectors, including clustering methods, decision trees, support vector machines, and many others. In this work, feature vectors are created by representing the attractor as a density in phase space and creating polynomials based on this density. Density is useful in itself because it is a one dimensional function of phase space position, but representing an attractor as a density is also a way to reduce the size of a large data set before analyzing it with graph theory methods, which can be computationally intensive. The density computation in this paper is also fast to execute. In this paper, as a demonstration of the usefulness of density, the density is used directly to construct phase space polynomials for comparing attractors. Comparisons between attractors could be useful for tracking changes in an experiment when the underlying equations are too complicated for vector field modeling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application and Evaluation of Surrogate Models for Radiation Source Search

Surrogate models are increasingly required for applications in which first-principles simulation models are prohibitively expensive to employ for uncertainty analysis, design, or control. They can also be used to approximate models whose discontinuous derivatives preclude the use of gradient-based optimization or data assimilation algorithms. We consider the problem of inferring the 2D location and intensity of a radiation source in an urban environment using a ray-tracing model based on Boltzmann transport theory. Whereas the code implementing this model is relatively efficient, extension to 3D Monte Carlo transport simulations precludes subsequent Bayesian inference to infer source locations, which typically requires thousands to millions of simulations. Additionally, the resulting likelihood exhibits discontinuous derivatives due to the presence of buildings. To address these issues, we discuss the construction of surrogate models for optimization, Bayesian inference, and uncertainty propagation. Specifically, we consider surrogate models based on Legendre polynomials, multivariate adaptive regression splines, radial basis functions, Gaussian processes, and neural networks. We detail strategies for computing training points and discuss the merits and deficits of each method.

Cook, Jared A.↗

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs, because of three challenges: (1) difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based in sparse linear algebra, which will allow graph algorithms to be expressed in a performant, succinct, composable and portable manner. In this paper, we examine the performance challenges of a linear algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity, which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in "GraphBLAST", the first open-source linear algebra-based graph framework on GPU targeting high-performance computing. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

97 MATHEMATICS AND COMPUTING↗

A mathematical framework for thermodynamic computing with applications to chemical reaction networks

The widespread adoption of energy-intensive computing applications has led to a growing need for energy-efficient computing approaches. Thermodynamic computing offers a promising approach for low-energy computation by leveraging the intrinsic computational capabilities of physical, chemical, or biological systems. However, the mathematical foundations of thermodynamic computing require further development to fully realize the potential energy efficiencies, as well as to assess factors like noise and operational speed. In this paper, we establish a mathematical framework for utilizing thermodynamic processes to perform fundamental operations, including addition, subtraction, multiplication, and division. We highlight the use of chemical reactions as potential computational units and explore synthetic chemical and biochemical systems as practical implementations. Additionally, we demonstrate how these principles can be applied to solving complex mathematical problems, such as ordinary differential equations (ODEs) and suggest the necessary components to implement the thermodynamic computing framework using chemical reactions based in a microfluidic device. This work enhances our understanding of thermodynamic processes for natural computing as a basis for scalable, energy-efficient computation in paradigm disruptive next-generation systems.

Cannon, William R. [Pacific Northwest National Lab↗

TURBULENT CLUSTERING OF PROTOPLANETARY DUST AND PLANETESIMAL FORMATION

We study the clustering of inertial particles in turbulent flows and discuss its applications to dust particles in protoplanetary disks. Using numerical simulations, we compute the radial distribution function (RDF), which measures the probability of finding particle pairs at given distances, and the probability density function of the particle concentration. The clustering statistics depend on the Stokes number, St, defined as the ratio of the particle friction timescale, {tau}{sub p}, to the Kolmogorov timescale in the flow. In agreement with previous studies, we find that, in the dissipation range, the clustering intensity strongly peaks at St {approx_equal} 1, and the RDF for St {approx} 1 shows a fast power-law increase toward small scales, suggesting that turbulent clustering may considerably enhance the particle collision rate. Clustering at inertial-range scales is of particular interest to the problem of planetesimal formation. At these large scales, the strongest clustering is from particles with {tau}{sub p} in the inertial range. Clustering of these particles occurs primarily around a scale where the eddy turnover time is {approx}{tau}{sub p}. We find that particles of different sizes tend to cluster at different locations, leading to flat RDFs between different particles at small scales. In the presence of multiple particle sizes, the overall clustering strength decreases as the particle size distribution broadens. We discuss particle clustering in two recent models for planetesimal formation. We argue that, in the model based on turbulent clustering of chondrule-size particles, the probability of finding strong clusters that can seed planetesimals may have been significantly overestimated. We discuss various clustering mechanisms in simulations of planetesimal formation by gravitational collapse of dense clumps of meter-size particles, in particular the contribution from turbulent clustering due to the limited numerical resolution.

79 ASTRONOMY AND ASTROPHYSICS↗

Generalized Kapchinskij-Vladimirskij Distribution and Envelope Equation for High-Intensity Beams in a Coupled Transverse Focusing Lattice

In an uncoupled lattice, the Kapchinskij-Vladimirskij (KV) distribution function first analyzed in 1959 is the only known exact solution of the nonlinear Vlasov-Maxwell equations for high-intensity beams including self-fields in a self-consistent manner. The KV solution is generalized here to high-intensity beams in a coupled transverse lattice using the recently developed generalized Courant-Snyder invariant for coupled transverse dynamics. This solution projects to a rotating, pulsating elliptical beam in transverse configuration space, determined by the generalized matrix envelope equation.

97 MATHEMATICS AND COMPUTING↗

CAT: computer aided triage improving upon the Bayes risk through ε-refusal triage rules

Manual extraction of information from electronic pathology (epath) reports to populate the Surveillance, Epidemiology, and End Result (SEER) database is labor intensive. Systematizing the data extraction automatically using machine-learning (ML) and natural language processing (NLP) is desirable to reduce the human labor required to populate the SEER database and to improve the timeliness of the data. This enables scaling up registry efficiency and collection of new data elements. To ensure the integrity, quality, and continuity of the SEER data, the misclassification error of ML and NPL algorithms needs to be negligible. Current algorithms fail to achieve the precision of human experts who can bring additional information in their assessments. Differences in registry format and the desire to develop a common information extraction platform further complicate the ML/NLP tasks. The purpose of our study is to develop triage rules to partially automate registry workflow to improve the precision of the auto-extracted information. This paper presents a mathematical framework to improve the precision of a classifier beyond that of the Bayes classifier by selectively classifying item that are most likely to be correct. This results in a triage rule that only classifies a subset of the item. We characterize the optimal triage rule and demonstrate its usefulness in the problem of classifying cancer site from electronic pathology reports to achieve a desired precision. From the mathematical formalism, we propose a heuristic estimate for triage rule based on post-processing the soft-max output from standard machine learning algorithms. We show, in test cases, that the triage rule significantly improve the classification accuracy.

60 APPLIED LIFE SCIENCES↗

Towards a Predictive Thermodynamic Model of Oxidation States of Uranium Incorporated in Fe (hydr) oxides

The theoretical research in this project has been directed toward the interpretation of core-level spectroscopies for systems relevant to the project. For the initial efforts, the focus of our theoretical simulations has been the interpretation of laboratory and synchrotron X-Ray Photoemission Spectra, XPS. In more recent efforts, an increasing emphasis has been placed on developing transparent understandings of X-Ray Adsorption Spectra, XAS . For the XAS, the principal concern is for the near-edge features, either just below or just above, an ionization limit or edge, which are described as Near-Edge X-Ray Adsorption Fine Structure, NEXAFS. In particular, a priority has involved the analysis and interpretation of XPS and NEXAFS spectra, especially of Fe and U systems, as measured by our PNNL collaborators. The overall objective of our theoretical studies is to establish connections between features of the spectra and their origin in the electronic structure of the materials. The efforts for the analysis of XPS have been reviewed in a paper by the PI, C. J. Nelin, and E. S. Ilton from PNNL on “The interpretation of XPS spectra: Insights into materials properties”, Surf. Sci. Reports, 68, 273 (2013). Two materials properties of special interest have been the degree of ionicity and the character of the covalent bonding in a range of oxides formed with transition metal, lanthanide, and actinide cations. Since the systems treated have electrons in open shells, it has been necessary to determine the energetics and the character of the angular momentum coupling of the open shell electrons. In particular, we have established methods for the treatment of the “intermediate coupling” which arises when the system is between the limit of Russell-Saunders multiplets, and the limit of j-j coupling where the spin-orbit splittings of single electrons dominate. A recent paper by the PI, and M. J. Sassi, and K. M. Rosso, (both at PNNL) “Intermediate Coupling For Core-Level Excited States: Consequences For X-Ray Absorption Spectroscopy”, J. Elec. Spectros. and Related Phenom., 200, 174 (2015) describes our first application of these methods. As well as applications to problems and materials of direct interest for our PNNL colleagues, we have pursued applications of fundamental theoretical significance for the analysis and interpretation of XPS and XAS spectra. These studies are important for the development of the fields of core-level spectroscopies as well as to advance our capabilities for applications of interest to our PNNL colleagues. An excellent example is our study of the surface core-level shifts, SCLS, for the surface and bulk atoms of an oxide that provides a new approach to understanding how the surface electronic of oxides differs from that in the bulk of the material. This work has the potential to lead to a new key to understanding the reactivity of oxide surfaces. Our theoretical studies use cluster models with finite numbers of atoms to describe the properties of condensed phases and crystals. This approach has allowed us to focus on the local atomistic, chemical interactions. For these clusters, we obtain orbitals and spinors through the solution of the Hartree-Fock, HF, and the fully relativistic Dirac HF equations. These orbitals are used to form configuration mixing wavefunctions which treat the many-body effects responsible for the open shell angular momentum coupling and for the satellites of the core-level spectra. Our efforts have been in two complementary directions. As well as the applications described above, we have placed major emphasis on the enhancement and extension of our theoretical and computational capabilities so that we can treat complex systems with a greater range of many-body effects. Noteworthy accomplishments in terms of method development and enhancement have included: (1) An improvement in our treatment of the large matrices that must be handled when many-body effects are treated. (2) Improvements and extensions of our capabilities for the calculation of the intensities of XPS and XAS transitions. And (3) ongoing development of flexible programs for the visualization of the theoretical spectra so that they can be compared with experiment. Our efforts on applications and methodology for these and related topics will continue under a sub-contract to PNNL.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Stationary self-focusing of intense laser beam in cold quantum plasma using ramp density profile

By using a transient density profile, we have demonstrated stationary self-focusing of an electromagnetic Gaussian beam in cold quantum plasma. The paper is devoted to the prospects of using upward increasing ramp density profile of an inhomogeneous nonlinear medium with quantum effects in self-focusing mechanism of high intense laser beam. We have found that the upward ramp density profile in addition to quantum effects causes much higher oscillation and better focusing of laser beam in cold quantum plasma in comparison to that in the classical relativistic case. Our computational results reveal the importance and influence of formation of electron density profiles in enhancing laser self-focusing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A comparative study of shear band tracking strategies in three-dimensional finite elements with embedded weak discontinuities

We present a computational framework for the treatment of shear localization in metallic materials under dynamic loading, based on the integration of a shear band tracking strategy into an explicit 3D finite element formulation with embedded weak discontinuities. Within this computational framework, an embedded shear band’s mid-surface is represented by an iso-surface of a level set function, which is obtained by solving a heatconduction type boundary value problem (BVP). The solution of this BVP is carried out either globally over the entire problem domain, or locally at the level of individual elements in the mesh. In this paper, we present a detailed comparison of these global and local algorithmic implementations of the shear band tracking strategy. Numerical results obtained using these two implementations, and using a simplified formulation without shear band tracking, are presented and compared. Moreover, we compare the computational efficiency and parallel scaling performance of the local and global implementations. This comparative study shows that both implementations can simulate the initiation of two independent shear bands and their propagation past each other without merging, whereas only the global implementation can successfully simulate the merging of two branches of a single shear band. This study also confirms that the global implementation is more computationally intensive, since it requires a global system of linear equations associated with the level set BVP to be solved at each time step. Both implementations exhibit very good scalability in domain decomposition-based parallel simulations.

36 MATERIALS SCIENCE↗

Multi-fidelity uncertainty quantification strategies for large-scale multiphysics applications: PSAAP II particle-based solar energy receiver

The study of complex systems is often based on computationally intensive, high-fidelity, simulations. To build confidence or improve the prediction accuracy of such simulations, the impact of uncertainties in model inputs, or even the structure of the models, on the quantities of interest must be measured. This, however, requires a computational budget that is a possibly large multiple of the cost of a single simulation, and thus may become infeasible for expensive simulation models featuring a large number of uncertain inputs and highly non-linear behavior. Therefore, this work explores multi-fidelity strategies to accelerate the estimation of the effect of uncertainties. The main idea behind multi-fidelity methods is to utilize cheaper, lower-fidelity models – than the intended high-fidelity, expensive model of the problem – to generate a baseline solution that together with relatively small number of high-fidelity simulations can lead to accurate predictions. The methods are briefly presented, and their performance assessed on an irradiated particle-laden turbulent flow case related to Stanford’s PSAAP II particle-based solar energy receiver.

Physics↗

Upgrade of the Minos+ Experiment Data Acquisition for the High Energy NuMI Beam Run

The Minos+ experiment is an extension of the Minos experiment at a higher energy and more intense neutrino beam, with the data collection having begun in the fall of 2013. The neutrino beam is provided by the Neutrinos from the Main Injector (NuMI) beam-line at Fermi National Accelerator Laboratory (Fermilab). The detector apparatus consists of two main detectors, one underground at Fermilab and the other in Soudan, Minnesota with the purpose of studying neutrino oscillations at a base line of 735 km. The original data acquisition system has been running for several years collecting data from NuMI, but with the extended run from 2013, parts of the system needed to be replaced due to obsolescence, reliability problems, and data throughput limitations. Specifically, we have replaced the front-end readout controllers, event builder, and data acquisition computing and trigger processing farms with modern, modular and reliable devices with few single points of failure. The new system is based on gigabit Ethernet TCP/IP communication to implement the event building and concatenation of data from many front-end VME readout crates. The simplicity and partitionability of the new system greatly eases the debugging and diagnosing process. As a result, the new system improves throughput by about a factor of three compared to the old system, up to 800 megabits per second, and has proven robust and reliable in the current run.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Analysis of Tight Junction Formation and Integrity

In this paper, we study segmentation of tight junctions and analyze the formation and integrity of tight junctions in large-scale confocal image stacks, a challenging biological problem because of the low spatial resolution images and the presence of breaks in tight junction structure. We present an automated, three-step processing approach for tight junction analysis. In our approach, we first localize each individual nucleus in the image by using thresholding, morphological filters and active contours. By using each nucleus position as a seed point, we automatically segment the cell body based on the active contour. We then use an intensity-based skeletonization algorithm to generate the boundary regions for each cell, and features are extracted from tight junctions associated with each cell to assess tight junction continuity. Based on qualitative results and quantitative comparisons, we show that we are able to automatically segment tight junctions and compute relevant features that provide a quantitative measure of tight junction formation to which the permeability of the cell monolayer can ultimately be correlated.

Karakaya, Mahmut↗

Multidimensional Simulations of Core Convection

The cores of main sequence intermediate- and high-mass stars are convective. Mixing at the radiative–convective boundary, waves excited by the convection, and magnetic fields generated by convective dynamos all influence the main sequence and post-main sequence evolution of these stars. These effects must be understood to accurately model the structure and evolution of intermediate- and high-mass stars. Unfortunately, there are many challenges in simulating core convection due to the wide range of temporal and spatial scales, as well as many important physics effects. In this review, we describe the latest numerical strategies to address these challenges. We then describe the latest state-of-the-art simulations of core convection, summarizing their main findings. These simulations have led to important insights into many of the processes associated with core convection. Two outstanding problems with multidimensional simulations are, 1. it is not always straightforward to extrapolate from simulation parameters to the parameters of real stars; and 2. simulations using different methods sometimes appear to arrive at contradictory results. To address these issues, next generation simulations of core convection must address how their results depend on stellar luminosity, dimensionality, and turbulence intensity. Furthermore, code comparison projects will be essential to establish robust parameterizations that will become the new standard in stellar modeling.

79 ASTRONOMY AND ASTROPHYSICS↗

Effective Software Design and Development for the New Graph Architecture HPC Machines

Software applications need to change and adapt as modern architectures evolve. Nowadays advancement in chip design translates to increased parallelism. Exploiting such parallelism is a major challenge in modern software engineering. Multicore processors are about to introduce a significant change in the way we design and use fundamental data structures. In this work we describe the design and programming principles of a software library of highly concurrent scalable and nonblocking data containers. In this project we have created algorithms and data structures for handling fundamental computations in massively multithreaded contexts, and we have incorporated these into a usable library with familiar look and feel. In this work we demonstrate the first design and implementation of a wait-free hash table. Our multiprocessor data structure design allows a large number of threads to concurrently insert, remove, and retrieve information. Non-blocking designs alleviate the problems traditionally associated with the use of mutual exclusion, such as bottlenecks and thread-safety. Lock-freedom provides the ability to share data without some of the drawbacks associated with locks, however, these designs remain susceptible to starvation. Furthermore, wait-freedom provides all of the benefits of lock-free synchronization with the added assurance that every thread makes progress in a finite number of steps. This implies deadlock-freedom, livelock-freedom, starvation-freedom, freedom from priority inversion, and thread-safety. The challenges of providing the desirable progress and correctness guarantees of wait-free objects makes their design and implementation difficult. There are few wait-free data structures described in the literature. Using only standard atomic operations provided by the hardware, our design is portable; therefore, it is applicable to a variety of data-intensive applications including the domains of embedded systems and supercomputers.Our experimental evaluation shows that our hash table design outperforms the most advanced locking solution, provided by Intel's TBB library, by 22%. When compared to more traditional locking designs we show a performance improvement by a factor of 7.92. When compared to alternative non-blocking designs, our hash table demonstrates solid performance gains in a large majority of cases, typically by a factor of 3.44.

99 GENERAL AND MISCELLANEOUS↗

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SU-F-BRD-13: Quantum Annealing Applied to IMRT Beamlet Intensity Optimization

Purpose: We report on the first application of quantum annealing (QA) to the process of beamlet intensity optimization for IMRT. QA is a new technology, which employs novel hardware and software techniques to address various discrete optimization problems in many fields. Methods: We apply the D-Wave Inc. proprietary hardware, which natively exploits quantum mechanical effects for improved optimization. The new QA algorithm, running on this hardware, is most similar to simulated annealing, but relies on natural processes to directly minimize the free energy of a system. A simple quantum system is slowly evolved into a classical system, representing the objective function. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitation of ∼500 binary variables. The beamlet dose matrices were computed using CERR, and an objective function was defined based on typical clinical constraints, including dose-volume objectives. The objective function was discretized, and the QA method was compared to two standard optimization Methods: simulated annealing and Tabu search, run on a conventional computing cluster. Results: Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the SA. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu, and 22.9 for the SA. The QA algorithm required 27–38% of the time required by the other two methods. Conclusion: In terms of objective function value, the QA performance was similar to Tabu but less effective than the SA. However, its speed was 3–4 times faster than the other two methods. This initial experiment suggests that QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.

07 ISOTOPE AND RADIATION SOURCES↗