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 469 records · Page 26

Acoustic Wave Propagation Modeling by a Two-dimensional Finite-difference Summation-by-parts Algorithm

Acoustic waveform modeling is a computationally intensive task and full three-dimensional simulations are often impractical for some geophysical applications such as long-range wave propagation and high-frequency sound simulation. In this study, we develop a two-dimensional high-order accurate finite-difference code for acoustic wave modeling. We solve the linearized Euler equations by discretizing them with the sixth order accurate finite difference stencils away from the boundary and the third order summation-by-parts (SBP) closure near the boundary. Non-planar topographic boundary is resolved by formulating the governing equation in curvilinear coordinates following the interface. We verify the implementation of the algorithm by numerical examples and demonstrate the capability of the proposed method for practical acoustic wave propagation problems in the atmosphere.

58 GEOSCIENCES↗

A comparison of Gaussian processes and neural networks for computer model emulation and calibration

The Department of Energy relies on complex physics simulations for prediction in domains like cosmology, nuclear theory, and materials science. These simulations are often extremely computationally intensive, with some requiring days or weeks for a single simulation. In order to assure their accuracy, these models are calibrated against observational data in order to estimate inputs and systematic biases. Because of their great computational complexity, this process typically requires the construction of an emulator, a fast approximation to the simulation. In this paper, two emulator approaches are compared: Gaussian process regression and neural networks. Their emulation accuracy and calibration performance on three real problems of Department of Energy interest is considered. On these problems, the Gaussian process emulator tends to be more accurate with narrower, but still well-calibrated uncertainty estimates. The neural network emulator is accurate, but tends to have large uncertainty on its predictions. Finally, as a result, calibration with the Gaussian process emulator produces more constrained posteriors that still perform well in prediction.

97 MATHEMATICS AND COMPUTING↗

Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities ({approx}100 W/cm{sup 2}) and comparatively small detunings ({approx}1000-10 000 linewidths), trap depths of {approx}1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Z2Pack: Numerical implementation of hybrid Wannier centers for identifying topological materials

The intense theoretical and experimental interest in topological insulators and semimetals has established band structure topology as a fundamental material property. Consequently, identifying band topologies has become an important, but often challenging, problem, with no exhaustive solution at the present time. Here, we compile a series of techniques, some previously known, that allow for a solution to this problem for a large set of the possible band topologies. The method is based on tracking hybrid Wannier charge centers computed for relevant Bloch states, and it works at all levels of materials modeling: continuous k ∙ p models, tight-binding models, and ab initio calculations. We apply the method to compute and identify Chern, $\mathbb{Z}$ 2 , and crystalline topological insulators, as well as topological semimetal phases, using real material examples. Moreover, we provide a numerical implementation of this technique (the Z2Pack software package) that is ideally suited for high-throughput screening of materials databases for compounds with nontrivial topologies. We expect that our work will allow researchers to (a) identify topological materials optimal for experimental probes, (b) classify existing compounds, and (c) reveal materials that host novel, not yet described, topological states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A numerical method for the prediction of high-speed boundary-layer transition using linear theory

A method is described of estimating the location of transition in an arbitrary laminar boundary layer on the basis of linear stability theory. After an examination of experimental evidence for the relation between linear stability theory and transition, a discussion is given of the three essential elements of a transition calculation: (1) the interaction of the external disturbances with the boundary layer; (2) the growth of the disturbances in the boundary layer; and (3) a transition criterion. The computer program which carried out these three calculations is described. The program is first tested by calculating the effect of free-stream turbulence on the transition of the Blasius boundary layer, and is then applied to the problem of transition in a supersonic wind tunnel. The effects of unit Reynolds number and Mach number on the transition of an insulated flat-plate boundary layer are calculated on the basis of experimental data on the intensity and spectrum of free-stream disturbances. Reasonable agreement with experiment is obtained in the Mach number range from 2 to 4.5.

Mack, L. M.↗

A Lanczos eigenvalue method on a parallel computer

Eigenvalue analyses of complex structures is a computationally intensive task which can benefit significantly from new and impending parallel computers. This study reports on a parallel computer implementation of the Lanczos method for free vibration analysis. The approach used here subdivides the major Lanczos calculation tasks into subtasks and introduces parallelism down to the subtask levels such as matrix decomposition and forward/backward substitution. The method was implemented on a commercial parallel computer and results were obtained for a long flexible space structure. While parallel computing efficiency is problem and computer dependent, the efficiency for the Lanczos method was good for a moderate number of processors for the test problem. The greatest reduction in time was realized for the decomposition of the stiffness matrix, a calculation which took 70 percent of the time in the sequential program and which took 25 percent of the time on eight processors. For a sample calculation of the twenty lowest frequencies of a 486 degree of freedom problem, the total sequential computing time was reduced by almost a factor of ten using 16 processors.

Bostic, Susan W.↗

High resolution ultrasonic spectroscopy system for nondestructive evaluation

With increased demand for high resolution ultrasonic evaluation, computer based systems or work stations become essential. The ultrasonic spectroscopy method of nondestructive evaluation (NDE) was used to develop a high resolution ultrasonic inspection system supported by modern signal processing, pattern recognition, and neural network technologies. The basic system which was completed consists of a 386/20 MHz PC (IBM AT compatible), a pulser/receiver, a digital oscilloscope with serial and parallel communications to the computer, an immersion tank with motor control of X-Y axis movement, and the supporting software package, IUNDE, for interactive ultrasonic evaluation. Although the hardware components are commercially available, the software development is entirely original. By integrating signal processing, pattern recognition, maximum entropy spectral analysis, and artificial neural network functions into the system, many NDE tasks can be performed. The high resolution graphics capability provides visualization of complex NDE problems. The phase 3 efforts involve intensive marketing of the software package and collaborative work with industrial sectors.

Chen, C. H.↗

SharP

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. along with hierarchical-heterogeneous memory, the system typically has a high-performing network ad a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also for running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models and software layer have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. A programming abstraction to address this problem. The programming abstraction is implemented as a software library and runs on pre-exascale and exascale systems supporting current and emerging system architecture. Using distributed data-structures as a central concept, it provides (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications.

Venkata, Manjunath Gorentla↗

GPU accelerated fully space and time resolved numerical simulations of self-focusing laser beams in SBS-active media

A computer cluster equipped with Graphics Processing Units (GPUs) is used for simulating nonlinear optical wave packets undergoing Kerr self-focusing and stimulated Brillouin scattering in fused silica. We first recall the model equations in full (3+1) dimensions. These consist of two coupled nonlinear Schrödinger equations for counterpropagating optical beams closed with a source equation for light-induced acoustic waves seeded by thermal noise. Compared with simulations on a conventional cluster of Central Processing Units (CPUs), GPU-based computations allow us to use a significant (16 times) larger number of mesh points within similar computation times. Reciprocally, simulations employing the same number of mesh points are between 3 and 20 times faster on GPUs than on the same number of classical CPUs. Performance speedups close to 45 are reported for isolated functions evaluating, e.g., the optical nonlinearities. Since the field intensities may reach the ionization threshold of silica, the action of a defocusing electron plasma is also addressed.

97 MATHEMATICS AND COMPUTING↗

Community-driven development for computational biology at Sprints, Hackathons and Codefests

Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools for its interpretation can find mutual understanding and consensus. Much conversation and joint investigation are required in order to identify and implement the best approaches. Traditionally, scientific conferences feature talks presenting novel technologies or insights, followed up by informal discussions during coffee breaks. In multi-institution collaborations, in order to reach agreement on implementation details or to transfer deeper insights in a technology and practical skills, a representative of one group typically visits the other. However, this does not scale well when the number of technologies or research groups is large. Conferences have responded to this issue by introducing Birds-of-a-Feather (BoF) sessions, which offer an opportunity for individuals with common interests to intensify their interaction. However, parallel BoF sessions often make it hard for participants to join multiple BoFs and find common ground between the different technologies, and BoFs are generally too short to allow time for participants to program together. Results: This report summarises our experience with computational biology Codefests, Hackathons and Sprints, which are interactive developer meetings. They are structured to reduce the limitations of traditional scientific meetings described above by strengthening the interaction among peers and letting the participants determine the schedule and topics. These meetings are commonly run as loosely scheduled “unconferences” (self-organized identification of participants and topics for meetings) over at least two days, with early introductory talks to welcome and organize contributors, followed by intensive collaborative coding sessions. We summarise some prominent achievements of those meetings and describe differences in how these are organised, how their audience is addressed, and their outreach to their respective communities. Conclusions: Hackathons, Codefests and Sprints share a stimulating atmosphere that encourages participants to jointly brainstorm and tackle problems of shared interest in a self-driven proactive environment, as well as providing an opportunity for new participants to get involved in collaborative projects.

59 BASIC BIOLOGICAL SCIENCES↗

A computationally efficient P 1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

The iterative convergence of the P 1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P 1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P 1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P 1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Additionally, PC provided 50% computational savings compared to employing CG in a standalone mode. The P 1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P 1 model provided good agreement against benchmark data with L 2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel Implementation of Power System Dynamic Simulation

Dynamic simulation of power system transient stability is important for planning, monitoring, operation, and control of electrical power systems. However, modeling the system dynamics and network involves the computationally intensive time-domain solution of numerous differential and algebraic equations (DAE). This results in a transient stability implementation that may not maintain the real-time constraints of an online security assessment. This paper presents a parallel implementation of the dynamic simulation on a high-performance computing (HPC) platform using parallel simulation algorithms and computation architectures. It enables the simulation to run even faster than real time, enabling the “look-ahead” capability of upcoming stability problems in the power grid.

dynamic simulation↗

Summer Proceedings 2019

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers and heterogeneous computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program includes the organization of a weekly seminar series and the publication of this summer proceedings.

97 MATHEMATICS AND COMPUTING↗

Diabatic forcing and initialization with assimilation of cloud and rain water in a forecast model: Methodology

The focus of this part of the investigation is to find one or more general modeling techniques that will help reduce the time taken by numerical forecast models to initiate or spin-up precipitation processes and enhance storm intensity. If the conventional data base could explain the atmospheric mesoscale flow in detail, then much of our problem would be eliminated. But the data base is primarily synoptic scale, requiring that a solution must be sought either in nonconventional data, in methods to initialize mesoscale circulations, or in ways of retaining between forecasts the model generated mesoscale dynamics and precipitation fields. All three methods are investigated. The initialization and assimilation of explicit cloud and rainwater quantities computed from conservation equations in a mesoscale regional model are examined. The physical processes include condensation, evaporation, autoconversion, accretion, and the removal of rainwater by fallout. The question of how to initialize the explicit liquid water calculations in numerical models and how to retain information about precipitation processes during the 4-D assimilation cycle are important issues that are addressed. The explicit cloud calculations were purposely kept simple so that different initialization techniques can be easily and economically tested. Precipitation spin-up processes associated with three different types of weather phenomena are examined. Our findings show that diabatic initialization, or diabatic initialization in combination with a new diabatic forcing procedure, work effectively to enhance the spin-up of precipitation in a mesoscale numerical weather prediction forecast. Also, the retention of cloud and rain water during the analysis phase of the 4-D data assimilation procedure is shown to be valuable. Without detailed observations, the vertical placement of the diabatic heating remains a critical problem.

Raymond, William H.↗

Unsteady Flow Simulations in Support of the SSME HEX Turning Vane Cracking Investigation with the ATD HPOTP

Unsteady flow computations are being performed with the P&W (ATD) and the Rocketdyne baseline configurations of the SSME LO2 turbine turnaround duct (TAD) and heat exchanger (HEX). The work is in support of the HEX inner turning vane cracking investigation. Fatigue cracking has occurred during hot firings with the P&W configuration on the HEX inner vane, and it appears the fix will involve changes to the TAD splitter vane position and to the TAD inner wall curvature to reduce the dynamic loading on the inner vane. Unsteady flow computations on the P&W baseline and fix and on the Rocketdyne baseline reference follow steady-flow screening computations done by MSFC/ED32 on several trial configurations arriving at the fix. The P&W TAD inlet velocity profile has a strong radial velocity component that directs the flow toward the inner wall and raises the local velocity a factor of two and the dynamic pressure a factor, of four. The fix is intended to redistribute the flow more evenly across the HEX inner and outer vanes like the Rocketdyne baseline reference. Vane buffeting at frequencies around 4,000 Hz is the leading suspected cause of the problem. Our simulations (work in progress) are being done with the USA 2D axisymmetric code approximating the flow as axisymmetric u+v 2D (axial, u, and radial, v, components only). The HEX coils are included in the model to make sure the fix does not adversely affect the HEX environment. Turbulent kinetic energy, k, levels where k = 1/2 v' rms2 are locally as high as 10,000 ft2/sec2 for the P&W baseline at the engine interface (between the TAD and HEX) at the HEX inner vane location. However, k is less than 8,000 on the HEX outer vane and only about 4,500 on the HEX inner vane for the Rocketdyne baseline. Unsteady turbulence intensity, v'rms/v, and pressure, p', are being computed in the present computations to compare with steady-flow Reynolds-averaged computations where p'rms = const (pk) for overall rms random turbulence from 0.1 to 12,000 Hz frequency. Random overall static, p'rms fluctuations as large as 1.7 psi are estimated from k on the HEX inner vane for the P&W baseline configuration but only about 0.7 psi for the Rocketdyne configuration.

Dougherty, N. S.↗

The combustion program at CTR

Understanding and modeling of turbulent combustion are key problems in the computation of numerous practical systems. Because of the lack of analytical theories in this field and of the difficulty of performing precise experiments, direct numerical simulation (DNS) appears to be one of the most attractive tools to use in addressing this problem. The general objective of DNS of reacting flows is to improve our knowledge of turbulent combustion but also to use this information for turbulent combustion models. For the foreseeable future, numerical simulation of the full three-dimensional governing partial differential equations with variable density and transport properties as well as complex chemistry will remain intractable; thus, various levels of simplification will remain necessary. On one hand, the requirement to simplify is not necessarily a handicap: numerical simulations allow the researcher a degree of control in isolating specific physical phenomena that is inaccessible in experiments. CTR has pursued an intensive research program in the field of DNS for turbulent reacting flows since 1987. DNS of reacting flows is quite different from DNS of non-reacting flows: without reaction, the equations to solve are clearly the five conservation equations of the Navier Stokes system for compressible situations (four for incompressible cases), and the limitation of the approach is the Reynolds number (or in other words the number of points in the computation). For reacting flows, the choice of the equations, the species (each species will require one additional conservation equation), the chemical scheme, and the configuration itself is more complex.

Poinsot, Thierry J.↗

A simplified method for thermal analysis of a cowl leading edge subject to intense local shock-wave-interference heating

Type IV shock wave interference heating on a blunt body causes extremely intense heating over a very localized region of the body. An analytical solution is presented to a heat transfer problem that approximates the shock wave interference heating of an engine cowl leading edge of the National Aero-Space Plane. The problem uses a simplified geometry to represent the leading edge. An analytical solution is developed that provides a means for approximating maximum temperature differences between the outer and inner surface temperatures of the leading edge. The solution is computationally efficient and, as a result, is well suited for conceptual and preliminary design or trade studies. Transient and steady state analyses are conducted, and results obtained from the analytical solution are compared with results of 2-D thermal finite element analyses over a wide range of design parameters. Isotropic materials as well as laminated composite materials are studied. Results of parametric studies are presented to indicate the effects of the thickness of the cowl leading edge and the width of the region heated by the shock wave interference on the thermal response of the leading edge.

Mcgowan, David M.↗

Calculation of stress intensity factors in an isotropic multicracked plate. Part 1: Theoretical development

An essential part of describing the damage state and predicting the damage growth in a multicracked plate is the accurate calculation of stress intensity factors (SIF's). Here, a methodology and rigorous solution formulation for SIF's of a multicracked plate, with fully interacting cracks, subjected to a far-field arbitrary stress state is presented. The fundamental perturbation problem is derived, and the steps needed to formulate the system of singular integral equations whose solution gives rise to the evaluation of the SIF's are identified. This analytical derivation and numerical solution are obtained by using intelligent application of symbolic computations and automatic FORTRAN generation capabilities (described in the second part of this paper). As a result, a symbolic/FORTRAN package, named SYMFRAC, that is capable of providing accurate SIF's at each crack tip was developed and validated.

Binienda, W. K.↗