Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational Complexity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
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 OSTI2016

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2015

SU-E-T-500: Initial Implementation of GPU-Based Particle Swarm Optimization for 4D IMRT Planning in Lung SBRT

Purpose 4D-IMRT planning, combined with dynamic MLC tracking delivery, utilizes the temporal dimension as an additional degree of freedom to achieve improved OAR-sparing. The computational complexity for such optimization increases exponentially with increase in dimensionality. In order to accomplish this task in a clinically-feasible time frame, we present an initial implementation of GPU-based 4D-IMRT planning based on particle swarm optimization (PSO). Methods The target and normal structures were manually contoured on ten phases of a 4DCT scan of a NSCLC patient with a 54cm3 right-lower-lobe tumor (1.5cm motion). Corresponding ten 3D-IMRT plans were created in the Eclipse treatment planning system (Ver-13.6). A vendor-provided scripting interface was used to export 3D-dose matrices corresponding to each control point (10 phases × 9 beams × 166 control points = 14,940), which served as input to PSO. The optimization task was to iteratively adjust the weights of each control point and scale the corresponding dose matrices. In order to handle the large amount of data in GPU memory, dose matrices were sparsified and placed in contiguous memory blocks with the 14,940 weight-variables. PSO was implemented on CPU (dual-Xeon, 3.1GHz) and GPU (dual-K20 Tesla, 2496 cores, 3.52Tflops, each) platforms. NiftyReg, an open-source deformable image registration package, was used to calculate the summed dose. Results The 4D-PSO plan yielded PTV coverage comparable to the clinical ITV-based plan and significantly higher OAR-sparing, as follows: lung Dmean=33%; lung V20=27%; spinal cord Dmax=26%; esophagus Dmax=42%; heart Dmax=0%; heart Dmean=47%. The GPU-PSO processing time for 14940 variables and 7 PSO-particles was 41% that of CPU-PSO (199 vs. 488 minutes). Conclusion Truly 4D-IMRT planning can yield significant OAR dose-sparing while preserving PTV coverage. The corresponding optimization problem is large-scale, non-convex and computationally rigorous. Our initial results indicate that GPU-based PSO with further software optimization can make such planning clinically feasible. This work was supported through funding from the National Institutes of Health and Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Recent developments in the PySCF program package

PySCF is a Python-based general-purpose electronic structure platform that supports first-principles simulations of molecules and solids as well as accelerates the development of new methodology and complex computational workflows. Here, we explain the design and philosophy behind PySCF that enables it to meet these twin objectives. With several case studies, we show how users can easily implement their own methods using PySCF as a development environment. We then summarize the capabilities of PySCF for molecular and solid-state simulations. Finally, we describe the growing ecosystem of projects that use PySCF across the domains of quantum chemistry, materials science, machine learning, and quantum information science.

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

Oxidation Behavior and Property Degradation of Nuclear Graphites

During its multidecade operation in the core of nuclear reactors, graphite components are subjected to aggressive and continuous exposure to a high field of ionizing and neutron irradiation, high temperature, and various types of present and postulated chemical attacks. High density, high crystallinity polygranular synthetic graphite is unique among other materials for its extraordinary capacity of resisting and adapting to the aggression inflicted by high temperature, high energy neutron bombardment and ionizing gamma radiation. But, as a carbonaceous material, even though of very high purity, graphite is reactive towards common oxidizing agents: oxygen, carbon dioxide, water. Safe operation of HTGRs relies, among other aspects, on engineered safeguard systems for efficient and continuous protection of graphite components against oxidation. Graphite oxidation behavior was, and continues to be, an important direction of theoretical and experimental research, engineering analyses, models and simulations, and design and safety regulations. The avalanche of publications, reports, experimental data, computer codes, and regulatory documents related to oxidation behavior of nuclear graphite is now accelerating to new levels, prompted by the increased interest for nuclear energy as a clean, carbon-free energy source. Even though public’s perception of nuclear energy advantages may still be influenced by the memories of past accidents of nuclear reactors from generations II and III, the community of informed scientists and engineers, regulators and statemen knows that generation IV of nuclear reactors is designed at very high safety standards, doubled by great advances of scientific knowledge and technological progress. One of routes of these recent advances is directed at better understanding of graphite oxidation behavior, its relationship with graphite manufacturing and microstructural properties, along with the effects of various environmental factors and process variables. Together, the recent progress in manufacturing, properties characterization, and modeling of intricated physical and chemical processes that concur to the oxidation behavior led to development of powerful simulation codes able to analyze various scenarios of normal operation and hypothetical off-normal events, and thus to clearly specify the allowable parameters envelopes for the designers, constructors, and operators of current and future modular HTGRs. This review begins with an introduction on manufacturing methods, structure, and properties of nuclear graphite, including basic requirements that this specialty graphite type must satisfy for nuclear use. It continues with a chapter on environmental effects on nuclear graphite, where emphasis is placed less on irradiation and much more on oxidation phenomena, their safety implications, and the basic traits of chronic and acute oxidation by air (oxygen) and water (humidity, steam). Particular attention is placed on the three graphite grades of interest for this document (IG-110, NBG-18, PCEA). A chapter on properties degradation induced by oxidation follows, with focus on density, dimensional, and mechanical properties changes. The next chapter is intended as a brief review of various approaches used for modeling of graphite oxidation behavior. It summarizes the progress of oxidation models, from the early attempts to complex computational approaches interfaced with specialized computer codes designed for nuclear reactor simulations. Last, a list is presented of knowledge gaps where more research is needed. A short summary concludes the review.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Correlations of the Elemental Compositions of Primary Coal Tar and Char

We report that simulations of large-scale coal combustors rely on accurate submodels to describe the chemical and physical changes in coal during reaction. Typically, researchers use simplified empirical submodels tuned to experimental data to reduce the computational complexity. When data are not readily available, researchers use simplifying assumptions, which can create inaccuracies and biases in a large simulation. One such simplifying assumption in coal research is how to describe the elemental composition of primary pyrolysis products. This paper explores several different empirical model forms to predict the dry, ash-free fractions of C, H, O, N, and S in both the char and the tar, using variables such as parent coal composition, reaction conditions (temperatures and particle residence times), and key coal structural parameters derived from NMR measurements. These model forms were correlated to existing data using a wide range of experimental data using a cross-validation procedure. Since coal structural values can be expensive to measure, several correlations from the literature were used to estimate these values based on information from the proximate and ultimate analyses of the parent coal, including a new correlation for the coal aromaticity. These model forms were tested against a set of measured elemental compositions of tar and char to find the best fit to use in the cross-validation process. Lastly, the best empirical models are presented that predict elemental composition of the coal char and tar after devolatilization.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2021

Performance Comparison of Circular and Spherical Error Probable Estimators

This report compares the performance of three Circular Error Probable (CEP) estimators: the Grubbs-Patnaik estimator, a new, non-iterative, radial-integration estimator, and a median estimator. It also compares the performance of two Spherical Error Probable (SEP) estimators. The performance of each estimator is assessed in terms of bias, uncertainty, robustness, and computational complexity. Robustness is evaluated with respect to outliers, variations in the underlying statistical distribution characterizing munition impact positions, and impact-position measurement errors. The performance assessments indicate the radial-integration and Grubbs-Patnaik estimators perform nearly identically providing the statistical distribution of impact-position coordinates is jointly normal with zero means. In that case, both estimators outperform the median estimator by about 2% relative to the true CEP in terms of estimator uncertainty. The bias performance of the radial-integration and median estimators is close to zero for jointly normal impacts, however, the Grubbs-Patnaik estimator can be significantly biased for jointly normal impacts with non-zero means. When the statistical distribution characterizing impact positions is known, but not jointly normal, the radial-integration estimator is superior. In this case, the median estimator also outperforms the Grubbs-Patnaik estimator but is not quite as good as the radial-integration estimator. If the statistical distribution characterizing impacts is unknown and not jointly normal, or if distribution parameters are difficult or impractical to estimate, or if test data is corrupted with outliers, then the median estimator dramatically outperforms the other estimators, especially in terms of estimation bias. Unexpectedly, measurement noise did not significantly degrade the performance of any of the estimators, except for cases with signal to noise ratios less than five. Although the Grubbs-Patnaik estimator has remained the gold standard for CEP estimation for over half a century, the performance assessments indicate the new, non-iterative, radial-integration estimator and the median estimator offer significant advantages and, in most practical real-world conditions, are superior estimators. These estimators are also useful for SEP estimation whereas the Grubbs-Patnaik estimator does not extend to three dimensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Uncertainty quantification and global sensitivity analysis of the Los Alamos sea ice model

Changes in the high-latitude climate system have the potential to affect global climate through feedbacks with the atmosphere and connections with midlatitudes. Sea ice and climate models used to understand these changes have uncertainties that need to be characterized and quantified. We present a quantitative way to assess uncertainty in complex computer models, which is a new approach in the analysis of sea ice models. We characterize parametric uncertainty in the Los Alamos sea ice model (CICE) in a standalone configuration and quantify the sensitivity of sea ice area, extent, and volume with respect to uncertainty in 39 individual model parameters. Unlike common sensitivity analyses conducted in previous studies where parameters are varied one at a time, this study uses a global variance-based approach in which Sobol' sequences are used to efficiently sample the full 39-dimensional parameter space. We implement a fast emulator of the sea ice model whose predictions of sea ice extent, area, and volume are used to compute the Sobol' sensitivity indices of the 39 parameters. Main effects and interactions among the most influential parameters are also estimated by a nonparametric regression technique based on generalized additive models. A ranking based on the sensitivity indices indicates that model predictions are most sensitive to snow parameters such as snow conductivity and grain size, and the drainage of melt ponds. Lastly, it is recommended that research be prioritized toward more accurately determining these most influential parameter values by observational studies or by improving parameterizations in the sea ice model.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗
DOE OSTI2021

MCML: Combining physical constraints with experimental data for a multi-purpose meta-generalized gradient approximation

The predictive power of density functional theory for materials properties can be improved without increasing the overall computational complexity by extending the generalized gradient approximation (GGA) for electronic exchange and correlation to density functionals depending on the electronic kinetic energy density in addition to the charge density and its gradient, resulting in a meta-GGA. Here, we propose an empirical meta-GGA model that is based both on physical constraints and on experimental and quantum chemistry reference data. Overall, the resulting optimized meta-GGA MCML yields improved surface and gas phase reaction energetics without sacrificing the accuracy of bulk property predictions of existing meta-GGA approaches.

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

Flexible‐rate optoelectronic wireless transmission system at 101 GHz using multiband CAP‐PAM modulation and envelope detection

Abstract In this paper, we have experimentally demonstrated the first flexible‐rate optoelectronic terahertz wireless transmission system at 101 GHz based on multiband CAP‐PAM modulation and cost‐efficient envelope detection. Instead of traditional M‐QAM mapping, PAM‐N mapping is used in CAP modulation with low‐computational complexity. The system performances and optimal capacity in both single‐band case and multiband case are intensively investigated. The results show that the highest data rate for single‐band system is 13.35 Gbit/s with CAP‐PAM‐5 modulation, while the optimum aggregate transmission line rate of 8.49 Gbit/s can be obtained with 4‐sub‐bands CAP‐PAM‐{5,3,2,2} modulation under 7% FEC limit of 3.8 × 10 −3 for four‐user access.

Zhang, Jiao↗
DOE OSTI2019

A coupled thermo‐chemo‐mechanical reduced‐order multiscale model for predicting process‐induced distortions, residual stresses, and strength

Summary We study residual stresses and part distortion induced by a manufacturing process of a polymer matrix composite and its effect on the component strength. Unlike most of the thermo‐chemo‐mechanical models in the literature where governing multiphysics equations are directly formulated on the macroscale, we present a multiscale‐multiphysics approach. To address the enormous computational complexity involved, a reduced‐order homogenization was originally developed for a single physics problem is employed. The proposed reduced‐order two‐scale thermo‐chemo‐mechanical model has been validated for predicting part distortion beam strength in three‐point bending test. It is shown that while macroscopic stresses are relatively low, and therefore often ignored in practice, stresses at the scale of microconstituents are significant and may have an effect on the overall composite component strength.

Yuan, Zifeng↗
DOE OSTI2022

The strip method for shape derivatives

Abstract A major challenge in shape optimization is the coupling of finite element method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multiphysics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. The volume and boundary methods are two approaches to computing shape derivatives. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. We introduce the strip method , which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. As an added benefit, its computational complexity is comparable to that of the boundary method, that is, it is faster than the volume method. We illustrate the benefits of the strip method with numerical examples.

Hardesty, Sean↗
DOE OSTI2021

Jet tagging in the Lund plane with graph networks

The identification of boosted heavy particles such as top quarks or vector bosons is one of the key problems arising in experimental studies at the Large Hadron Collider. In this article, we introduce LundNet, a novel jet tagging method which relies on graph neural networks and an efficient description of the radiation patterns within a jet to optimally disentangle signatures of boosted objects from background events. We apply this framework to a number of different benchmarks, showing significantly improved performance for top tagging compared to existing state-of-the-art algorithms. We study the robustness of the LundNet taggers to non-perturbative and detector effects, and show how kinematic cuts in the Lund plane can mitigate overfitting of the neural network to model-dependent contributions. Finally, we consider the computational complexity of this method and its scaling as a function of kinematic Lund plane cuts, showing an order of magnitude improvement in speed over previous graph-based taggers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Improving modular bootstrap bounds with integrality

We propose methods that efficiently impose integrality — i.e., the condition that the coefficients of characters in the partition function must be integers — into numerical modular bootstrap. We demonstrate the method with a number of examples where it can be used to strengthen modular bootstrap results. First, we show that, with a mild extra assumption, imposing integrality improves the bound on the maximal allowed gap in dimensions of operators in theories with a U(1) c symmetry at c = 3, and reduces it to the value saturated by the SU(4) 1 WZW model point of c = 3 Narain lattices moduli space. Second, we show that our method can be used to eliminate all but a discrete set of points saturating the bound from previous Virasoro modular bootstrap results. Finally, when central charge is close to 1, we can slightly improve the upper bound on the scaling dimension gap.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗