Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,657 records · Page 92

Advection algorithms for quantum neutrino moment transport

Neutrino transport in compact objects is an inherently challenging multidimensional problem. Here, this difficulty is compounded if one includes flavor transformation—an intrinsically quantum phenomenon requiring one to follow the coherence between flavors and thus necessitating the introduction of complex numbers. To reduce the computational burden, simulations of compact objects that include neutrino transport often make use of momentum-angle-integrated moments (the lowest order ones being commonly referred to as the energy density and flux) and these quantities can be generalized to include neutrino flavor, i.e., they become quantum moments. Numerous finite-volume approaches to solving the moment evolution equations for classical neutrino transport have been developed based on solving a Riemann problem at cell interfaces. In this paper we describe our generalization of a Riemann solver for quantum moments, specifically decomposing complex numbers in terms of a (signed) magnitude and phase instead of real and imaginary parts. We then test our new algorithm in numerous cases showing a neutrino fast flavor instability, varying from toy models with analytic solutions to snapshots from neutron star merger simulations. Compared to previous algorithms for neutrino transport with flavor mixing, we find uniformly smaller growth rates of the flavor transformation along with concomitantly larger length-scales, and that the results are a better match with the growth rates seen from multiangle codes.

79 ASTRONOMY AND ASTROPHYSICS↗

I/O Access Patterns in HPC Applications: A 360-Degree Survey

The high-performance computing I/O stack has been complex due to multiple software layers, the inter-dependencies among these layers, and the different performance tuning options for each layer. In this complex stack, the definition of an “I/O access pattern” has been reappropriated to describe what an application is doing to write or read data from the perspective of different layers of the stack, often comprising a different set of features. It has become common to have to redefine what is meant when discussing a pattern in every new study, as no assumption can be made. This survey aims to propose a baseline taxonomy, harnessing the I/O community’s knowledge over the past 20 years. This definition can serve as a common ground for high-performance computing I/O researchers and developers to apply known I/O tuning strategies and design new strategies for improving I/O performance. We seek to summarize and bring a consensus to the multiple ways to describe a pattern based on common features already used by the community over the years.

97 MATHEMATICS AND COMPUTING↗

Sculpting in cyberspace: Parallel processing the development of new software

Stimulating creativity in problem solving, particularly where software development is involved, is applicable to many disciplines. Metaphorical thinking keeps the problem in focus but in a different light, jarring people out of their mental ruts and sparking fresh insights. It forces the mind to stretch to find patterns between dissimilar concepts, in the hope of discovering unusual ideas in odd associations (Technology Review January 1993, p. 37). With a background in Engineering and Visual Design from MIT, I have for the past 30 years pursued a career as a sculptor of interdisciplinary monumental artworks that bridge the fields of science, engineering and art. Since 1979, I have pioneered the application of computer simulation to solve the complex problems associated with these projects. A recent project for the roof of the Carnegie Science Center in Pittsburgh made particular use of the metaphoric creativity technique described above. The problem-solving process led to the creation of hybrid software combining scientific, architectural and engineering visualization techniques. David Steich, a Doctoral Candidate in Electrical Engineering at Penn State, was commissioned to develop special software that enabled me to create innovative free-form sculpture. This paper explores the process of inventing the software through a detailed analysis of the interaction between an artist and a computer programmer.

Fisher, Rob↗

A New Method for Estimating the Single Scattering Phase Functions of Regolith Grains

Hapke's photometric model has been widely used in solar system remote sensing applications for nearly two decades. Recently, Hapke extended his model to describe the coherent-backscatter opposition effect and multiple-scattering by particles with anisotropic single particle phase functions (SPPF's). A practical difficulty for retrieving Hapke's model parameters from typical planet, satellite, and asteroid photometry data sets is that the model employs a large number of adjustable parameters (at least eight) that can be reliably constrained only for a small number of planetary data sets in which both disk-resolved and whole-disk observations are available from opposition to very large phase angles. The present work aims to reduce the number of adjustable parameters and preserve (or even enhance) the model's accuracy and usefulness by expressing Hapke's parameters in terms of more fundamental physical properties on which they mutually depend. The most difficult part of this task, described here, is to develop a simple method for computing the effective SPPF for structurally complex regolith grains from optical constants, grain-size distribution, and average regolith porosity. The development of light-scattering models for irregularly shaped particles is a large, complex subject and many sophisticated methods, such as Discrete Dipole Approximation (DDA) and Monte-Carlo simulations, have been explored elsewhere. Many of these methods are computationally intensive and probably impractical for routine substitution in Hapke's model. Here, progress is reported in developing a practical, semi-empirical method for estimating the directional scattering behavior (i.e. SPPF) of irregular regolith grains. The method employs Optical Transfer Function (OTF) techniques to model how the structural complexity of regolith particles broaden and attenuate the angular distribution of scattered light relative to that expected from ideal spherical particles of equivalent size and composition.

Helfenstein, P.↗

BraggNN : fast X-ray Bragg peak analysis using deep learning

X-ray diffraction based microscopy techniques such as high-energy diffraction microscopy (HEDM) rely on knowledge of the position of diffraction peaks with high precision. These positions are typically computed by fitting the observed intensities in detector data to a theoretical peak shape such as pseudo-Voigt. As experiments become more complex and detector technologies evolve, the computational cost of such peak-shape fitting becomes the biggest hurdle to the rapid analysis required for real-time feedback in experiments. To this end, we propose BraggNN, a deep-learning based method that can determine peak positions much more rapidly than conventional pseudo-Voigt peak fitting. When applied to a test dataset, peak center-of-mass positions obtained from BraggNN deviate less than 0.29 and 0.57 pixels for 75 and 95% of the peaks, respectively, from positions obtained using conventional pseudo-Voigt fitting (Euclidean distance). When applied to a real experimental dataset and using grain positions from near-field HEDM reconstruction as ground-truth, grain positions using BraggNN result in 15% smaller errors compared with those calculated using pseudo-Voigt. Recent advances in deep-learning method implementations and special-purpose model inference accelerators allow BraggNN to deliver enormous performance improvements relative to the conventional method, running, for example, more than 200 times faster on a consumer-class GPU card with out-of-the-box software.

36 MATERIALS SCIENCE↗

Multi-state Catalysts Modulated by Mechanical Force (Final Report)

The development of more efficient catalytic processes and new approaches to control catalytic activity and selectivity are central to the realization of more selective, atom economic, and energy efficient routes to value added chemicals and polymers. The reactivity and selectivity of a transition metal catalyst is intimately related to the ligand-sphere geometry and, in many cases, the ideal ligand geometry for one step of a catalytic cycle is poorly matched to the ideal ligand geometry for another, resulting in sub-optimal efficiency. Macroscopic mechanical forces are both large, potentially much larger than interatomic forces, and are directional and localized to an extent that differentiates them from other forms of energy input such as heat or light. As such, mechanical force represents a heretofore untapped approach to modulate catalyst geometry, with the potential to reversibly modulate catalyst geometry on the timescale of catalytic turnover or monomer enchainment. This project has addressed the fundamental challenges in material-to-molecule strain coupling associated with the development of a new class of mechanically responsive catalysts (mechanocatalysts) in which active organotransition metal catalysts are strategically embedded in a flexible polymer network such that application of external mechanical force (stretching or deformation) leads to modulation of catalyst geometry, and hence reactivity and selectivity. Our efforts during the tenure of this grant were directed toward the elucidation of force-reactivity relationships of elementary transformations that occur within the first coordination sphere of a transition metal complex employing stiff stilbene photoswitches tethered to a flexible bidentate phosphine ligand derived from MeOBiphep as molecular force probes which provide a range of compressive and extension forces to the coupled transition metal complex depending on the geometry of the stiff stilbene and length of the tethering chains. During the tenure of this grant, we have quantified the rate of C(sp 2 )-C(sp 2 ) reductive elimination from platinum(II) diaryl complexes containing bis(phosphine) force probe ligands as a function of mechanical force; compressive forces decreased the rate of reductive elimination whereas extension forces increased the rate relative to the strain-free MeOBiphep complex with a 3.4-fold change in rate over a ~290 pN range of restoring forces. In a similar manner, we have quantified the rate of oxidative addition of bromobenzene to low-ligated palladium(0) complexes containing force probe ligands as a function of mechanical force; compressive forces increase the rate of oxidative addition, whereas tensile forces decrease the rate with a ~6 fold change in rate across ~340 pN of force applied to the complexes. In both cases, experimental and computational analyses argue strongly against any significant force-induced perturbation of ground state geometry within the first coordination sphere of the reactant complexes. Rather, the force/rate behavior observed for these transformations across these ranges of forces is attributed to the coupling of force to the nuclear motion comprising the reaction coordinates for reductive elimination and oxidative addition. These results together inform the development of catalysts whose activity can be tuned by an external force that is adjusted within a catalytic cycle and suggest opportunities to experimentally map geometry changes associated with reactions in transition metal complexes and potential strategies for force-modulated catalysis.

99 GENERAL AND MISCELLANEOUS↗

An Analysis of Performance Enhancement Techniques for Overset Grid Applications

The overset grid methodology has significantly reduced time-to-solution of high-fidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process resolves the geometrical complexity of the problem domain by using separately generated but overlapping structured discretization grids that periodically exchange information through interpolation. However, high performance computations of such large-scale realistic applications must be handled efficiently on state-of-the-art parallel supercomputers. This paper analyzes the effects of various performance enhancement techniques on the parallel efficiency of an overset grid Navier-Stokes CFD application running on an SGI Origin2000 machine. Specifically, the role of asynchronous communication, grid splitting, and grid grouping strategies are presented and discussed. Results indicate that performance depends critically on the level of latency hiding and the quality of load balancing across the processors.

Djomehri, J. J.↗

Performance Enhancement Strategies for Multi-Block Overset Grid CFD Applications

The overset grid methodology has significantly reduced time-to-solution of highfidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process resolves the geometrical complexity of the problem domain by using separately generated but overlapping structured discretization grids that periodically exchange information through interpolation. However, high performance computations of such large-scale realistic applications must be handled efficiently on state-of-the-art parallel supercomputers. This paper analyzes the effects of various performance enhancement strategies on the parallel efficiency of an overset grid Navier-Stokes CFD application running on an SGI Origin2000 machinc. Specifically, the role of asynchronous communication, grid splitting, and grid grouping strategies are presented and discussed. Details of a sophisticated graph partitioning technique for grid grouping are also provided. Results indicate that performance depends critically on the level of latency hiding and the quality of load balancing across the processors.

Djomehri, M. Jahed↗

Turbulent flow calculations using unstructured and adaptive meshes

A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow-field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of flow-field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with experimental data.

Mavriplis, Dimitri J.↗

Turbulent flow calculations using unstructured and adaptive meshes

A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of the flow field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptaive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with expeirmental data.

Mavriplis, Dimitri J.↗

Large-Scale, GPU-Enhanced DFTB Approaches for Probing Multi-Component Alloys

The major goals of the project are to develop and apply GPU-enhanced density functional theory tight binding (DFTB) calculations for efficient simulations of structural materials of alloy systems. The figure below depicts the GPU algorithmic developments on the left that will be carried out, and the solid-state structures on the right are representative of the complex alloys that can be computed with the GPU-enhanced DFTB approach. The methodology and tools developed in this project encompass accurate intermolecular potentials and GPU enhancements to the density functional tight binding (DFTB) approach for high-throughput ab initio molecular dynamics calculations of multi-component alloys at elevated temperatures. While classical molecular dynamics can handle hundreds of thousands of atoms, it cannot provide a first-principles based description of large, multi-component alloys at the predictive quantum level. At the other extreme, conventional Kohn-Sham DFT methods can probe the true quantum nature of chemical systems; however, these methods cannot tackle the large sizes relevant to these multi-component systems. The DFTB-based ab initio molecular dynamics approach (coupled with our in-house GPU capabilities for enhanced speed) used in this project provides a viable approach for probing these large systems at a quantum level of detail that is significantly faster than current first-principle methods Collectively, the capabilities developed in this project directly respond to DOE HBCU-OMI, AOI 2-1 initiatives by (1) enabling accurate and efficient predictions and (2) bringing a fundamental understanding of structural interactions in these complex systems at elevated temperatures.

20 FOSSIL-FUELED POWER PLANTS↗

A conservative approach for flow field calculations on multiple grids

In the computation of flow fields about complex configurations, it is very difficult to construct body-fitted coordinate systems. An alternative approach is to use several grids at once, each of which is generated independently. This procedure is called the 'multiple grids' or 'zonal grids' approach and its applications are investigated in this study. The method follows the conservative approach and provides conservation of fluxes at grid interfaces. The Euler equations are solved numerically on such grids for various configurations. The numerical scheme used is the finite-volume technique with a three-stage Runge-Kutta time integration. The code is vectorized and programmed to run on the CDC VPS-32 computer. Some steady state solutions of the Euler equations are presented and discussed.

Kathong, M.↗

A conservative approach for flow field calculations on multiple grids

In the computation of flow fields about complex configurations, it is very difficult to construct body-fitted coordinate systems. An alternative approach is to use several grids at once, each of which is generated independently. This procedure is called the multiple grids or zonal grids approach and its applications are investigated in this study. The method follows the conservative approach and provides conservation of fluxes at grid interfaces. The Euler equations are solved numerically on such grids for various configurations. The numerical scheme used is the finite-volume technique with a three-state Runge-Kutta time integration. The code is vectorized and programmed to run on the CDC VPS-32 computer. Some steady state solutions of the Euler equations are presented and discussed.

Kathong, Monchai↗

CompLaB v1.0: a scalable pore-scale model for flow, biogeochemistry, microbial metabolism, and biofilm dynamics

Abstract. Microbial activity and chemical reactions in porous media depend on the local conditions at the pore scale and can involve complex feedback with fluid flow and mass transport. We present a modeling framework that quantitatively accounts for the interactions between the bio(geo)chemical and physical processes and that can integrate genome-scale microbial metabolic information into a dynamically changing, spatially explicit representation of environmental conditions. The model couples a lattice Boltzmann implementation of Navier–Stokes (flow) and advection–diffusion-reaction (mass conservation) equations. Reaction formulations can include both kinetic rate expressions and flux balance analysis, thereby integrating reactive transport modeling and systems biology. We also show that the use of surrogate models such as neural network representations of in silico cell models can speed up computations significantly, facilitating applications to complex environmental systems. Parallelization enables simulations that resolve heterogeneity at multiple scales, and a cellular automaton module provides additional capabilities to simulate biofilm dynamics. The code thus constitutes a platform suitable for a range of environmental, engineering and – potentially – medical applications, in particular ones that involve the simulation of microbial dynamics.

58 GEOSCIENCES↗

Subspace Iteration Method for Complex Eigenvalue Problems with Nonsymmetric Matrices in Aeroelastic System

Modern airplane design is a multidisciplinary task which combines several disciplines such as structures, aerodynamics, flight controls, and sometimes heat transfer. Historically, analytical and experimental investigations concerning the interaction of the elastic airframe with aerodynamic and in retia loads have been conducted during the design phase to determine the existence of aeroelastic instabilities, so called flutter .With the advent and increased usage of flight control systems, there is also a likelihood of instabilities caused by the interaction of the flight control system and the aeroelastic response of the airplane, known as aeroservoelastic instabilities. An in -house code MPASES (Ref. 1), modified from PASES (Ref. 2), is a general purpose digital computer program for the analysis of the closed-loop stability problem. This program used subroutines given in the International Mathematical and Statistical Library (IMSL) (Ref. 3) to compute all of the real and/or complex conjugate pairs of eigenvalues of the Hessenberg matrix. For high fidelity configuration, these aeroelastic system matrices are large and compute all eigenvalues will be time consuming. A subspace iteration method (Ref. 4) for complex eigenvalues problems with nonsymmetric matrices has been formulated and incorporated into the modified program for aeroservoelastic stability (MPASES code). Subspace iteration method only solve for the lowest p eigenvalues and corresponding eigenvectors for aeroelastic and aeroservoelastic analysis. In general, the selection of p is ranging from 10 for wing flutter analysis to 50 for an entire aircraft flutter analysis. The application of this newly incorporated code is an experiment known as the Aerostructures Test Wing (ATW) which was designed by the National Aeronautic and Space Administration (NASA) Dryden Flight Research Center, Edwards, California to research aeroelastic instabilities. Specifically, this experiment was used to study an instability known as flutter. ATW was a small-scale airplane wing comprised of an airfoil and wing tip boom. This wing was formulated based on a NACA-65A004 airfoil shape with a 3.28 aspect ratio. The wing had a span of 18 inch with root chord length of 13.2 inch and tip chord length of 8.7 inch. The total area of this wing was 197 square inch. The wing tip boom was a 1 inch diameter hollow tube of length 21.5 inch. The total weight of the wing was 2.66 lbs.

Pak, Chan-gi↗

Capturing the Page curve and entanglement dynamics of black holes in quantum computers

Quantum computers are emerging technologies expected to become important tools for exploring various aspects of fundamental physics in the future. Therefore, we pose the question of whether quantum computers can help us to study the Page curve and the black hole information dynamics, which has been a key focus in fundamental physics. In this regard, we rigorously examine the qubit transport model, a toy qubit model of black hole evaporation on IBM’s superconducting quantum computers, to shed light on this question. Specifically, we implement the quantum simulation of the scrambling dynamics in black holes using an efficient random unitary circuit. Furthermore, we employ the swap-based many-body interference protocol and the randomized measurement protocol to measure the entanglement entropy of Hawking radiation qubits in this model. Finally, by incorporating quantum error mitigation techniques into our challenging implementation of entanglement entropy measurement protocols on the IBM quantum hardware, we accurately determine the Rényi entropy in the qubit transport model, thus showcasing the utility of quantum computers for future investigations of complex quantum systems.

97 MATHEMATICS AND COMPUTING↗

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗