Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Maximum principle”

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 127 records · Page 7

Bound-preserving discontinuous Galerkin methods for conservative phase space advection in curvilinear coordinates

In this study, we extend the positivity-preserving method of Zhang & Shu to simulate the advection of neutral particles in phase space using curvilinear coordinates. The ability to utilize these coordinates is important for non-equilibrium transport problems in general relativity and also in science and engineering applications with specific geometries. The method achieves high-order accuracy using Discontinuous Galerkin (DG) discretization of phase space and strong stability-preserving, Runge-Kutta (SSP-RK) time integration. Special care in taken to ensure that the method preserves strict bounds for the phase space distribution function $f$; i.e., $f\in[0,1]$. The combination of suitable CFL conditions and the use of the high-order limiter proposed in Zhang & Shu (2010) is sufficient to ensure positivity of the distribution function. However, to ensure that the distribution function satisfies the upper bound, the discretization must, in addition, preserve the divergence-free property of the phase space flow. Proofs that highlight the necessary conditions are presented for general curvilinear coordinates, and the details of these conditions are worked out for some commonly used coordinate systems (i.e., spherical polar spatial coordinates in spherical symmetry and cylindrical spatial coordinates in axial symmetry, both with spherical momentum coordinates). Results from numerical experiments --- including one example in spherical symmetry adopting the Schwarzschild metric --- demonstrate that the method achieves high-order accuracy and that the distribution function satisfies the maximum principle.

97 MATHEMATICS AND COMPUTING↗

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗

Assimilating partial observation to enhance feedback control of stochastic dynamical systems

Here, in this paper, we present a novel methodology to tackle feedback optimal control problems in scenarios where the exact state of the controlled process is unknown. It integrates data assimilation techniques and optimal control solvers to manage partial observation of the state process, a common occurrence in practical scenarios. Traditional stochastic optimal control methods assume full state observation, which is often not feasible in real-world fluid dynamics control problems. Our approach underscores the significance of utilizing observational data to inform control policy design. Specifically, we introduce a kernel learning backward stochastic differential equation (SDE) filter to enhance data assimilation efficiency and propose a sample-wise stochastic optimization method within the stochastic maximum principle framework. We demonstrate the efficacy and accuracy of our method in the control of advection-diffusion-reaction flow problem and the Dubins airplane maneuvering problem with model uncertainty.

data driven↗

A Stochastic Gradient Descent Approach for Stochastic Optimal Control

In this work, we introduce a stochastic gradient descent approach to solve the stochastic optimal control problem through stochastic maximum principle. The motivation that drives our method is the gradient of the cost functional in the stochastic optimal control problem is under expectation, and numerical calculation of such an expectation requires fully computation of a system of forward backward stochastic differential equations, which is computationally expensive. By evaluating the expectation with single-sample representation as suggested by the stochastic gradient descent type optimisation, we could save computational efforts in solving FBSDEs and only focus on the optimisation task which aims to determine the optimal control process.

97 MATHEMATICS AND COMPUTING↗

A conservative nonlocal convection–diffusion model and asymptotically compatible finite difference discretization

Here in this paper, we first propose a nonlocal convection–diffusion model, in which the convection term is constructed in a special upwind manner so that mass conservation and maximum principle are maintained in any space dimension. The well-posedness of the proposed nonlocal model and its convergence to the classical local convection–diffusion model are established. A quadrature-based finite difference discretization is then developed to numerically solve the nonlocal problem and it is shown to be consistent and unconditionally stable. We further demonstrate that the numerical scheme is asymptotically compatible, that is, the approximate solutions converge to the exact solution of the corresponding local problem when δ → 0 and h → 0. Numerical experiments are also performed to complement the theoretical analysis.

42 ENGINEERING↗

Matrix-free subcell residual distribution for Bernstein finite element discretizations of linear advection equations

In this work, we introduce a new residual distribution (RD) framework for the design of bound-preserving high-resolution finite element schemes. The continuous and discontinuous Galerkin discretizations of the linear advection equation are modified to construct local extremum diminishing (LED) approximations. To that end, we perform mass lumping and redistribute the element residuals in a manner which guarantees the LED property. The hierarchical correction procedure for high-order Bernstein finite element discretizations involves localization to subcells and definition of bound-preserving weights for subcell contributions. Using strong stability preserving (SSP) Runge–Kutta methods for time integration, we prove the validity of discrete maximum principles under CFL-like time step restrictions. The low-order version of our method has roughly the same accuracy as the one derived from a piecewise (multi)-linear approximation on a submesh with the same nodal points. In high-order extensions, we use an element-based flux-corrected transport (FCT) algorithm which can be interpreted as a nonlinear RD scheme. The proposed LED corrections are tailor-made for matrix-free implementations which avoid the rapidly growing cost of matrix assembly for high-order Bernstein elements. The results for 1D, 2D, and 3D test problems compare favorably to those obtained with the best matrix-based approaches.

97 MATHEMATICS AND COMPUTING↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗

Sequential limiting in continuous and discontinuous Galerkin methods for the Euler equations

We present a new predictor-corrector approach to enforcing local maximum principles in piecewise-linear finite element schemes for the compressible Euler equations. The new element-based limiting strategy is suitable for continuous and discontinuous Galerkin methods alike. In contrast to synchronized limiting techniques for systems of conservation laws, we constrain the density, momentum, and total energy in a sequential manner which guarantees positivity preservation for the pressure and internal energy. After the density limiting step, the total energy and momentum gradients are adjusted to incorporate the irreversible effect of density changes. Antidiffusive corrections to bounds-compatible low-order approximations are limited to satisfy inequality constraints for the specific total and kinetic energy. An accuracy-preserving smoothness indicator is introduced to gradually adjust lower bounds for the element-based correction factors. The employed smoothness criterion is based on a Hessian determinant test for the density. Finally, a numerical study is performed for test problems with smooth and discontinuous solutions.

97 MATHEMATICS AND COMPUTING↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Entropy production rate in a flux-driven self-organizing system

Entropy production rate (EPR) is often effective to describe how a structure is self-organized in a nonequilibrium thermodynamic system. The 'minimum EPR principle' is widely applicable to characterizing self-organized structures, but is sometimes disproved by observations of 'maximum EPR states'. Here we delineate a dual relation between the minimum and maximum principles; the mathematical representation of the duality is given by a Legendre transformation. For explicit formulation, we consider heat transport in the boundary layer of fusion plasma [Z. Yoshida and S. M. Mahajan, Phys. Plasmas 15, 032307 (2008)]. The mechanism of bifurcation and hysteresis (which are the determining characteristics of the so-called H-mode, a self-organized state of reduced thermal conduction) is explained by multiple tangent lines to a pleated graph of an appropriate thermodynamic potential. In the nonlinear regime, we have to generalize Onsager's dissipation function. The generalized function is no longer equivalent to EPR; then EPR ceases to be the determinant of the operating point, and may take either minimum or maximum values depending on how the system is driven.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Chapter 1 briefly reviews several related topics associated with the symmetrization of systems of conservation laws and quasi-conservation laws: (1) Basic Entropy Symmetrization Theory; (2) Symmetrization and eigenvector scaling; (3) Symmetrization of the compressible Navier-Stokes equations; and (4) Symmetrization of the quasi-conservative form of the magnetohydrodynamic (MHD) equations. Chapter 2 describes one of the best known tools employed in the study of differential equations, the maximum principle: any function f(x) which satisfies the inequality f(double prime)>0 on the interval [a,b] attains its maximum value at one of the endpoints on the interval. Chapter three examines the upwind finite volume schemes for scalar and system conservation laws. The basic tasks in the upwind finite volume approach have already been presented: reconstruction, flux evaluation, and evolution. By far, the most difficult task in this process is the reconstruction step.

Bart, Timothy J.↗

Optimal cruise trajectories for supersonic airplanes

Equations are derived for maximizing range for specified initial and final values of mass and altitude. Constant-velocity flight is assumed, and normal acceleration is neglected. The problem is solved by using the maximum principle. Optimal trajectories are obtained and uniqueness is demonstrated. Results are obtained for a supersonic airplane. Curves are presented which can be used to obtain the optimal trajectory and maximum range for a range of initial and final mass and altitude. The optimal range is compared to the range obtained by using the standard cruise trajectory profile (consisting of a Bereguet cruise plus maximum- and minimum-thrust connecting segments) and to the range obtained at constant-altitude cruise.

Teren, F.↗

Optimal reusable-tug and expendable-kickstage trajectories for high-energy planetary missions including correction for nodal precession

Equations are derived by using branched trajectory optimization techniques and the maximum principle to maximize the payload capability of a reusable tug/expendable kickstage vehicle configuration for planetary missions. The two stages and the payload are launched into a low earth orbit by a single space shuttle. The analysis includes correction for precession of the orbit. This correction is done by the tug. The tug propels the payload and the kickstage to an energy beyond earth escape and returns within a specified time to the precessed orbit. After separating from the tug, the kickstage accelerates the payload to the required injection conditions. Planetary injection conditions are specified by the mission energy and a fixed declination and right ascension of the outgoing asymptote. The multipoint boundary value problem resulting from the analysis is solved by a Newton-Raphson iteration technique. Partial derivatives of the boundary conditions are obtained by perturbing the initial conditions one at a time, integrating the trajectory and adjoint equations, and observing the changes in boundary conditions. Maximum payload capability is derived for two typical mission energies. In addition, the variations of several mission and stage parameters are also examined.

Borsody, J.↗

Mechanism of formation of wiggly compaction bands in porous sandstone: 2. Numerical simulation using discrete element method

Wiggly compaction bands in porous aeolian s andstone vary from chevron shape to wavy shape to nearly straight. In some outcrops these variations occur along a single band. Here, a bonded close-packed discrete element model is used to investigate what mechanical properties control the formation of wiggly compaction bands (CBs). To simulate the volumetric yielding failure of porous sandstone, a discrete element shrinks when the force state of one of its bonds reaches the yielding cap defined by the failure force and the aspect ratio (k) of the yielding ellipse. A Matlab code “MatDEM 3D ” has been developed on the basis of this enhanced discrete element method. Mechanical parameters of elements are chosen according to the elastic properties and the strengths of porous sandstone. In numerical simulations, the failure angle between the band segment and maximum principle stress decreases from 90° to approximately 45° as k increases from 0.5 to 2, and compaction bands vary from straight to chevron shape. With increasing strain, subsequent compaction occurs inside or beside compacted elements, which leads to further compaction and thickening of bands. The simulations indicate that a greater yielding stress promotes chevron CBs, and a greater cement strength promotes straight CBs. Combined with the microscopic analysis introduced in the companion paper, we conclude that the shape of wiggly CBs is controlled by the mechanical properties of sandstone, including the aspect ratio of the yielding ellipse, the cri tical yielding stress, and the cement strength, w hich are d etermined primarily by petrophysical attributes, e.g., grain sorting, porosity, and cementation.

58 GEOSCIENCES↗

Optimal Compensation with Hidden Action and Lump-Sum Payment in a Continuous-Time Model

We consider a problem of finding optimal contracts in continuous time, when the agent's actions are unobservable by the principal, who pays the agent with a one-time payoff at the end of the contract. We fully solve the case of quadratic cost and separable utility, for general utility functions. The optimal contract is, in general, a nonlinear function of the final outcome only, while in the previously solved cases, for exponential and linear utility functions, the optimal contract is linear in the final output value. In a specific example we compute, the first-best principal's utility is infinite, while it becomes finite with hidden action, which is increasing in value of the output. In the second part of the paper we formulate a general mathematical theory for the problem. We apply the stochastic maximum principle to give necessary conditions for optimal contracts. Sufficient conditions are hard to establish, but we suggest a way to check sufficiency using non-convex optimization.

97 MATHEMATICS AND COMPUTING↗