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 145 records · Page 8

Efficient High Order Central Schemes for Multi-Dimensional Hamilton-Jacobi Equations: Talk Slides

This viewgraph presentation presents information on the attempt to produce high-order, efficient, central methods that scale well to high dimension. The central philosophy is that the equations should evolve to the point where the data is smooth. This is accomplished by a cyclic pattern of reconstruction, evolution, and re-projection. One dimensional and two dimensional representational methods are detailed, as well.

Bryson, Steve↗

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

Flight Dynamics Facility (FDF) located at NASA Goddard Space Flight Center (GSFC) provides the flight dynamics expertise for three Sun-Earth Moon L1 missions. Advanced Composition Explorer (ACE) launched August 1997 Solar and Heliospheric Observatory (SOHO) launched December 1995 Global Geospace Science WIND satellite launched November 1994 entered Lagrange point orbit in 2004.

Ace↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

Separability in consistent truncations

The separability of the Hamilton-Jacobi equation has a well-known connection to the existence of Killing vectors and rank-two Killing tensors. This paper combines this connection with the detailed knowledge of the compactification metrics of consistent truncations on spheres. The fact that both the inverse metric of such compactifications, as well as the rank-two Killing tensors can be written in terms of bilinears of Killing vectors on the underlying “round metric,” enables us to perform a detailed analyses of the separability of the Hamilton-Jacobi equation for consistent truncations. We introduce the idea of a separating isometry and show that when a consistent truncation, without reduction gauge vectors, has such an isometry, then the Hamilton-Jacobi equation is always separable. When gauge vectors are present, the gauge group is required to be an abelian subgroup of the separating isometry to not impede separability. We classify the separating isometries for consistent truncations on spheres, S n , for n = 2, …, 7, and exhibit all the corresponding Killing tensors. These results may be of practical use in both identifying when supergravity solutions belong to consistent truncations and generating separable solutions amenable to scalar probe calculations. Finally, while our primary focus is the Hamilton-Jacobi equation, we also make some remarks about separability of the wave equation.

79 ASTRONOMY AND ASTROPHYSICS↗

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson s Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.↗

Transport Equation Based Wall Distance Computations Aimed at Flows With Time-Dependent Geometry

Eikonal, Hamilton-Jacobi and Poisson equations can be used for economical nearest wall distance computation and modification. Economical computations may be especially useful for aeroelastic and adaptive grid problems for which the grid deforms, and the nearest wall distance needs to be repeatedly computed. Modifications are directed at remedying turbulence model defects. For complex grid structures, implementation of the Eikonal and Hamilton-Jacobi approaches is not straightforward. This prohibits their use in industrial CFD solvers. However, both the Eikonal and Hamilton-Jacobi equations can be written in advection and advection-diffusion forms, respectively. These, like the Poisson's Laplacian, are commonly occurring industrial CFD solver elements. Use of the NASA CFL3D code to solve the Eikonal and Hamilton-Jacobi equations in advective-based forms is explored. The advection-based distance equations are found to have robust convergence. Geometries studied include single and two element airfoils, wing body and double delta configurations along with a complex electronics system. It is shown that for Eikonal accuracy, upwind metric differences are required. The Poisson approach is found effective and, since it does not require offset metric evaluations, easiest to implement. The sensitivity of flow solutions to wall distance assumptions is explored. Generally, results are not greatly affected by wall distance traits.

Tucker, Paul G.↗

Holographic trace anomaly and local renormalization group

The Hamilton-Jacobi method in holography has produced important results both at a renormalization group (RG) fixed point and away from it. In this paper we use the Hamilton-Jacobi method to compute the holographic trace anomaly for four- and six-dimensional boundary conformal field theories (CFTs), assuming higher-derivative gravity and interactions of scalar fields in the bulk. The scalar field contributions to the anomaly appear in CFTs with exactly marginal operators. Moving away from the fixed point, we show that the Hamilton-Jacobi formalism provides a deep connection between the holographic and the local RG. We derive the local RG equation holographically, and verify explicitly that it satisfies Weyl consistency conditions stemming from the commutativity of Weyl scalings. We also consider massive scalar fields in the bulk corresponding to boundary relevant operators, and comment on their effects to the local RG equation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

Hamiltonian nature of monopole dynamics

Classical electromagnetism with magnetic monopoles is not a Hamiltonian field theory because the Jacobi identity for the Poisson bracket fails. The Jacobi identity is recovered only if all of the species have the same ratio of electric to magnetic charge or if an electron and a monopole can never collide. Without the Jacobi identity, there are no local canonical coordinates or Lagrangian action principle. In order to build a quantum field of magnetic monopoles, we either must explain why the positions of electrons and monopoles can never coincide or we must resort to new quantization techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗