Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

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 415 records · Page 23

The Algorithm Selection Problem

Work on NP-hard problems has shown that many instances of these theoretically computationally difficult problems are quite easy. The field has also shown that choosing the right algorithm for the problem can have a profound effect on the time needed to find a solution. However, to date there has been little work showing how to select the right algorithm for solving any particular problem. The paper refers to this as the algorithm selection problem. It describes some of the aspects that make this problem difficult, as well as proposes a technique for addressing it.

Minton, Steve↗

Error Analysis for Discontinuous Galerkin Method for Parabolic Problems

In the proposal, the following three objectives are stated: (1) A p-version of the discontinuous Galerkin method for a one dimensional parabolic problem will be established. It should be recalled that the h-version in space was used for the discontinuous Galerkin method. An a priori error estimate as well as a posteriori estimate of this p-finite element discontinuous Galerkin method will be given. (2) The parameter alpha that describes the behavior double vertical line u(sub t)(t) double vertical line 2 was computed exactly. This was made feasible because of the explicitly specified initial condition. For practical heat transfer problems, the initial condition may have to be approximated. Also, if the parabolic problem is proposed on a multi-dimensional region, the parameter alpha, for most cases, would be difficult to compute exactly even in the case that the initial condition is known exactly. The second objective of this proposed research is to establish a method to estimate this parameter. This will be done by computing two discontinuous Galerkin approximate solutions at two different time steps starting from the initial time and use them to derive alpha. (3) The third objective is to consider the heat transfer problem over a two dimensional thin plate. The technique developed by Vogelius and Babuska will be used to establish a discontinuous Galerkin method in which the p-element will be used for through thickness approximation. This h-p finite element approach, that results in a dimensional reduction method, was used for elliptic problems, but the application appears new for the parabolic problem. The dimension reduction method will be discussed together with the time discretization method.

Kaneko, Hideaki↗

Steady-State ALPS for Real-Valued Problems

The two objectives of this paper are to describe a steady-state version of the Age-Layered Population Structure (ALPS) Evolutionary Algorithm (EA) and to compare it against other GAs on real-valued problems. Motivation for this work comes from our previous success in demonstrating that a generational version of ALPS greatly improves search performance on a Genetic Programming problem. In making steady-state ALPS some modifications were made to the method for calculating age and the method for moving individuals up layers. To demonstrate that ALPS works well on real-valued problems we compare it against CMA-ES and Differential Evolution (DE) on five challenging, real-valued functions and on one real-world problem. While CMA-ES and DE outperform ALPS on the two unimodal test functions, ALPS is much better on the three multimodal test problems and on the real-world problem. Further examination shows that, unlike the other GAs, ALPS maintains a genotypically diverse population throughout the entire search process. These findings strongly suggest that the ALPS paradigm is better able to avoid premature convergence then the other GAs.

Hornby, Gregory S.↗

Crowdsourcing for Challenging Technical Problems - It Works!

The NASA Johnson Space Center Space Life Sciences Directorate (SLSD) and Wyle Integrated Science and Engineering (Wyle) will conduct a one-day business cluster at the 62nd IAC so that IAC attendees will understand the benefits of open innovation (crowdsourcing), review successful results of conducting technical challenges in various open innovation projects, and learn how an organization can effectively deploy these new problem solving tools to innovate more efficiently and effectively. Results from both the SLSD open innovation pilot program and the open innovation workshop conducted by the NASA Human Health and Performance Center will be discussed. NHHPC members will be recruited to participate in the business cluster (see membership http://nhhpc.nasa.gov) and as IAF members. Crowdsourcing may be defined as the act of outsourcing tasks that are traditionally performed by an employee or contractor to an undefined, generally large group of people or community (a crowd) in the form of an open call. The open call may be issued by the organization wishing to find a solution to a particular problem or complete a task, or by an open innovation service provider on behalf of that organization. In 2008, the SLSD, with the support of Wyle, established and implemented pilot projects in open innovation (crowdsourcing) to determine if these new internet-based platforms could indeed find solutions to difficult technical challenges. These unsolved technical problems were converted to problem statements, called Challenges by some open innovation service providers, and were then posted externally to seek solutions to these problems. In addition, an open call was issued internally to NASA employees Agency wide (11 Field Centers and NASA HQ) using an open innovation service provider crowdsourcing platform to post NASA challenges from each Center for the others to propose solutions). From 2008 to 2010, the SLSD issued 34 challenges, 14 externally and 20 internally. The 14 external problems or challenges were posted through three different vendors: InnoCentive, yet2.com and TopCoder. The 20 internal challenges were conducted using the InnoCentive crowdsourcing platform designed for use internal to an organization and customized for NASA use, and promoted as NASA@Work. The results were significant. Of the seven InnoCentive external challenges, two full and five partial awards were made in complex technical areas such as predicting solar flares and long-duration food packaging.

Davis, Jeffrey R.↗

Semantic Annotation of Complex Text Structures in Problem Reports

Text analysis is important for effective information retrieval from databases where the critical information is embedded in text fields. Aerospace safety depends on effective retrieval of relevant and related problem reports for the purpose of trend analysis. The complex text syntax in problem descriptions has limited statistical text mining of problem reports. The presentation describes an intelligent tagging approach that applies syntactic and then semantic analysis to overcome this problem. The tags identify types of problems and equipment that are embedded in the text descriptions. The power of these tags is illustrated in a faceted searching and browsing interface for problem report trending that combines automatically generated tags with database code fields and temporal information.

Malin, Jane T.↗

Lossless Convexification of Control Constraints for a Class of Nonlinear Optimal Control Problems

In this paper we consider a class of optimal control problems that have continuous-time nonlinear dynamics and nonconvex control constraints. We propose a convex relaxation of the nonconvex control constraints, and prove that the optimal solution to the relaxed problem is the globally optimal solution to the original problem with nonconvex control constraints. This lossless convexification enables a computationally simpler problem to be solved instead of the original problem. We demonstrate the approach in simulation with a planetary soft landing problem involving a nonlinear gravity field.

planetary soft landing↗

Hypersonic Flight and the Re-Entry Problem: The Twenty-First Wright Brothers Lecture

Up to this point the discussion of the problems of rocket vehicles has been confined to the effects of phenomena which have in the past been important ones for lower speed aircraft and will continue to be important for aircraft of all speeds. Now with considerable extension of both speed and altitude, other phenomena also become important. The nature of some problems will be altered, as a result, and new problems, of course, will be encountered. First, it is well to note that our interest in bluff bodies for ballistic vehicles in particular, and in rounded-nosed bodies generally, has changed our emphasis in aerodynamics. The detached bow waves which occur with such bodies at high supersonic speeds complicate the calculations of the flow-field characteristics. In the present period, much attention is being given to such studies. In addition, at the very high altitudes attained by most of the rocket-craft, the mean free path of air molecules can be of the same order, or long, compared to the dimensions of the vehicles. Thus, slip-flow and free-molecule-flow studies are of interest, particularly for satellite vehicles." The aerodynatnicist must deal with air having unfamiliar states and properties. Second, at hypersonic speeds where, for example, air is greatly decelerated, it may undergo considerable change in composition, the degree of change depending upon many factors. Dissociation of oxygen and nitrogen molecules can occur and, in addition, thermal ionization of many of the constituents. It is naturally to be expected that the convective heat transfer will, as a result, be altered from what it was for the "perfect" gas, and this has been the subject of much recent research effort. Moreover, the decelerated gas becomes capable of radiating energy and the radiative heat transfer must generally be considered for hypersonic vehicles, particularly for long-range ballistic rockets. It is not only the aerodynamic heating problems that are affected. The fact that at very high air temperature the gas becomes electrically conductive introduces new problems in radio wave transmission and reception. In addition, a conducting gas flow can, of course, be influenced by a magnetic field. The study of such flows, which has been termed "magneto gas dynamics," is still in too primitive a state to indicate how important a role it can play, but many interesting possibilities suggest themselves. Third, our experience with airplanes powered by air-breathing engines has naturally been restricted to the stratosphere, or lower. Our ignorance increases with altitude. For rockets, literally, "the sky's the limit," and it is not surprising that a great emphasis has now been placed on obtaining a more thorough understanding of the whole atmosphere. These studies are not aimed at an understanding of the chemical and physical characteristics alone, but also of the occurrence of high-energy particles, from meteors to cosmic rays, and the nature of the problems they will promote.

Wright Brother↗

Use of Simple Continuum Solutions in Finite Element Alternating Method for Fracture Problems

The performance of the finite element alternating (FEAM) method for two-dimensional crack problems is studied with respect to a polynomial pressure distribution fitted to the crack face stresses. The FEAM alternates between the analytical solution of crack in an infinite plate subjected to arbitrary polynomial distribution and a finite element solution of an uncracked body to satisfy the required boundary conditions in the crack problem. In this paper, the FEAM is applied to embedded crack and edge crack problems. For embedded crack problems, all of the constant, linear, and quadratic ( N=0,1, or 2, respectively) pressure distributions yield very accurate results with this algorithm with 4 to 5 iterations. The edge crack problems, on the other hand, require much higher order polynomials distributions (N=5 to 6) to yield accurate solutions. For slant edge crack problems, the mode-I stress-intensity factors have better accuracy than the mode-II stress-intensity factors for the same convergence tolerance.

Krishnamurthy, T.↗

A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem

With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.

Mixed-integer optimization↗

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods.

Raju, Ivatury S.↗

Understanding Resilience Optimization Architectures With an Optimization Problem Repository

Optimizing a system’s resilience can be challenging, especially when it involves considering both the inherent resilience of a robust design and the active resilience of a health management system to a set of computationally-expensive hazard simulations. While prior work has developed specialized architectures to effectively and efficiently solve combined design and resilience optimization problems, the comparison of these architectures has been limited to a single case study. To further study resilience optimization formulations, this work develops a problem repository which includes previously-developed resilience optimization problems and additional problems presented in this work: a notional system resilience model, a pandemic response model, and a cooling tank hazard prevention model. This work then uses models in the repository at large to understand the characteristics of resilience optimization problems and study the applicability of optimization architectures and decomposition strategies. Based on the comparisons in the repository, applying an optimization architecture effectively requires understanding the alignment and coupling relationships between the design and resilience models, as well as the efficiency characteristics of the algorithms. While alignment determines the necessity of a surrogate of resilience cost in the upper-level design problem, coupling determines the overall applicability of a sequential, alternating, or bilevel structure. Additionally, the application of decomposition strategies is dependent on there being limited interactions between variable sets, which often does not hold when a resilience policy is parameterized in terms of actions to take in hazardous model states rather than specific given scenarios.

Resilience↗

Influence of the course boundary value problem on length scale parmeters for second-gradient continuum theories

All nonlocal continuum descriptions of inelastic material response involve length scale parameters that either directly or implicitly quantify the physical dimensions of a neighborhood of response which influences the behavior at a particular point. The second-gradient continuum theories such as those developed by Germain, Toupin and Mindlin, and Eringen, and giving rise to strain-gradient plasticity, is becoming a common coarse-scale basis for homogenization of material response that respects the non local nature of heterogeneous material response. Ideally, the length scale parameters involved in such homogenization would be intrinsically associated with dominant aspects of the microstructure. However, these parameters, at least in some cases, are inextricably linked to the details of the coarse scale boundary value problem. Accordingly, they cannot be viewed as pure constitutive parameters. An example problem of multiscale homogenization is presented to underscore the dependence of second-gradient length scale parameters on the coarse scale boundary value problem, namely the multiscale response of an idealized porous microstructure. The fine scale (microstructure) comprises elastic perfectly plastic matrix with a periodic array of circular voids. This fine scale description of the problem is identical for two separate classes of coarse scale boundary value problem, viz. an extruded channel subject to compression and eventually developing plastic shear bands and a thin layer of material with larger (coarse scale) elliptical voids subject to shear deformation. Implications of the relationship between length scale parameters and the details of the coarse scale boundary value problem are discussed and ideas to ascertain such length parameters from evolving response fields are presented.

99 GENERAL AND MISCELLANEOUS↗

Discrete Ordinate Quadrature Selection for Reactor-based Eigenvalue Problems

In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and the recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work.

Discrete Ordinates↗

Bringing Fenton Hill into the Digital Age: Data Conversion in Support of the Geothermal Technologies Office Code Comparison Study Challenge Problems

The Geothermal Technologies Office Code Comparison Study (GTO-CCS) was established by the U.S. Department of Energy to facilitate collaboration among members of the geothermal modeling community and to evaluate and improve upon the ability of existing codes to simulate thermal, hydrological, mechanical, and chemical processes associated with complex enhanced geothermal systems (EGS). The first stage of the project, which has been completed, involved comparing simulations for seven benchmark problems that were primarily designed using well-prescribed, simplified data sets. In the second stage, the participating teams are tackling two challenge problems based on the EGS research conducted in hot dry rock (HDR) at Fenton Hill, near Los Alamos, New Mexico. The Fenton Hill project, conducted by Los Alamos National Laboratory (LANL) from 1970 to 1995, was the world’s first HDR demonstration project. One of the criteria for selecting this experiment as the basis for the challenge problems was the amount and availability of data for generating model inputs. The Fenton Hill HDR system consisted of two reservoirs – an earlier Phase I reservoir tested from 1974 to 1981 and a deeper Phase II reservoir tested from 1980 to 1995. Detailed accounts of both phases of the HDR project have been presented in a number of books and reports, including a recently published summary of the lessons learned and a final report with a chronological description of the Fenton Hill project, prepared by LANL. Project documents and records have been archived and made public through the National Geothermal Data System (NGDS). Some of the data acquired from Phase II are available in electronic format readable on modern computers. These include the microseismic data from some of the important experiments (e.g. the massive hydraulic fracturing test conducted in 1983) and the injection/production wellhead data from the circulation tests conducted between 1992-1995. However, much of the data collected during the project, while publicly available, currently only exist in the form of tables or graphs within scanned documents. Therefore, in support of the GTO-CCS, the data needed for developing simulation inputs are being compiled and converted to platform independent, open readable formats so that all participating teams will have access to the same electronic data set. In some cases this requires conversion using optical character recognition, digitizing existing images, and generating the appropriate metadata from project documents. The GTO-Velo knowledge management framework, developed by Pacific Northwest National Laboratory (PNNL), was used for the benchmark problem stage of the comparison study and will also be used as the data repository for the challenge problem data sets. It is staggering and impractical to convert all published data for the Fenton Hill site, so the focus is on data that supports simulations for the three topical areas defined by the study for the challenge problems: 1) reservoir creation/stimulation, 2) reactive and passive transport, and 3) thermal recovery. Conversion of these data provide value not only to GTO-CCS participants, but also to members of the geothermal community at large who may be interested in revisiting the Fenton Hill experiment in the future.

Code Comparison Study↗

Discrete ordinate quadrature selection for reactor-based Eigenvalue problems

In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and the recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work. (authors)

97 MATHEMATICS AND COMPUTING↗

Thick diffusion limit boundary layer test problems

We develop two simple test problems that quantify the behavior of computational transport solutions in the presence of boundary layers that are not resolved by the spatial grid. In particular we study the quantitative effects of 'contamination' terms that, according to previous asymptotic analyses, may have a detrimental effect on the solutions obtained by both discontinuous finite element (DFEM) and characteristic-method (CM) spatial discretizations, at least for boundary layers caused by azimuthally asymmetric incident intensities. Few numerical results have illustrated the effects of this contamination, and none have quantified it to our knowledge. Our test problems use leading-order analytic solutions that should be equal to zero in the problem interior, which means the observed interior solution is the error introduced by the contamination terms. Results from DFEM solutions demonstrate that the contamination terms can cause error propagation into the problem interior for both orthogonal and non-orthogonal grids, and that this error is much worse for non-orthogonal grids. This behavior is consistent with the predictions of previous analyses. We conclude that these boundary layer test problems and their variants are useful tools for the study of errors that are introduced by unresolved boundary layers in diffusive transport problems. (authors)

97 MATHEMATICS AND COMPUTING↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Application of Polynomial Chaos Expansion in One-Dimensional Inverse Transport Problems

In the problem of inverse radiation transport, measurements of particle leakages from radioactive source/shield systems are used to infer unknown parameters within the systems. This reconstruction can be accomplished by finding the physical parameters of the unknown system that minimize the difference between calculated detector responses and measured detector responses. The inverse transport solver should also propagate uncertainties from the detector responses to the reconstructed parameter values. Recently, the Differential Evolution Adaptive Metropolis (DREAM) method was shown to be a robust method for uncertainty quantification in inverse problems. The DREAM method uses the differential evolution algorithm to choose efficient steps in a Markov chain Monte Carlo (MCMC) simulation. Although the DREAM method has been shown to be more efficient than traditional MCMC approaches, it still requires thousands of transport computations to accurately quantify uncertainty. For the simple ray-tracing model, it was possible to perform these calculations in a reasonable amount of time (under an hour). However, inverse transport problems that require computationally-intensive transport solvers will need prohibitively long run times when using the DREAM method. A way to overcome the computational burden of the DREAM method is to perform surrogate modeling using the polynomial chaos expansion (PCE) approach. It was recently shown that the PCE method provides both accurate and computationally inexpensive uncertainty quantification in forward radiation source/shield problems. PCE was also recently applied to an inverse problem in nonlinear point reactor kinetics within a standard MCMC approach. PCE was first used with the DREAM method where it was applied to inverse problems in groundwater modeling.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗