Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Sierra/SolidMechanics 4.56 User's Guide

Siera/SolidMechanics (Sierra / SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra / SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra / SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes . This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Sierra/SolidMechanics 4.58 User's Guide

Sierra / SolidMechanics (Sierra / SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra / SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra / SM has a versatile library of continuum and structural elements, an d a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes . This document describes the functionality and input syntax for Sierra / SM.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Multigroup Thermal Radiation Transport with Tensor Trains

We investigate the application of tensor-train (TT) algorithms to multigroup thermal radiation transport (i.e., photon radiation transport). The TT framework enables simulations at discretizations that might otherwise be computationally infeasible on conventional hardware. We show that solutions to certain multigroup problems possess an intrinsic low-rank structure, which the TT representation leverages effectively. This enables us to solve problems where the discretized solution size exceeds a trillion parameters on a single node. The solver is evaluated on a range of test problems with varying levels of complexity, consistently achieving compression factors greater than 100× and speedups exceeding 2×. We also investigate alternative TT topologies by analyzing the low-rank structure of the merged spatio-spectral core to assess the potential for greater compression. This analysis suggests that compression gains could increase by factors as large as 7. Our results indicate that the low-rank structure of the merged spatio-spectral core captures the spatio-spectral complexity of the solution, largely driven by the opacity structure of the medium. Beyond identifying opportunities for improved compression, this analysis highlights the types of errors that may arise in angle-integrated quantities when exploiting this low-rank structure.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗
DOE OSTI2020

Space-energy separated representations for multigroup neutron diffusion using proper generalized decompositions

Proper generalized decomposition (PGD) can be described as a numerical extension of separation of variables and thus be employed as a solution technique for multi-dimensional problems, where dimensions should be understood in the phase-space context of the governing law at hand. This paper presents a PGD approach on efficiently solving problems involving multigroup neutron diffusion. Two PGD approaches are described: space-only and space-energy decompositions. Numerical results include 2-D and 3-D examples with two-, seven-, and 145-group structures. The PGD solutions are compared against traditional multi-dimensional finite element discretization. For few-group problems, both PGD approaches prove effective for mildly heterogeneous geometries, but showed reduced performance with increasing heterogeneity. The space-energy representation was found to be slower than the space-only approach for two-group problems, but proved more effective for seven-group problems. For even larger numbers of groups, the space-energy PGD decomposition was very effective at reducing the computational time.

42 ENGINEERING↗
DOE OSTI2023

Generating Synthetic Time Series Photovoltaic Data with Real-World Physical Challenges and Noise for Use in Algorithm Test and Validation

The PV Fleet Data Initiative and other projects seek the develop algorithms for automated analysis of PV time series data for extraction of statistical information and other parameters of the data such as degradation rates, soiling loss information, tracker performance, clipping or curtailment, system availability and other valuable information. While there is a vast body of PV data available for application of said extraction algorithms it is difficult to validate these algorithms because the true parameters to be extracted are not known. There has been a wide use of synthetic data in the literature for algorithm validation but this synthetic data is typically very bounded by the problem or topic at hand. The PV Fleet Data Initiative project has demonstrated that real time series PV data almost always includes a host of data quality and physical problems that, in reality, any automated PV abstraction algorithm must handle appropriately. For this reason, this work describes the development of a complex synthetic PV times series data set that includes data quality and physical problems that have been experienced in real world PV data. The various quality and physical problems are documented in the synthetic data so that users can test the validity of various PV extraction algorithms as well as develop new algorithms to solve problems this data set can support.

14 SOLAR ENERGY↗
DOE OSTI2023

Multi-Stage Modeling With Recourse Decisions for Solving Stochastic Complementarity Problems With an Application in Energy

This paper presents a multi-stage model with recourse decisions for solving complementarity problems in a competitive electricity market under uncertainty, while also considering renewable energy technologies and battery storage utilization. The model is based on a Nash-Cournot formulation of imperfect competition among power producers. We analyze the value of variable renewable energy (VRE) and battery storage under different uncertainties, such as demand level and VRE availability. To illustrate the proposed model, we apply it to three- bus five-player model and analyze different cases varying costs, including a user-optimal perspective (with market power) and a system-optimal perspective (with central planning). We also consider the potential for congestion in the system by restricting the transmission capacity between a single interface that connects two buses. Our findings show that increasing the battery storage capacity results in a decrease in the need for perfect information about future uncertainties. Additionally, as the model allows for more uncertainty, it becomes more apparent that the stochastic mixed complementarity problem (MCP) has an advantage over a deterministic equivalent. We propose the use of the Value of the Stochastic Equilibrium Solution (VSES) as a quality metric to compare the stochastic MCP with its deterministic equivalent. Overall, expanding battery storage capacity can lower the maximum, mean, and variance values of delivered prices, but there are diminishing returns to this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

ECP FY19 AD Project Review [Slides]

Industry seems to have the isolated-single-turbine-in-a-flat-field problem "solved". Wide-scale deployment and cost competitiveness require large wind plants — tens to hundreds of turbines in complex terrain. Predictive wind farm simulation is an exascale problem.

17 WIND ENERGY↗
DOE OSTI2024

Data-driven and model-agnostic approach to solving combinatorial assignment problems in searches for new physics

We present a novel approach to solving combinatorial assignment problems in particle physics. The correct assignment of decay products to parent particles is achieved in a model-agnostic fashion by introducing a neural network architecture, asswd-, which combines a custom layer based on attention mechanisms and dual autoencoders. We demonstrate how the network, trained purely on background events in an unsupervised setting, is capable of reconstructing correctly hypothetical new particles regardless of their mass, decay multiplicity, and substructure, and produces simultaneously an anomaly score that can be used to efficiently suppress the background. This model allows the extension of the suite of searches for localized excesses to include nonresonant particle pair production where the reconstruction of the two resonant masses is thwarted by combinatorics. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2019

Active Manifolds ICML 2019 Paper Results Code

Problem Solved: A novel technique for regression and sensitivity analysis of C1 function f problematic input dimension given observations (x_i, f(x_i), f'(x_i)). Solution Provided by the Code: Active Manifolds reduces the problem to analysis/regression of a 1 dimensional analogue by exploiting geometric properties of the function.

Bridges, RobertA.↗
DOE OSTI2018

Applications of Analytic Models to Spent Fuel Cask Analysis

The advent of high performance computing has changed the way scientists and engineers solve problems. Scientists previously would make a tremendous effort to simplify a complex problem to it’s essence by reducing geometry, neglecting changes and only preserving first-order effects. Now, scientist are able to leave the details in the problem and computationally arrive at a result. To develop the computational physics programs used by scientists, developers make assumptions and use approximation to reduce complex, continuous calculus to algebraic expressions which computers are able to solve.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Meshfree Methods

Meshfree methods have undergone substantial development and have received much attention in the last two decades. This new family of numerical methods is designed to inherit the main advantages of the finite element method such as compact supports of shape functions and good approximation properties while, at the same time, overcome the main disadvantages of the finite element method caused by the mesh dependence. The meshfree methods share a common feature that no mesh is needed and shape functions are constructed from sets of points, thus eliminating the need for time consuming mesh generation. The most significant advantage of meshfree methods is the flexibility in customizing approximation functions for desired regularity and for capturing essential physics and features of the particular problems of interest. Adaptivity formulation and multiple-scale solution strategies also can be implemented with relative ease. It has become clear that the meshfree methods provide considerable advantages over the conventional finite element methods in solving problems involving moving discontinuities, evolving material interfaces, multiple-scale phenomena, large material distortion and structural deformation, and fracture and damage processes. This Chapter gives an overview of many classes of meshfree methods, with more detailed discussions on Smoothed Particle Hydrodynamics (SPH), the Reproducing Kernel Particle Method (RKPM), Peridynamics (PD), the Material Point Method (MPM), as well as their applications in various challenging engineering problems.2

Chen, Jiun-Shyan↗
DOE OSTI2020

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

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

Regularization by denoising diffusion models for solving inverse PDE problems with application to full waveform inversion

Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.

Shan, Siming [Yale University, New Haven, CT (Unit↗
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗