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 1,297 records · Page 72

MOLNs: A Cloud Platform for Interactive, Reproducible, and Scalable Spatial Stochastic Computational Experiments in Systems Biology Using PyURDME

Computational experiments using spatial stochastic simulations have led to important new biological insights, but they require specialized tools and a complex software stack, as well as large and scalable compute and data analysis resources due to the large computational cost associated with Monte Carlo computational workflows. The complexity of setting up and managing a large-scale distributed computation environment to support productive and reproducible modeling can be prohibitive for practitioners in systems biology. This results in a barrier to the adoption of spatial stochastic simulation tools, effectively limiting the type of biological questions addressed by quantitative modeling. In this paper, we present PyURDME, a new, user-friendly spatial modeling and simulation package, and MOLNs, a cloud computing appliance for distributed simulation of stochastic reaction-diffusion models. In conclusion, MOLNs is based on IPython and provides an interactive programming platform for development of sharable and reproducible distributed parallel computational experiments.

97 MATHEMATICS AND COMPUTING↗

Computational Data Associated with the publication: Formation of a Decanuclear Organometallic Dysprosium Complex via a Radical–Radical Cross–Coupling Reaction

Over the years, polynuclear cyclic or torus complexes have attracted increasing interest due to their unique metal topologies and properties. However, the isolation of polynuclear cyclic organometallic complexes is extremely challenging due to their inherent reactivity, which stems from the labile and reactive metal‐carbon bonds. In this study, the pyrazine ligand undergoes a radical‐radical cross‐coupling reaction leading to the formation of a decanuclear [(Cp*)20Dy10(L1)10] ⋅ 12(C7H8) (1; where L1 = anion of 2‐prop‐2‐enyl‐2H‐pyrazine; Cp* = pentamethylcyclopentadienyl) complex, where all DyIII metal centres are bridged by the anionic L1 ligand. Amongst the family of polynuclear Ln organometallic complexes bearing CpR2Lnx units (CpR = substituted cyclopentadienyl), 1 features the highest nuclearity obtained to date. In‐depth computational studies were conducted to elucidate the proposed reaction mechanism and formation of L1, while probing of the magnetic properties of 1, revealed slow magnetic relaxation upon application of a static dc field.

Bajaj, Neha↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum sensing effect of electron tunneling in DQD/analyte complex

We investigate electron tunneling between quantum dots and molecules to propose a quantum sensor. This sensor consists of double quantum dots (DQD) with energy levels specifically tailored to mirror those of the target analyte. By analyzing the spectral distribution of electron localizations in the DQD system, we can delineate the analyte’s spectrum and deduce its composition by comparing it with a reference sample. To understand electron tunneling dynamics within the DQD/analyte complex, we performed three-dimensional computational modeling applying the effective potential approach to the InAs/GaAs heterostructure. In this modeling, we mimicked the analyte spectrum by utilizing a quantum well characterized by a quasi-discrete spectrum. Our calculations reveal the inherent potential of utilizing this method as a highly sensitive and selective sensor.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Enhancing performance assessments using the ASCEM tool-set - 15222

The Office of Soil and Groundwater Remediation within the U.S. Department of Energy's Office of Environmental Management (EM) is supporting development of the Advanced Simulation Capability for Environmental Management (ASCEM). ASCEM is an open source and modular computing framework that incorporates new advances and tools for predicting contaminant fate and transport in natural and engineered systems. ASCEM integrates modeling tools into a common work-flow that facilitates integrated approaches to modeling and site characterization, and enables robust and standardized assessments of performance and risk for EM cleanup and closure activities. The ASCEM project includes collaboration with end users engaged in performance assessments and subsurface simulation. Two working groups are engaged in performance assessment activities at the Hanford Site and Savannah River Site (SRS). The Hanford Site working group is focused on evaluating an alternative conceptual model that includes fine-scale heterogeneities. The baseline conceptual model for the performance assessment includes the large-scale stratigraphy at the site. The working group is applying the ASCEM tool-set to develop and evaluate alternative conceptual models and evaluate the effect of heterogeneities on long-term transport under rainfall-driven conditions. Because the heterogeneous models require long compute times due to increased model complexity, the simulations are implemented on a high-performance computing platform to reduce simulation times. The ASCEM Akuna work-flow enables efficient organization, simulation execution, and processing and visualization of results. Current performance assessments for waste tank closure at the SRS are limited to two-dimensional axi-symmetric representations. The SRS working group is collaborating with the site contractor to address technical review issues by resolving fine-scale tank features and simulating three-dimensional flow with Richards equation for selected closure scenarios using the ASCEM simulator, Amanzi. The Akuna tool-set is being applied to support model setup, sensitivity analysis, uncertainty quantification, and visualization. Both of the ASCEM working groups are addressing issues that cannot readily be evaluated with the existing tools. In these efforts, ASCEM is being used to provide technical underpinnings for ongoing performance assessments. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Assessment of TD-DFT and LF-DFT for study of d − d transitions in first row transition metal hexaaqua complexes

Herein, we present the systematic, comparative computational study of the d − d transitions in a series of first row transition metal hexaaqua complexes, [M(H{sub 2}O){sub 6}]{sup n+} (M{sup 2+/3+} = V {sup 2+/3+}, Cr{sup 2+/3+}, Mn{sup 2+/3+}, Fe{sup 2+/3+}, Co{sup 2+/3+}, Ni{sup 2+}) by the means of Time-dependent Density Functional Theory (TD-DFT) and Ligand Field Density Functional Theory (LF-DFT). Influence of various exchange-correlation (XC) approximations have been studied, and results have been compared to the experimental transition energies, as well as, to the previous high-level ab initio calculations. TD-DFT gives satisfactory results in the cases of d{sup 2}, d{sup 4}, and low-spin d{sup 6} complexes, but fails in the cases when transitions depend only on the ligand field splitting, and for states with strong character of double excitation. LF-DFT, as a non-empirical approach to the ligand field theory, takes into account in a balanced way both dynamic and non-dynamic correlation effects and hence accurately describes the multiplets of transition metal complexes, even in difficult cases such as sextet-quartet splitting in d{sup 5} complexes. Use of the XC functionals designed for the accurate description of the spin-state splitting, e.g., OPBE, OPBE0, or SSB-D, is found to be crucial for proper prediction of the spin-forbidden excitations by LF-DFT. It is shown that LF-DFT is a valuable alternative to both TD-DFT and ab initio methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Compressed optimization of device architectures

Recent advances in nanotechnology have enabled researchers to control individual quantum mechanical objects with unprecedented accuracy, opening the door for both quantum and extreme- scale conventional computation applications. As these devices become more complex, designing for facility of control becomes a daunting and computationally infeasible task. Here, motivated by ideas from compressed sensing, we introduce a protocol for the Compressed Optimization of Device Architectures (CODA). It leads naturally to a metric for benchmarking and optimizing device designs, as well as an automatic device control protocol that reduces the operational complexity required to achieve a particular output. Because this protocol is both experimentally and computationally efficient, it is readily extensible to large systems. For this paper, we demonstrate both the bench- marking and device control protocol components of CODA through examples of realistic simulations of electrostatic quantum dot devices, which are currently being developed experimentally for quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rational Design of Orthogonal Multipolar Interactions with Fluorine in Protein–Ligand Complexes

Multipolar interactions involving fluorine and the protein backbone have been frequently observed in protein–ligand complexes. Such fluorine–backbone interactions may substantially contribute to the high affinity of small molecule inhibitors. Here we found that introduction of trifluoromethyl groups into two different sites in the thienopyrimidine class of menin–MLL inhibitors considerably improved their inhibitory activity. In both cases, trifluoromethyl groups are engaged in short interactions with the backbone of menin. In order to understand the effect of fluorine, we synthesized a series of analogues by systematically changing the number of fluorine atoms, and we determined high-resolution crystal structures of the complexes with menin. Here, we found that introduction of fluorine at favorable geometry for interactions with backbone carbonyls may improve the activity of menin–MLL inhibitors as much as 5- to 10-fold. In order to facilitate the design of multipolar fluorine–backbone interactions in protein–ligand complexes, we developed a computational algorithm named FMAP, which calculates fluorophilic sites in proximity to the protein backbone. We demonstrated that FMAP could be used to rationalize improvement in the activity of known protein inhibitors upon introduction of fluorine. Furthermore, FMAP may also represent a valuable tool for designing new fluorine substitutions and support ligand optimization in drug discovery projects. Analysis of the menin–MLL inhibitor complexes revealed that the backbone in secondary structures is particularly accessible to the interactions with fluorine. Lastly, considering that secondary structure elements are frequently exposed at protein interfaces, we postulate that multipolar fluorine–backbone interactions may represent a particularly attractive approach to improve inhibitors of protein–protein interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The multi-faceted inverted harmonic oscillator: Chaos and complexity

The harmonic oscillator is the paragon of physical models; conceptually and computationally simple, yet rich enough to teach us about physics on scales that span classical mechanics to quantum field theory. This multifaceted nature extends also to its inverted counterpart, in which the oscillator frequency is analytically continued to pure imaginary values. In this article we probe the inverted harmonic oscillator (IHO) with recently developed quantum chaos diagnostics such as the out-of-time-order correlator (OTOC) and the circuit complexity. In particular, we study the OTOC for the displacement operator of the IHO with and without a non-Gaussian cubic perturbation to explore genuine and quasi scrambling respectively. In addition, we compute the full quantum Lyapunov spectrum for the inverted oscillator, finding a paired structure among the Lyapunov exponents. We also use the Heisenberg group to compute the complexity for the time evolved displacement operator, which displays chaotic behaviour. Finally, we extended our analysis to N-inverted harmonic oscillators to study the behaviour of complexity at the different timescales encoded in dissipation, scrambling and asymptotic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement-based Power System Dynamic Model Reductions

Interconnected power systems have experienced a significant increase in its size and complexity, due to continuous topology and operating condition changes. It is computationally burdensome to represent entire system models in detail to conduct power system analysis. In the large-scale power system dynamic simulations, the models in the study area need to be retained in detail while the external area can be reduced without compromising accuracy, which can preserve the full system dynamic properties. This paper develops measurement-based continuous-time dynamic equivalents for power systems in order to both improve the model accuracy of the reduced system and increase the speed of dynamic simulation. Our method is based on a set of measurements at the boundary nodes between the study area and external area. Case studies demonstrate that the measurement-based model can capture the full system behavior sufficiently, and improve computational efficiency.Interconnected power systems experienced a significant increase in size and complexity. It is computationally burdensome to represent the entire system in detail to conduct power system analysis. Therefore, the model of the study system must be retained in detail while the external system can be reduced using system reduction techniques. This paper proposes a measurement-based dynamic equivalent in order to increase both model accuracy and simulation speed. The proposed method uses a set of measurements at the boundary nodes between the study area and external area for model parameter identification. Case studies demonstrate that the measurement-based technique can capture the main system behaviors accurately and improve computational efficiency.

Xue, Yaosuo↗

Computational Science at Los Alamos National Laboratory (Rev. 1) [Slides]

High Performance Computing (HPC) enables problem solving at the grandest scales, on the most complex challenges that face humanity. The problems often tackled by scientific computing are: Very complex; Cool; Using the fastest, most powerful supercomputers on the planet; Often important, impactful, effecting real lives.

97 MATHEMATICS AND COMPUTING↗

Complexity-theoretic foundations of BosonSampling with a linear number of modes

BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the complexity-theoretic hardness arguments and current experiments. One of the largest gaps involves the ratio of {particles} to modes -- all current hardness evidence assumes a dilute regime in which the number of linear optical modes scales at least quadratically in the number of particles. By contrast, current experiments operate in a saturated regime with a linear number of modes. In this paper we bridge this gap, bringing the hardness evidence for experiments in the saturated regime to the same level as had been previously established for the dilute regime. This involves proving a new worst-to-average-case reduction for computing the Permanent which is robust to both large numbers of row repetitions and also to distributions over matrices with correlated entries. We also apply similar arguments to give evidence for hardness of Gaussian BosonSampling in the saturated regime.

Computational Complexity (cs.CC)↗

AENET–LAMMPS and AENET–TINKER : Interfaces for accurate and efficient molecular dynamics simulations with machine learning potentials

Machine-learning potentials (MLPs) trained on data from quantum-mechanics based first-principles methods can approach the accuracy of the reference method at a fraction of the computational cost. To facilitate efficient MLP-based molecular dynamics and Monte Carlo simulations, an integration of the MLPs with sampling software is needed. Here, we develop two interfaces that link the atomic energy network (ænet) MLP package with the popular sampling packages TINKER and LAMMPS. The three packages, ænet, TINKER, and LAMMPS, are free and open-source software that enable, in combination, accurate simulations of large and complex systems with low computational cost that scales linearly with the number of atoms. Scaling tests show that the parallel efficiency of the ænet–TINKER interface is nearly optimal but is limited to shared-memory systems. The ænet–LAMMPS interface achieves excellent parallel efficiency on highly parallel distributed memory systems and benefits from the highly optimized neighbor list implemented in LAMMPS. We demonstrate the utility of the two MLP interfaces for two relevant example applications: the investigation of diffusion phenomena in liquid water and the equilibration of nanostructured amorphous battery materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sentinel

Network intrusion detection systems (NIDS) are commonplace in network security but they frequently employ algorithms that are computational demanding requiring hardware and software with significant power requirements. Two examples of such resource-intensive algorithms used for network security are regular expression matching and broader signature pattern matching which are commonly used in deep packet inspection (DPI). Network security algorithms that have large power requirements may be a challenge for low-power internet-of-things (IoT) environments, which generally lack the power resources to implement complex security measures like computationally expensive DPI at the edge. Furthermore, IoT environments incorporating 5G standalone networks have network latency constraints beyond just power that make DPI at the edge even more difficult. Programmable logic is ideally suited for machine learning inference for DPI because of its deep instruction level parallelism and single-cycle memory access. Machine learning approaches for DPI have been explored before using the programmable logic of field programmable gate arrays (FPGA) as a potential solution for NIDS approaches that would be power-suitable for IoT. However, those previous programmable logic NIDS approaches utilize either a supervised or unsupervised learning model. Sentinel utilizes the ensemble of these two machine learning approaches known as a semi-supervised approach which has shown promise in NIDS implementations. Sentinel provides a programmable logic implementation of a semi-supervised approach for DPI which operates at much lower power and latency than a GPU implementation with negligible loss of accuracy due to quantization through a logistic regressor.

Anderson, MatthewW [Idaho National Laboratory (INL↗

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗

Dirac traces and the Tutte polynomial

Perturbative calculations involving fermion loops in quantum field theories require tracing over Dirac matrices. A simple way to regulate the divergences that generically appear in these calculations is dimensional regularisation, which has the consequence of replacing 4-dimensional Dirac matrices with d-dimensional counterparts for arbitrary complex values of d. In this work, a connection between traces of d-dimensional Dirac matrices and computations of the Tutte polynomial of associated graphs is proven. The time complexity of computing Dirac traces is analysed by this connection, and improvements to algorithms for computing Dirac traces are proposed.

Renormalization and Regularization↗