Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Jacobi”

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 199 records · Page 11

Optimal Control Problems with Switching Points

The main idea of this report is to give an overview of the problems and difficulties that arise in solving optimal control problems with switching points. A brief discussion of existing optimality conditions is given and a numerical approach for solving the multipoint boundary value problems associated with the first-order necessary conditions of optimal control is presented. Two real-life aerospace optimization problems are treated explicitly. These are altitude maximization for a sounding rocket (Goddard Problem) in the presence of a dynamic pressure limit, and range maximization for a supersonic aircraft flying in the vertical, also in the presence of a dynamic pressure limit. In the second problem singular control appears along arcs with active dynamic pressure limit, which in the context of optimal control, represents a first-order state inequality constraint. An extension of the Generalized Legendre-Clebsch Condition to the case of singular control along state/control constrained arcs is presented and is applied to the aircraft range maximization problem stated above. A contribution to the field of Jacobi Necessary Conditions is made by giving a new proof for the non-optimality of conjugate paths in the Accessory Minimum Problem. Because of its simple and explicit character, the new proof may provide the basis for an extension of Jacobi's Necessary Condition to the case of the trajectories with interior point constraints. Finally, the result that touch points cannot occur for first-order state inequality constraints is extended to the case of vector valued control functions.

Seywald, Hans↗

A multigrid method for steady Euler equations on unstructured adaptive grids

A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.

Riemslagh, Kris↗

Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems

In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. We show that the uniform estimates for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not depending on the number of multigrid levels).

Bramble, James H.↗

Approximate optimal guidance for the advanced launch system

A real-time guidance scheme for the problem of maximizing the payload into orbit subject to the equations of motion for a rocket over a spherical, non-rotating earth is presented. An approximate optimal launch guidance law is developed based upon an asymptotic expansion of the Hamilton - Jacobi - Bellman or dynamic programming equation. The expansion is performed in terms of a small parameter, which is used to separate the dynamics of the problem into primary and perturbation dynamics. For the zeroth-order problem the small parameter is set to zero and a closed-form solution to the zeroth-order expansion term of Hamilton - Jacobi - Bellman equation is obtained. Higher-order terms of the expansion include the effects of the neglected perturbation dynamics. These higher-order terms are determined from the solution of first-order linear partial differential equations requiring only the evaluation of quadratures. This technique is preferred as a real-time, on-line guidance scheme to alternative numerical iterative optimization schemes because of the unreliable convergence properties of these iterative guidance schemes and because the quadratures needed for the approximate optimal guidance law can be performed rapidly and by parallel processing. Even if the approximate solution is not nearly optimal, when using this technique the zeroth-order solution always provides a path which satisfies the terminal constraints. Results for two-degree-of-freedom simulations are presented for the simplified problem of flight in the equatorial plane and compared to the guidance scheme generated by the shooting method which is an iterative second-order technique.

Feeley, T. S.↗

Robust Multigrid Smoothers for Three Dimensional Elliptic Equations with Strong Anisotropies

We discuss the behavior of several plane relaxation methods as multigrid smoothers for the solution of a discrete anisotropic elliptic model problem on cell-centered grids. The methods compared are plane Jacobi with damping, plane Jacobi with partial damping, plane Gauss-Seidel, plane zebra Gauss-Seidel, and line Gauss-Seidel. Based on numerical experiments and local mode analysis, we compare the smoothing factor of the different methods in the presence of strong anisotropies. A four-color Gauss-Seidel method is found to have the best numerical and architectural properties of the methods considered in the present work. Although alternating direction plane relaxation schemes are simpler and more robust than other approaches, they are not currently used in industrial and production codes because they require the solution of a two-dimensional problem for each plane in each direction. We verify the theoretical predictions of Thole and Trottenberg that an exact solution of each plane is not necessary and that a single two-dimensional multigrid cycle gives the same result as an exact solution, in much less execution time. Parallelization of the two-dimensional multigrid cycles, the kernel of the three-dimensional implicit solver, is also discussed. Alternating-plane smoothers are found to be highly efficient multigrid smoothers for anisotropic elliptic problems.

Llorente, Ignacio M.↗

High Order Discontinuous Gelerkin Methods for Convection Dominated Problems with Application to Aeroacoustics

This project is about the investigation of the development of the discontinuous Galerkin finite element methods, for general geometry and triangulations, for solving convection dominated problems, with applications to aeroacoustics. On the analysis side, we have studied the efficient and stable discontinuous Galerkin framework for small second derivative terms, for example in Navier-Stokes equations, and also for related equations such as the Hamilton-Jacobi equations. This is a truly local discontinuous formulation where derivatives are considered as new variables. On the applied side, we have implemented and tested the efficiency of different approaches numerically. Related issues in high order ENO and WENO finite difference methods and spectral methods have also been investigated. Jointly with Hu, we have presented a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the RungeKutta discontinuous Galerkin finite element method for solving conservation laws. The method has the flexibility of treating complicated geometry by using arbitrary triangulation, can achieve high order accuracy with a local, compact stencil, and are suited for efficient parallel implementation. One and two dimensional numerical examples are given to illustrate the capability of the method. Jointly with Hu, we have constructed third and fourth order WENO schemes on two dimensional unstructured meshes (triangles) in the finite volume formulation. The third order schemes are based on a combination of linear polynomials with nonlinear weights, and the fourth order schemes are based on combination of quadratic polynomials with nonlinear weights. We have addressed several difficult issues associated with high order WENO schemes on unstructured mesh, including the choice of linear and nonlinear weights, what to do with negative weights, etc. Numerical examples are shown to demonstrate the accuracies and robustness of the methods for shock calculations. Jointly with P. Montarnal, we have used a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition under the form epsilon = epsilon(sub 1) + epsilon(sub 2), where epsilon(sub 1) is associated with a simpler pressure law (gamma)-law in this paper) and the nonlinear deviation epsilon(sub 2) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the epsilon(sub l) gamma-law. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Shu, Chi-Wang↗

Reply to Comment by Cole-dai Et Al. on "Climatic Impact of the Long-lasting Laki Eruption: Inapplicability of Mass-independent Sulfur Isotope Composition Measurements"

Here we respond to the comments by Cole-Dai et al. [2014] on our article Schmidt et al. [2012]. Specifically, in response to section 2 of their reply, we argued in Schmidt et al. [2012] that based on previously published estimates of the volatile release height during the 1783-1784 C.E. Laki eruption, the lack of a sulfur massindependent fractionation (MIF) anomaly is expected. In other words, no previous study on Laki ever argued that this eruption emitted SO2 into altitudes >13-15 km. In section 2.3, Cole-Dai et al. [2014] argue that the nonzero Δ33S value of their Laki sample 1 may be explained by a short-lived explosive phase at Laki during which volatiles reached the stratosphere. In Schmidt et al. [2012] in section 2, we argued in agreement with Cole-Dai et al. [2014] (section 3.1) that for a MIF anomaly to be preserved, the Laki volatiles would have had to be emitted in >20 km altitude. Our main point is that eruption column heights >20 km are unlikely based on the historical accounts and plume-rise modeling for the Laki eruption [Stothers et al., 1986; Woods, 1993; Thordarson and Self, 2003]. In Schmidt et al. [2012], we argued that to deduce a short-lived climatic impact of the Laki eruption based on the lack of a MIF anomaly and the length of the sulfate deposition in Greenland ice cores may be misleading because the climatic impact will outlast the radiative forcing of the Laki aerosol cloud. Cole-Dai et al. [2014] acknowledge the latter in their reply in section 4.2. We agreewith Cole-Dai et al. [2014] in that themagnitude and length of the climatic impact during the winter of 1783-1784 depends on the altitude of the volatile release during the eruption (sections 2.3 and 4.2). However, even if we assumed that during Laki all sulfur dioxide (SO2) would have been released in the troposphere, then the aerosol cloud would still be present in the upper troposphere during March 1784, as is evident from independent model simulations of this "tropospheric-only" scenario [Stevenson et al., 2003]. We acknowledge that there is uncertainty on the volatile release height for Laki; however, it is worth considering that those climate model simulations that used an injection altitude between 9 km and 13 km for the Laki SO2 [Highwood and Stevenson, 2003; Oman et al., 2006a, 2006b; Schmidt et al., 2012] best match the observed temperature changes during summer of 1783 [Angell and Korshover, 1985; Brázdil et al., 2010; Briffa et al., 1998; D'Arrigo and Jacoby, 1999; Jacoby et al., 1999; Kington, 1988; Manley, 1974; Parker et al., 1992; Thordarson and Self, 2003]. Based on these model simulations, a climatic impact during the winter of 1783-1784, albeit weaker than during the climactic phases of Laki, is expected (and our argument here does not exclude the role of natural variability in contributing to the cold winter of 1783-1784 as discussed in Schmidt et al. [2012]). Therefore, we continue to argue that for high-latitude eruptions such as Laki, the applicability of sulfur isotopic measurements to interpret the climatic relevance has yet to be demonstrated. Itmay transpire that the interpretation of MIF signals for the climate-relevance of an eruption is valid and unambiguous only for short-lived explosive eruptions in the tropics. In terms of the processes producing a MIF anomaly (section 3.3 in Cole-Dai et al. [2014]), the works by Hattori et al. [2013] and Ono et al. [2013] suggest that there are remaining issues not discussed by Cole-Dai et al. [2014], for instance, self-shielding of SO2 due to high column densities typical for eruptions of Pinatubo-scale and greater, and the preservation of the MIF signature in general.

general circulation model↗

Lyapunov Orbits in the Jupiter System Using Electrodynamic Tethers

Various researchers have proposed the use of electrodynamic tethers for power generation and capture from interplanetary transfers. The effect of tether forces on periodic orbits in Jupiter-satellite systems are investigated. A perturbation force is added to the restricted three-body problem model and a series of simplifications allows development of a conservative system that retains the Jacobi integral. Expressions are developed to find modified locations of equilibrium positions. Modified families of Lyapunov orbits are generated as functions of tether size and Jacobi integral. Zero velocity curves and stability analyses are used to evaluate the dynamical properties of tether-modified orbits.

Cassini↗

Improved parallel solution techniques for the integral transport matrix method

Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution by up to {approx}50% when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing case are opticaUy thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block preconditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient preconditioner.

97 MATHEMATICS AND COMPUTING↗

Scalable parallel Newton-Krylov solvers for discontinuous Galerkin discretizations

We present techniques for implicit solution of discontinuous Galerkin discretizations of the Navier-Stokes equations on parallel computers. While a block-Jacobi method is simple and straight-forward to parallelize, its convergence properties are poor except for simple problems. Therefore, we consider Newton-GMRES methods preconditioned with block-incomplete LU factorizations, with optimized element orderings based on a minimum discarded fill (MDF) approach. We discuss the difficulties with the parallelization of these methods, but also show that with a simple domain decomposition approach, most of the advantages of the block-ILU over the block-Jacobi preconditioner are still retained. The convergence is further improved by incorporating the matrix connectivities into the mesh partitioning process, which aims at minimizing the errors introduced from separating the partitions. We demonstrate the performance of the schemes for realistic two- and three-dimensional flow problems.

97 MATHEMATICS AND COMPUTING↗

Stochastic Differential Games with Asymmetric Information

We investigate a two-player zero-sum stochastic differential game in which the players have an asymmetric information on the random payoff. We prove that the game has a value and characterize this value in terms of dual viscosity solutions of some second order Hamilton-Jacobi equation.

97 MATHEMATICS AND COMPUTING↗

Finite Time Merton Strategy under Drawdown Constraint: A Viscosity Solution Approach

We consider the optimal consumption-investment problem under the drawdown constraint, i.e. the wealth process never falls below a fixed fraction of its running maximum. We assume that the risky asset is driven by the constant coefficients Black and Scholes model and we consider a general class of utility functions. On an infinite time horizon, Elie and Touzi (Preprint, [2006]) provided the value function as well as the optimal consumption and investment strategy in explicit form. In a more realistic setting, we consider here an agent optimizing its consumption-investment strategy on a finite time horizon. The value function interprets as the unique discontinuous viscosity solution of its corresponding Hamilton-Jacobi-Bellman equation. This leads to a numerical approximation of the value function and allows for a comparison with the explicit solution in infinite horizon.

97 MATHEMATICS AND COMPUTING↗

On Aronsson Equation and Deterministic Optimal Control

When Hamiltonians are nonsmooth, we define viscosity solutions of the Aronsson equation and prove that value functions of the corresponding deterministic optimal control problems are solutions if they are bilateral viscosity solutions of the Hamilton-Jacobi-Bellman equation. We characterize such a property in several ways, in particular it follows that a value function which is an absolute minimizer is a bilateral viscosity solution of the HJB equation and these two properties are often equivalent. We also determine that bilateral solutions of HJB equations are unique among absolute minimizers with prescribed boundary conditions.

97 MATHEMATICS AND COMPUTING↗

Stochastic Optimal Control and Linear Programming Approach

We study a classical stochastic optimal control problem with constraints and discounted payoff in an infinite horizon setting. The main result of the present paper lies in the fact that this optimal control problem is shown to have the same value as a linear optimization problem stated on some appropriate space of probability measures. This enables one to derive a dual formulation that appears to be strongly connected to the notion of (viscosity sub) solution to a suitable Hamilton-Jacobi-Bellman equation. We also discuss relation with long-time average problems.

97 MATHEMATICS AND COMPUTING↗

Risk Sensitive Control of Diffusions with Small Running Cost

Infinite horizon risk-sensitive control of diffusions is analyzed under a stability condition coupled with a bound on the running cost. It is shown that the corresponding Hamilton-Jacobi-Bellman equation has a solution (w( Dot-Operator ),{lambda}{sup Asterisk-Operator }) where the scalar {lambda}{sup Asterisk-Operator} is in fact the optimal cost. This also leads to an existence result for optimal controls.

97 MATHEMATICS AND COMPUTING↗

Linearization Techniques for Controlled Piecewise Deterministic Markov Processes; Application to Zubov's Method

We aim at characterizing domains of attraction for controlled piecewise deterministic processes using an occupational measure formulation and Zubov's approach. Firstly, we provide linear programming (primal and dual) formulations of discounted, infinite horizon control problems for PDMPs. These formulations involve an infinite-dimensional set of probability measures and are obtained using viscosity solutions theory. Secondly, these tools allow to construct stabilizing measures and to avoid the assumption of stability under concatenation for controls. The domain of controllability is then characterized as some level set of a convenient solution of the associated Hamilton-Jacobi integral-differential equation. The theoretical results are applied to PDMPs associated to stochastic gene networks. Explicit computations are given for Cook's model for gene expression.

97 MATHEMATICS AND COMPUTING↗

Large Deviations and Importance Sampling for Systems of Slow-Fast Motion

In this paper we develop the large deviations principle and a rigorous mathematical framework for asymptotically efficient importance sampling schemes for general, fully dependent systems of stochastic differential equations of slow and fast motion with small noise in the slow component. We assume periodicity with respect to the fast component. Depending on the interaction of the fast scale with the smallness of the noise, we get different behavior. We examine how one range of interaction differs from the other one both for the large deviations and for the importance sampling. We use the large deviations results to identify asymptotically optimal importance sampling schemes in each case. Standard Monte Carlo schemes perform poorly in the small noise limit. In the presence of multiscale aspects one faces additional difficulties and straightforward adaptation of importance sampling schemes for standard small noise diffusions will not produce efficient schemes. It turns out that one has to consider the so called cell problem from the homogenization theory for Hamilton-Jacobi-Bellman equations in order to guarantee asymptotic optimality. We use stochastic control arguments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Viscosity Solutions of Systems of PDEs with Interconnected Obstacles and Switching Problem

This paper deals with existence and uniqueness of a solution in viscosity sense, for a system of m variational partial differential inequalities with inter-connected obstacles. A particular case is the Hamilton-Jacobi-Bellmann system of the Markovian stochastic optimal m-states switching problem. The switching cost functions depend on (t,x). The main tool is the notion of systems of reflected backward stochastic differential equations with oblique reflection.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗