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 649 records · Page 36

Fully discrete schemes for monotone optimal control problems

In this article, we study an infinite horizon optimal control problem with monotone controls. We analyze the associated Hamilton–Jacobi–Bellman (HJB) variational inequality which characterizes the value function and consider the totally discretized problem using Lagrange elements to approximate the state space Ω. The convergence orders of these approximations are proved, which are in general (h+(k/(√h))){sup γ} where γ is the Hölder constant of the value function u, h and k are the time and space discretization parameters, respectively. A special election of the relations between h and k allows to obtain a convergence of order k{sup (2/3)γ}, which is valid without semiconcavity hypotheses over the problem’s data.

97 MATHEMATICS AND COMPUTING↗

Smoothing by cubic spline modified applied to solve inverse thermal problem

This paper presents an alternative to cubic spline regularization and its weighted form applied in solving inverse thermal problems. The inverse heat transfer problems are classified as ill-posed, that is, the solution may become unstable, mainly because they are sensitive to random errors deriving from the input data, necessitating a regularization method to soften these effects. The smoothing technique proposed by cubic spline regularization ensures that the global data tend to be more stable, with fewer data oscillations and dependent on a single arbitrary parameter input. It also shows that the weighted cubic spline is able to enhance filter action. The methods have been implemented in order for the search engine to optimize the choice of parameters and weight and, thus, the smoothing gains more flexibility and accuracy. The simulated and experimental tests confirm that the techniques are effective in reducing the amplified noise by inverse thermal problem presented.

97 MATHEMATICS AND COMPUTING↗

Explicit solution for a two-phase fractional Stefan problem with a heat flux condition at the fixed face

A generalized Neumann solution for the two-phase fractional Lamé–Clapeyron–Stefan problem for a semi-infinite material with constant initial temperature and a particular heat flux condition at the fixed face is obtained, when a restriction on data is satisfied. The fractional derivative in the Caputo sense of order α∈(0,1) respect on the temporal variable is considered in two governing heat equations and in one of the conditions for the free boundary. Furthermore, we find a relationship between this fractional free boundary problem and another one with a constant temperature condition at the fixed face and based on that fact, we obtain an inequality for the coefficient which characterizes the fractional phase–change interface obtained in Roscani and Tarzia (Adv Math Sci Appl 24(2):237–249, 2014). We also recover the restriction on data and the classical Neumann solution, through the error function, for the classical two-phase Lamé–Clapeyron–Stefan problem for the case α=1.

97 MATHEMATICS AND COMPUTING↗

Control of Fractional Diffusion Problems via Dynamic Programming Equations

In this study, we explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach.

97 MATHEMATICS AND COMPUTING↗

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

Rapid, wide-scale deployment of green process systems, such as carbon capture or water desalination systems, is essential for combatting climate change. Methods relying on traditional design or modularity fail to capture the benefits of both economies of numbers and economies of scale. We have proposed process family design, which designs a family of processes simultaneously exploiting opportunities for common elements. In previous work, we explored different optimization formulations to solve this problem. In this work, we develop a decomposition approach to tackle larger problems efficiently. We solve a water desalination case study, which is too large to solve within a reasonable timeframe with the discretization formulation. We exploit the block angular structure of the discretization problem to decompose and solve using Progressive Hedging (PH). We use the open-source Python package mpi-sppy to execute PH which allows us to leverage parallelization and a HPC cluster to further improve solution time.

Stinchfield, Georgia↗

Characterizing the impact of model error in hydrologic time series recovery inverse problems

Hydrologic models are commonly over-smoothed relative to reality, owing to computational limitations and to the difficulty of obtaining accurate high-resolution information. When used in an inversion context, such models may introduce systematic biases which cannot be encapsulated by an unbiased “observation noise” term of the type assumed by standard regularization theory and typical Bayesian formulations. Despite its importance, model error is difficult to encapsulate systematically and is often neglected. In this paper, model error is considered for an important class of inverse problems that includes interpretation of hydraulic transients and contaminant source history inference: reconstruction of a time series that has been convolved against a transfer function (i.e., impulse response) that is only approximately known. Using established harmonic theory along with two results established here regarding triangular Toeplitz matrices, upper and lower error bounds are derived for the effect of systematic model error on time series recovery for both well-determined and over-determined inverse problems. It is seen that use of additional measurement locations does not improve expected performance in the face of model error. A Monte Carlo study of a realistic hydraulic reconstruction problem is presented, and the lower error bound is seen informative about expected behavior. Finally, a possible diagnostic criterion for blind transfer function characterization is also uncovered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multigrid solution of a distributed optimal control problem constrained by the Stokes equations

We construct multigrid preconditioners to accelerate the solution process of a linear-quadratic optimal control problem constrained by the Stokes system. The first order optimality conditions of the control problem form a linear system (the KKT system) connecting the state, adjoint, and control variables. Our approach is to eliminate the state and adjoint variables by essentially solving two Stokes systems, and to construct efficient multigrid preconditioners for the Schur-complement of the block associated with the state and adjoint variables. These multigrid preconditioners are shown to be of optimal order with respect to the convergence properties of the discrete methods used to solve the Stokes system. In particular, the number of conjugate gradient iterations is shown to decrease as the resolution increases, a feature shared by similar multigrid preconditioners for elliptic constrained optimal control problems.

97 MATHEMATICS AND COMPUTING↗

Creation of problem-dependent Doppler-broadened cross sections in the KENO Monte Carlo code

In this paper, we introduce a quick method for improving the accuracy of Monte Carlo simulations by generating one- and two-dimensional cross sections at a user-defined temperature before performing transport calculations. A finite difference method is used to Doppler-broaden cross sections to the desired temperature, and unit-base interpolation is done to generate the probability distributions for double differential two-dimensional thermal moderator cross sections at any arbitrarily user-defined temperature. The accuracy of these methods is tested using a variety of contrived problems. In addition, various benchmarks at elevated temperatures are modeled, and results are compared with benchmark results. Lastly, the problem-dependent cross sections are observed to produce eigenvalue estimates that are closer to the benchmark results than those without the problem-dependent cross sections.

42 ENGINEERING↗

An exactly solvable deformation of the Coulomb problem associated with the Taub–NUT metric

In this paper we quantize the N-dimensional classical Hamiltonian system H=(|q|)/(2(η+|q|)) p{sup 2}−k/(η+|q|) , that can be regarded as a deformation of the Coulomb problem with coupling constant k, that it is smoothly recovered in the limit η→0. Moreover, the kinetic energy term in H is just the one corresponding to an N-dimensional Taub–NUT space, a fact that makes this system relevant from a geometric viewpoint. Since the Hamiltonian H is known to be maximally superintegrable, we propose a quantization prescription that preserves such superintegrability in the quantum mechanical setting. We show that, to this end, one must choose as the kinetic part of the Hamiltonian the conformal Laplacian of the underlying Riemannian manifold, which combines the usual Laplace–Beltrami operator on the Taub–NUT manifold and a multiple of its scalar curvature. As a consequence, we obtain a novel exactly solvable deformation of the quantum Coulomb problem, whose spectrum is computed in closed form for positive values of η and k, and showing that the well-known maximal degeneracy of the flat system is preserved in the deformed case. Several interesting algebraic and physical features of this new exactly solvable quantum system are analyzed, and the quantization problem for negative values of η and/or k is also sketched.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗

Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems

A goal-oriented analysis of linear, stochastic advection–diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem.

97 MATHEMATICS AND COMPUTING↗

An asymptotically compatible meshfree quadrature rule for nonlocal problems with applications to peridynamics

In this paper, we present a meshfree quadrature rule for compactly supported nonlocal integro-differential equations (IDEs) with radial kernels. We apply this rule to develop a meshfree discretization of a peridynamic solid mechanics model that requires no background mesh. Existing discretizations of peridynamic models have been shown to exhibit a lack of asymptotic compatibility to the corresponding linearly elastic local solution. By posing the quadrature rule as an equality constrained least squares problem, we obtain asymptotically compatible convergence by introducing polynomial reproduction constraints. Our approach naturally handles traction-free conditions, surface effects, and damage modeling for both static and dynamic problems. We demonstrate high-order convergence to the local theory by comparing to manufactured solutions and to cases with crack singularities for which an analytic solution is available. We verify the applicability of the approach to realistic problems by reproducing high-velocity impact results from the Kalthoff–Winkler experiments.

42 ENGINEERING↗

Time-periodic steady-state solution of fluid-structure interaction and cardiac flow problems through multigrid-reduction-in-time

In this study, a time-periodic MGRIT algorithm is proposed as a means to reduce the time-to-solution of numerical algorithms by exploiting the time periodicity inherent to many applications in science and engineering. The time-periodic MGRIT algorithm is applied to a variety of linear and nonlinear single- and multiphysics problems that are periodic-in-time. It is demonstrated that the proposed parallel-in-time algorithm can obtain the same time-periodic steady-state solution as sequential time-stepping. It is shown that the required number of MGRIT iterations can be estimated a priori and that the new MGRIT variant can significantly and consistently reduce the time-to-solution compared to sequential time-stepping, irrespective of the number of dimensions, linear or nonlinear PDE models, single-physics or coupled problems and the employed computing resources. The numerical experiments demonstrate that the time-periodic MGRIT algorithm enables a greater level of parallelism yielding faster turnaround, and thus, facilitating more complex and more realistic problems to be solved.

97 MATHEMATICS AND COMPUTING↗

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗

Fast meta-solvers for 3D complex-shape scatterers using neural operators trained on a non-scattering problem

Three-dimensional target identification using scattering techniques requires high accuracy solutions and very fast computations for real-time predictions in some critical applications. We first train a deep neural operator (DeepONet) to solve wave propagation problems described by the Helmholtz equation in a domain without scatterers but at different wavenumbers and with a complex absorbing boundary condition. We then design two classes of fast meta-solvers by combining DeepONet with either relaxation methods, such as Jacobi and Gauss-Seidel, or with Krylov methods, such as GMRES and BiCGStab, using the trunk basis of DeepONet as a coarse-scale preconditioner. We leverage the spectral bias of neural networks to account for the lower part of the spectrum in the error distribution while the upper part is handled inexpensively using relaxation methods or fine-scale preconditioners. The meta-solvers are then applied to solve scattering problems with different shape of scatterers, at no extra training cost. We first demonstrate that the resulting meta-solvers are shape-agnostic, fast, and robust, whereas the standard standalone solvers may even fail to converge without the DeepONet. We then apply both classes of meta-solvers to scattering from a submarine, a complex three-dimensional problem. We achieve very fast solutions, especially with the DeepONet-Krylov methods, which require orders of magnitude fewer iterations than any of the standalone solvers.

97 MATHEMATICS AND COMPUTING↗

Applications of the Dulmage–Mendelsohn decomposition for debugging nonlinear optimization problems

Nonlinear modeling and optimization is a valuable tool for aiding decisions by engineering practitioners, but programming an optimization problem based on a complex electrical, mechanical, or chemical process is a time-consuming and error-prone activity. Therefore, there is a need for model analysis and debugging tools that can detect and diagnose modeling errors. One such tool is the Dulmage–Mendelsohn decomposition, which identifies structurally under- and over-determined subsets in systems of equations and variables by partitioning the bipartite graph of the system. This work provides the necessary background to understand the Dulmage–Mendelsohn decomposition and its application to the analysis of nonlinear optimization problems, demonstrates its use in diagnosing a variety of modeling errors, and introduces software implementations for analyzing nonlinear optimization problems in the Pyomo and JuMP algebraic modeling languages.

42 ENGINEERING↗

Assessment of the hydromechanical higher-order MPM for the simulation of geotechnical problems

The Material Point Method (MPM) has been increasingly used to simulate large strain deformations. Linear interpolation functions are commonly used to perform the spatial integration. It is well-known that the discontinuities in the interpolation function derivatives induce shock-like artifacts known as ‘cell-crossing’ error. These errors compound with volumetric locking errors when used with hydromechanical formulations for porous media, where different velocity fields are used for each phase. The capabilities of higher-order MPM frameworks have not been explored for real-scale geotechnical problems. As such, this paper aims to assess, validate, and further discuss a higher-order B-spline MPM (BS-MPM) framework. First, the BS-MPM framework is verified against the large-strain oedometer consolidation problem. Second, the framework is validated against a real-scale slope failure experiment triggered by pore water pressure recharge. Landslide features that are captured using the higher-order framework are specifically highlighted, and results (e.g., pore water pressure and deformation) are validated with field measurements. A generally convergent numerical solution is observed when using cubic interpolation functions. Third, a footing penetration problem is simulated using the multi-patch BS-MPM. Trends are examined with respect to penetration velocity and variation in hydraulic conductivity. The BS-MPM framework ultimately presents a stabilized numerical solution that captures plausible hydromechanical interaction trends important in geotechnical engineering applications.

36 MATERIALS SCIENCE↗