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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Local bilinear computation of Jacobi sets

Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2006

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

NASA NTRS1997

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

NASA NTRS1992

Computing interface motion in compressible gas dynamics

An analysis is conducted of the coupling of Osher and Sethian's (1988) 'Hamilton-Jacobi' level set formulation of the equations of motion for propagating interfaces to a system of conservation laws for compressible gas dynamics, giving attention to both the conservative and nonconservative differencing of the level set function. The capabilities of the method are illustrated in view of the results of numerical convergence studies of the compressible Rayleigh-Taylor and Kelvin-Helmholtz instabilities for air-air and air-helium boundaries.

Mulder, W.↗

NASA NTRS1997

RIACS

Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project.

Oliger, Joseph↗

DOE OSTI2020

Simultaneous material, shape and topology optimization

Using three design fields we develop an optimization environment that can simultaneously optimize material, shape and topology. We use the implicit representation of the boundaries with level-set functions that define the shape and topology. Differentiable R-functions allow us to combine these shapes and topology descriptions with Boolean operations. Additionally, we incorporate design dependent-stiffness materials with another design field. Notably, this framework accommodates design dependent loads, has the ability to introduce holes, and ensures the satisfaction of optimality criteria. It builds upon the fictitious domain, ersatz material, material interpolation and level-set methods. Additionally, it also borrows from parameterized density-based topology optimization methods. Since analytical sensitivities can be computed, we use efficient nonlinear programming algorithms to update the design instead of the Hamilton–Jacobi’s scheme of level-set methods. We illustrate the features of our framework by designing a cantilever beam with octet truss microlattice, a dam with design-dependent loads, and a composite clevis plate.

42 ENGINEERING↗

NASA NTRS1977

A block iterative LU solver for weakly coupled linear systems

A hybrid technique, called the block iterative LU solver, is proposed for solving the linear equations resulting from a finite element numerical analysis of certain fluid dynamics problems where the equations are weakly coupled between distinct sets of variables. Either the block Jacobi iterative method or the block Gauss-Seidel iterative solver is combined with LU decomposition.

Cooke, C. H.↗

DOE OSTI2023

Operational control with set-points tuning - application to mobile robots

This paper proposes a novel method for the optimal tuning of set points for multiple-layered control system structure widely seen in robotics and other complex industrial processes composed of a number of subsystems. The terminal sliding mode control (SMC) is used as the low-level control strategy to ensure the stability of subsystems. When uncertainties exist, it can be shown that the deteriorated system performance will be improved by the outer loop with set points tuning. For this purpose, the learning of the new set point is designed to compensate for the effects caused by uncertainties during the system operation. At the same time, the system is proven to stay with the original set point when the compensation is introduced. A practical application to a holonomic mobile robot system is given to illustrate the presented method. Desired results have been obtained.

42 ENGINEERING↗

NASA NTRS2013

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↗

NASA NTRS1993

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

NASA NTRS1984

Opening of an interface flaw in a layered elastic half-plane under compressive loading

A static analysis is given of the problem of an elastic layer perfectly bonded, except for a frictionless interface crack, to a dissimilar elastic half-plane. The free surface of the layer is loaded by a finite pressure distribution directly over the crack. The problem is formulated using the two dimensional linear elasticity equations. Using Fourier transforms, the governing equations are converted to a pair of coupled singular integral equations. The integral equations are reduced to a set of simultaneous algebraic equations by expanding the unknown functions in a series of Jacobi polynomials and then evaluating the singular Cauchy-type integrals. The resulting equations are found to be ill-conditioned and, consequently, are solved in the least-squares sense. Results from the analysis show that, under a normal pressure distribution on the free surface of the layer and depending on the combination of geometric and material parameters, the ends of the crack can open. The resulting stresses at the crack-tips are singular, implying that crack growth is possible. The extent of the opening and the crack-top stress intensity factors depend on the width of the pressure distribution zone, the layer thickness, and the relative material properties of the layer and half-plane.

Kennedy, J. M.↗

DOE OSTI2025

Quantum Hamilton-Jacobi theory, spectral path integrals, and exact WKB analysis

We propose a new way to perform path integrals in quantum mechanics by using a quantum version of Hamilton-Jacobi (HJ) theory. In classical mechanics, Hamilton-Jacobi theory is a powerful formalism, however, its utility is not explored in quantum theory beyond approximation schemes. The canonical transformation enables one to set the new Hamiltonian to constant or zero, but keeps the information about solution in Hamilton’s characteristic function. To benefit from this in quantum theory, one must work with a formulation in which classical Hamiltonian is used. This uniquely points to phase space path integral. However, the main variable in HJ formalism is energy, not time. Thus, we are led to consider the Fourier transform of the path integral, the spectral path integral Z ˜ ( E ) . The evaluation of path integrals reduces to determining the quantum Hamilton characteristic functions (which can be achieved via an asymptotic analysis) and a discrete sum over the quantum period lattice, generalizing Gutzwiller’s sum. Published by the American Physical Society 2025

Türe, Mustafa (ORCID:0009000975968618)↗

NASA NTRS1991

Unstructured grid generation using the distance function

A new class of methods for obtaining level sets to generate unstructured grids is presented. The consecutive grid levels are computed using the distance functions, which corresponds to solving the Hamilton-Jacobi equations representing the equations of motion of fronts propagating with curvature-dependent speed. The relationship between the distance function and the governing equations will be discussed as well as its application to generating grids. Multi-ply connected domains and complex geometries are handled naturally, with a straightforward generalization to several space dimensions. The grid points for the unstructured grid are obtained simultaneously with the grid levels. The search involved in checking for overlapping triangles is minimized by triangulating the entire domain one level at a time.

Bihari, Barna L.↗

NASA NTRS1989

A new adaptive control approach for aerospace vehicles with parameter uncertainties

A new stochastic adaptive control structure is developed for the problem of combined parameter estimation and control of aerospace vehicles with changing parameters. Parameter uncertainties are modeled as first-order Gauss-Markov processes, and are introduced to the system dynamics through a small parameter. It is assumed that an accurate inertial measurement unit gives perfect measurements of the state variables. Since the stochastic system is assumed to be Gauss-Markov, the density function of the parameters given these measurements is conditionally Gaussian. Based on this conditionally Gaussian density, the problem of minimizing a quadratic cost over an infinite time horizon can be set up within the framework of stochastic optimal control theory. The optimal feedback control law is derived from a straightforward expansion of the Hamilton-Jacobi-Bellman equation, based on the LQG solution. The resulting nonlinear controller is applied to the pitch axis control of a space platform with uncertain moments of inertia and is shown to produce marked improvement over a fixed controller.

Hahn, Yungsun↗

DOE OSTI2021

Two Dimensional Topology Optimization of Heat Exchangers with the Density and Level-Set Methods

We design heat exchangers using two topology optimization approaches: the density, i.e. volume fraction and level set methods. Our goal is to maximize the heat exchange between two fluids in separate channels while constraining the pressure drop across each channel. The heat exchanger is modeled with a coupled thermal-flow formulation. The flow is governed by an isothermal and incompressible Stokes-Brinkman equation and the heat transfer is governed by a convection-diffusion equation with high Peclet number. We solve one set of Stokes-Brinkman equations per fluid. Each Brinkman term in the flow equation serves to model the other phase as a solid, thereby preventing mixing. We first represent the solid and fluid phases using a volume fraction variable and apply a SIMP-like penalization in the Brinkman term to drive the optimization to a discrete design. The cost and constraint function derivatives are automatically calculated with the library pyadjoint and the optimization is performed by the Method of Moving Asymptotes. In a second optimization formulation, we use the level set approach to define the interface that separates the two fluids. Pyadjoint calculates the shape derivatives of the cost and constraint functions and the Hamilton-Jacobi advects the interface, allowing for topological changes. We present results in two dimensions and discuss the advantages and disadvantages of each approach.

42 ENGINEERING↗

DOE OSTI2024

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

NASA NTRS1988

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↗

NASA NTRS1987

Solutions of some problems in applied mathematics using MACSYMA

Various Symbolic Manipulation Programs (SMP) were tested to check the functioning of their commands and suitability under various operating systems. Support systems for SMP were found to be relatively better than the one for MACSYMA. The graphics facilities for MACSYMA do not work as expected under the UNIX operating system. Not all commands for MACSYMA function as described in the manuals. Shape representation is a central issue in computer graphics and computer-aided design. Aside from appearance, there are other application dependent, desirable properties like continuity to certain order, symmetry, axis-independence, and variation-diminishing properties. Several shape representations are studied, which include the Osculatory Method, a Piecewise Cubic Polynomial Method using two different slope estimates, Piecewise Cubic Hermite Form, a method by Harry McLaughlin, and a Piecewise Bezier Method. They are applied to collected physical and chemical data. Relative merits and demerits of these methods are examined. Kinematics of a single link, non-dissipative robot arm is studied using MACSYMA. Lagranian is set-up and Lagrange's equations are derived. From there, Hamiltonian equations of motion are obtained. Equations suggest that bifurcation of solutions can occur, depending upon the value of a single parameter. Using the characteristic function W, the Hamilton-Jacobi equation is derived. It is shown that the H-J equation can be solved in closed form. Analytical solutions to the H-J equation are obtained.

Punjabi, Alkesh↗