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,189 records · Page 66

Distributed-memory lattice H-matrix factorization

We parallelize the LU factorization of a hierarchical low-rank matrix (H-matrix) on a distributed-memory computer. This is much more difficult than the H-matrix-vector multiplication due to the dataflow of the factorization, and it is much harder than the parallelization of a dense matrix factorization due to the irregular hierarchical block structure of the matrix. Block low-rank (BLR) format gets rid of the hierarchy and simplifies the parallelization, often increasing concurrency. However, this comes at a price of losing the near-linear complexity of the H-matrix factorization. In this work, we propose to factorize the matrix using a “lattice H-matrix” format that generalizes the BLR format by storing each of the blocks (both diagonals and off-diagonals) in the H-matrix format. These blocks stored in the H-matrix format are referred to as lattices. Thus, this lattice format aims to combine the parallel scalability of BLR factorization with the near-linear complexity of H-matrix factorization. We first compare factorization performances using the H-matrix, BLR, and lattice H-matrix formats under various conditions on a shared-memory computer. Our performance results show that the lattice format has storage and computational complexities similar to those of the H-matrix format, and hence a much lower cost of factorization than BLR. In conclusion, we then compare the BLR and lattice H-matrix factorization on distributed-memory computers. Our performance results demonstrate that compared with BLR, the lattice format with the lower cost of factorization may lead to faster factorization on the distributed-memory computer.

97 MATHEMATICS AND COMPUTING↗

Highly Selective Adsorption of Ethylene over Ethane in a MOF Featuring the Combination of Open Metal Site and -Complexation

The introduction of the combination of open metal site (OMS) and -complexation into MOF has led to very high ethylene/ethane adsorption selectivity at 318K, as illustrated in the context of MIL-101-Cr-SO 3 Ag. The interactions with ethylene from both OMS and -complexation in MIL-101-Cr-SO 3 Ag have been investigated by in situ IR spectroscopic studies and computational calculations, which suggest -complexation contributes dominantly to the high ethylene/ethane adsorption selectivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling the self-assembly of ordered nanoporous materials

This report describes progress on a collaborative project on the multiscale modeling of the assembly processes in the synthesis of nanoporous materials. Such materials are of enormous importance in modern technology with application in the chemical process industries, biomedicine and biotechnology as well as microelectronics. The project focuses on two important classes of materials: i) microporous crystalline materials, such as zeolites, and ii) ordered mesoporous materials. In the first case the pores are part of the crystalline structure, while in the second the structures are amorphous on the atomistic length scale but where surfactant templating gives rise to order on the length scale of 2 - 20 nm. We have developed a modeling framework that encompasses both these kinds of materials. Our models focus on the assembly of corner sharing silica tetrahedra in the presence of structure directing agents. We emphasize a balance between sufficient realism in the models and computational tractibility given the complex many-body phenomena. We use both on-lattice and off-lattice models and the primary computational tools are Monte Carlo simulations with sampling techniques and ensembles appropriate to specific situations. Our modeling approach is the first to capture silica polymerization, nanopore crystallization, and mesopore formation through computer-simulated self assembly.

36 MATERIALS SCIENCE↗

Complex-plane generalization of scalar Levin transforms: A robust, rapidly convergent method to compute potentials and fields in multi-layered media

We propose the complex-plane generalization of a powerful algebraic sequence acceleration algorithm, the method of weighted averages (MWA), to guarantee exponential-cum-algebraic convergence of Fourier and Fourier–Hankel (F–H) integral transforms. This “complex-plane” MWA, effected via a linear-path detour in the complex plane, results in rapid, absolute convergence of field and potential solutions in multi-layered environments regardless of the source-observer geometry and anisotropy/loss of the media present. In this work, we first introduce a new integration path used to evaluate the field contribution arising from the radiation spectra. Subsequently, we (1) exhibit the foundational relations behind the complex-plane extension to a general Levin-type sequence convergence accelerator, (2) specialize this analysis to one member of the Levin transform family (the MWA), (3) address and circumvent restrictions, arising for two-dimensional integrals associated with wave dynamics problems, through minimal complex-plane detour restrictions and a novel partition of the integration domain, (4) develop and compare two formulations based on standard/real-axis MWA variants, and (5) present validation results and convergence characteristics for one of these two formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse measurement medical CT reconstruction using multi-fused block matching denoising priors

A major challenge for medical X-ray CT imaging is reducing the number of X-ray projections to lower radiation dosage and reduce scan times without compromising image quality. However these under-determined inverse imaging problems rely on the formulation of an expressive prior model to constrain the solution space while remaining computationally tractable. Traditional analytical reconstruction methods like Filtered Back Projection (FBP) often fail with sparse measurements, producing artifacts due to their reliance on the Shannon-Nyquist Sampling Theorem. Consensus Equilibrium, which is a generalization of Plug and Play, is a recent advancement in Model-Based Iterative Reconstruction (MBIR), has facilitated the use of multiple denoisers are prior models in an optimization free framework to capture complex, non-linear prior information. However, 3D prior modelling in a Plug and Play approach for volumetric image reconstruction requires long processing time due to high computing requirement. Instead of directly using a 3D prior, this work proposes a BM3D Multi Slice Fusion (BM3D-MSF) prior that uses multiple 2D image denoisers fused to act as a fully 3D prior model in Plug and Play reconstruction approach. Our approach does not require training and are thus able to circumvent ethical issues related with patient training data and are readily deployable in varying noise and measurement sparsity levels. In addition, reconstruction with the BM3D-MSF prior achieves similar reconstruction image quality as fully 3D image priors, but with significantly reduced computational complexity. We test our method on clinical CT data and demonstrate that our approach improves reconstructed image quality.

Hossain, Maliha [ORNL]↗

Exascale granular microstructure reconstruction in 3D volumes of arbitrary geometries with generative learning

Reconstructing 3D granular microstructures within volumes of arbitrary geometries from limited 2D image data is crucial for predicting the material properties, as well as performances of structural components accounting for material microstructural effects. We present a novel generative learning framework that enables exascale reconstruction of granular microstructures within complex 3D geometric volumes. Building upon existing transfer learning techniques using pre-trained convolutional neural networks (CNN), we introduce several key innovations to overcome the difficulties inherent in arbitrary geometries. Our framework incorporates periodic boundary conditions using circular padding techniques, ensuring continuity and representativeness of the reconstructed microstructures. We also introduce a novel seamless transition reconstruction (STR) method that creates statistically equivalent transition zones to integrate multiple pre-existing 3D microstructure volumes. Based on STR, we propose a cost-effective strategy for reconstructing microstructures within complex geometric volumes, minimizing computational waste. Validation through numerical experiments using kinetic Monte Carlo simulations demonstrates accurate reproduction of grain statistics, including grain size distributions and morphology. A case study involving the reconstruction of a 4-blade propeller microstructure illustrates the method’s capability to efficiently handle complex geometries. In conclusion, the proposed framework significantly reduces computational demands while maintaining high reconstruction quality, paving the way for scalable microstructure reconstruction in materials design and analysis.

36 MATERIALS SCIENCE↗

Self-consistent continuum solvation for optical absorption of complex molecular systems in solution

We introduce a new method to compute the optical absorption spectra of complex molecular systems in solution, based on the Liouville approach to time-dependent density-functional perturbation theory and the revised self-consistent continuum solvation model. The former allows one to obtain the absorption spectrum over a whole wide frequency range, using a recently proposed Lanczos-based technique, or selected excitation energies, using the Casida equation, without having to ever compute any unoccupied molecular orbitals. The latter is conceptually similar to the polarizable continuum model and offers the further advantages of allowing an easy computation of atomic forces via the Hellmann-Feynman theorem and a ready implementation in periodic-boundary conditions. The new method has been implemented using pseudopotentials and plane-wave basis sets, benchmarked against polarizable continuum model calculations on 4-aminophthalimide, alizarin, and cyanin and made available through the QUANTUM ESPRESSO distribution of open-source codes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Python’s Lunch: geometric obstructions to decoding Hawking radiation

According to Harlow and Hayden [ arXiv:1301.4504 ] the task of distilling information out of Hawking radiation appears to be computationally hard despite the fact that the quantum state of the black hole and its radiation is relatively un-complex. We trace this computational difficulty to a geometric obstruction in the Einstein-Rosen bridge connecting the black hole and its radiation. Inspired by tensor network models, we conjecture a precise formula relating the computational hardness of distilling information to geometric properties of the wormhole — specifically to the exponential of the difference in generalized entropies between the two non-minimal quantum extremal surfaces that constitute the obstruction. Due to its shape, we call this obstruction the ‘Python’s Lunch’, in analogy to the reptile’s postprandial bulge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

In-Plane Thorium(IV), Uranium(IV), and Neptunium(IV) Expanded Porphyrin Complexes

In our research, we report a first series of in-plane thorium(IV), uranium(IV), and neptunium(IV) expanded porphyrin complexes. These actinide (An) complexes were synthesized using a hexa-aza porphyrin analogue, termed dipyriamethyrin, and the non-aqueous An(IV) precur-sors: ThCl 4 (DME) 2 , UCl 4 , and NpCl 4 (DME) 2 under conditions of in situ sodium bis(trimethylsilyl)amide deprotonation. The molecu-lar and electronic structure of the ligand, each An(IV) complex, and a corresponding uranyl(VI) complex were characterized using NMR and UV-vis spectroscopies, as well as single crystal X-ray diffraction analysis. Computational analyses of these complexes, coupled with their structural features, provide support for the conclusion that a greater degree of covalency in the ligand-cation orbital interactions arises as the early actinide series is traversed from Th(IV) to U(IV) and Np(IV). The axial ligands in the current An(IV) complexes proved labile, allowing for the electronic features of these complexes to be further modified.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approaches for the Simulation of Coupled Processes in Evolving Fractured Porous Media Enabled by Exascale Computing

Models have historically represented fractured porous media with continuum descriptions that characterize the media using bulk parameters. The impact of small-scale features is not captured in these models, although they may be controlling the performance of subsurface applications. Pore-scale models can simulate processes in small-scale features by representing the pore space geometry explicitly but are computationally expensive for large domains. The alternative multiscale approach entails the combination of pore-scale and continuum-scale descriptions in a single framework. We use Chombo-Crunch, a computational capability that discretizes complex geometries with an adaptive, embedded boundary method to contrast these two approaches. Chombo-Crunch takes advantage of recent computational performance and memory bandwidth improvements resulting from the emergence of exascale computing resources. These combined improvements enable the efficient simulation of reactive transport in fractured media with a high degree of fidelity and the ability to capture the control small-scale processes exert on the overall medium evolution.

42 ENGINEERING↗

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗

Distributed merge trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges. Copyright © 2013 ACM 978-1-4503-1922-5/13/ 02...$15.00.

Morozov, D↗

Distributed Merge Trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

97 MATHEMATICS AND COMPUTING↗

Structural characterization of an intrinsically disordered protein complex using integrated small-angle neutron scattering and computing

Characterizing structural ensembles of intrinsically disordered proteins (IDPs) and intrinsically disordered regions (IDRs) of proteins is essential for studying structure–function relationships. Due to the different neutron scattering lengths of hydrogen and deuterium, selective labeling and contrast matching in small-angle neutron scattering (SANS) becomes an effective tool to study dynamic structures of disordered systems. However, experimental timescales typically capture measurements averaged over multiple conformations, leaving complex SANS data for disentanglement. We hereby demonstrate an integrated method to elucidate the structural ensemble of a complex formed by two IDRs. We use data from both full contrast and contrast matching with residue-specific deuterium labeling SANS experiments, microsecond all-atom molecular dynamics (MD) simulations with four molecular mechanics force fields, and an autoencoder-based deep learning (DL) algorithm. From our combined approach, we show that selective deuteration provides additional information that helps characterize structural ensembles. We find that among the four force fields, a99SB-disp and CHARMM36m show the strongest agreement with SANS and NMR experiments. In addition, our DL algorithm not only complements conventional structural analysis methods but also successfully differentiates NMR and MD structures which are indistinguishable on the free energy surface. Finally, we present an ensemble that describes experimental SANS and NMR data better than MD ensembles generated by one single force field and reveal three clusters of distinct conformations. Our results demonstrate a new integrated approach for characterizing structural ensembles of IDPs.

59 BASIC BIOLOGICAL SCIENCES↗

Supercomputing and Scientific Workflows Gaps and Requirements

Over the past decade, workflows have been successfully applied to a number of scientific domains with great success. Workflow engines are now commonly used across scientific disciplines to automate mundane tasks, collect provenance, and orchestrate complex processes. However, workflows have not yet made significant strides managing fine-grain, concurrent tasks directly on supercomputing platforms. As scientific computing becomes an increasingly important discovery method and high performance computing environments become more complex, addressing this gap becomes critical. Using a simple use case as motivation, this paper describes the current barriers to using workflow engines in a supercomputing environment and outlines the new capabilities that must be provided if workflows are to be successfully applied in this context.

99 GENERAL AND MISCELLANEOUS↗

Fault Diagnosis of Hybrid Computing Systems Using Chaotic-Map Method

Computing systems are becoming increasingly complex with nodes consisting of a combination of multi-core central processing units (CPUs), many integrated core (MIC) and graphics processing unit (GPU) accelerators. These computing units and their interconnections are subject to different classes of hardware and software faults, which should be detected to support mitigation measures. We present the chaotic-map method that uses the exponential divergence and wide Fourier properties of the trajectories, combined with memory allocations and assignments to diagnose component-level faults in these hybrid computing systems. We propose lightweight codes that utilize highly parallel chaotic-map computations tailored to isolate faults in arithmetic units, memory elements and interconnects. The diagnosis module on a node utilizes pthreads to place chaotic-map threads on CPU and MIC cores, and CUDA C and OpenCL kernels on GPU blocks. We present experimental diagnosis results on five multi-core CPUs; one MIC; and, seven GPUs with typical diagnosis run-times under a minute.

Rao, Nageswara↗

High Performance Computing Systems Tools, Visualization, and Management

High Performance Computing (HPC) systems are complex setups of servers, storage devices, network switches, and cables that are specifically designed to accommodate hundreds of users running highly computationally intensive applications at a time. These applications require numerous softwares, licenses, and various levels of storage as well. All of these resources must be monitored and managed by HPC administrators, which presents a daunting task. In this project, I created numerous software tools as part of an HPC Visualization and Management system, which is now used by HPC administrators on a daily basis.

97 MATHEMATICS AND COMPUTING↗

GPU-accelerated Software Library for Unsteady Flamelet Modeling of Turbulent Combustion with Complex Chemical Kinetics

Modeling and simulation of turbulent combustion are computationally demanding and challenging problems due to the complexity of turbulent flows and the complex chemical reaction kinetics. Recent advances in high performance computing (HPC) has allowed simulations to utilize increasing computer power to obtain newer insights that were not feasible before. The arrival of GPUs and many-core processors is set to revolutionize the HPC landscape. This paper presents an unsteady flamelet software library developed for utilizing GPUs as an onboard accelerator while the flow solver continues to run on conventional host processors using legacy software. The software was architected to expose multiple levels of parallelism and concurrency available in the unsteady flamelet model which is also necessary to realize the full potential of these accelerators. While the model and its coupling with the flow solver have been known for some time, the potential to target these models and libraries for newer HPC architectures provides a greater incentive for pursuing combustion model development.

Sankaran, Ramanan↗