Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving 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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Machine learning for domain transfer between simulated and experimental 2D X-ray diffraction patterns using generative adversarial networks

X-ray diffraction (XRD) is a well-established technique for analyzing materials at an atomic level. Dynamic compression experiments (DCE), in which materials are subject to extreme pressures, can provide fundamental understanding to pressure-induced phase transitions and compression of the crystal lattice. The analysis of XRD patterns from highly compressed samples is non-trivial given the sparsity of data, high experimental costs, and the fact that the data is often marred with X-ray background and other artifacts. While accurate computational frameworks exist, they solve the forward problem—from structures and orientations to XRD patterns. Solving the inverse problem for 2D experimental diffraction patterns is currently a complex manual process of matching and comparing experimentally observed patterns to computationally generated ones. Machine learning is a promising tool for automating the matching process but often requires data-intensive architectures. Here, in this study, we use a CycleGAN to translate the domain of limited experimental data to a domain in which there is readily available simulated data. This domain shift allows data-intensive machine learning models that have only been trained on simulated XRD patterns to be used in the analysis of experiments.

Brozak, Samantha Jean [Sandia National Laboratorie↗
DOE OSTI2020

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Power Dissipation on the Metallic Coating of a Ceramic Chamber in Planar Approximation

We adopt the standard field matching technique to solve the general electromagnetic problem consisting of two parallel layers with arbitrary complex relative permittivity and permeability. With parameters of the NSLS-II ceramic chambers, we calculate the power dissipated on the metallic coating and compare the result with the power lost by the beam and with the results of [4].

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Scalable preconditioning for the stabilized contact mechanics problem

We present a family of preconditioning strategies for the contact problem in fractured and faulted porous media. We combine low-order continuous finite elements to simulate the bulk deformation with piecewise constant Lagrange multipliers to impose the frictional contact constraints. This formulation is not uniformly inf-sup stable and requires stabilization. We improve previous work by Franceschini et al. (2020) by introducing a novel jump stabilization technique that requires only local geometrical and mechanical properties. We then design scalable preconditioning strategies that take advantage of the block structure of the Jacobian matrix using a physics-based partitioning of the unknowns by field type, namely displacement and Lagrange multipliers. The key to the success of the proposed preconditioners is a pseudo-Schur complement obtained by eliminating the Lagrange multiplier degrees of freedom, which can then be efficiently solved using an optimal multigrid method. Numerical results, including complex real-world problems, are presented to illustrate theoretical properties, scalability and robustness of the preconditioner. A comparison with other approaches available in the literature is also provided.

58 GEOSCIENCES↗
DOE OSTI2025

SPIKANs: separable physics-informed Kolmogorov–Arnold networks

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Kolmogorov-Arnold networks↗
DOE OSTI2024

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗
DOE OSTI2023

Modeling and optimization of steady flow of natural gas and hydrogen mixtures in pipeline networks

Here, we extend the canonical problems of simulation and optimization of steady-state gas flows in pipeline networks with compressors to the transport of mixtures of highly heterogeneous gases injected throughout a network. Our study is motivated by proposed projects to blend hydrogen generated using clean energy into existing natural gas pipeline systems as part of efforts to reduce the reliance of energy systems on fossil fuels. Flow in a pipe is related to endpoint pressures by a basic Weymouth equation model, with an ideal gas equation of state, where the wave speed depends on the hydrogen concentration. At vertices, in addition to mass balance, we also consider mixing of incoming flows of varying hydrogen concentrations. The problems of interest are the heterogeneous gas flow simulation (HGFS), which determines system pressures and flows given fixed boundary conditions and compressor settings, as well as the heterogeneous gas flow optimization (HGFO), which extremizes an objective by determining optimal boundary conditions and compressor settings. We examine conditions for uniqueness of solutions to the HGFS, as well as compare and contrast mixed-integer and continuous nonlinear programming formulations for the HGFO. We develop computational methods to solve both problems, and examine their performance using four test networks of increasing complexity.

08 HYDROGEN↗
DOE OSTI2020

Polymer informatics: Current status and critical next steps

Artificial intelligence (AI) based approaches are beginning to impact several domains of human life, science and technology. Polymer informatics is one such domain where AI and machine learning (ML) tools are being used in the efficient development, design and discovery of polymers. Surrogate models are trained on available polymer data for instant property prediction, allowing screening of promising polymer candidates with specific target property requirements. Questions regarding synthesizability, and potential (retro)synthesis steps to create a target polymer, are being explored using statistical means. Data-driven strategies to tackle unique challenges resulting from the extraordinary chemical and physical diversity of polymers at small and large scales are being explored. Other major hurdles for polymer informatics are the lack of widespread availability of curated and organized data, and approaches to create machine-readable representations that capture not just the structure of complex polymeric situations but also synthesis and processing conditions. Methods to solve inverse problems, wherein polymer recommendations are made using advanced AI algorithms that meet application targets, are being investigated. As various parts of the burgeoning polymer informatics ecosystem mature and become integrated, efficiency improvements, accelerated discoveries and increased productivity can result. Here in this paper, we review emergent components of this polymer informatics ecosystem and discuss imminent challenges and opportunities.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Gene editing through microfluidic delivery

Gene editing can be performed by introducing gene-editing components into a cell by mechanical cell disruption. Related apparatus, systems, techniques, and articles are also described. The methods and systems of the invention solve the problem of intracellular delivery of gene editing components and gene editing complexes to target cells. The results described herein indicate that delivery of gene editing components, e.g., protein, ribonucleic acid (RNA), and deoxyribonucleic acid (DNA), by mechanical disruption of cell membranes leads to successful gene editing. Because intracellular delivery of gene editing materials is a current challenge, the methods provide a robust mechanism to engineer target cells without the use of potentially harmful viral vectors or electric fields.

Sharei, Armon R.↗
DOE OSTI2023

Classification Analytics of Pu-239 and U-235 Source Signatures Using Gamma Spectral Regions

Machine learning detection methods using gamma signatures from spectral measurements of low-intensity Pu-239 and U-235 sources are studied. NaI detectors located at different distances fromthe source have been used to collect the training and independent testing data sets. The source is introduced via a shielded conduit into the facility where it is surrounded by 21 NaI detectors deployed over 6 x 6 meters area in the formation of two concentric circles and a spiral. The counts in gamma spectral regions associated with these two sources are estimated at 1 second intervals for each NaI detector, and are used as classifier features for detecting the source presence. Eight different classifiers with five basic properties — namely, smooth, non-smooth, statistical, structural, and hyper-parameter tuning — are trained and tested using the background and source measurements collected over multiple experimental runs. While the overall classifier performance improved as detectors closer to the source are used, some identically produced detectors under-performed but differently between two sources. Some classifiers achieved lower training error but their testing error based on independent measurements is higher for both sources. Overall, these results indicate significant over-fitting by these methods, and illustrate the complexity of training and selecting the machine learning methods to solve these detection problems.

Rao, Nageswara↗
DOE OSTI2021

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Wake steering optimization under uncertainty

Turbines in wind power plants experience significant power losses when wakes from upstream turbines affect the energy production of downstream turbines. A promising plant-level control strategy to reduce these losses is wake steering, where upstream turbines are yawed to direct wakes away from downstream turbines. However, there are significant uncertainties in many aspects of the wake steering problem. For example, infield sensors do not give perfect information, and inflow to the plant is complex and difficult to forecast with available information, even over short time periods. Here, we formulate and solve an optimization under uncertainty (OUU) problem for determining optimal plant-level wake steering strategies in the presence of independent uncertainties in the direction, speed, turbulence intensity, and shear of the incoming wind, as well as in turbine yaw positions. The OUU wake steering strategy is first examined for a two-turbine test case to explore the impacts of different types of inflow uncertainties, and it is then demonstrated for a more realistic 11-turbine wind power plant. Of the sources of uncertainty considered, we find that wake steering strategies are most sensitive to uncertainties in the wind speed and direction. When maximizing expected power production, the OUU strategy also tends to favor smaller yaw angles, which have been shown in previous work to reduce turbine loading. Ultimately, the plant-level wake steering strategy formulated using an OUU approach yields 0.48?% more expected annual energy production for the 11-turbine wind plant than a strategy that neglects uncertainty when considering stochastic inputs. Thus, not only does the present OUU strategy produce more power in realistic conditions, but it also reduces risk by prescribing strategies that call for less extreme yaw angles.

17 WIND ENERGY↗
DOE OSTI2024

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The “Fresnel Equations” for Diffuse radiation on Inclined photovoltaic Surfaces (FEDIS)

Here the well-known Fresnel equations solve for the reflection and transmission of light for precise incident angles. The transmission of diffuse radiation incident on a planar or domed surface is often needed for real-world applications. Due to the complexity of the Fresnel equations, the analytical solution of the integration has hitherto been unobtainable over the last centuries. Therefore, this problem was numerically solved by integrating the angular transmittances in space often leading to substantial computing burden and bias in the results. To efficiently estimate the solar energy resource for a glass-covered photovoltaic (PV) module, we derive an analytical solution of diffuse transmission based on the rigorous integration of an alternate form of the Fresnel equations. The approach leads to a simple yet accurate relative transmittance model that reconciles the solar energy sensed by pyranometers and PV panels. With limited and clearly stated approximations, the complex mathematical derivation resulted in an elegant solution. An experiment using 1-year of data at the National Renewable Energy Laboratory's (NREL's) Solar Radiation Research Laboratory (SRRL) shows that the new model dramatically decreases the disparity between the solar radiation measurements by a Kipp and Zonen CM Pyranometer 22 (CMP22) and an IMT reference cell on a 1-axis tracking system. The solution in this paper can be widely used in scientific and engineering research, development, and applications wherever the Fresnel equations are used.

14 SOLAR ENERGY↗
DOE OSTI2022

FEDIS (The “Fresnel Equations” for Diffuse radiation on Inclined photovoltaic Surfaces) [SWR-22-64]

The well-known Fresnel equations solve for the reflection and transmission of light for precise incident angles. The transmission of diffuse radiation incident on a planar or domed surface is often needed for real-world applications. Due to the complexity of the Fresnel equations, the analytical solution of the integration has hitherto been unobtainable over the last centuries. Therefore, this problem was numerically solved by integrating the angular transmittances in space often leading to substantial computing burden and bias in the results. To efficiently estimate the solar energy resource for a glass-covered photovoltaic (PV) module, we derive an analytical solution of diffuse transmission based on the rigorous integration of an alternate form of the Fresnel equations. The approach leads to a simple yet accurate relative transmittance model that reconciles the solar energy sensed by pyranometers and PV panels. With limited and clearly stated approximations, the complex mathematical derivation resulted in an elegant solution.

Xie, Yu↗
DOE OSTI2026

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗