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 1,441 records · Page 80

Benchmark problems in aerosol evolution: Comparison of some exact and DSMC results

Aerosols are generated in many normal or accident situations associated with the nuclear enterprise. For a good understanding and modeling of the nuclear source term, for example, good experimental data and computational programs relating to aerosol evolution are needed. In the past several years there has been an effort to explore use of the Direct Simulation Monte Carlo (DSMC) approach for such estimations to improve fidelity of computations to the actual physics and chemistry of the accidents. An integral part of these efforts has been verification and validation of the DSMC technique against other available results wherever possible. Herein this paper explores verification of DSMC against one existing and two new benchmark problems covering condensation, coagulation, deposition and two-component aerosols. The simulations compare well with the exact results, providing further confidence in the use of DSMC.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Deterministically estimated fission source distributions for Monte Carlo k-eigenvalue problems

The standard Monte Carlo (MC) k-eigenvalue algorithm involves iteratively converging the fission source distribution using a series of potentially time-consuming inactive cycles before quantities of interest can be tallied. One strategy for reducing the computational time requirements of these inactive cycles is the Sourcerer method, in which a deterministic eigenvalue calculation is performed to obtain an improved initial guess for the fission source distribution. This method has been implemented in the Exnihilo software suite within SCALE using the SPNSPN or SNSN solvers in Denovo and the Shift MC code. The efficacy of this method is assessed with different Denovo solution parameters for a series of typical k-eigenvalue problems including small criticality benchmarks, full-core reactors, and a fuel cask. Here it is found that, in most cases, when a large number of histories per cycle are required to obtain a detailed flux distribution, the Sourcerer method can be used to reduce the computational time requirements of the inactive cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Landau problem with a general time-dependent electric field

The time evolution is studied for the Landau level problem with a general time dependent electric field E(t) in a plane perpendicular to the magnetic field. A general and explicit factorization of the time evolution operator is obtained with each factor having a clear physical interpretation. The factorization consists of a geometric factor (path-ordered magnetic translation), a dynamical factor generated by the usual time-independent Landau Hamiltonian, and a nonadiabatic factor that determines the transition probabilities among the Landau levels. Since the path-ordered magnetic translation and the nonadiabatic factor are, up to completely determined numerical phase factors, just ordinary exponentials whose exponents are explicitly expressible in terms of the canonical variables, all of the factors in the factorization are explicitly constructed. New quantum interference effects are implied by this result. The factorization is unique from the point of view of the quantum adiabatic theorem and provides a seemingly first rigorous demonstration of how the quantum adiabatic theorem (incorporating the Berry phase phenomenon) is realized when infinitely degenerate energy levels are involved. Since the factorization separates the effect caused by the electric field into a geometric factor and a nonadiabatic factor, it makes possible to calculate the nonadiabatic transition probabilities near the adiabatic limit. A formula for matrix elements that determines the mixing of the Landau levels for a general, nonadiabatic evolution is also provided by the factorization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Periodic Sturm-Liouville problems related to two Riccati equations of constant coefficients

We consider two closely related Riccati equations of constant parameters whose particular solutions are used to construct the corresponding class of supersymmetrically coupled second-order differential equations. We solve analytically these parametric periodic problems along the whole real axis. Next, the analytically solved model is used as a case study for a powerful numerical approach that is employed here for the first time in the investigation of the energy band structure of periodic not necessarily regular potentials. The approach is based on the well-known self-matching procedure of James (1949) and implements the spectral parameter power series solutions introduced by Kravchenko (2008). We obtain additionally an efficient series representation of the Hill discriminant based on Kravchenko's series.

97 MATHEMATICS AND COMPUTING↗

A Lie algebraic approach to the Kondo problem

The Kondo problem is approached using the unitary Lie algebra of spin-singlet fermion bilinears. In the limit when the number of values of the spin N goes to infinity the theory approaches a classical limit, which still requires a renormalization. We determine the ground state of this renormalized theory. Then we construct a quantum theory around this classical limit, which amounts to recovering the case of finite N.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The extended Bloch representation of quantum mechanics and the hidden-measurement solution to the measurement problem

A generalized Bloch sphere, in which the states of a quantum entity of arbitrary dimension are geometrically represented, is investigated and further extended, to also incorporate the measurements. This extended representation constitutes a general solution to the measurement problem, inasmuch it allows to derive the Born rule as an average over hidden-variables, describing not the state of the quantum entity, but its interaction with the measuring system. According to this modelization, a quantum measurement is to be understood, in general, as a tripartite process, formed by an initial deterministic decoherence-like process, a subsequent indeterministic collapse-like process, and a final deterministic purification-like process. We also show that quantum probabilities can be generally interpreted as the probabilities of a first-order non-classical theory, describing situations of maximal lack of knowledge regarding the process of actualization of potential interactions, during a measurement. - Highlights: • An extended Bloch representation of quantum measurements is given. • Quantum measurements are explained in terms of hidden-measurement interactions. • Quantum measurements are explained as tripartite processes. • The Born rule results from a universal average, over all possible measurement processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Haydock’s recursive solution of self-adjoint problems. Discrete spectrum

Haydock’s recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber’s quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock’s recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials (p{sub n}(E)) in energy variable E. The polynomials (p{sub n}(E)) are orthonormal with respect to the density of states n{sub 0}(E) and energy eigenstate |E〉 is the generating function of (p{sub n}(E)). The generality of Haydock’s recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable DPG multigrid solver for Helmholtz problems: A study on convergence

This paper presents a scalable multigrid preconditioner targeting large-scale systems arising from discontinuous Petrov–Galerkin (DPG) discretizations of high-frequency wave operators. This work is built on previously developed multigrid preconditioning techniques of Petrides and Demkowicz (Comput. Math. Appl. 87 (2021) pp. 12–26) and extends the convergence results from $\mathscr{O}$(10 7 ) degrees of freedom (DOFs) to $\mathscr{O}$(10 9 ) DOFs using a new scalable parallel MPI/OpenMP implementation. Novel contributions of this paper include an alternative definition of coarse-grid systems based on restriction of fine-grid operators, yielding superior convergence results. In the uniform refinement setting, a detailed convergence study is provided, demonstrating h and p robust convergence and linear scaling with respect to the wave frequency. Finally, the paper concludes with numerical results on hp -adaptive simulations including a large-scale seismic modeling benchmark problem with high material contrast.

97 MATHEMATICS AND COMPUTING↗

A data-driven linear formulation of the optimal demand response scheduling problem for an industrial air separation unit

Demand response (DR) has become a key element in balancing the power grid as the contribution of time-varying renewable power generation increases. Chemical plants are appealing candidates for DR programs as they offer large, concentrated and flexible loads. DR participation calls for frequent production rate changes over time scales that overlap with the dominant dynamics of the plant. Production scheduling should therefore consider the process dynamics explicitly. Here we present a data-driven approach for modelling the scheduling-relevant dynamics based on historical closed-loop operating data using autoregressive with extra inputs (ARX) models. We introduce a new, linear scheduling problem formulation based on the ARX representation, and demonstrate its implementation on an industrial air separation unit.

42 ENGINEERING↗

Minimizing total energy cost and tardiness penalty for a scheduling-layout problem in a flexible job shop system: A comparison of four metaheuristic algorithms

Job scheduling and machine layout are interrelated in improving energy consumption (EC) and productivity measures such as tardiness and represent two important decisions that must be made by manufacturers. This interdependency can be explained by transportation time, which connects scheduling and layout. Scheduling and layout, however, have not been thoroughly studied in conjunction using an integrated model in the context of sustainable manufacturing. Hence, we propose an energy-aware optimization model in which scheduling is integrated with layout in a single-level framework. More specifically, a single objective function is defined to minimize the facility energy cost and the job tardiness penalty, which control EC and tardiness respectively in a flexible job shop system. In order to model machine EC more accurately, we also consider three different machine states: a processing state and two idle states. Our case studies show that the integrated model exhibits better performance in controlling manufacturing EC and job tardiness than a non-integrated model in which machine locations are uncontrollable and transportation times between machines are unchangeable. To deal with large-sized problems, we also introduce four new metaheuristics. The performances of these new metaheuristics are compared in terms of objective function values and CPU times using various case studies. The results indicate that a hybrid ant colony optimization and simulated annealing (ACO-SA) algorithm provides better performance than the other algorithms. Specifically, our case studies show that the integrated model using ACO-SA can improve the objective function value by around 5% when compared to the non-integrated model.

42 ENGINEERING↗

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗

Solving inverse problems in stochastic models using deep neural networks and adversarial training

Inverse problems associated with stochastic models constitute a significant portion of scientific and engineering applications. In such cases the unknown quantities are distributions. The applicability of traditional methods is limited because of their demanding assumptions or prohibitive computational consumption; for example, maximum likelihood methods require closed-form density functions, and Markov Chain Monte Carlo needs a large number of simulations. We propose a new method that estimates the unknown distribution by matching the statistical properties between observed and simulated random processes. We leverage the expressive power of neural networks to approximate the unknown distribution and use a discriminative neural network for computing the statistical discrepancies between the observed and simulated random processes. Here we demonstrated numerically that the proposed methods can estimate both the model parameters and learn complicated unknown distributions.

42 ENGINEERING↗

Conditional Karhunen–Loève regression model with Basis Adaptation for high-dimensional problems: Uncertainty quantification and inverse modeling

Here, we propose a methodology for improving the accuracy of surrogate models of the observable response of physical systems as a function of the systems’ spatially heterogeneous parameter fields, with applications to uncertainty quantification and parameter estimation in high-dimensional problems. Practitioners often formulate finite-dimensional representations of spatially heterogeneous parameter fields using truncated unconditional Karhunen–Loève expansions (KLEs) for a certain choice of unconditional covariance kernel and construct surrogate models of the observable response with respect to the KLE coefficients. When direct measurements of the parameter fields are available, we propose improving the accuracy of these surrogate models by representing the parameter fields via conditional Karhunen-Loève expansions (CKLEs). CKLEs are constructed by conditioning the covariance kernel of the unconditional expansion on the direct measurements of the parameter field via Gaussian process regression, and then truncating the corresponding KLE. We apply the proposed methodology to constructing surrogate models via the Basis Adaptation (BA) method of the stationary hydraulic head response, measured at spatially discrete observation locations, of a groundwater flow model of the Hanford Site, as a function of the 1000-dimensional representation of the model’s log-transmissivity field. We find that BA surrogate models of the hydraulic head based on CKLEs are more accurate than BA surrogate models based on unconditional expansions for forward uncertainty quantification tasks. Furthermore, we find that inverse estimates of the hydraulic transmissivity field computed using CKLE-based BA surrogate models are more accurate than those computed using unconditional BA surrogate models.

97 MATHEMATICS AND COMPUTING↗

A cohesive zone treatment for the material point method involving problems of large deformation and damage

A new algorithm is described that permits the use of cohesive zones in the material point method for problems involving large deformation and fracture. In contrast to previous cohesive zone implementations, this method does not utilize massless surface-element particles. Instead, cohesive tractions are computed using the shape function mappings from a reference grid configuration in combination with explicitly defined particle surface normals and surface positions. These normals and relative surface positions are updated each time step according to particle deformation. The tractions are converted to cohesive forces using the nodal areas and mapped back to particles using the same reference shape function mappings. These forces are then remapped by conventional particle-to-grid interpolation as external forces using the current-configuration shape-function mappings. This allows highly compliant cohesive zones to function over jump displacements larger than a grid cell. Upon damage, these interfaces can revert to conventional multi-field contact surfaces. This approach is general and readily applies to two and three dimensions as well as being compatible with damage-field gradient partitioning offering exceptional computational flexibility. The framework for this method enables other capabilities, such as improved contact precision using explicitly defined surface normals and positions, and a method to mitigate spurious material damage at weak discontinuities between stiff brittle materials and soft or compliant materials.

Cohesive zone↗

A finite difference informed random walker (FDiRW) solver for strongly inhomogeneous diffusion problems

In nature, many complex multi-physics coupling problems exhibit strong diffusivity inhomogeneity. For instance, in the context of radionuclide absorption by porous wasteform materials within a flowing waste stream, the difference of species’ diffusivity in solid and liquid phases spans by 3~8 orders of magnitude. To solve the diffusion equations with strongly inhomogeneous diffusivity, traditional discretization-based methods, such as the Finite Difference Method (FDM), require infinitesimally small time steps (<10 -10 ) as high spatial resolutions are employed in most microstructure evolution processes, leading to prohibitively high computational costs. Here, this work developed an integrated numerical approach (FDiRW: Finite Difference informed Random Walk) to tackle this challenge. The idea is that utilizing the Random Walk concept, the fast diffusion is modeled as a superposition of point source’s solution for a concentration distribution while FDM is used to obtain the point source’s solution at each node. A mesh-coarsening algorithm is developed to generate an exclusive coarse mesh for FDiRW approach to maximize its efficiency. The effectiveness of the coarse mesh-based FDiRW approach is validated by benchmarking Finite Difference solutions. Numerical results demonstrated that FDiRW achieves a remarkable 1000x computational efficiency improvement over FDM while preserving desired accuracy for a medium-sized model of 192 × 192 × 192 grids. Finally, as models scale up, a floating-point operations (PLOPs) analysis of the FDiRW algorithm reveals that its computational complexity grows quadratically in terms of the number of nodes employed in computation.

36 MATERIALS SCIENCE↗

A spectrum slicing method for the Kohn–Sham problem

Solving the Kohn–Sham equation, which arises in density functional theory, is a standard procedure to determine the electronic structure of atoms, molecules, and condensed matter systems. The solution of this nonlinear eigenproblem is used to predict the spatial and energetic distribution of electronic states. However, obtaining a solution for large systems is computationally intensive because the problem scales super-linearly with the number of atoms. Here we demonstrate a divide and conquer method that partitions the necessary eigenvalue spectrum into slices and computes each partial spectrum on an independent group of processors in parallel. We focus on the elements of the spectrum slicing method that are essential to its correctness and robustness such as the choice of filter polynomial, the stopping criterion for a vector iteration, and the detection of duplicate eigenpairs computed in adjacent spectral slices. Some of the more prominent aspects of developing an optimized implementation are discussed.

Computer Science↗

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗