Search NASA⌕ Search

SEARCH · Search NASA

Results for “Jacobi set”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Fracture Mechanics Analysis of an Annular Crack in a Three-concentric-cylinder Composite Model

A boundary-value problem governing a three-phase concentric-cylinder model was analytically modeled to analyze annular interfacial crack problems with Love s strain functions in order to find the stress intensity factors (SIFs) and strain energy release rates (SERRs) at the tips of an interface crack in a nonhomogeneous medium. The complex form of a singular integral equation (SIE) of the second kind was formulated using Bessel s functions in the Fourier domain, and the SIF and total SERR were calculated using Jacoby polynomials. For the validity of the SIF equations to be established, the SIE of the three-concentric-cylinder model was reduced to the SIE for a two-concentric-cylinder model, and the results were compared with the previous results of Erdogan. A preliminary set of parametric studies was carried out to show the effect of interphase properties on the SERR. The method presented here provides insight about the effect of interphase properties on the crack driving force.

Kuguoglu, Latife H.↗
NASA NTRS1988

An approximate atmospheric guidance law for aeroassisted plane change maneuvers

An approximate optimal guidance law for the aeroassisted plane change problem is presented which is based upon an expansion of the Hamilton-Jacobi-Bellman equation with respect to the small parameter of Breakwell et al. (1985). The present law maximizes the final velocity of the reentry vehicle while meeting terminal constraints on altitude, flight path angle, and heading angle. The integrable zeroth-order solution found when the small parameter is set to zero corresponds to a solution of the problem where the aerodynamic forces dominate the inertial forces. Higher order solutions in the expansion are obtained from the solution of linear partial differential equations requiring only quadrature integration.

Speyer, Jason L.↗
NASA NTRS1992

Polarizabilities of two-electron positive ions and Rydberg levels of lithium

Second-order sums are computed for the two-electron positive ions Li(+), Be(2+), and B(3+) by representing the intermediate states as discrete pseudostates. The Hamiltonian for the system is given and translated to semi-Jacobi variables for its derivation in reduced Rydberg units. The interaction potential is developed in its multipole form and employed in second-order perturbation theory. The perturbation is always a multipole-potential term, and the initial and intermediate states are constructed from two-particle Hylleraas basis sets. The resulting pseudostates are shown to represent the continuum with good convergence, and the asymptotic-optical-potential method is applied to the two-body quantities to determine the energy levels of three-electron systems in high Rydberg states. The method is shown to give accurate values for the polarizabilities of the two-electron isoelectronic systems.

Bhatia, A. K.↗
NASA NTRS1974

Stability regions for quasiperiodic motion in the restricted problem of three bodies

Surfaces of section, plotted in configuration space, have been computed for the motion of the massless particle in the restricted problem of three bodies. Nine mass ratios and a wide variety of Jacobi constants were investigated; over four thousand orbits were computed, about half of which were finally used. The plots of surface of section have been reduced to plots of stability regions, following a method due to Henon (1965a, 1965b, 1966b, 1969). Sample surfaces of section are also given. The complete set of 276 surfaces of section has been published as a report (Jefferys, 1971) and is available upon request from the author.

Jefferys, W. H.↗
NASA NTRS1983

On neutron star structure and the millisecond pulsar

The millisecond pulsar is the first observed example of a neutron star spinning rapidly enough to approach the Jacobi bifurcation point and thus affords the possibility of constraining neutron star physics. The pulsar must be rotating below the critical frequency at which its equilibrium configuration would become nonaxisymmetric, since the lifetime of this configuration against decay by gravitational radiation is very short. This critical frequency may be used to set a lower limit of 2 x 10 to the 14th g/cu cm on the density of the star. If the mass is 0.5-1.5 solar mass, several of the stiffer neutron star equations of state may be ruled out, and the radius should be less than 16 km. The condition for axisymmetry also imposes an upper limit on the rotation rate to which neutron stars may be spun up by accretion disks in binary systems.

Harding, A. K.↗
NASA NTRS1974

An analytic method to account for drag in the Vinti Satellite theory

To retain separability in the Vinti theory of earth satellite motion when a nonconservative force such as air drag is considered, a set of variational equations for the orbital elements are introduced, and expressed as functions of the transverse, radial, and normal components of the nonconservative forces acting on the system. In this approach, the Hamiltonian is preserved in form, and remains the total energy, but the initial or boundary conditions and hence the Jacobi constants of the motion advance with time through the variational equations. In particular, the atmospheric density profile is written as a fitted exponential function of the eccentric anomaly, which adheres to tabular data at all altitudes and simultaneously reduced the variational equations to indefinite integrals with closed form evaluations. The values of the limits for any arbitrary time interval are obtained from the Vinti program.

Watson, J. S.↗
DOE OSTI2021

Cauchy data space and multisymplectic formulation of conformal classical field theories

In this article we inspect the dynamics of classical field theories with a local conformal behavior. Our interest in the multisymplectic setting comes from its suitable description of field theories, and the conformal character has been added to account for field theories that are scale invariant, flat spaces, and because some conformal fields can be exactly solved or classified. In particular, we will solve the example of a conformal scalar field using the geometric Hamilton–Jacobi theory that is explicitly proposed for conformal fields on a multisymplectic manifold. To complete the geometric approach to study field theories, we propose the Hamilton–Jacobi theory for conformal fields in a Cauchy data space, in which space and time are split separately and the dynamics is depicted in an infinite-dimensional manifold.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Next-to-$\mathrm{MHV}$ Yang-Mills kinematic algebra

Kinematic numerators of Yang-Mills scattering amplitudes possess a rich Lie algebraic structure that suggest the existence of a hidden infinite-dimensional kinematic algebra. Explicitly realizing such a kinematic algebra is a longstanding open problem that only has had partial success for simple helicity sectors. In past work, we introduced a framework using tensor currents and fusion rules to generate BCJ numerators of a special subsector of NMHV amplitudes in Yang-Mills theory. Here we enlarge the scope and explicitly realize a kinematic algebra for all NMHV amplitudes. Master numerators are obtained directly from the algebraic rules and through commutators and kinematic Jacobi identities other numerators can be generated. Inspecting the output of the algebra, we conjecture a closed-form expression for the master BCJ numerator up to any multiplicity. We also introduce a new method, based on group algebra of the permutation group, to solve for the generalized gauge freedom of BCJ numerators. It uses the recently introduced binary BCJ relations to provide a complete set of NMHV kinematic numerators that consist of pure gauge.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1987

A numerical method for the solution of three dimensional, incompressible, viscous flows over slender bodies

A marching iterative method for the solution of the three dimensional, incompressibhle, steady and parabolized Navier-Stokes equations is described. The equations are written in primitive variables and discretized in general axisymmetric orthogonal coordinate systems. The coupled set of finite-difference equations are solved without any splitting or factorization errors. Moreover, the continuity equation and the two crossflow momentum equations are exactly satisfied at every step of the iterative process. The solution scheme is equivalent to the solution of one Poisson equation by the Successive Plane Over Relaxation method and has good convergence properties. Other existing solution methods resemble a Jacobi-type iterative scheme and therefore are less efficient. Numerical experiments include the laminar, incompressible flow over prolate spheroids at incidence.

Rosenfeld, Moshe↗
DOE OSTI2024

Multicollinear singularities in celestial CFT

The purpose of this paper is to study the holomorphic multicollinear limit of (celestial) amplitudes and use it to further investigate the double residue condition for (hard celestial) amplitudes and the celestial operator product expansion. We first set up the notion of holomorphic multicollinear limits of amplitudes and derive the 3-collinear splitting functions for Yang-Mills theory, Einstein gravity, and massless ϕ 3 theory. In particular, we find that in ϕ 3 theory the celestial 3-OPE contains a term with a branch cut. This explicit example confirms that branch cuts can obstruct the double residue condition for hard celestial amplitudes, which is the underlying cause of the celestial Jacobi identities not holding for certain theories. This addresses an ongoing debate in the literature about associativity of the celestial OPEs and concretely demonstrates a new (multi-particle) term in the celestial OPE coming from the multi-particle channel in the amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1994

Simulation fidelity of a virtual environment display

We assessed the degree to which a virtual environment system produced a faithful simulation of three-dimensional space by investigating the influence of a pitched optic array on the perception of gravity-referenced eye level (GREL). We compared the results with those obtained in a physical environment. In a within-subjects factorial design, 12 subjects indicated GREL while viewing virtual three-dimensional arrays at different static orientations. A physical array biased GREL more than did a geometrically identical virtual pitched array. However, addition of two sets of orthogonal parallel lines (a grid) to the virtual pitched array resulted in as large a bias as that obtained with the physical pitched array. The increased bias was caused by longitudinal, but not the transverse, components of the grid. We discuss implications of our results for spatial orientation models and for designs of virtual displays.

Nemire, Kenneth↗
NASA NTRS2006

Application of p-Multigrid to Discontinuous Galerkin Formulations of the Poisson Equation

We investigate p-multigrid as a solution method for several different discontinuous Galerkin (DG) formulations of the Poisson equation. Different combinations of relaxation schemes and basis sets have been combined with the DG formulations to find the best performing combination. The damping factors of the schemes have been determined using Fourier analysis for both one and two-dimensional problems. One important finding is that when using DG formulations, the standard approach of forming the coarse p matrices separately for each level of multigrid is often unstable. To ensure stability the coarse p matrices must be constructed from the fine grid matrices using algebraic multigrid techniques. Of the relaxation schemes, we find that the combination of Jacobi relaxation with the spectral element basis is fairly effective. The results using this combination are p sensitive in both one and two dimensions, but reasonable convergence rates can still be achieved for moderate values of p and isotropic meshes. A competitive alternative is a block Gauss-Seidel relaxation. This actually out performs a more expensive line relaxation when the mesh is isotropic. When the mesh becomes highly anisotropic, the implicit line method and the Gauss-Seidel implicit line method are the only effective schemes. Adding the Gauss-Seidel terms to the implicit line method gives a significant improvement over the line relaxation method.

Helenbrook, B. T.↗
NASA NTRS1993

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

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↗
NASA NTRS1985

Acoustic particle separation

A method is described which uses acoustic energy to separate particles of different sizes, densities, or the like. The method includes applying acoustic energy resonant to a chamber containing a liquid of gaseous medium to set up a standing wave pattern that includes a force potential well wherein particles within the well are urged towards the center, or position of minimum force potential. A group of particles to be separated is placed in the chamber, while a non-acoustic force such as gravity is applied, so that the particles separate with the larger or denser particles moving away from the center of the well to a position near its edge and progressively smaller lighter particles moving progressively closer to the center of the well. Particles are removed from different positions within the well, so that particles are separated according to the positions they occupy in the well.

Barmatz, M. B.↗
NASA NTRS2014

Development of a Route Crossing Tool for Shared Airspace Environments

In current-day Terminal Radar Approach Control (TRACON) operations, departure and arrival controllers maintain separate and dedicated airspace for their respective traffic flows. Although this practice has obvious safety features, it also leads to inefficiencies; for example, departure aircraft may be routinely capped beneath arrival airspace. With the right decision-support and coordination tools, departures could continue to climb through arrival airspace when sufficient gaps exist. Previous studies of ‘shared airspace’ have examined pre-arranged coordination procedures, as well as tools that gave feedback to the controllers on where gaps between arrivals were located and whether the departure aircraft could be scheduled to fly through those gaps [1, 2, 3, 4]. Since then, the Route Crossing Tool (RCT) has been developed to allow controllers to assess multiple pre-defined route options at points where the arrivals and departures cross, thereby increasing the possibility of climbing a departure through an arrival gap.The RCT aids in ensuring lateral separation between departure and arrival aircraft that pass through the same altitude. Since the RCT can be applied tactically, it can enable aircraft to fly through arrival flows even if these aircraft depart outside scheduled times. The RCT makes use of a set of predefined parallel departure routes crossing the arrival flow at equidistant intersecting points on the arrival route. The RCT uses the Estimated Time of Arrival (ETA) of the departure aircraft at each intersecting point to calculate the lateral separation with the neighboring arrivals when it crosses that point; this information is graphically displayed to the controller. Additionally, the RCT incorporates forecast winds in its ETA predictions.Multiple prototypes of the RCT have been iteratively developed with feedback from Subject Matter Experts (SMEs). This paper presents the final design, the design process, and lessons learned. Initial results from a simulation suggest that the tool was successful in helping controllers to safely climb more aircraft. Controller feedback on the tool was also positive.

shared airspace↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗