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 217 records · Page 12

Problems of Nuclear Technology and Radiation Safety

This work discusses ethical issues arising in the course of the development of nuclear technologies and related issues of radiation safety. Attention is paid to ethical dilemmas and proposed solutions. The author suggests a critical analysis of the relevant discussions, conducted, first of all, in the English-language literature, and muses on the specifics associated with their transfer to the Russian context. This study considers ethical problems arising in context of the depletion of uranium resources and nuclear waste management and including the inevitable risks for the present and future generations, such as inter- and intragenerational justice (Gardiner's problem) and the problem of the identity of future generations (Parfit’s problem); problems of collectivity and individuality in the assessment of permissible radiation doses for workers at nuclear enterprises and the population associated with the need to combine deontological and utilitarian approaches in the practice of radiation protection. The author demonstrates cultural differences in attitudes towards the safety of the current and future generations of the population of countries and regions and the associated ambiguities in the choice of technology for nuclear reactors, long-term disposal or processing of nuclear waste; double standards in ensuring the radiation safety of personnel of nuclear facilities and the population; ethical problems of risk compensation to workers of radiation-hazardous production facilities; issues of gender differences in sensitivity to radiation exposure, gender equality and discrimination in relation to access to the labor market in the nuclear industry. The article elucidates the importance of socio-humanitarian discussion of the ethical problems of nuclear technologies and radiation safety Such debates currently are almost absent in the Russian-language philosophical literature, despite its exceptional importance due to both the level of development of nuclear energy in Russia and the potential risks that these technologies pose to current and future generations of both employees of nuclear facilities and the population of the country, neighboring countries, and the world. The purpose of this article, thus, is to initiate such a discussion.

ethics of science and technology↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗

Extending the subspace hybrid method for eigenvalue problems in reactor physics calculation

This paper presents an innovative hybrid Monte-Carlo-Deterministic method denoted by the SUBSPACE method designed for improving the efficiency of hybrid methods for reactor analysis applications. The SUBSPACE method achieves its high computational efficiency by taking advantage of the existing correlations between desired responses. Recently, significant gains in computational efficiency have been demonstrated using this method for source driven problems. Within this work the mathematical theory behind the SUBSPACE method is introduced and extended to address core wide level k-eigenvalue problems. The method's efficiency is demonstrated based on a three-dimensional quarter-core problem, where responses are sought on the pin cell level. The SUBSPACE method is compared to the FW-CADIS method and is found to be more efficient for the utilized test problem because of the reason that the FW-CADIS method solves a forward eigenvalue problem and an adjoint fixed-source problem while the SUBSPACE method only solves an adjoint fixed-source problem. Based on the favorable results obtained here, we are confident that the applicability of Monte Carlo for large scale reactor analysis could be realized in the near future. (authors)

97 MATHEMATICS AND COMPUTING↗

Fourier Analysis of the Multilevel QD Method with {alpha}-Approximation For Time-Dependent Radiative Transfer Problems

Thermal radiation transfer (TRT) problems describe interaction of photon radiation with matter. They are defined by the time-dependent radiative transfer (RT) equation for the specific intensity I coupled with the energy balance (EB) equation. This class of problems is characterised by high dimensionality, multiple scales and strong nonlinearity. In this paper we analyze the multilevel quasi-diffusion (QD) method for solving TRT problems. This is a nonlinear method of moments with exact closures. The QD method enables one to reduce dimensionality of the original radiative transfer problem. It is formulated by a nonlinear system of equations consisting of (i) the high-order RT (HORT) equation for the intensity of photon radiation and (ii) low-order equations for the angular and energy moments of the intensity. The nonlinear closures are formulated by means of stable factors. The low-order problem brings the radiative transfer model to the level of multi-physics equations. The multilevel QD (MLQD) method possesses attractive features for efficient multi-physics coupling. To calculate the high-order RT solution we apply the {alpha}-approximation which assumes that the intensity changes exponentially in time over a time step. The {alpha}-approximation leads to the steady-state RT equation with a modified opacity and enables one to avoid storing the high-dimensional solution from the previous time step. The rate of change is evaluated by the solution of the time-dependent low-order QD (LOQD) equations for moments. We note that the HORT equation in the {alpha}-approximation contains an extra nonlinear term. It affects the iterative behaviour of the MLQD method. The obtained computational results indicated that the rate of convergence is slower compared to the rate when the time-dependent HORT is used to calculate the intensity. In this paper we perform an iterative stability analysis of the MLQD method in a discretized form and analyze convergence of outer (transport) iterations on a time step. We consider multigroup TRT problems in 1D slab geometry. The fully implicit scheme is used to discretize equations in time. The HORT equation is approximated with the method of step characteristics. A finite volume method is applied for spatial discretization of multigroup LOQD equations. The grey (one-group) LOQD equations are algebraically consistent with the multigroup LOQD equations. To perform Fourier analysis a model TRT problem in an infinite homogeneous medium is considered. The system of nonlinear equations of the MLQD method is linearized near an equilibrium solution at some given temperature. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the benefit of using both hand calculation methods and computer experiments algorithms to solve complex nuclear criticality safety problems - 14299

A companion paper shows the 'anomalies', and even the safety issues, that may be raised by the very usual problem of making safe a fissile mass inside a controlled geometry. These anomalies mainly come from the solving of such problems which belong to the mathematical family of 'robust inversion' including two inversion parameters (the fissile mass and the geometry) and one nuisance parameter (the moderation ratio of the fissile material). Since a 'brute force' method of resolution requires a lot of calculations and since a 'smart' method of resolution requires a lot of engineer time, it is tempting to solve these problems by a 'custom made' approach rather than to achieve a 'whole' resolution. The present paper shows how one can use a hand calculation method (derivation of the one-speed diffusion theory) to perform the whole resolution of such kind of problems with a minimum calculations and human efforts. The powerful capability of predicting the 'anomalies' highlighted in the companion paper is shown. Then the limitations of such a method are discussed: limitation in the geometry of the problem and bias in absolute values prediction. Finally, new algorithms of computer experiments design, dedicated to solve robust inversion problems and based on Kriging surrogates, are tested to solve these problems with limiting calculations and human efforts. The performance of these new algorithms may supplement the one-speed diffusion theory limitations. (authors)

42 ENGINEERING↗

A Perspective on information fusion problems, Extended Abstract, Journal of Distributed Sensor Neworks

Information fusion problems have a rich history spanning four centuries and several disciplines as diverse as political economy, reliability engineering, target tracking, bioinformatics, forecasting, distributed detection, robotics, cyber security, nuclear engineering, distributed sensor networks, and others. Over the past decade, the area of information fusion has been established as a discipline by itself with several contributions to its foundations as well as applications. In a basic formulation of the information fusion problem, each component is characterized by a probability distribution. The goal is to estimate a fusion rule for combining the outputs of components to achieve a specified objective such as better performance or functionality compared to the components. If the sensor error distributions are known, several fusion rule estimation problems have been formulated and solved using deterministic methods. In the area of pattern recognition a weighted majority fuser was shown to be optimal in combining outputs from pattern recognizers under statistical independence conditions. A simpler version of this problem corresponds to the Condorcet Jury theorem proposed in 1786. This result was rediscovered since then in other disciplines including by von Neumann in 1959 in building reliable computing devices. The distributed detection problem, studied extensively in the target tracking area, can be viewed as a generalization of the above two problems. In these works, the underlying distributions are assumed to be known, which is quite reasonable in the areas these methods are applied. In a different formulation, we consider estimating the fuser based on empirical data when no information is available about the underlying distributions of components. Using the empirical estimation methods, this problem is shown to be solvable in principle, and the fuser performance may be sharpened based on the specific formulation. The isolation fusers perform at least as good as best component, and the projective fusers perform as good as best combination of components. In a special case of function estimation, each component could be a potential function estimator, radial basis function, nearest neighbor estimator, regressogram, kernel estimator, regression tree or another estimator. A projective fuser based on a nearest neighbor concept has been proposed based on Voronoi regions in this case. Under fairly general smoothness and non-smoothness conditions on the individual estimators, the expected fuser error is close to optimal with a specified probability. This result is purely sample-based and distribution-free in that it does not require the knowledge of underlying distributions and can be computed only using measurements.

99 GENERAL AND MISCELLANEOUS↗

Riemann–Hilbert Problems on a Cut Plane

We consider the Riemann–Hilbert-type boundary-value problems in the case of several unknown functions and obtain solvability conditions and index formulas for the linear conjugation problem, the Riemann–Hilbert problem, and the Riemann–Hilbert–Poincaré problem on a plane cut along several regular arcs in various weighted functional classes. We also examine the general differential boundary-value problem for analytic functions and boundary-value problems with shifts and complex conjugation on a cut plane.

97 MATHEMATICS AND COMPUTING↗

Designing interagency responses to wicked problems: A viable system model board game

Government agencies struggle to address wicked problems because they are open-ended, highly interdependent issues that cross agency, stakeholder, jurisdictional, and geopolitical boundaries. While both quantitative modelling and qualitative problem structuring methodologies have been used to support interagency decision making in the past, co-designing an effective interagency organization to collaboratively tackle wicked problems is more challenging. Few approaches have been developed to enable such efforts. This paper explains how the viable system model (VSM) was implemented through a board game, which was employed to co-design an interagency meta-organization that would be capable of more effectively collaborating to jointly address a wicked problem: international organized drug crime and its interface with local gangs in Chicago, USA. The board game was developed to make the VSM easier for the participants to learn, given that the cybernetic language and engineering-influenced diagrams in the original literature can be off-putting to leaders and managers. The board game was used as the final stage of a multi-method, systemic approach, which involved boundary critique and problem structuring as well as deployment of the VSM. The research findings indicate that the VSM board game, used as part of a larger mixed-methods systemic intervention, contributes to building trust in the value of systems thinking amongst the participants, and sets up a rich context for collaboration on multi-agency co-design. The game therefore offers significant promise as part of the co-design of interagency responses to wicked problems because it creates an embodied process for stakeholders to learn about the VSM. It also reduces the work involved in this learning. Thus, the game enables an effective appropriation of the VSM language and criteria.

Business & Economics↗

Adaptive Interface-PINNs (AdaI-PINNs) for transient diffusion: Applications to forward and inverse problems in heterogeneous media

We model transient diffusion in heterogeneous materials using a novel physics-informed neural networks framework (PINNs) termed Adaptive interface physics-informed neural networks or AdaI-PINNs (Roy et al. arXiv preprint arXiv:2406.04626, 2024). AdaI-PINNs utilize different activation functions with trainable slopes tailored to each material region within the computational domain, allowing for a fully automated and adaptive PINNs approach to model interface problems with strongly and weakly discontinuous solutions. To enhance its performance in highly heterogeneous transient diffusion systems, we prescribe a suite of robust practices, including appropriate non-dimensionalization of equations, a biased sampling method, Glorot initialization, and the hard enforcement of boundary and initial conditions. Here we evaluate the efficacy of the proposed method on several benchmark forward and inverse problems. Comparative studies on one-dimensional and two-dimensional benchmark problems reveal that the modified AdaI-PINNs outperform its unmodified counterpart, achieving root-mean-square errors that are at least two orders of magnitude better in forward problems. For inverse problems, the maximum errors in the approximated diffusion coefficients by modified AdaI-PINNs are four orders of magnitude better than those of the unmodified version. Additionally, modified AdaI-PINNs demonstrate improved stability in problems with large material mismatches.

42 ENGINEERING↗

Semi-global approach for propagation of the time-dependent Schrödinger equation for time-dependent and nonlinear problems

A detailed exposition of highly efficient and accurate method for the propagation of the time-dependent Schrödinger equation is presented. The method is readily generalized to solve an arbitrary set of ODE's. The propagation is based on a global approach, in which large time-intervals are treated as a whole, replacing the local considerations of the common propagators. The new method is suitable for various classes of problems, including problems with a time-dependent Hamiltonian, nonlinear problems, non-Hermitian problems and problems with an inhomogeneous source term. In this paper, a thorough presentation of the basic principles of the propagator is given. We give also a special emphasis on the details of the numerical implementation of the method. For the first time, we present the application for a non-Hermitian problem by a numerical example of a one-dimensional atom under the influence of an intense laser field. The efficiency of the method is demonstrated by a comparison with the common Runge–Kutta approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN

Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin dynamics method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence; two chains with different temperatures are designed where the low temperature chain aims for the local convergence, and the target of the high temperature chain is to travel globally and explore the whole loss function entropy landscape. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. More precisely, one can use a solver with low fidelity in the high temperature chain while using a solver with high fidelity in the low temperature chain. Our proposed method significantly lowers the computational cost in the high temperature chain, meanwhile preserving the accuracy and converging very fast. Here we give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin dynamics (SGLD) method and vanilla replica exchange methods.

97 MATHEMATICS AND COMPUTING↗

A point implicit time integration technique for slow transient flow problems

We introduce a point implicit time integration technique for slow transient flow problems. The method treats the solution variables of interest (that can be located at cell centers, cell edges, or cell nodes) implicitly and the rest of the information related to same or other variables are handled explicitly. The method does not require implicit iteration; instead it time advances the solutions in a similar spirit to explicit methods, except it involves a few additional function(s) evaluation steps. Moreover, the method is unconditionally stable, as a fully implicit method would be. This new approach exhibits the simplicity of implementation of explicit methods and the stability of implicit methods. It is specifically designed for slow transient flow problems of long duration wherein one would like to perform time integrations with very large time steps. Because the method can be time inaccurate for fast transient problems, particularly with larger time steps, an appropriate solution strategy for a problem that evolves from a fast to a slow transient would be to integrate the fast transient with an explicit or semi-implicit technique and then switch to this point implicit method as soon as the time variation slows sufficiently. We have solved several test problems that result from scalar or systems of flow equations. Our findings indicate the new method can integrate slow transient problems very efficiently; and its implementation is very robust.

42 ENGINEERING↗

A NEW EIGHT-STEP SYMMETRIC EMBEDDED PREDICTOR-CORRECTOR METHOD (EPCM) FOR ORBITAL PROBLEMS AND RELATED IVPs WITH OSCILLATORY SOLUTIONS

A new multistep predictor-corrector (PC) pair form is introduced for the numerical integration of second-order initial-value problems. Using this form, a new eight-step symmetric embedded predictor-corrector method is constructed. The new PC method is based on the multistep symmetric method of Quinlan and Tremaine, with eight steps and eighth algebraic order, and is constructed to solve numerically the N-body problem. The new integrator has algebraic order 10 and it can be used to solve problems, for which the frequency is not known. We investigate the behavior of the new algorithm by integrating the five outer-planet problem and the two-body problem with various eccentricities. Regarding the five outer-planet problem, we calculate the error of the integrator in the solution, the Hamiltonian, and the phase after forward and backward integration over various intervals that are multiples of the period of Jupiter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Taylor approximation variance reduction for approximation errors in PDE-constrained Bayesian inverse problems

In numerous applications, surrogate models are used as a replacement for accurate parameter-to-observable mappings when solving large-scale inverse problems governed by partial differential equations (PDEs). The surrogate model may be a computationally cheaper alternative to the accurate parameter-to-observable mappings and/or may ignore additional unknowns or sources of uncertainty. The Bayesian approximation error (BAE) approach provides a means to account for the induced uncertainties and approximation errors, i.e. the errors between the accurate parameter-to-observable mapping and the surrogate. The statistics of these errors are, however, in general unknown a priori, and are thus calculated using Monte Carlo sampling. Although the sampling is typically carried out offline, i.e. before considering the data, the process can still represent a computational bottleneck. In this work, we develop a scalable computational approach for reducing the costs associated with the sampling stage of the BAE approach. Specifically, we consider the Taylor expansion of the accurate and surrogate forward models with respect to the uncertain parameter fields either as a control variate for variance reduction or as a means to directly and efficiently approximate the mean and covariance of the approximation errors. We propose efficient methods for evaluating the expressions for the mean and covariance of the Taylor approximations based on linear(-ized) PDE solves. Furthermore, the proposed approach is independent of the dimension of the uncertain parameter, depending instead on the intrinsic dimension of the data, ensuring scalability to high-dimensional problems. The potential benefits of the proposed approach are demonstrated for two high-dimensional inverse problems governed by PDE examples, namely for the estimation of a distributed Robin boundary coefficient in a linear diffusion problem, and for a coefficient estimation problem governed by a nonlinear diffusion problem.

Bayesian approximation error↗

Particle-Filter-Based Multisensor Fusion For Solving Low-Frequency Electromagnetic NDE Inverse Problems

Flaw profile characterization from NDE measurements is a typical inverse problem. A novel transformation of this inverse problem into a tracking problem, and subsequent application of a sequential Monte Carlo method called particle filtering, has been proposed by the authors in an earlier publication [1]. In this study, the problem of flaw characterization from multi-sensor data is considered. The NDE inverse problem is posed as a statistical inverse problem and particle filtering is modified to handle data from multiple measurement modes. The measurement modes are assumed to be independent of each other with principal component analysis (PCA) used to legitimize the assumption of independence. The proposed particle filter based data fusion algorithm is applied to experimental NDE data to investigate its feasibility.

Data Fusion↗

Decentralizing Network Inference Problems With Multiple-Description Fusion Estimation (MDFE)

Network inference (or tomography) problems, such as traffic matrix estimation or completion and link loss inference, have been studied rigorously in different networking applications. These problems are often posed as under-determined linear inverse (UDLI) problems and solved in a centralized manner, where all the measurements are collected at a central node, which then applies a variety of inference techniques to estimate the attributes of interest. This paper proposes a novel framework for decentralizing these large-scale under-determined network inference problems by intelligently partitioning it into smaller subproblems and solving them independently and in parallel. The resulting estimates, referred to as multiple descriptions, can then be fused together to compute the global estimate. We apply this Multiple Description and Fusion Estimation (MDFE) framework to three classical problems: traffic matrix estimation, traffic matrix completion, and loss inference. Using real topologies and traces, we demonstrate how MDFE can speed up computation while maintaining (even improving) the estimation accuracy and how it enhances robustness against noise and failures. In conclusion, we also show that our MDFE framework is compatible with a variety of existing inference techniques used to solve the UDLI problems.

97 MATHEMATICS AND COMPUTING↗

Enabling Hyper-Differential Sensitivity Analysis for Ill-Posed Inverse Problems

Inverse problems constrained by partial differential equations (PDEs) play a critical role in model development and calibration. In many applications, there are multiple uncertain parameters in a model that must be estimated. However, high dimensionality of the parameters and computational complexity of the PDE solves make such problems challenging. A common approach is to reduce the dimension by fixing some parameters (which we will call auxiliary parameters) to a best estimate and use techniques from PDE-constrained optimization to estimate the other parameters. In this article, hyper-differential sensitivity analysis (HDSA) is used to assess the sensitivity of the solution of the PDE-constrained optimization problem to changes in the auxiliary parameters. Foundational assumptions for HDSA require satisfaction of the optimality conditions which are not always practically feasible as a result of ill-posedness in the inverse problem. Here we introduce novel theoretical and computational approaches to justify and enable HDSA for ill-posed inverse problems by projecting the sensitivities on likelihood informed subspaces and defining a posteriori updates. Our proposed framework is demonstrated on a nonlinear multiphysics inverse problem motivated by estimation of spatially heterogeneous material properties in the presence of spatially distributed parametric modeling uncertainties.

97 MATHEMATICS AND COMPUTING↗