Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 973 records · Page 54

ISCOs in AdS/CFT

Abstract We study stable circular orbits in spherically symmetric AdS black holes in various dimensions and their limiting innermost stable circular orbits. We provide analytic expressions for their size, angular velocity and angular momentum in a large black hole mass regime. The dual interpretation is in terms of meta-stable states not thermalising in typical thermal scales and whose existence is due to non-perturbative effects on the spatial curvature. Our calculations reproduce the binding energy known in the literature, but also include a binding energy in the radial fluctuations corresponding to near circular trajectories. We also describe how particles are placed on these orbits from integrated operators on the boundary: they tunnel inside in a way that can be computed from both complex geodesics in the black hole background and from the WKB approximation of the wave equation. We explain how these two computations are related.

Astronomy & Astrophysics↗

Early Career Award: An Enabling Computational Framework for Uncertainty Assimilation and Propagation in Complex PDE Systems: Sparse and Low-rank Techniques (Final Report)

This project aims to develop a set of new theories, algorithms, and computational tools that enable ultra-scalable representation and propagation of high-dimensional uncertainties to circumvent the issue of curse-of-dimensionality. The research components are motivated by the fact that highly scalable algorithms are needed to achieve exascale performance for uncertainty quantification and predictive simulation at extreme scales. Although these developments are generic and applicable to a wide range of high-dimensional, complex, stochastic, partial-differential-equation (PDE) systems, this research effort will focus on predictive simulation of high-energy-density lithium batteries. To create knowledge about the precise failure mechanisms of these batteries and ultimately predict their performance and reliability, a truly data-driven, multi-scale, multi-physics framework is needed that allows studying (i) dominant sources of uncertainty in the governing physical models at all scales of relevance and (ii) the interface between the interchanging physics and scales. The impact of the planned mathematical and numerical advancements in prediction of high-dimensional uncertain systems will be broad across areas of engineering and science such as climate modeling, fusion energy, combustion, and nanoscience, among others.

97 MATHEMATICS AND COMPUTING↗

An O(N logN) multi-layer boundary element method for direct computation of sound propagation in shallow water environments

Direct three-dimensional (3D) numerical simulations of acoustic fields in range-dependent shallow water environments remains a challenge due to environmental complexities and large computational cost.We develop an efficient 3D boundary element method (BEM) for shallow water acoustic propagation which utilizes a Pre-corrected Fast Fourier Transform (PFFT) approach to reduce the computational effort from O ( N 2~3 ) to O ( N log N ) where N is the total number of boundary unknowns. To account for inhomogeneous media, the method allows for arbitrary number of coupled multi-layer BEM sub-domains. With O ( N log N ) efficiency and the use of massively parallel high-performance computing platforms, we are able to conduct multi-layer 3D direct simulations of low-mid frequency acoustics over kilometer ranges. Furthermore we perform extensive validations of the method and provide two shallow water waveguide examples benchmarked against theoretical solutions. To illustrate the efficacy and usefulness of the PFFT-BEM method, we perform 3D large-scale direct simulations to assess the performance of two established canonical models: axisymmetric coupled mode model for 3D seamount; and Kirchhoff approximation and perturbation theory for 3D rough surface scattering.

42 ENGINEERING↗

Thermodynamic Features of Benzene-1,2-Diphosphonic Acid Complexes with Several Metal Ions

Among his many contributions to the advancement of f-element chemistry and separation science, Professor Gregory R. Choppin’s research group completed numerous investigations featuring the application of distribution techniques to the determination of metal complexation equilibrium quotients. Most of these studies focused on the chemistry of lanthanide and actinide complexes. In keeping with that tradition, this report discusses the complex formation equilibrium constants for complexes of trivalent europium (Eu3+) with benzene-1,2-diphosphonic acid (H4BzDP) determined using solvent extraction distribution experiments in 0.2 M (Na,H)ClO4 media in the temperature range of 5 – 45 degrees C. Protonation constants for HnBzDP4-n and stoichiometry and stability of BzDP4- complexes with Zn2+, Ni2+, and Cu2+ have also been determined using potentiometric titration (at I = 0.1 M) and 31P NMR spectroscopy. Heats of protonation of HnBzDPn-4 species have been determined by titration calorimetry. From the temperature dependence of the complex Eu3+-HnBzDPn-4 equilibrium constant, a composite enthalpy (?H = -15.1 (+/-1.0) kJ mol-1) of complexation has been computed. Comparing these thermodynamic parameters with literature reports on other diphosphonic acids and structurally similar carboxylic acids indicates that exothermic heats of complexation are unique to the Eu-BzDP system. Comparisons with thermodynamic data from the literature indicate that the fixed geometry imposed by the benzene ring enhances complex stability.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Symposium MT02: Statistical Mechanics-Based Computational Tools for the Study of Phase Transformation in Complex Materials (Final Report)

Symposium MT02 brought together a diverse and interdisciplinary community of scientists specializing in Statistical Mechanics-based computational modeling to investigate phase transformations in materials exhibiting complex disordered structures. As the demand for materials with extreme performance metrics grows—from aerospace components to next-generation optical fibers—the ability to predict microstructural evolution under non-equilibrium conditions has become paramount. The primary goal of this symposium was to identify, evaluate, and discuss advanced computational tools capable of designing precise manufacturing conditions to tailor material properties efficiently. By fostering a dialogue between computational theorists and experimentalists, the symposium sought to establish new protocols for predicting how processing history—such as cooling rates or strain paths—dictates the final microstructure.

36 MATERIALS SCIENCE↗

Plasma Surface Interactions: Bridging from the Surface to the Micron Frontier through Leadership Class Computing (Final Technical Progress Report)

The performance demands on plasma-facing components (PFCs) in future fusion power plants are beyond the capability of current materials. In defining the plasma-surface interaction (PSI), it is evident that three coupled spatial regions influence PFC materials evolution and performance. These regions consist of (1) the edge and scrape-off layer region of the plasma, (2) the near-surface material response to extreme thermal and particle fluxes under the influence of, and feedback to, the plasma sheath, and (3) the structural material’s response to an intense, 14 MeV peaked neutron spectrum, which produces very high concentrations of transmuted elements through (n,p) and (n,α) reactions and structural material property degradation. The objective of this project is to develop and deploy validated, high-performance simulation tools capable of predicting the performance of tungsten-based plasma-facing components (PFCs) in a burning fusion plasma environment, which includes modeling surface morphology evolution in either erosion or re-deposition regimes, and the recycling of hydrogen species. This requires the development of a leadership-scale computational code to predict PFC behavior that is well integrated to a suite of multiscale modeling techniques to bridge the scales needed to address complex physical and computational issues at the plasma surface interface and the transition region below the surface where neutron damage processes in the bulk dominate material behavior. Successful completion of this project will provide PFC simulation tools to evaluate steady-state performance of tungsten-based PFC and divertor components in burning plasma environments. This will enable the identification of critical experiments to confirm whether practical PFC solutions exist for magnetic fusion energy beyond ITER. More specifically, the research activities within this project focus on two broadly defined research thrusts: 1) Developing a new simulation code, Xolotl-PSI to predict PFC operating lifetime and performance, that is specifically designed to take advantage of leadership class computing facilities; and 2) Integrating and applying discrete particle-based, as well as continuum-based, multiscale modeling techniques to provide scientific discovery of the mechanisms controlling PFC and bulk materials evolution under fusion plasma and 14-MeV neutron exposure; in this thrust, the challenge of scale-bridging between atomistic/microstructural modeling and the continuum-scale of PFC device performance is achieved through multiscale modeling techniques. Throughout the grant period, research at UMass Amherst focused on the atomic-scale analysis of the dynamics and kinetics (transport and reactions) of small mobile helium clusters near surfaces and grain boundaries in plasma-exposed tungsten, as well as the proper parameterization and incorporation of these processes into our SciDAC team’s continuum-level cluster dynamics code (Xolotl). Our work also included characterization of large-scale molecular-dynamics (MD) simulation results of helium implantation into tungsten based on the findings of our analysis and comparisons of Xolotl simulation predictions with the large-scale MD simulation results for Xolotl validation purposes; emphasis was placed on the impact of helium cluster dynamics/kinetics on tungsten surface morphology, near-surface tungsten structure, and helium retention. Furthermore, our work included initiation of a research program on evaluating the impact of structural defects in tungsten due to plasma exposure (such as helium nanobubbles) on tungsten’s thermophysical properties, focusing on lattice thermal conductivity. Our studies contributed to a fundamental understanding of the effects of plasma-surface interactions on the dynamical response of plasma-facing materials in nuclear fusion devices and the development of predictive hierarchical multiscale computational tools for the quantitative description of the material’s dynamical response to plasma exposure.

36 MATERIALS SCIENCE↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

Deterministic Calculation of Gamma-Ray Transport Spectra with InterScatter.

Gamma-ray transport describes the way in which high-energy photons interact with matter. There are many well established, general purpose gamma transport calculation frameworks (such as GEANT4, MCNP, PARTISN, and GADRAS) that allow for complex generalized calculations, but they are typically not designed to be integrated into other multi-process, multi-platform applications, not designed for rapid computation, or their complexity leads to user errors. In this report, we introduce InterScatter: a deterministic simulation designed to quickly and easily calculate gamma-ray transport spectra for a 1D shielding geometry.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Deterministic Calculation of Gamma-Ray Transport Spectra with InterScatter

Gamma-ray transport describes the way in which high-energy photons (gamma rays and x-rays) interact with matter. There are many well established, general purpose gamma transport calculation frameworks (such as GEANT4, MCNP, PARTISN, and GADRAS [1] [2] [3] [4]) that allow for complex generalized calculations, but they are typically not designed to be integrated into other multi-process, multi-platform applications, not designed for rapid computation, or their complexity leads to user errors. In this report, we introduce InterScatter: a deterministic simulation designed to quickly and easily calculate gamma-ray transport spectra for a 1D shielding geometry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Analytic Form of Planar Two-Loop Five-Gluon Scattering Amplitudes in QCD

We present the analytic form of the planar two-loop five-gluon scattering amplitudes in QCD for a complete set of independent helicity configurations of external gluons. These include the first analytic results for five-point two-loop amplitudes relevant for the computation of next-to-next-to-leading-order QCD corrections at hadron colliders. The results were obtained by reconstructing analytic expressions from numerical evaluations. The complexity of the computation is reduced by exploiting physical and analytical properties of the amplitudes, employing a minimal basis of so-called pentagon functions that have recently been classified.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

ML-based Dimension Reduction Strategies

Deep learning (DL)--based surrogate models have achieved success in various applications in carbon capture and storage (CCS). However, the model training on high-dimensional spaces is computationally expensive and impractical for large-scale and complex geological models, because the models usually contain hundreds of thousands to millions of grid cells, each with a set of parameters. Furthermore, the high cost of generating training data with sufficient variation is another limitation of model training on high-dimensional spaces, which may result in overfitting and reduce the model efficiency and prediction performance. We proposed the workflow incorporating dimension reduction methods and deep learning models, which aim to extract the latent variables of input parameters and output state variables, and then build the mapping function at the latent spaces. The proposed workflow can significantly reduce the computational complexity in solving both forward and inverse problems compared to models trained on high-dimensional spaces. Dimensionality reduction models showed great potential in workflows for fast reservoir simulation, history matching, prior model generation, visualization, and more, ultimately enhancing DL model performance in related SMART Work Packages.

Hosseini, Seyyed↗

Computer tomography of large dust clouds in complex plasmas

The dust density is a central parameter of a dusty plasma. Here, a tomography setup for the determination of the three-dimensionally resolved density distribution of spatially extended dust clouds is presented. The dust clouds consist of micron-sized particles confined in a radio frequency argon plasma, where they fill almost the entire discharge volume. First, a line-of-sight integrated dust density is obtained from extinction measurements, where the incident light from an LED panel is scattered and absorbed by the dust. Performing these extinction measurements from many different angles allows the reconstruction of the 3D dust density distribution, analogous to a computer tomography in medical applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗

Accelerating the Mining of Influential Nodes in Complex Networks through Community Detection

Computing the set of influential nodes with a given size to ensure maximal spread of influence on a complex network is a challenging problem impacting multiple applications. A rigorous approach to influence maximization involves utilization of optimization routines that comes with a high computational cost. In this work, we propose to exploit the existence of communities in complex networks to accelerate the mining of influential seeds. We provide intuitive reasoning to explain why our approach should be able to provide speedups without significantly degrading the extent of the spread of influence when compared to the case of influence maximization without using the community information. Additionally, we have parallelized the complete workflow by leveraging an existing parallel implementation of the Louvain community detection algorithm. We then conduct a series of experiments on a dataset with three representative graphs to first verify our implementation and then demonstrate the speedups. Our method achieves speedups ranging from 3x - 28x for graphs with small number of communities while nearly matching or even exceeding the activation performance on the entire graph. Complexity analysis reveals that dramatic speedups are possible for larger graphs that contain a correspondingly larger number of communities. In addition to the speedups obtained from the utilization of the community structure, scalability results show up to 6.3x speedup on 20 cores relative to the baseline run on 2 cores. Finally, current limitations of the approach are outlined along with the planned next steps.

community detection↗

Residual stress distribution in an additively manufactured complex structure by neutron diffraction measurement

Residual stress in an aerodynamically shaped Ni-based superalloy airfoil fabricated by laser powder bed fusion was measured by neutron diffraction. The experiment was conducted by considering the complex shape, implementing computer aided experiment planning, and automatic alignment at each rapid measurement. The 3-dimensional (3D) residual stress distribution in the airfoil is presented in this work, which lacks symmetry due to the complex geometry of the airfoil. In conclusion, the results provide theoretical thermal processing models a complete residual stress dataset of simulation validation on 3D shape complex structure.

Residual stress↗

Parallel Processing of Geospatial Time-Series Data

One way of quantifying how much sunlight the earth receives, at a particular location and time, is to compute a Cloud Index from satellite images. This calculation involves processing large files of data that are collected in a way that makes time-series analysis extremely time consuming on a single computer. There are several ways to render this memory-intensive problem more feasible usingparallel programming. Our implementation uses the Message Passing Interface (MPI) protocol and is an excellent balance between implementation complexity and execution time. We believe that this will also scale well as more complex algorithms for computing the Cloud Index emerge. This work extends to any domain where time-series analysis is needed on large data sets that are collectedas a function of time.

97 MATHEMATICS AND COMPUTING↗

Computational Spectrum of Agent Model Simulation

The study of human social behavioral systems is finding renewed interest in military, homeland security and other applications. Simulation is the most generally applied approach to studying complex scenarios in such systems. Here, we outline some of the important considerations that underlie the computational aspects of simulation-based study of human social systems. The fundamental imprecision underlying questions and answers in social science makes it necessary to carefully distinguish among different simulation problem classes and to identify the most pertinent set of computational dimensions associated with those classes. We identify a few such classes and present their computational implications. The focus is then shifted to the most challenging combinations in the computational spectrum, namely, large-scale entity counts at moderate to high levels of fidelity. Recent developments in furthering the state-of-the-art in these challenging cases are outlined. A case study of large-scale agent simulation is provided in simulating large numbers (millions) of social entities at real-time speeds on inexpensive hardware. Recent computational results are identified that highlight the potential of modern high-end computing platforms to push the envelope with respect to speed, scale and fidelity of social system simulations. Finally, the problem of shielding the modeler or domain expert from the complex computational aspects is discussed and a few potential solution approaches are identified.

97 MATHEMATICS AND COMPUTING↗

Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E{sup 2} a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E{sup 3} case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

97 MATHEMATICS AND COMPUTING↗