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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Learning Only on Boundaries: A Physics-Informed Neural Operator for Solving Parametric Partial Differential Equations in Complex Geometries

Recently, deep learning surrogates and neural operators have shown promise in solving partial differential equations (PDEs). However, they often require a large amount of training data and are limited to bounded domains. In this work, we present a novel physics-informed neural operator method to solve parameterized boundary value problems without labeled data. By reformulating the PDEs into boundary integral equations (BIEs), we can train the operator network solely on the boundary of the domain. This approach reduces the number of required sample points from $O(N^d)$ to $O(N^{d-1}$), where $d$ is the domain’s dimension, leading to a significant acceleration of the training process. Additionally, our method can handle unbounded problems, which are unattainable for existing physics-informed neural networks (PINNs) and neural operators. Finally, our numerical experiments show the effectiveness of parameterized complex geometries and unbounded problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Source term method for binary neutron stars initial data

The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Tomographic optical emission spectroscopy of an atmospheric pressure plasma jet and surface ionization waves on planar and structured surfaces

Here in this paper, an approach for 3D plasma structure diagnostics using tomographic optical emission spectroscopy (Tomo-OES) of a nanosecond pulsed atmospheric pressure plasma jet (APPJ) is presented. In contrast to the well-known Abel inversion, Tomo-OES does not require cylindrical symmetry to recover 3D distributions of plasma light emission. Instead, many 2D angular projections are measured with intensified cameras and the multiplicative algebraic reconstruction technique is used to recover the 3D distribution of light emission. This approach solves the line-of-sight integration problem inherent to optical diagnostics, allowing recovery of localized OES information within the plasma that can be used to better infer plasma parameters within complex plasma structures. Here, Tomo-OES was applied to investigate an APPJ operated with helium in ambient air and impinging on planar and structured dielectric surfaces. Surface charging caused the guided streamer from the APPJ to transition to a surface ionization wave (SIW) that propagated along the surface. The SIW experienced variable geometrical and electrical material properties as it propagated, leading to 3D configurations that were non-symmetric and spatially complex. Light emission from He, N$_2^+$, and N2 were imaged at ten angular projections and the respective time-resolved 3D emission distributions in the plasma were then reconstructed. The spatial resolution of each tomographic reconstruction was 7.4 µm and the temporal resolution was 5 ns, sufficient to observe the guided streamer and the effects of the structured surface on the SIW. Emission from He showed the core of the jet and emission from N$_2^+$ and N2 indicated effects of entrainment of ambient air. Penning ionization of N2 created a ring or outer layer of N$_2^+$ that spatially converged to form the 'plasma bullet' or spatially diverged across a surface as part of a SIW. The SIW entered trenches of size 150 µm, leading to decreases in plasma light emission in regions above the trenches. The plasma light emission was higher in some regions with trenches, possibly due to effects of field enhancement.

plasma interactions with complex surfaces↗
DOE OSTI2020

Allocation and Operation of A Hydropneumatic Energy Storage with Building Microgrid

Behind-meter application for a recently invented hydropneumatic Ground-Level Integrated Diverse Energy Storage (GLIDES) is focused in this research. Considering possible uncertainties from solar radiation and electricity load in a building microgrid, two-stage stochastic programming is adopted for 15-min operation and a mixed-integer nonlinear stochastic model is built with integrated energy systems of GLIDES, solar panel and power generating unit. In order to make the model computationally tractable, we use sample average approximate method to decrease associated complexity with sample size and improve solving efficiency. The experimental results in deterministic and stochastic operation indicate that best candidate solution from SAA are superior to the solution from expected value problem in terms of optimality gap and variance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A multiresolution adaptive wavelet method for nonlinear partial differential equations

We report the multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to solve partial differential equations (PDEs) with features evolving on a wide range of spatial and temporal scales. To meet these challenges, we present a multiresolution wavelet algorithm to solve PDEs with significant data compression and explicit error control. We discretize in space by projecting fields and spatial derivative operators onto wavelet basis functions. We provide error estimates for the wavelet representation of fields and their derivatives. Then, our estimates are used to construct a sparse multiresolution discretization which guarantees the prescribed accuracy. Additionally, we embed a predictor-corrector procedure within the temporal integration to dynamically adapt the computational grid and maintain the accuracy of the solution of the PDE as it evolves. We present examples to highlight the accuracy and adaptivity of our approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust Parameter Design on Dual Stochastic Response Models With Constrained Bayesian Optimization

In engineering system design, minimizing the variations of the quality measurements while guaranteeing their overall quality up to certain levels, namely the robust parameter design (RPD), is crucial. Recent works have dealt with the design of a system whose response-control variables relationship is a deterministic function with a complex shape and function evaluation is expensive. In this work, we propose a Bayesian optimization method for the RPD of stochastic functions. Dual stochastic response models are carefully designed for stochastic functions. The heterogeneous variance of the sample mean is addressed by the predictive mean of the log variance surrogate model in a two-step approach. We establish an acquisition function that favors exploration across the feasible and optimality-improvable regions to effectively and efficiently solve the stochastic constrained optimization problem. Further, the performance of our proposed method is demonstrated by the extensive numerical and case studies. Note to Practitioners-Many manufacturing processes involve undesirable variations, which create variations in the final products. For example, many emerging manufacturing processes, such as nanomanufacturing, involve complex physical and chemical dynamics and transformation, creating variations in the manufacturing output. In such processes, it is crucial to design the manufacturing processes or products so that they have minimum variations in their quality. Meanwhile, it is also important to maintain the overall quality of the designed processes or products. Furthermore, acquiring data from many advanced manufacturing processes is often very costly, especially in the designing stage. In this work, we propose a data-driven method that automatically finds the best setting of manufacturing processes or products with the minimum variations of quality and a given constraint on the average quality satisfied. Our proposed method is used before conducting every experiment; It analyzes the historical data from previous experiments and provides a setting to be used in the next experiment. Our proposed method efficiently utilizes the historical data, and thus finds the best robust setting by conducting only a small number of experiments.

42 ENGINEERING↗
DOE OSTI2020

Foundations for high-order, conservative cut-cell methods: Stable discretizations on degenerate meshes

Cut-cell methods for unsteady flow problems can greatly simplify the grid generation process and allow for high-fidelity simulations on complex geometries. However, cut-cell methods have been limited to low orders of accuracy. This is driven, largely, by the variety of procedures typically introduced to evaluate derivatives in a stable manner near the highly irregular embedded geometry. Here, a completely new approach, termed TEMO (truncation error matching and optimization), is taken to solve this problem. The approach is based on two simple and intuitive design principles. These principles directly allow for the construction of stable 8th To the best of the authors' knowledge, these are the highest orders ever achieved for a cut-cell discretization by a significant margin. This is done for both explicit and compact finite differences and is accomplished without any geometric transformations or artificial stabilization procedures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

A fourth order sharp immersed method for the incompressible Navier-Stokes equations with stationary and moving boundaries and interfaces

We propose a fourth order Navier-Stokes solver based on the immersed interface method (IIM), for flow problems with stationary and one-way coupled moving boundaries and interfaces. Our algorithm employs a Runge-Kutta-based projection method that maintains high-order temporal accuracy in both velocity and pressure for steady and unsteady velocity boundary conditions. Fourth order spatial accuracy is achieved through a novel fifth order IIM discretization scheme for the advection term, as well as existing high-order interface-corrected finite difference schemes for the other differential operators. Using a set of manufactured flow problems with stationary and moving boundaries, we demonstrate fourth order convergence of velocity and pressure in the infinity norm, both inside the domain and on the immersed boundaries. The solver’s performance is further validated through a range of practical flow simulations, highlighting its efficiency over a second order scheme. Finally, we showcase the ability of our immersed discretization scheme to handle interface-coupled multiphysics problems by solving a conjugate heat transfer problem with multiple immersed solids. Overall, the proposed approach robustly combines the efficiency of high order discretization schemes with the flexibility of immersed discretizations for flow problems with complex, moving boundaries and interfaces.

42 ENGINEERING↗
DOE OSTI2020

Properties of Medium Nuclei from First Principles

During this project we have extended the Auxiliary Field Diffusion Monte Carlo (AFDMC) to calculate several properties of light/medium nuclei. In particular, we have included and tested several models of three-body forces and the associated approximations required, and the comparison with other exact calculations for simpler problems demonstrated the accuracy of the AFDMC method. In this project we have also developed new subroutines to solve for the ground-state of open shell nuclei. This case requires very complex wave function with respect to the case of closed-shell nuclei. We have used the AFDMC code to calculate many properties of nuclei up to the Oxygen, including energies, radii, spatial and momentum distributions and others.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Artificial Intelligence/Machine Learning Technologies for Advanced Reactors (Workshop Summary Report)

A workshop on artificial intelligence and machine learning (AI/ML) for advanced reactors (AR) was held October 5-6, 2021. The workshop was to be attended in-person at ANL but COVID restrictions forced the workshop to go virtual. The objectives of the workshop were to identify the most promising AI/ML opportunities for improving advanced reactor design, optimizing plant performance, and enhancing economic competitiveness and to develop an understanding of the scientific, engineering and licensing challenges facing their application. The workshop planning committee included GAIN, EPRI and NEI and members of three national laboratories (ANL, INL, and ORNL). The workshop was attended by more than 200 individuals representing academic and scientific institutions and the nuclear power industry. The definition put forth for an AI/ML system was one that perceives its environment and takes actions that maximize its chance of achieving its goals. In this report AI/ML refers to next generation algorithms that include deep learning, statistical analysis and data analytics and associated scientific computing and their potential application to the design, licensing, operation and maintenance of ARs. These methods typically incorporate models built from process data and may also include data generated by simulations that represent the behavior of a system. The workshop was organized in response to the growing interest in application of AI/ML for improving the economic competitiveness of nuclear energy. Increasingly more resources are being allocated to investigating the benefits of AI/ML methods. The DOE created the Artificial Intelligence & Technology Office to promote their development. And within the Office of Nuclear Energy, resources have been allocated to explore and understand the potential benefits of AI/ML. Additionally, the national laboratories are strategically positioned with DOE computing facilities such as Summit, Perlmutter, Aurora and Frontier that support large-scale simulations, hybrid HPC models with AI surrogates, and the exploration of new types of generative models emerging from multi-model data streams and sources. The workshop was organized with members of the AR community to understand the effort and to identify the level of interest and progress in this emerging technology. The workshop discussions focused on identifying opportunities for AI/ML across diverse areas of the nuclear industry and identifying current scientific and engineering challenges for advanced reactors that might be addressed through transformational uses of AI/ML. Discussion panels focused on four high-interest technical domains for advanced reactors: design, maintenance and operations, energy storage, and materials. The results of those discussions are summarized in this report. This includes opportunities that were identified for exploiting AI techniques and methods to improve the efficacy and efficiency of reactor analysis and to improve the operation and optimization of advanced reactors. Advanced reactor developers expressed an interest in learning more about AI/ML methods and their application. This included understanding whether ML methods can provide an advantage over existing nonlinear data regression methods for collapsing high-fidelity simulation results into faster running models. A consensus emerged that AR advances planned for the next decade will benefit from the use of AI/ML tools. The need exists to understand and model complex systems across length scales and modalities. AI/ML is a tool for discovery that can yield a set of engineering principles for use by nuclear engineers, licensing bodies, and operators to solve problems in plant design, safety analyses, autonomous operation, and predictive maintenance. While AI/ML represents a new set of tools, an awareness by the nuclear community of the full potential is still in the early stages so there is a need to increase awareness. It appears that the wide-spread adoption of AI/ML tools for ARs would be facilitated by future educational workshops that describe foundational methods and capabilities and describe successful applications.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Extended Physics-Informed Neural Networks (XPINNs): A Generalized Space-Time Domain Decomposition Based Deep Learning Framework for Nonlinear Partial Differential Equations

Here we propose a generalized space-time domain decomposition approach for the physics-informed neural networks (PINNs) to solve nonlinear partial differential equations (PDEs) on arbitrary complex-geometry domains. The proposed framework, named eXtended PINNs ( X P I N N s ), further pushes the boundaries of both PINNs as well as conservative PINNs (cPINNs), which is a recently proposed domain decomposition approach in the PINN framework tailored to conservation laws. Compared to PINN, the XPINN method has large representation and parallelization capacity due to the inherent property of deployment of multiple neural networks in the smaller subdomains. Unlike cPINN, XPINN can be extended to any type of PDEs. Moreover, the domain can be decomposed in any arbitrary way (in space and time), which is not possible in cPINN. Thus, XPINN offers both space and time parallelization, thereby reducing the training cost more effectively. In each subdomain, a separate neural network is employed with optimally selected hyperparameters, e.g., depth/width of the network, number and location of residual points, activation function, optimization method, etc. A deep network can be employed in a subdomain with complex solution, whereas a shallow neural network can be used in a subdomain with relatively simple and smooth solutions. We demonstrate the versatility of XPINN by solving both forward and inverse PDE problems, ranging from one-dimensional to three-dimensional problems, from time-dependent to time-independent problems, and from continuous to discontinuous problems, which clearly shows that the XPINN method is promising in many practical problems. The proposed XPINN method is the generalization of PINN and cPINN methods, both in terms of applicability as well as domain decomposition approach, which efficiently lends itself to parallelized computation. The XPINN code is available on h t t p s : / / g i t h u b . c o m / A m e y a J a g t a p / X P I N N s .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2021

A Review of Lattice-Boltzmann Models Coupled with Geochemical Modeling Applied for Simulation of Advanced Waterflooding and Enhanced Oil Recovery Processes

To maintain economic profit and improve the oil production efficiency after the primary and secondary production phase, advanced waterflooding techniques such as low salinity waterflooding in carbonate reservoirs have been investigated in numerical simulations, laboratory experiments, and field pilot tests. Multiple underlying mechanisms have been proposed based on these studies, and they are still under debate. Various numerical modeling approaches are introduced, but there exists a lack of a pore-scale comprehensive modeling scheme to fully understand the processes. Lattice-Boltzmann method (LBM) is a type of numerical fluid flow modeling technique that shows capabilities and flexibilities in modeling pore-scale fluid flow to integrate physical–chemical processes within complex structures. The intrinsic feature of LBM makes it a promising framework for simulating advanced waterflooding due to its flexibility, accuracy, and parallel efficiency. LBM works either by itself for solving reactive transport problems or by coupling with a third-party reaction solver. This review mainly introduces the LBM fluid flow and reactive transport capabilities and the concept and modeling approaches to simulate advanced waterflooding techniques. Meanwhile, an evaluation of the coupled LBM models for enhanced oil recovery (EOR) simulations is discussed with future research challenges and directions concluded.

02 PETROLEUM↗
DOE OSTI2024

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

maestro

MÆSTRO stands for Multi-fidelity Adaptive Ensemble Stochastic Trust Region Optimization and it is a plug n play derivate fee stochastic optimization solver. The problem being considered in MÆSTRO involves fitting Monte Carlo simulations that describe complex phenomena to experiments. This is done by finding parameters of the resource intensive and noisy simulation that yield the least squares objective function value to the noisy experimental data. This problem is solved using a stochastic trust-region optimization algorithm where in each iteration, a local approximation of the simulation signal and of the simulation noise is constructed over data, which is obtained by running the simulation at strategically placed design points within the trust-region around the current iterate. Then the simulation components of the objective are replaced by their approximations and this analytical and closed-form optimization problem is solved to find the next iterate within the trust-region. Then the trust region is moved and the iterations continue until a satisfactory convergence criteria is met.

KRISHNAMOORTHY, MOHAN↗
DOE OSTI2023

Lightshow: a Python package for generating computational x-ray absorption spectroscopy input files

First-principles computational spectroscopy is a critical tool for interpreting experiment, per- forming structure refinement, and developing new physical understanding. Systematically setting up input files for different simulation codes and a diverse class of materials is a challeng- ing task with a very high barrier-to-entry, given the complexities and nuances of each individual simulation package. This task is non-trivial even for experts in the electronic structure field and nearly formidable for non-expert researchers. Lightshow solves this problem by providing a uniform abstraction for writing computational x-ray spectroscopy input files for multiple popular codes, including FEFF, VASP, OCEAN, exciting and XSpectra. Its extendable framework will also allow the community to easily add new functions and to incorporate new simulation codes.

36 MATERIALS SCIENCE↗