Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring methods”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Parallel quantum annealing

Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after quantum annealing. However, since the connectivity of the physical qubits on the chip is limited, a minor embedding of the problem structure onto the chip is required. In this process, and especially for smaller problems, many qubits will stay unused. We propose a novel method, called parallel quantum annealing, to make better use of available qubits, wherein either the same or several independent problems are solved in the same annealing cycle of a quantum annealer, assuming enough physical qubits are available to embed more than one problem. Although the individual solution quality may be slightly decreased when solving several problems in parallel (as opposed to solving each problem separately), we demonstrate that our method may give dramatic speed-ups in terms of the Time-To-Solution (TTS) metric for solving instances of the Maximum Clique problem when compared to solving each problem sequentially on the quantum annealer. Additionally, we show that solving a single Maximum Clique problem using parallel quantum annealing reduces the TTS significantly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Data-Efficient Dimensionality Reduction and Surrogate Modeling of High-Dimensional Stress Fields

Tensor datatypes representing field variables like stress, displacement, velocity, etc., have increasingly become a common occurrence in data-driven modeling and analysis of simulations. Numerous methods [such as convolutional neural networks (CNNs)] exist to address the meta-modeling of field data from simulations. As the complexity of the simulation increases, so does the cost of acquisition, leading to limited data scenarios. Modeling of tensor datatypes under limited data scenarios remains a hindrance for engineering applications. Here, in this article, we introduce a direct image-to-image modeling framework of convolutional autoencoders enhanced by information bottleneck loss function to tackle the tensor data types with limited data. The information bottleneck method penalizes the nuisance information in the latent space while maximizing relevant information making it robust for limited data scenarios. The entire neural network framework is further combined with robust hyperparameter optimization. We perform numerical studies to compare the predictive performance of the proposed method with a dimensionality reduction-based surrogate modeling framework on a representative linear elastic ellipsoidal void problem with uniaxial loading. The data structure focuses on the low-data regime (fewer than 100 data points) and includes the parameterized geometry of the ellipsoidal void as the input and the predicted stress field as the output. The results of the numerical studies show that the information bottleneck approach yields improved overall accuracy and more precise prediction of the extremes of the stress field. Additionally, an in-depth analysis is carried out to elucidate the information compression behavior of the proposed framework.

artificial intelligence↗
DOE OSTI2020

Local-nonlocal coupling in Emu/PDMS

A technique called the splice method for coupling local to peridynamic subregions of a body is described. The method relies on ghost nodes, whose values of displacement are interpolated from nearby physical nodes, to make each subregion visible to the other. In each time step, the nodes in each subregion treat the nodes in the other subregion as boundary conditions. Adaptively changing the subregions is possible through the creation and deletion of ghost nodes. Example problems in 2D and 3D illustrate how the method is used to perform multiscale modeling of fracture and impact events within a larger structure.

42 ENGINEERING↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗
DOE OSTI2022

Molecular-based analysis of nanoparticle solvation: Classical density functional approach

Proper statistical mechanics understanding of nanoparticle solvation processes requires an accurate description of the molecular structure of the solvent. Achieving this goal with standard molecular dynamics (MD) simulation methods is challenging due to large length scales. An alternative approach to this problem can be formulated using classical density functional theory (cDFT), where a full configurational description of the positions of all the atoms is replaced by collective atomic site densities in the molecule. Using an example of the negatively charged silica-like system in an aqueous polar environment represented by a two-site water model, we demonstrate here that cDFT can reproduce MD data at a fraction of the computational cost. An important implication of this result is the ability to understand how the solvent molecular features may affect the system’s properties at the macroscopic scale. A concrete example highlighted in this work is the analysis of nanoparticle interactions with sizes of up to 100 nm in diameter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Strategies for solving the excited-state self-consistent-field problem for highly excited and multiply ionized states

The dynamics of molecules exposed to intense x-ray radiation involve a large number of multiply ionized and highly excited electronic configurations. To model these dynamics a reliable and efficient electronic structure model is imperative. Employing the Hartree-Fock-Slater electronic structure model in combination with the maximum overlap method, we quantify the associated convergence failures when calculating electronic states of carbon monoxide with multiple vacancies in the core and valence levels. Here, we characterize these cases and describe strategies to overcome the convergence problems. The described techniques not only eliminate all convergence issues for CO but also result in a significant reduction of convergence failures for simulations of the x-ray-induced multiple ionization dynamics of the phenol molecule.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

GPU Profiling and Optimizing xRAGE (Final Report)

Our project’s objective is to increase the efficiency of GPU-enabled kernels in xRAGE. To do so, we conduct GPU profiling with NSight Systems on xRAGE tests unsplit_sod_1d and unsplit_sedov_2d to identify bottlenecks and understand the behavior of the GPU during code execution. Next, we analyze these generated GPU profiles to locate the lines of code whose optimization have the most potential for improving runtime. We replicate the structure of the code in smaller test problems that are easier to understand, edit, and run quickly. Within these test problems, we implement two different methods of improving performance: transformation of nested loops into a single MDRangePolicy and hierarchical parallelization using teams of threads. Both methods show speedups in the test code, and after transferring them to xRAGE, they both show up to 30x speedups on various computing platforms. Profiling the edited versions of xRAGE reveals that the GPU successfully executed the bottlenecks with greater efficiency

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Enumeration as a Tool for Structure Solution: A Materials Genomic Approach to Solving the Cation-Ordered Structure of Na 3 V 2 (PO 4 ) 2 F 3

While powder diffraction methods are routinely utilized to optimize structural models for compounds whose crystal structures are known, the determination of unknown structures is far more challenging. When the unknown structure is large, structure solution can become a virtually intractable problem using standard structure solution methodologies, especially when the space group cannot be unambiguously resolved. One such system is the promising Na-ion battery cathode material Na 3 V 2 (PO 4 ) 2 F 3 whose high temperature and room temperature structures were previously solved, but whose more complex low-temperature structure could not be determined. Here, a novel materials genomic approach is demonstrated for the solution of the unknown 100 K structure of Na 3 V 2 (PO 4 ) 2 F 3 in which enumeration methods are first used to generate a large number (~3,000) of trial structures based on plausible orderings of Na ions and then automated Rietveld refinements are carried out to optimize each of these trial structures. Based on both the analysis of the ensemble of optimized trial structures and the density functional theory energy minimization of selected trial structures, the 100 K structure of Na 3 V 2 (PO 4 ) 2 F 3 is best described as belonging to the space group A2 1 am with unit cell dimensions of a = 9.01928(4), b = 27.1379(1), c = 10.73307(5). The 100 K unit cell has a large volume of 2627.07(2) Å 3 with Z = 12 and 33 independent crystallographic sites (9 Na, 3 V, 3 P, 12 O, and 6 F) that is 3x and 6x larger than the room- and high-temperature polymorphs of this phase, respectively. Finally, the novel methods described here will be generally applicable for the solution of the complex cation-ordered structures that commonly occur for battery materials.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Feasibility Study on Implementing a Staggered-Grid Finite Volume Method for System Analysis Code Development Under the MOOSE Framework

Here, this work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key to the test bed is the implementation of high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. The test bed utilized a more flexible code structure to enable the finite volume method implementation and direct interacting with the solver package, instead of using the natively supported finite element method by the framework. Using a suite of selected test problems with different problem sizes and levels of complexity, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. For a complex reactor model, transient simulation was performed using the newly developed finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development.

MOOSE↗
DOE OSTI2025

Holographic Quantum Simulation of Strongly Correlated Electron Systems

The project aimed to demonstrate a new holographic quantum simulation approach and co‐ designed quantum hardware to tackle three specific problems that fall within the broad umbrella of unraveling the physics of strongly correlated electron systems (SCES). These tasks were: (1) holographic preparation of ground‐ and thermal‐ states of correlated magnetic and electronic systems including quasi‐2d frustrated‐spin, Fermi‐Hubbard, and fractional quantum Hall (FQH) systems, (2) holographic‐simulation of long‐time out‐of‐equilibrium dynamics and (3) holographic analogs of embedding methods such as dynamical mean‐ field theory (DMFT) and density‐matrix embedding theory (DMET) to solve systems with complex structure or long‐range interactions. These tasks are prototypes for the kinds of material simulation problems of interest to BES, such as the simulation of multiferroic materials, perovskite photovoltaics and high‐temperature superconductors, that tax the capabilities of the most powerful classical supercomputers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Recent Developments in the General Atomic and Molecular Electronic Structure System

A discussion of many of the recently implemented features of GAMESS (General Atomic and Molecular Electronic Structure System) and LibCChem (the C++ CPU/GPU library associated with GAMESS) is presented. These features include fragmentation methods like the fragment molecular orbital, effective fragment potential and effective fragment molecular orbital methods, hybrid MPI/OpenMP approaches to Hartree-Fock and resolution of the identity second order perturbation theory. Many new coupled cluster theory methods have been implemented in GAMESS, as have multiple levels of density functional/tight binding theory. The role of accelerators, especially graphical processing units, is discussed in the context of the new features of LibCChem, as is the associated problem of power consumption as the power of computers increases dramatically. The process by which a complex program suite like GAMESS is maintained and developed is considered. Future developments are briefly summarized.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

buhito

buhito is a Python library for graph analysis and machine learning. Graphs can represent networks with objects as nodes and their relationships as edges. buhito focuses on graphlet methods that study graphs through enumerating their component subgraphs to enable interpretable and fast models of complex systems. The package provides tools for different algorithmic designs for computing, analyzing, and applying graphlets to research problems such as machine learning, data compression, and anomaly detection in graph-structured data. A central feature is performing decomposition data analysis on graphs for machine learning models. Implemented in Python and built upon open-source scientific libraries such as NetworkX, NumPy, and SciPy, buhito provides high-performance methods for researchers exploring the mathematical and computational foundations of graphlet analysis applicable to systems of different sizes.

Pimonova, Yulia↗
DOE OSTI2024

A layered solid finite element formulation with interlaminar enhanced displacements for the modeling of laminated composite structures

Accurate modeling of layered composite structures often requires the use of detailed finite element models which can sufficiently resolve the kinematics and material behavior within each layer of the composite. However, individually discretizing each material layer into finite elements presents a prohibitive computational expensive given the large number of thin layers comprising some laminated composites. To address these challenges, an 8-node layered solid hexahedral finite element is formulated with the aim of striking an appropriate balance between efficiency and fidelity. The element is discretized into an arbitrary number of distinct material layers, and employs reduced in-plane integration within each layer. The chosen reduced integration scheme is supplemented by a novel physical stabilization approach which includes layerwise enhancements to mitigate various forms of locking phenomena. The proposed framework additionally supports the inclusion of interlaminar enhanced displacements to better represent the kinematics of general layered composite materials. Finally, the described element formulation has been implemented in the ParaDyn finite element code, and its efficacy for modeling laminated composite structures is demonstrated on a variety of verification problems.

42 ENGINEERING↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Harmonic analysis of discrete tracers of large-scale structure

It is commonplace in cosmology to analyze fields projected onto the celestial sphere, and in particular density fields that are defined by a set of points e.g. galaxies. When performing an harmonic-space analysis of such data (e.g. an angular power spectrum) using a pixelized map one has to deal with aliasing of small-scale power and pixel window functions. We compare and contrast the approaches to this problem taken in the cosmic microwave background and large-scale structure communities, and advocate for a direct approach that avoids pixelization. We describe a method for performing a pseudo-spectrum analysis of a galaxy data set and show that it can be implemented efficiently using well-known algorithms for special functions that are suited to acceleration by graphics processing units (GPUs). The method returns the same spectra as the more traditional map-based approach if in the latter the number of pixels is taken to be sufficiently large and the mask is well sampled. The method is readily generalizable to cross-spectra and higher-order functions. It also provides a convenient route for distributing the information in a galaxy catalog directly in harmonic space, as a complement to releasing the configuration-space positions and weights, and a route to spectral apodization. Finally, we make public a code enabling the application of our method to existing and upcoming datasets.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Multiorbital Quantum Impurity Solver for General Interactions and Hybridizations

Here we present a numerically exact inchworm Monte Carlo method for equilibrium multiorbital quantum impurity problems with general interactions and hybridizations. We show that the method, originally developed to overcome the dynamical sign problem in certain real-time propagation problems, can also overcome the sign problem as a function of temperature for equilibrium quantum impurity models. This is shown in several cases where the current method of choice, the continuous-time hybridization expansion, fails due to the sign problem. Our method therefore enables simulations of impurity problems as they appear in embedding theories without further approximations, such as the truncation of the hybridization or interaction structure or a discretization of the impurity bath with a set of discrete energy levels, and eliminates a crucial bottleneck in the simulation of ab initio embedding problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Sparse Bayesian mass mapping with uncertainties: hypothesis testing of structure

ABSTRACT A crucial aspect of mass mapping, via weak lensing, is quantification of the uncertainty introduced during the reconstruction process. Properly accounting for these errors has been largely ignored to date. We present a new method to reconstruct maximum a posteriori (MAP) convergence maps by formulating an unconstrained Bayesian inference problem with Laplace-type l1-norm sparsity-promoting priors, which we solve via convex optimization. Approaching mass mapping in this manner allows us to exploit recent developments in probability concentration theory to infer theoretically conservative uncertainties for our MAP reconstructions, without relying on assumptions of Gaussianity. For the first time, these methods allow us to perform hypothesis testing of structure, from which it is possible to distinguish between physical objects and artefacts of the reconstruction. Here, we present this new formalism, and demonstrate the method on simulations, before applying the developed formalism to two observational data sets of the Abell 520 cluster. Initial reconstructions of the Abell 520 catalogues reported the detection of an anomalous ‘dark core’ – an overdense region with no optical counterpart – which was taken to be evidence for self-interacting dark matter. In our Bayesian framework, it is found that neither Abell 520 data set can conclusively determine the physicality of such dark cores at $99{{\ \rm per\ cent}}$ confidence. However, in both cases the recovered MAP estimators are consistent with both sets of data.

Price, M. A.↗