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 109 records · Page 6

A new look at Fresnel field computation using the Jacobi-Bessel series

Computational procedures that would be useful in finding the Fresnel field from a knowledge of the Jacobi-Bessel expansion of the far field are considered. The range of validity of the Fresnel approximation is carefully examined by comparing it with the exact closed form solution for the uniform circular aperture. Also investigated numerically, and in great detail, is the range of validity (over theta) of the Fresnel small angle (FSA) approximation. For moderate sized apertures as small as 10 wavelengths, it is found that the FSA approximation is very accurate to angles as wide as four or more sidelobes (as seen in the far zone). A very efficient computational method is shown to exist for the radiation integral in the form of a single series expansion that is analytically continuous and convergent for a wide range of observation points in three-dimensional space.

Galindo-Israel, V.↗

The Jacobi Matrix Technique in Computational Fluid Dynamics

The Jacobi matrix technique was applied to the direct calculation of inviscid supersonic flow about two dimensional airfoils of varying thickness, angle of attack and camber and axisymmetric bodies of varying thickness and taper; and the design (inverse) calculation of inviscid supersonic flow past airfoils described by a given family of pressure distributions and axisymmetric bodies described by a given family of pressure distributions. The method was also applied to subsonic potential flow about two dimensional airfoils by modifying Jameson's FLO36. Results are discussed.

Sharp, H. Thomas↗

The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations

Simple inequalities for the Riemann problem for a Hamilton-Jacobi equation in N space dimension when neither the initial data nor the Hamiltonian need be convex (or concave) are presented. The initial data is globally continuous, affine in each orthant, with a possible jump in normal derivative across each coordinate plane, x sub i = 0. The inequalities become equalities wherever a maxmin equals a minmax and thus an exact closed form solution to this problem is then obtained.

Osher, Stanley↗

The nonconvex multi-dimensional Riemann problem for Hamilton-Jacobi equations

Simple inequalities are presented for the viscosity solution of a Hamilton-Jacobi equation in N space dimensions when neither the initial data nor the Hamiltonian need be convex (or concave). The initial data are uniformly Lipschitz and can be written as the sum of a convex function in a group of variables and a concave function in the remaining variables, therefore including the nonconvex Riemann problem. The inequalities become equalities wherever a 'maxmin' equals a 'minmax', and thus a representation formula for this problem is obtained, generalizing the classical Hopi formulas.

Bardi, Martino↗

A new proof of the Jacobi necessary condition

A new proof is given for Jacobi's no-conjugate-point necessary condition. For a certain class of linear-quadratic optimal control problems it is shown that the existence of a conjugate point in the interior of the extremal implies the existence of control perturbations that lead to a reduction in cost. In a well-known way, through the concept of the accessory minimum problem, this results in a no-conjugate-point condition for general optimal control problems. Important ideas used in this work are adopted from Breakwell and Ho (1965). In contrast to earlier results, the new proof also applies if the coefficient functions of time associated with the accessory minimum problem have any finite number of discontinuities.

Seywald, Hans↗

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.↗

New proof of the Jacobi necessary condition

A new proof is given for Jacobi's necessary condition. It is shown that the existence of a conjugate point in the interior of an extremal implies the existence of control perturbations which lead to a reduction in cost. The present analysis is restricted to linear-quadratic optimal control problems.

Seywald, Hans↗

A Discontinuous Galerkin Finite Element Method for Hamilton-Jacobi Equations

In this paper, we present a discontinuous Galerkin finite element method for solving the nonlinear Hamilton-Jacobi equations. This method is based on the Runge-Kutta 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.

Hu, Changqing↗

Central Schemes for Multi-Dimensional Hamilton-Jacobi Equations

We present new, efficient central schemes for multi-dimensional Hamilton-Jacobi equations. These non-oscillatory, non-staggered schemes are first- and second-order accurate and are designed to scale well with an increasing dimension. Efficiency is obtained by carefully choosing the location of the evolution points and by using a one-dimensional projection step. First-and second-order accuracy is verified for a variety of multi-dimensional, convex and non-convex problems.

Bryson, Steve↗

High-Order Central WENO Schemes for 1D Hamilton-Jacobi Equations

In this paper we derive fully-discrete Central WENO (CWENO) schemes for approximating solutions of one dimensional Hamilton-Jacobi (HJ) equations, which combine our previous works. We introduce third and fifth-order accurate schemes, which are the first central schemes for the HJ equations of order higher than two. The core ingredient is the derivation of our schemes is a high-order CWENO reconstructions in space.

Bryson, Steve↗

High-Order Central WENO Schemes for Multi-Dimensional Hamilton-Jacobi Equations

We present new third- and fifth-order Godunov-type central schemes for approximating solutions of the Hamilton-Jacobi (HJ) equation in an arbitrary number of space dimensions. These are the first central schemes for approximating solutions of the HJ equations with an order of accuracy that is greater than two. In two space dimensions we present two versions for the third-order scheme: one scheme that is based on a genuinely two-dimensional Central WENO reconstruction, and another scheme that is based on a simpler dimension-by-dimension reconstruction. The simpler dimension-by-dimension variant is then extended to a multi-dimensional fifth-order scheme. Our numerical examples in one, two and three space dimensions verify the expected order of accuracy of the schemes.

Bryson, Steve↗

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

We present high-order semi-discrete central-upwind numerical schemes for approximating solutions of multi-dimensional Hamilton-Jacobi (HJ) equations. This scheme is based on the use of fifth-order central interpolants like those developed in [1], in fluxes presented in [3]. These interpolants use the weighted essentially nonoscillatory (WENO) approach to avoid spurious oscillations near singularities, and become "central-upwind" in the semi-discrete limit. This scheme provides numerical approximations whose error is as much as an order of magnitude smaller than those in previous WENO-based fifth-order methods [2, 1]. Thee results are discussed via examples in one, two and three dimensions. We also pregnant explicit N-dimensional formulas for the fluxes, discuss their monotonicity and tl!e connection between this method and that in [2].

Bryson, Steve↗

Compressed Semi-Discrete Central-Upwind Schemes for Hamilton-Jacobi Equations

We introduce a new family of Godunov-type semi-discrete central schemes for multidimensional Hamilton-Jacobi equations. These schemes are a less dissipative generalization of the central-upwind schemes that have been recently proposed in series of works. We provide the details of the new family of methods in one, two, and three space dimensions, and then verify their expected low-dissipative property in a variety of examples.

Bryson, Steve↗

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, numerical schemes which discretize the Hamilton-Jacobi (H-J), level set, and Eikonal equations on triangulated domains are presented. The first scheme is a provably monotone discretization for certain forms of the H-J equations. Unfortunately, the basic scheme lacks proper Lipschitz continuity of the numerical Hamiltonian. By employing a virtual edge flipping technique, Lipschitz continuity of the numerical flux is restored on acute triangulations. Next, schemes are introduced and developed based on the weaker concept of positive coefficient approximations for homogeneous Hamiltonians. These schemes possess a discrete maximum principle on arbitrary triangulations and naturally exhibit proper Lipschitz continuity of the numerical Hamiltonian. Finally, a class of Petrov-Galerkin approximations are considered. These schemes are stabilized via a least-squares bilinear form. The Petrov-Galerkin schemes do not possess a discrete maximum principle but generalize to high order accuracy.

Barth, Timothy J.↗

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗

End of Life Disposal for Three Libration Point Missions through Manipulation of the Jacobi Constant and Zero Velocity Curves

The aim of this investigation is to determine the feasibility of mission disposal by inserting the spacecraft into a heliocentric orbit along the unstable manifold and then manipulating the Jacobi constant to prevent the spacecraft from returning to the Earth-Moon system. This investigation focuses around L1 orbits representative of ACE, WIND, and SOHO. It will model the impulsive delta-V necessary to close the zero velocity curves after escape through the L1 gateway in the circular restricted three body model and also include full ephemeris force models and higher fidelity finite maneuver models for the three spacecraft.

Wind↗

On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting

MOOSE's radiation transport module Rattlesnake comprises a first order S N solver that can be accelerated with a flexible Nonlinear Diffusion Acceleration. At each NDA iteration, the streaming and collision operator of the S{sub N} equations are (approximately) inverted using a transport sweep. When executed on multiple processors parallel block Jacobi (PBJ) splitting is utilized lagging the processor sub-domain's incoming angular fluxes making the implemented method asynchronous, i.e. the convergence properties of NDA become dependent on the number of concurrent tasks and details of the partitioning. Within this work, we study the NDA convergence properties for the two-dimensional C5G7 benchmark problem PBJ with p = 1, 2, 4, 8, 12, 16, 24, 32, 48, 60, 72, 96 and 144 concurrent tasks. Rosa studied the convergence properties of PBJ splitting methods with and without transport synthetic acceleration (TSA) in slab geometry and two-dimensional Cartesian geometry, respectively. Rosa's iteration scheme lags both the incoming angular fluxes and the scattering source making it very similar to the method described here. Rosa found by means of Fourier analysis that convergence of unaccelerated PBJ can degrade for optically thin subdomains, i.e. for a large number of processors given a fixed domain size. Depending on the choice of parameters application of TSA can lead to an effective algorithm. In contrast to Rosa's work, this work focuses on PBJ splitting for NDA accelerated solution of the multigroup eigenvalue problem. Later, Zerr and Anistratov used their integral transport matrix method in conjunction with PBJ. This iteration scheme is different as it does not lag the scattering source. Nevertheless, Fourier analysis with Diamond Difference spatial discretization showed that the method degrades with increasing the overall size of the spatial domain while keeping the sub-domain size constant. In the case of an infinite medium, the observed spectral radius becomes unity. These references establish the iterative performance of PBJ for one-group fixed source problems discretized on rectangular cells, but for the Rattlesnake first order NDA method, an emphasis lies on multigroup eigenvalue problems. In this setting, the additional complication arises that the low order equations are not exactly inverted, but only to some iterative criterion. Further, as the low order problem is solved using Jacobian-Free Newton Krylov methods, a suitable preconditioner for the GMRES iterations is required. As the effectiveness of the preconditioners may decrease when more concurrent processes are used, we expect the low order solve to impact the overall effectiveness of the NDA method in parallel execution as well. Therefore, this work focuses on the question of how detrimental the asynchronicity of the high and low order iterative solutions is for the effectiveness of NDA solutions of realistic, unstructured grid, multigroup eigenvalue problems. The iterative convergence properties of Rattlesnake's NDA method for multigroup eigenvalue problems are studied for varying number of concurrent processes. Rattlesnake's NDA method is asynchronous because the high order transport sweep uses PBJ splitting and because the low order solve's preconditioners, algebraic multigrid and additive Schwarz, are asynchronous. We found that up to 144 processes the number of Picard iterations increases by a factor of 2-3 affecting but not destroying NDA's parallel performance for the C5G7 benchmark problem, a representative LWR (light water reactor) configuration. The solution of the NDA low order eigenvalue problem posed greater problems than expected for the solvers currently available in Rattlesnake mainly because of problems to effectively precondition the modified low-order problem. As a matter of fact, the low order problem becomes an advection-diffusion problem. Non-robustness was observed for the AMG preconditioned coarse mesh acceleration for more than 60 concurrent processes, which was fixed by increasing the number of permissible V-cycles per AMG call. For fine mesh acceleration AMG proved to be ineffective and we resorted to ASM. For both AMG and ASM, increasing number of linear iterations per nonlinear are observed when increasing the number of processes, but for ASM this problem appears to be worse. The results from this work also indicate that initial development efforts should be diverted from implementation of a high-order parallel sweeping algorithm to the effective and robust iterative solution of the low order NDA multigroup eigenvalue problem. (authors)

97 MATHEMATICS AND COMPUTING↗

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗