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,369 records · Page 76

Exploring Professor Motivations and Implementations of a Real-World Problem-Solving Project: A Case Study in Preparing Students for the Emerging Building Science Industry: Preprint

Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Geospatial Integrated Problem Solving Environment for Homeland Security Applications

Effective planning, response, and recovery (PRR) involving terrorist attacks or natural disasters come with a vast array of information needs. Much of the required information originates from disparate sources in widely differing formats. However, one common attribute the information often possesses is physical location. The organization and visualization of this information can be critical to the success of the PRR mission. Organizing information geospatially is often the most intuitive for the user. In the course of developing a field tool for the U.S. Department of Homeland Security (DHS) Office for Bombing Prevention, a geospatial integrated problem solving environment software framework was developed by Oak Ridge National Laboratory. This framework has proven useful as well in a number of other DHS, Department of Defense, and Department of Energy projects. An overview of the software architecture along with application examples are presented.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Predicting the severity of spurious “double ITCZ” problem in CMIP5 coupled models from AMIP simulations [Tropical versus extratropical origins of the spurious 'double ITCZ' in coupled climate models]

The severity of the double Intertropical Convergence Zone (DI) problem in climate models can be measured by a tropical precipitation asymmetry index (PAI), indicating whether tropical precipitation favors the Northern Hemisphere or the Southern Hemisphere. Examination of 19 Coupled Model Intercomparison Project phase 5 models reveals that the PAI is tightly linked to the tropical sea surface temperature (SST) bias. As one of the factors determining the SST bias, the asymmetry of tropical net surface heat flux in Atmospheric Model Intercomparison Project (AMIP) simulations is identified as a skillful predictor of the PAI change from an AMIP to a coupled simulation, with an intermodel correlation of 0.90. Using tropical top-of-atmosphere (TOA) fluxes, the correlations are lower but still strong. However, the extratropical asymmetries of surface and TOA fluxes in AMIP simulations cannot serve as useful predictors of the PAI change. Furthermore, this study suggests that the largest source of the DI bias is from the tropics and from atmospheric models.

54 ENVIRONMENTAL SCIENCES↗

An adaptive Gaussian process-based method for efficient Bayesian experimental design in groundwater contaminant source identification problems: ADAPTIVE GAUSSIAN PROCESS-BASED INVERSION

Surrogate models are commonly used in Bayesian approaches such as Markov Chain Monte Carlo (MCMC) to avoid repetitive CPU-demanding model evaluations. However, the approximation error of a surrogate may lead to biased estimations of the posterior distribution. This bias can be corrected by constructing a very accurate surrogate or implementing MCMC in a two-stage manner. Since the two-stage MCMC requires extra original model evaluations, the computational cost is still high. If the information of measurement is incorporated, a locally accurate approximation of the original model can be adaptively constructed with low computational cost. Based on this idea, we propose a Gaussian process (GP) surrogate-based Bayesian experimental design and parameter estimation approach for groundwater contaminant source identification problems. A major advantage of the GP surrogate is that it provides a convenient estimation of the approximation error, which can be incorporated in the Bayesian formula to avoid over-confident estimation of the posterior distribution. The proposed approach is tested with a numerical case study. Without sacrificing the estimation accuracy, the new approach achieves about 200 times of speed-up compared to our previous work using two-stage MCMC.

Zhang, Jiangjiang↗

Extremum seeking for optimal control problems with unknown time-varying systems and unknown objective functions

We consider the problem of optimal feedback control of an unknown, noisy, time-varying, dynamic system that is initialized repeatedly. Examples include a robotic manipulator which must perform the same motion, such as assisting a human, repeatedly and accelerating cavities in particle accelerators which are turned on for a fraction of a second with given initial conditions and vary slowly due to temperature fluctuations. In this paper, we present an approach that applies to systems of practical interest. The method presented here is model independent; does not require knowledge of the objective function; is robust to measurement noise; is applicable for any set of initial conditions; is applicable to simultaneously controlling an arbitrary number of parameters; and may be implemented with a broad range of continuous or discontinuous functions such as sine or square waves. For systems with convex cost functions we prove that our algorithm will produce controllers that approach the minimal cost. For linear systems we reproduce the cost minimizing linear quadratic regulator optimal controller that could have been designed analytically had the system and cost function been known. We demonstrate the effectiveness of the algorithm with simulation studies of noisy and time-varying systems.

42 ENGINEERING↗

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasks without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.

97 MATHEMATICS AND COMPUTING↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗

A semi-local spectral/hp element solver for linear elasticity problems:

We develop an efficient semi-local method for speeding up the solution of linear systems arising in spectral/hp element discretization of the linear elasticity equations. The main idea is to approximate the element-wise residual distribution with a localization operator we introduce in this paper, and subsequently solve the local linear system. Additionally, we decouple the three directions of displacement in the localization operator, hence enabling the use of an efficient low energy preconditioner for the conjugate gradient solver. This approach is effective for both nodal and modal bases in the spectral/hp element method, but here, we focus on the modal hierarchical basis. In numerical tests, we verify that there is no loss of accuracy in the semi-local method, and we obtain good parallel scalability and substantial speed-up compared to the original formulation. In particular, our tests include both structure-only and fluid-structure interaction problems, with the latter modeling a 3D patient-specific brain aneurysm. Copyright © 2014 John Wiley & Sons, Ltd.

Engineering↗

Level set topology optimization of structural problems with interface cohesion

Summary This paper presents a finite element topology optimization framework for the design of two‐phase structural systems considering contact and cohesion phenomena along the interface. The geometry of the material interface is described by an explicit level set method, and the structural response is predicted by the extended finite element method. In this work, the interface condition is described by a bilinear cohesive zone model on the basis of the traction‐separation constitutive relation. The non‐penetration condition in the presence of compressive interface forces is enforced by a stabilized Lagrange multiplier method. The mechanical model assumes a linear elastic isotropic material, infinitesimal strain theory, and a quasi‐static response. The optimization problem is solved by a nonlinear programming method, and the design sensitivities are computed by the adjoint method. The performance of the presented method is evaluated by 2D and 3D numerical examples. The results obtained from topology optimization reveal distinct design characteristics for the various interface phenomena considered. In addition, 3D examples demonstrate optimal geometries that cannot be fully captured by reduced dimensionality. The optimization framework presented is limited to two‐phase structural systems where the material interface is coincident in the undeformed configuration, and to structural responses that remain valid considering small strain kinematics. Copyright © 2017 John Wiley & Sons, Ltd.

Behrou, Reza↗

A matrix-free approach for finite-strain hyperelastic problems using geometric multigrid

This paper investigates matrix-free algorithms for problems in quasi-static finite-strain hyperelasticity. Iterative solvers with matrix-free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix-free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. Furthermore, in order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. Additionally, the performance of the matrix-free operator and the geometric multigrid preconditioner is compared to the matrix-based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix-free methods for finite-strain solid mechanics are very promising, outperforming linear matrix-based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.

42 ENGINEERING↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

A robust interface finite element formulation for modeling brittle material failure problems

Abstract Failure of many brittle materials and structures can be modeled using interface‐oriented finite elements combined with intrinsic cohesive zone models. The discontinuous Galerkin (DG) finite element method provides an innovative framework for modeling brittle crack propagation with zero‐thickness interface elements, which can accommodate extrinsic cohesive laws to avoid the artificial compliance required in intrinsic cohesive models. However, robust formulations and implementations of DG methods are critical in alleviating the well‐known convergence issues for both crack nucleation and propagation with reduced instability. This paper presents a robust interface element formulation by modifying the incomplete interior penalty Galerkin (IIPG) method, which successfully avoids the initial element interface penetration across elements that occurs prior to crack nucleation, and thereby greatly reduces the instability issue as cracks open. We further verified and validated our implementation by using a bar tension test and a beam fracturing benchmark. The robustness of our proposed interface element method was demonstrated by a micromechanics fiber/matrix debonding problem with 64 fibers embedded in a bulk matrix.

Liu, Ruijie↗

Parity solution to the strong CP problem and a unified framework for inflation, baryogenesis, and dark matter

It has been known for some time that asymptotic parity invariance of weak interactions can provide a solution to the strong CP problem without the need for the axion. Left-right symmetric theories which employ a minimal Higgs sector consisting of a left-handed and a right-handed doublet is an example of such a theory wherein all fermion masses arise through a generalized seesaw mechanism. In this paper we present a way to understand the origin of matter-antimatter asymmetry as well as the dark matter content of the universe in these theories using the Affleck-Dine (AD) leptogenesis mechanism and inflaton decay, respectively. Three gauge singlet fermions are needed for this purpose, two of which help to implement the Dirac seesaw for neutrino masses while the third one becomes the non-thermal dark matter candidate. A soft lepton number breaking term involving the AD scalar field is used to generate lepton asymmetry which suffers no wash-out effects and maintains the Dirac nature of neutrinos. This framework thus provides a unified description of many of the unresolved puzzles of the standard model that require new physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Radiative Majorana neutrino masses in a parity solution to the strong CP problem

The strong CP problem is solved in Parity symmetric theories, with the electroweak gauge group containing SU(2) L × SU(2) R broken by the minimal set of Higgs fields. Neutrino masses may be explained by adding the same number of gauge singlet fermions as the number of generations. The neutrino masses vanish at tree-level and are only radiatively generated, leading to larger couplings of right-handed neutrinos to Standard Model particles than with the tree-level seesaw mechanism. We compute these radiative corrections and the mixing angles between left- and right-handed neutrinos. We discuss sensitivities to these right-handed neutrinos from a variety of future experiments that search for heavy neutral leptons with masses from tens of MeV to the multi-TeV scale.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cosmology as a weak gravitational field and the trans-Planckian problem

At momenta much higher than the Hubble scale, the cosmological expansion can be thought of as a weak gravitational field. We consider QFT in a particularly convenient set of coordinates that makes this manifest, so that, for those high momenta, the effects of the cosmological expansion can be dealt with using the standard tools of perturbation theory in Minkowski space. In this way, we re-derive standard results of QFT in a cosmological background, such as mode-stretching and gravitational particle production. We discuss the implications of our results for the trans-Planckian problem.

79 ASTRONOMY AND ASTROPHYSICS↗

Leptogenesis in parity solutions to the strong CP problem and Standard Model parameters

We study the simplest theories with exact spacetime parity that solve the strong CP problem and successfully generate the cosmological baryon asymmetry via decays of right-handed neutrinos. Lower bounds are derived for the masses of the right-handed neutrinos and for the scale of spontaneous parity breaking, v R . For generic thermal leptogenesis, v R ≳ 10 12 GeV, unless the small observed neutrino masses arise from fine-tuning. We compute v R in terms of the top quark mass, the QCD coupling, and the Higgs boson mass and find this bound is consistent with current data at 1σ. Future precision measurements of these parameters may provide support for the theory or, if v R is determined to be below 10 12 GeV, force modifications. However, modified cosmologies do not easily allow reductions in v R — no reduction is possible if leptogenesis occurs in the collisions of domain walls formed at parity breaking, and at most a factor 10 reduction is possible with non-thermal leptogenesis. Standard Model parameters that yield low values for v R can only be accommodated by having a high degree of degeneracy among the right-handed neutrinos involved in leptogenesis. If future precision measurements determine v R to be above 10 12 GeV, it is likely that higher-dimensional operators of the theory will yield a neutron electric dipole moment accessible to ongoing experiments. This is especially true in a simple UV completion of the neutrino sector, involving gauge singlet fermions, where the bound from successful leptogenesis is strengthened to v R ≳ 10 13 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

All loop scattering as a counting problem

Abstract This is the first in a series of papers presenting a new understanding of scattering amplitudes based on fundamentally combinatorial ideas in the kinematic space of the scattering data. We study the simplest theory of colored scalar particles with cubic interactions, at all loop orders and to all orders in the topological ’t Hooft expansion. We find novel integral formulas for the amplitudes of this theory, with no trace of the conventional sum over Feynman diagrams, but instead determined by a beautifully simple counting problem attached to any order of the topological expansion. These results represent a significant step forward in the decade-long quest to formulate the fundamental physics of the real world in a radically new language, where the rules of spacetime and quantum mechanics, as reflected in the principles of locality and unitarity, are seen to emerge from deeper mathematical structures.

1/N Expansion↗