Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Jacobi Method”

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 55 records · Page 3

Optimal Low-Thrust Limited-Power Transfers between Arbitrary Elliptic Coplanar Orbits

In this work, a complete first order analytical solution, which includes the short periodic terms, for the problem of optimal low-thrust limited-power transfers between arbitrary elliptic coplanar orbits in a Newtonian central gravity field is obtained through Hamilton-Jacobi theory and a perturbation method based on Lie series.

daSilvaFernandes, Sandro↗

Notes on the restricted three body problem- approximate behavior of solutions near the collinear lagrangian points

Studies the solutions of the restricted three-body problem near those equilibrium points which are collinear with the two positive masses. This is done to gain insight toward the development of an analytic proof and classification of the periodic orbits that pass near these equilibrium points, which have been discovered numerically by M. Davidson, and also to hopefully gain insight into the nature of solutions of the restricted three-body problem in general. The qualitative observations that are made are all deduced from the linearized equations.

Approximation method↗

Matched asymptotic expansion of the Hamilton-Jacobi-Bellman equation for aeroassisted plane-change maneuvers

In this paper we develop a general procedure for constructing a matched asymptotic expansion of the Hamilton-Jacobi-Bellman equation based on the method of characteristics. The development is for a class of perturbation problems whose solution exhibits two-time-scale behavior. A regular expansion for problems of this type is inappropriate since it is not uniformly valid over a narrow range of the independent variable. Of particular interest here is the manner in which matching and boundary conditions are enforced when the expansion is carried out to first order. Two cases are distinguished - one where the left boundary condition coincides with or lies to the right of the singular region and one where the left boundary condition lies to the left of the singular region. A simple example is used to illustrate the procedure, and its potential application to aeroassisted plane change is described.

Calise, Anthony J.↗

Guidance law development for aeroassisted transfer vehicles using matched asymptotic expansions

This report addresses and clarifies a number of issues related to the Matched Asymptotic Expansion (MAE) analysis of skip trajectories, or any class of problems that give rise to inner layers that are not associated directly with satisfying boundary conditions. The procedure for matching inner and outer solutions, and using the composite solution to satisfy boundary conditions is developed and rigorously followed to obtain a set of algebraic equations for the problem of inclination change with minimum energy loss. A detailed evaluation of the zeroth order guidance algorithm for aeroassisted orbit transfer is performed. It is shown that by exploiting the structure of the MAE solution procedure, the original problem, which requires the solution of a set of 20 implicit algebraic equations, can be reduced to a problem of 6 implicit equations in 6 unknowns. A solution that is near optimal, requires a minimum of computation, and thus can be implemented in real time and on-board the vehicle, has been obtained. Guidance law implementation entails treating the current state as a new initial state and repetitively solving the zeroth order MAE problem to obtain the feedback controls. Finally, a general procedure is developed for constructing a MAE solution up to first order, of the Hamilton-Jacobi-Bellman equation based on the method of characteristics. The development is valid for a class of perturbation problems whose solution exhibits two-time-scale behavior. A regular expansion for problems of this type is shown to be inappropriate since it is not valid over a narrow range of the independent variable. That is, it is not uniformly valid. Of particular interest here is the manner in which matching and boundary conditions are enforced when the expansion is carried out to first order. Two cases are distinguished-one where the left boundary condition coincides with, or lies to the right of, the singular region, and another one where the left boundary condition lies to the left of the singular region. A simple example is used to illustrate the procedure where the obtained solution is uniformly valid to O(Epsilon(exp 2)). The potential application of this procedure to aeroassisted plane change is also described and partially evaluated.

Calise, Anthony J.↗

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗

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↗

On the efficient computation of Fraunhofer and Fresnel region fields radiated by reflector and planar-aperture antennas

Computation of fields radiated by parabolic reflectors and planar apertures is a problem of prime importance, and conventional approaches to performing these computations are often very time-consuming. The paper demonstrates the usefulness of a series expansion technique for efficient computation of radiated fields in both the Fraunhofer and Fresnel regions. The series approach is based on the use of the Jacobi polynomials. The application of the series method to determining the far-field pattern of the antenna from the near-field measurements for an arbitrary aperture antenna is also discussed.

Mittra, R.↗

Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models

We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the "actual" state space instead of the "potential" state space.

Buchholz, Peter↗

Fronts propagating with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations

New numerical algorithms are devised (PSC algorithms) for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be used also for more general Hamilton-Jacobi-type problems. The algorithms are demonstrated by computing the solution to a variety of surface motion problems.

Osher, Stanley↗

Numerical simulation of boundary-layer transition

The transition to turbulence in boundary layers was investigated by direct numerical solution of the nonlinear, three-dimensional, incompressible Navier-Stokes equations in the half-infinite domain over a flat plate. Periodicity was imposed in the streamwise and spanwise directions. A body force was applied to approximate the effect of a nonparallel mean flow. The numerical method was spectra, based on Fourier series and Jacobi polynomials, and used divergence-free basis functions. Extremely rapid convergence was obtained when solving the linear Orr-Sommerfeld equation. The early nonlinear and three-dimensional stages of transition, in a boundary layer disturbed by a vibrating ribbon, were successfully simulated. Excellent qualitative agreement was observed with either experiments or weakly nonlinear theories. In particular, the breakdown pattern was staggered or nonstaggered depending on the disturbance amplitude.

Spalart, P. R.↗

Nonlinear longitudinal control of a supermaneuverable aircraft

A technique is described which can be used for design of feedback controllers for high-performance aircraft operating in flight conditions in which nonlinearities significantly affect performance. Designs are performed on a mathematical model of the longitudinal dynamics of a hypothetical aircraft similar to proposed supermaneuverable flight test vehicles. Nonlinear controller designs are performed using truncated solutions of the Hamilton-Jacobi-Bellman equation. Preliminary results show that the method yields promising results.

Garrard, William L.↗

Problems in fluid dynamics

A scheme was developed for the parametric differentiation and integration of gas dynamics equations. A numerical integration of the gas dynamics equations is necessarily performed for a specific set of parameter values. The linear variational equations are obtained by differentiating the exact equations with respect to each of the relevant parameters. The resulting matrix of flow quantities is referred to as the Jacobi matrix. The subsequent procedure is then straightforward. The method was tested for two dimensional supersonic flow past an airfoil, with airfoil thickness, camber, and angle of attack varied. This approach has great potential value for rapidly assessing the effect of design changes. The other focus of the work was on problems in fluid stability, bifurcations, and turbulence.

Sirovich, Lawrence↗

Variable-Position Acoustic Levitation

Method of acoustic levitation supports objects at positions other than acoustic nodes. Acoustic force is varied so it balances gravitational (or other) force, thereby maintaining object at any position within equilibrium range. Levitation method applicable to containerless processing. Such objects as table-tennis balls, hollow plastic spheres, and balsa-wood spheres levitated in laboratory by new method.

Barmatz, M. B.↗

Robust Maneuvering Envelope Estimation Based on Reachability Analysis in an Optimal Control Formulation

This paper discusses an algorithm for estimating the safe maneuvering envelope of damaged aircraft. The algorithm performs a robust reachability analysis through an optimal control formulation while making use of time scale separation and taking into account uncertainties in the aerodynamic derivatives. Starting with an optimal control formulation, the optimization problem can be rewritten as a Hamilton- Jacobi-Bellman equation. This equation can be solved by level set methods. This approach has been applied on an aircraft example involving structural airframe damage. Monte Carlo validation tests have confirmed that this approach is successful in estimating the safe maneuvering envelope for damaged aircraft.

optimal control↗