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 811 records · Page 45

Verification of the ENDF/B-VII.1 Based MC 2 -3 Library Rev.1

The MC 2 -3 code, developed by Argonne National Laboratory under the DOE-NE NEAMS program, is a multigroup cross section generation code for fast reactor applications. Last year, the ENDF/B-VII.0 (E70) MC 2 -3 library, which has been extensively used, verified, and validated over a long period, was intensively reverified and updated to support the commercial grade dedication (CGD) requirement of the TerraPower Natrium project. This year, the ENDF/B-VII.1 (E71) MC 2 -3 library, the preliminary version of which was generated several years ago, was regenerated and rigorously verified to support the Natrium project as well as the completion of verification of the E71 library. The E71 library was verified using the process developed during the verification of the E70 library, including comparisons of cross sections with the NJOY-generated cross sections, comparisons of the resolved resonance cross sections with those using the PEDNF library, and comparison of total cross sections with the sum of partial cross sections. Additional verifications were conducted to ensure that the benchmark problem solutions with the E71 library are reasonable compared to the corresponding Monte Carlo solutions. Furthermore, the E71 gamma library was generated, which includes data for prompt gamma, delayed gamma, and delayed beta as well as neutron and gamma heating. The gamma library was verified at the level of individual isotopes. The EBR-II core solutions from MC 2 -3/ DIF3D and MCNP were compared, demonstrating that those solutions in terms of k-effective and assembly powers were in good agreement.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Advanced Modeling of Ions in Solutions, on Surfaces, and in Biological Environments (Final Scientific/Technical Report)

The research supported by this grant focused on modeling liquid water from basic microscopic theory and on developing advanced methodologies for molecular simulation and electronic structure calculation of large and disordered systems. Water is arguably the most important molecule on earth: without it there would be no life, as we know it. Water does not behave as a simple liquid. Understanding its unique and anomalous properties at the molecular level has been the focus of intense study during the entire last century and still is a major goal of research today. To address the problem we adopted a multipronged approach that included methodological and algorithmic developments as well as simulations of important model systems. We made progress on several key issues. (i) We implemented accurate electronic structure schemes for modeling water from quantum mechanical theory that make accessible in simulations processes driven by formation and breaking of chemical bonds. We studied in this way neat bulk water and simple solvated ions. We could understand, in particular, why hydronium, i.e. the positive water ion, diffuses faster than its negative counterpart, the hydroxyl, solving a 200-year-old ionic mystery of water, as reported in a news article featuring our study on Chemistry World, the magazine of the Royal Society of Chemistry (U.K.). (ii) Using advanced statistical mechanical techniques we studied water in the deeply undercooled regime, which may hold the clue to understanding many of the water anomalies. These conditions are currently only accessible to simulations based on empirical force fields. We found that deeply undercooled water, as described by the popular force field ST2, possesses a secondary critical point, below which it would spontaneously separate into two liquids, one of low-density (LDL) and one of high-density (HDL), much in the same way in which water and oil phase-separate at room temperature. The secondary critical point is supported indirectly by many experiments, but rapid ice nucleation has so far hindered direct observation. In related studies we gained new insight on the connection of the two metastable liquids with the two corresponding amorphous ice phases, LDA and HDA, which are observed experimentally. (iii) We developed and implemented several new algorithms for computing the electronic structure of large systems and to accelerate the calculation of electron exchange energies. We applied these methodologies to model nanomaterials, such as nanoribbons and nanoflakes, and to study water absorption and splitting on nanomaterials. (iv) We developed new local order descriptors. (v) In the last year of the project we developed a methodology based on deep neural networks to construct model interatomic potentials that can accurately reproduce ab-initio quantum mechanical simulations at the computational cost of empirical force fields. These potentials will make possible to access the size and time scales that are currently only accessible with empirical force fields without loosing the predictive power of ab-initio simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Observability of localized magnetoplasmons in quantum dots: Scrutinizing the eligibility of far-infrared, Raman, and electron-energy-loss spectroscopies

We investigate a one-component, quasi-zero dimensional, quantum plasma exposed to a parabolic potential and an applied magnetic field in the symmetric gauge. If the size of such a system as can be realized in the semiconducting quantum dots is on the order of the de-Broglie wavelength, the electronic and optical properties become highly tunable. Then the quantum size effects challenge the observation of many-particle phenomena such as the magneto-optical absorption, Raman intensity, and electron energy-loss spectrum. An exact analytical solution of the problem leads us to infer that these many-particle phenomena are, in fact, dictated by the generalized Kohn’s theorem (GKT) in the long-wavelength limit. Maneuvering the confinement and/or the magnetic field furnishes the resonance energies capable of being explored with the FIR, Raman, and/or electron-energy-loss spectroscopy. This implies that either of these probes is competent in observing the localized magnetoplasmons in the system. As an application of the rigorous analytical diagnosis of the system, we have presented various pertinent single-particle, such as Fock-Darwin spectrum, Fermi energy, zigzag excitation spectrum, and magneto-optical transitions, and the many-particle phenomena, such as magneto-optical absorption, Raman intensity, and electron energy-loss probability. In the latter, the energy position of the resonance peaks is observed to be independent of the electron-electron interactions and hence of the number of electrons in the quantum dot in compliance with the GKT. It is found that both confinement potential and magnetic field play a decisive role in influencing the aforementioned many-particle phenomena. Specifically, increasing (decreasing) the strength of the confining potential is found to be analogous to shrinking (expanding) the size of the quantum dots and results into a blue (red) shift in the respective spectra. Intensifying the magnetic field has two-fold effects in the resonance spectra associated with all three spectroscopies considered here: the lower resonance peak observes a red shift, whereas the higher one experiences a blue shift. This is a unique and intriguing behavior observed in the quantum dots with complete confinement. A deeper insight into the physics of the quantum dots is paving the way for their implementation in such diverse fields as quantum computing and medical imaging.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗

Applying an improved rapid impact assessment matrix method to strategic environmental assessment of urban planning in China

Strategic environmental assessment (SEA) has become an increasingly important decision-support tool for providing information on the environmental implications of a policy, plan, or program. The goal is to safeguard the environment and promote sustainable development at the strategic level. Despite major progress in implementing SEA practices internationally, developing countries, such as China, often lag behind in applying SEA methodology. Lack of available data and time constraints arising from tight schedules create problems. The rapid impact assessment matrix (RIAM) is a potential resource for breaking through such difficulties. Our analysis of RIAM applications suggested that it could become a tool for evaluating strategic alternatives because of its applicability in interdisciplinary settings, its transparency, and its short implementation timeframe. To make it more suitable for the SEA context, we have developed two major improvements to the conventional RIAM process: assignment of weights to assessment indicators and the development of an integrated environmental assessment score (IES). The improved RIAM process was employed in an SEA of the development plan for the Nansha District in Guangzhou, the capital city of Guangdong Province in China. It was used to assess five alternatives for development in Wanqingsha (WQS), a subunit of Nansha, where important ecological resources are located and where industrial development could impact the air quality in the neighboring Hong Kong Special Administrative Region (HKSAR). The evaluation identified WQS-A04 as the preferred alternative. This alternative involved a minimal amount of industrial development – 10% compared with the most intense development alternative – and included important wetland preservation plans. The assessment results have been incorporated into the officially approved development plan for Nansha. The improved RIAM methodology is well adapted to the technical aims of SEA and decision-making structures in China. It offers the potential for delivering timely and quality results to decision-making processes. To achieve the desired efficiency, it is recommended that an SEA procedure take into account findings acquired from an improved RIAM application at an early stage, then, at a later stage, results from more comprehensive assessments conducted using more sophisticated methods should be added, if time and data are available. - Highlights: • RIAM is a potential SEA tool due to its multidisciplinary setting and rapid process. • Weighting index and computing IES are raised for improving RIAM when applied to SEAs. • The improved RIAM boosts SEA effectiveness by timely responding to decision-making. • The improved RIAM is more suitable to an SEA bothered by tight time or data shortage. • The improved RIAM adapts to the technical aims of SEA and decision features in China.

54 ENVIRONMENTAL SCIENCES↗

Simplified predictive models for CO 2 sequestration performance assessment

CO2 sequestration in deep saline formations is increasingly being considered as a viable strategy for the mitigation of greenhouse gas emissions from anthropogenic sources. In this context, detailed numerical simulation based models are routinely used to understand key processes and parameters affecting pressure propagation and buoyant plume migration following CO2 injection into the subsurface. As these models are data and computation intensive, the development of computationally-efficient alternatives to conventional numerical simulators has become an active area of research. Such simplified models can be valuable assets during preliminary CO2 injection project screening, serve as a key element of probabilistic system assessment modeling tools, and assist regulators in quickly evaluating geological storage projects. We present three strategies for the development and validation of simplified modeling approaches for CO2 sequestration in deep saline formations: (1) simplified physics-based modeling, (2) statisticallearning based modeling, and (3) reduced-order method based modeling. In the first category, a set of full-physics compositional simulations is used to develop correlations for dimensionless injectivity as a function of the slope of the CO2 fractional-flow curve, variance of layer permeability values, and the nature of vertical permeability arrangement. The same variables, along with a modified gravity number, can be used to develop a correlation for the total storage efficiency within the CO2 plume footprint. Furthermore, the dimensionless average pressure buildup after the onset of boundary effects can be correlated to dimensionless time, CO2 plume footprint, and storativity contrast between the reservoir and caprock. In the second category, statistical “proxy models” are developed using the simulation domain described previously with two approaches: (a) classical Box-Behnken experimental design with a quadratic response surface, and (b) maximin Latin Hypercube sampling (LHS) based design with a multidimensional kriging metamodel fit. For roughly the same number of simulations, the LHS-based metamodel yields a more robust predictive model, as verified by a k-fold cross-validation approach (with data split into training and test sets) as well by validation with an independent dataset. In the third category, a reduced-order modeling procedure is utilized that combines proper orthogonal decomposition (POD) for reducing problem dimensionality with trajectory-piecewise linearization (TPWL) in order to represent system response at new control settings from a limited number of training runs. Significant savings in computational time are observed with reasonable accuracy from the PODTPWL reduced-order model for both vertical and horizontal well problems – which could be important in the context of history matching, uncertainty quantification and optimization problems. The simplified physics and statistical learning based models are also validated using an uncertainty analysis framework. Reference cumulative distribution functions of key model outcomes (i.e., plume radius and reservoir pressure buildup) generated using a 97-run full-physics simulation are successfully validated against the CDF from 10,000 sample probabilistic simulations using the simplified models. The main contribution of this research project is the development and validation of a portfolio of simplified modeling approaches that will enable rapid feasibility and risk assessment for CO2 sequestration in deep saline formations.

54 ENVIRONMENTAL SCIENCES↗

2019 Budget Request for the DOE Computational Science Graduate Fellowship (CSGF) Grant

The Department of Energy Computational Science Graduate Fellowship (DOE CSGF) is necessary to meet the continual challenging national workforce needs that arise as computational science and engineering problems continue to grow in scope and complexity. Computational science and engineering (CSE) is a multidisciplinary approach that uses scientific computing to solve practical problems methods and to supply technical tools across the scientific discovery spectrum. In particular, the DOE CSGF emphasizes high-performance computing (HPC) that enables CSE that advances science and engineering in directions important to the DOE and the economy in general. Over the past half-century, HPC has been an essential tool for DOE’s success. During this period, important missions, such as nuclear stockpile stewardship, have turned to HPC as an essential technology. Entire science disciplines, such as biology and cosmology, have been transformed through the augmentation of scientific observation via HPC. At government laboratories and in industry, DOE CSGF alumni are helping push traditional HPC boundaries while contributing to discoveries in high-energy physics, renewable energy, fusion-reactor design, additive manufacturing, nanomaterials for next-generation batteries and transistors, and turbine and advanced nuclear reactor modeling. In addition, HPC is used to address national health needs that will eventually point to cures both by helping cancer researchers manage and analyze huge troves of data, by simulating biological mechanisms, and by accelerating drug development — including continuing to rise to the challenge of pandemic-related research. A 2023 report from the ASCAC Subcommittee on American Competitiveness and Innovation to the ASCR office, “Can the United States Maintain Its Leadership in High-Performance Computing?” says of the Program, “The CSGF program provides a barometer for disciplines that will be of interest to future DOE computing.” An explosion in scientific and technological data has driven the need for increasingly sophisticated HPC to transform those data into scientific understanding. With access to more and more data and the proliferation of HPC, Machine Learning and Artificial Intelligence are experiencing a renaissance, complementing the now well-established use of computational simulation. Indeed, in its September 2020 subcommittee report on “AI/ML, Data Intensive Science and High-Performance Computing”, the DOE Advanced Scientific Computing Advisory Committee (ASCAC) explicitly called for a fellowship program to train computational and data scientists to tackle exascale and data-intensive computing challenges. This collaboration of empirical and theory-based modeling will increasingly inform federal policymakers whose decisions affect American society and future generations, and it requires highly skilled and intellectually agile computational scientists who can support the fast-moving DOE National Laboratory research environment. In fact, the DOE CSGF program has explicitly and consistently addressed this need.

97 MATHEMATICS AND COMPUTING↗

End-to-End Pipeline for Trigger Detection on Hit and Track Graphs

There has been a surge of interest in applying deep learning in particle and nuclear physics to replace labor-intensive offline data analysis with automated online machine learning tasks. This paper details a novel AI-enabled triggering solution for physics experiments in Relativistic Heavy Ion Collider and future Electron-Ion Collider. The triggering system consists of a comprehensive end-to-end pipeline based on Graph Neural Networks that classifies trigger events versus background events, makes online decisions to retain signal data, and enables efficient data acquisition. Here, the triggering system first starts with the coordinates of pixel hits lit up by passing particles in the detector, applies three stages of event processing (hits clustering, track reconstruction, and trigger detection), and labels all processed events with the binary tag of trigger versus background events. By switching among different objective functions, we train the Graph Neural Networks in the pipeline to solve multiple tasks: the edge-level track reconstruction problem, the edge-level track adjacency matrix prediction, and the graph-level trigger detection problem. We propose a novel method to treat the events as track-graphs instead of hit-graphs. This method focuses on intertrack relations and is driven by underlying physics processing. As a result, it attains a solid performance (around 72% accuracy) for trigger detection and outperforms the baseline method using hit-graphs by 2% higher accuracy.

97 MATHEMATICS AND COMPUTING↗

Surface Modeling and Grid Generation for Iced Airfoils (SmaggIce)

Many of the troubles associated with problem solving are alleviated when there is a model that can be used to represent the problem. Through the Advanced Graphics and Visualization (G-VIS) Laboratory and other facilities located within the Research Analysis Center, the Computer Services Division (CSD) is able to develop and maintain programs and software that allow for the modeling of various situations. For example, the Icing Research Branch is devoted to investigating the effect of ice that forms on the wings and other airfoils of airplanes while in flight. While running tests that physically generate ice and wind on airfoils within the laboratories and wind tunnels on site are done, it would be beneficial if most of the preliminary work could be done outside of the lab. Therefore, individuals from within CSD have collaborated with Icing Research in order to create SmaggIce. This software allows users to create ice patterns on clean airfoils or open files containing a variety of icing situations, manipulate and measure these forms, generate, divide, and merge grids around these elements for more explicit analysis, and specify and rediscretize subcurves. With the projected completion date of Summer 2005, the majority of the focus of the Smagglce team is user-functionality and error handling. My primary responsibility is to test the Graphical User Interface (GUI) in SmaggIce in order to ensure the usability and verify the expected results of the events (buttons, menus, etc.) within the program. However, there is no standardized, systematic way in which to test all the possible combinations or permutations of events, not to mention unsolicited events such as errors. Moreover, scripting tests, if not done properly and with a view towards inevitable revision, can result in more apparent errors within the software and in effect become useless whenever the developers of the program make a slight change in the way a specific process is executed. My task therefore requires a brief yet intense study into GUI coverage criteria and creating algorithms for GUI implementation. Nevertheless, there are still heavily graphical features of SmaggIceSmaggIce that must be either corrected or redesigned before its release. A particular feature of SmaggIce is the ability to smooth out curves created by control points that form an arbitrary shape into something more acquiescent to gridding (while maintaining the integrity of the data). This is done by a mathematical model known as Non-Uniform Rational B-Spline (NURBS) curves. Existing NURBS code is written in FORTRAN-77 with static arrays for holding information. My new assignment is to allow for dynamic memory allocation within the code and to make it possible for the developers to call out functions from the NURBS code using C.

Hammond, Brandy M.↗

Trust-Enhancing Probabilistic Transfer Learning for Sparse and Noisy Data Environments

There is an increasing aspiration to utilize machine learning (ML) for various tasks of relevance to national security. ML models have thus far been mostly applied to tasks and domains that, while impactful, have sufficient volume of data. For predictive tasks of national security relevance, ML models of great capacity (ability to approximate nonlinear trends in input-output maps) are often needed to capture the complex underlying physics. However, scientific problems of relevance to national security are often accompanied by various sources of sparse and/or incomplete data, including experiments and simulations, across different regimes of operation, of varying degrees of fidelity, and include noise with different characteristics and/or intensity. State-of-the-art ML models, despite exhibiting superior performance on the task and domain they were trained on, may suffer detrimental loss in performance in such sparse data environments. This report summarizes the results of the Laboratory Directed Research and Development project entitled Trust-Enhancing Probabilistic Transfer Learning for Sparse and Noisy Data Environments. The objective of the project was to develop a new transfer learning (TL) framework that aims to adaptively blend the data across different sources in tackling one task of interest, resulting in enhanced trustworthiness of ML models for mission- and safety-critical systems. The proposed framework determines when it is worth applying TL and how much knowledge is to be transferred, despite uncontrollable uncertainties. The framework accomplishes this by leveraging concepts and techniques from the fields of Bayesian inverse modeling and uncertainty quantification, relying on strong mathematical foundations of probability and measure theories to devise new uncertainty-aware TL workflows.

97 MATHEMATICS AND COMPUTING↗

Matrix-free preconditioning for high-order H (curl) discretizations

The greater arithmetic intensity of high-order finite element discretizations makes them attractive for implementation on next-generation hardware, but assembly of high-order finite element operators as matrices is prohibitively expensive. As a result, the development of general algebraic solvers for such operators has been an open research challenge. Fast matrix-free application of high-order operators has received significant attention in the literature in the context of Poisson-type problems, but preconditioners and solvers for inverting more general operators are not very well-developed. In this paper, we consider the problem of preconditioning a definite Maxwell operator at high polynomial order without assembling a matrix. We show that given efficient preconditioners for high-order H 1 finite element problems on the same mesh, efficient H(curl) preconditioners can be constructed in an auxiliary space framework. We demonstrate the resulting preconditioners in a practical setting with tensor-product basis functions on an unstructured mesh of quadrilaterals. Overall, our approach uses a sparsified H 1 solver constructed on a low-order mesh of the nodal points of the underlying high-order space, and we show that the resulting H(curl) preconditioner is effective at very high polynomial orders for two-dimensional model problems with complicated geometry, varying piecewise constant coefficients, and curved elements. The resulting preconditioner scales with nearly optimal O(p d+1 ) floating point operation count and optimal O(p d ) memory transfer requirements, outperforming existing Maxwell preconditioners in the high-order regime.

97 MATHEMATICS AND COMPUTING↗

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Automated Quantitative Analysis of Extended Irradiation Defects - Dislocations, Voids and Precipitates in Neutron Irradiated HT-9 Steel

Structural alloys that make up the core components of nuclear reactors are exposed to radiation that can substantially alter the microstructure and mechanical properties of the material. Irradiation can cause the formation of extended defects including dislocation line and loops, voids and various types of precipitates. To understand the irradiation effects, it is critical to characterize these defects individually and collectively to quantify how they evolve throughout irradiation stages. Transmission electron microscopy (TEM) is a standard tool for providing extensive size, number density and spatial distribution of extended irradiation defects, however, manual measurement of defect size and number density requires time-intensive effort to analyze enough defects that provide a statistically meaningful result and are prone to errors of subjectivity. In this work, we developed a set of MATLAB algorithms offering robust and automated identification and quantification of extended irradiation defects like dislocation lines, voids and precipitates commonly observed in neutron irradiated cladding alloys [1]. Using a neutron-irradiated HT-9 martensitic alloy irradiated at 412°C to 111.8 dpa, we demonstrate the capability of these algorithms for quantitative defect analysis. Figure 1 presents defect images of the HT-9 using an advanced diffraction contrast imaging scanning transmission electron microscopy (DCI STEM) that suppresses bend contours and provides better defect contrast compared to conventional TEM [2]. The first step of defect analysis is defect identification, a process that can be digitally achieved by contrast thresholding (for simple defect contrast) and by machine learning computer vision for defect semantic segmentation [3]. Here, labeled binary defect images (Figures 2a and 2c) were used. For dislocation density quantification, we employed an optimized circular-grid intersection method first introduced by Dr. John Steeds [4]. This method is shown in Figures 2a and 2b, where the number of intersections of dislocation lines with circular traces was measured. This produces an unbiased sampling of dislocation lines, regardless of their orientation. This process was optimized with automated digital intersection number and grid length registration. Interestingly, it was found that a relatively large number of circles in a set circular gird is was needed to produce an invariant result (Figure 2b), with a low systematic measurement error. This demonstrates the main advantage of computer-based defect analysis, in performing repetitive operations quickly with a reduced systematic error. For the quantitative analysis of voids and precipitates a challenge encountered with automated defect analysis is feature overlap, particularly when the density of voids/precipitates is high. To mitigate this problem, as shown in Figure 2d, we modified the popular circular Hough transformation and treated ‘circular shape’ as the particle descriptor for voids/precipitates, efficiently resolving the overlapping particles. In summary, this automated digital quantification together with machine learning enabled defect identification [3] opens new opportunities for standardizing the characterization workflow for quantitative analysis of extended irradiation defects.

Sainju, Rajat↗

Transient superconductivity at nano- and meso-scales

High-T c superconductivity is surpassed by few, if any, other unsolved problems in contemporary physics in terms of its richness, complexity, impact on other fields, and potential technological importance in energy applications. Recent discoveries reveal that the highest transition temperatures emerge under extraordinary experimental conditions such as the strong perturbation of a single atomic layer material by the underlying substrate, application of ~200 GPa pressure or ~MV/cm static electric fields, or irradiation by intense femtosecond optical fields. Research in superconductivity under extreme experimental conditions is challenging and requires the development of novel experimental methods and new theoretical tools suitable to tackle the problem. Our team has approached the challenges of transient superconductivity under intense optical fields by rethinking the types of experimental observables that are best suited to elucidate the physics of light-induced effects. This exercise has identified the need for: i) ultra-fast spatio-temporal probes enabling access to plasmonic properties and also nano-scale inhomogeneities that are ubiquitous in unconventional superconductors; ii) meso-scale structures and hybrid meta-surfaces imperative for strong enhancement of optical fields and iii) theoretical approaches suitable to explain and predict the response of superconductors under ultra-fast photo-excitation. Co-PIs have already made major advances with developing capabilities i)-iii). Therefore, our team is poised to make significant progress in transient superconductivity by exploring novel spatio-temporal effects that currently remain unattainable. Co-investigators will search for light-induced superconductivity in the high-T c cuprates to build upon spectacular recent results still lacking independent confirmations. Novel data acquisition methods combined with nano-plasmonic imaging will allow our team to test the hypothesis of photo-induced superconducting pairing. Spatio-temporal experiments will provide insights into the interplay between superconductivity and competing orders in the cuprates. Co-PIs will also investigate strong light-matter interaction and superconductivity in FeSe monolayers. Finally, we will study spatio-temporal electrodynamics of planar Josephson junctions. This latter direction will allow our team to thoroughly characterize one of the most fundamental examples of inhomogeneity in all of unconventional superconductivity. The proposed experiments in combination with theoretical analysis will provide information that is difficult to obtain using alternative methods. Basov and Averitt will carry out pump-probe spectroscopy and nano-imaging experiments. Averitt and Hone will design and fabricate state-of-the-art meta-surfaces. Theoretical and computational studies of ultrafast transient phenomena will be carried out by Millis and Fogler. Modeling of time-resolved nano-optical effects will be done by Fogler. The bulk of the requested budget will be used to support graduate students at Columbia & UCSD that will be co-supervised by co-PIs. The proposed program is transformative, since it will enable an entire suite of experiments previously either impossible or technically implausible. It will deliver critically important insights not only into mechanisms of unconventional superconductivity but also to many other correlated quantum materials.

36 MATERIALS SCIENCE↗

Dark energy from large-scale structure lensing information

Wide area large-scale structure (LSS) surveys are planning to map a substantial fraction of the visible Universe to quantify dark energy through baryon acoustic oscillations. At increasing redshift, for example, that probed by proposed 21-cm intensity mapping surveys, gravitational lensing potentially limits the fidelity (Hui et al., 2007) because it distorts the apparent matter distribution. In this paper we show that these distortions can be reconstructed, and actually used to map the distribution of intervening dark matter. The lensing information for sources at z=1-3 allows accurate reconstruction of the gravitational potential on large scales, l < or approx. 100, which is well matched for integrated Sachs-Wolfe effect measurements of dark energy and its sound speed, and a strong constraint for modified gravity models of dark energy. We built an optimal quadratic lensing estimator for non-Gaussian sources, which is necessary for LSS. The phenomenon of 'information saturation' (Rimes and Hamilton, 2005) saturates reconstruction at mildly nonlinear scales, where the linear source power spectrum {Delta}{sup 2{approx}}0.2-0.5, depending on power spectrum slope. Naive Gaussian estimators with nonlinear cutoff can be tuned to reproduce the optimal non-Gaussian errors within a factor of 2. We compute the effective number densities of independent lensing sources for LSS lensing, and find that they increase rapidly with redshifts. For LSS/21-cm sources at z{approx}2-4, the lensing reconstruction is limited by cosmic variance at l < or approx. 100.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Aeroacoustic computation of gust-blade interaction

To better understand and address the challenges faced in computing the acoustics of flow fields, test problems must be considered. In the present study, the sound radiated by the interaction of a flat plate with an oncoming gust containing a two component, mean velocity is computed. The gust has a uniform mean flow in x with Mach number M(infinity) equal to 0.5. The gust's mean velocity in y is of smaller amplitude and is given by: v = 0.1 sin(pi/8(x/M(sub infinity) - t)). This problem has been posed for an upcoming ICASE/LaRC workshop on benchmark problems in computational aeroacoustics. A plate with a length of 30 units in x is used. The plate is assumed to be infinitesimally thin and is centered at the origin. All variables are made dimensionless using the scales specified. Acoustic quantities are obtained by numerically integrating the linearized Euler equations. Integration is performed on the computational domain -100.0 less than or equal to x less than or equal to 100.0, -100.0 less than or equal to y less than or equal to 100.0, using unit length grid spacing in x and in y. An integration scheme is sought which will provide accurate solution to the small quantities of interest at a minimal computational expense. Results indicate that with the given discretization a scheme of minimal fourth order accuracy might be adequate to approximate the waves within the given flow. Thus, a variation of the MacCormack scheme with fourth order accuracy in space and second order accuracy in time was chosen. A scheme with sixth order accuracy in space has also been implemented and results compared with those of the fourth order accurate scheme. To ensure no mass flux, zero normal velocity is assigned at the plate. This condition will induce a discontinuity in the pressure across the plate location. Values for the perturbation pressure p' along the surface of the plate are obtained using a one-sided, third order Taylor expansion, such that p'(sub y) = O. In accordance with the Kutta condition, perturbation pressure at the trailing edge is assigned to zero. In the far field, radiation boundary conditions have been implemented. The effectiveness of the far field conditions are validated by computing in a larger computational domain and comparing the results. Early in time, sound waves begin to radiate from the plate. A Doppler effect is observed. After the initial transients disappear, the strongest waves leave the trailing edge at an approximate 45 degree angle. The intensity pattern of pressure fluctuations shows five lobes (of increasing magnitude with increasing downstream direction) emerging from the plate. Undesirable short wave contaminants are observed in the computed pressure distribution along the plate surface. For a more accurate solution at small scales, a more refined discretization will be required.

Martin, James E.↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Computational Ghost Imaging for Remote Sensing

This work relates to the generic problem of remote active imaging; that is, a source illuminates a target of interest and a receiver collects the scattered light off the target to obtain an image. Conventional imaging systems consist of an imaging lens and a high-resolution detector array [e.g., a CCD (charge coupled device) array] to register the image. However, conventional imaging systems for remote sensing require high-quality optics and need to support large detector arrays and associated electronics. This results in suboptimal size, weight, and power consumption. Computational ghost imaging (CGI) is a computational alternative to this traditional imaging concept that has a very simple receiver structure. In CGI, the transmitter illuminates the target with a modulated light source. A single-pixel (bucket) detector collects the scattered light. Then, via computation (i.e., postprocessing), the receiver can reconstruct the image using the knowledge of the modulation that was projected onto the target by the transmitter. This way, one can construct a very simple receiver that, in principle, requires no lens to image a target. Ghost imaging is a transverse imaging modality that has been receiving much attention owing to a rich interconnection of novel physical characteristics and novel signal processing algorithms suitable for active computational imaging. The original ghost imaging experiments consisted of two correlated optical beams traversing distinct paths and impinging on two spatially-separated photodetectors: one beam interacts with the target and then illuminates on a single-pixel (bucket) detector that provides no spatial resolution, whereas the other beam traverses an independent path and impinges on a high-resolution camera without any interaction with the target. The term ghost imaging was coined soon after the initial experiments were reported, to emphasize the fact that by cross-correlating two photocurrents, one generates an image of the target. In CGI, the measurement obtained from the reference arm (with the high-resolution detector) is replaced by a computational derivation of the measurement-plane intensity profile of the reference-arm beam. The algorithms applied to computational ghost imaging have diversified beyond simple correlation measurements, and now include modern reconstruction algorithms based on compressive sensing.

Erkmen, Baris I.↗