Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic Geometry”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Novel superposed kinklike and pulselike solutions for several nonlocal nonlinear equations

In this work, we show that a number of nonlocal nonlinear equations, including the Ablowitz–Musslimani and Yang variant of the nonlocal nonlinear Schrödinger (NLS) equation, the nonlocal modified Korteweg de Vries (mKdV) equation, and the nonlocal Hirota equation, admit novel kinklike and pulselike superposed periodic solutions. Furthermore, we show that the nonlocal mKdV equation also admits the superposed (hyperbolic) kink–antikink solution. In addition, we show that while the nonlocal Ablowitz–Musslimani variant of the NLS admits complex parity-time reversal-invariant kink and pulse solutions, neither the local NLS nor the Yang variant of the nonlocal NLS admits such solutions. Finally, except for the Yang variant of the nonlocal NLS, we show that the other three nonlocal equations admit both the kink and pulse solutions in the same model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Constrained Tomographic Reconstructions of Gamma Scans in AGR 5/6/7 Capsules

We demonstrate a novel approach to locate potential areas of interest within individual capsules in the Advanced Gas Reactor 5/6/7 experiment. Individual capsules from the experiment have been scanned for gamma-emitting radioisotopes using the precision gamma spectrometer at Idaho National Laboratory’s hot fuel examination facility. Only a small number of scans were available, fewer than ten scan angles as opposed to a typical three hundred, so a geometry-informed algebraic reconstruction technique was used to provide qualitative information on high-activity regions in the capsule. While results are non-quantitative, some qualitative conclusions are drawn.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS2000

TOA Lightning Location Retrieval on Spherical and Oblate Spheroidal Earth Geometries

A simple linear algebraic solution is introduced for retrieving the location and time-of-occurrence of lightning ground strikes on a spherical Earth from a network of four or more time-of-arrival (TOA) sensors. Since the solution accounts for Earth curvature, it represents an extension to earlier planar model results described by Koshak et al. A test of the retrieval method is provided using computer-simulated data sets. The method is easy to comprehend and completely avoids reference to the mathematics of spherical hyperbolas such as discussed by Lewis. A quasi-analytic extension to the spherical Earth solution is provided for an oblate spheroidal Earth geometry, and the importance/relevance of oblate effects are discussed. Future application of these methods in support of the North American National Lightning Detection Network (NALDN) described by Cummins et al. is desirable, but additional theoretical investigations are required to incorporate magnetic bearing information into the present solution process.

Koshak, W. J.↗
DOE OSTI2024

Modular flow in JT gravity and entanglement wedge reconstruction

It has been shown in recent works that JT gravity with matter with two boundaries has a type II ∞ algebra on each side. As the bulk spacetime between the two boundaries fluctuates in quantum nature, we can only define the entanglement wedge for each side in a pure algebraic sense. As we take the semiclassical limit, we will have a fixed long wormhole spacetime for a generic partially entangled thermal state (PETS), which is prepared by inserting heavy operators on the Euclidean path integral. Under this limit, with appropriate assumptions of the matter theory, geometric notions of the causal wedge and entanglement wedge emerge in this background. In particular, the causal wedge is manifestly nested in the entanglement wedge. Different PETS are orthogonal to each other, and thus the Hilbert space has a direct sum structure over sub-Hilbert spaces labeled by different Euclidean geometries. The full algebra for both sides is decomposed accordingly. From the algebra viewpoint, the causal wedge is dual to an emergent type III 1 subalgebra, which is generated by boundary light operators. To reconstruct the entanglement wedge, we consider the modular flow in a generic PETS for each boundary. We show that the modular flow acts locally and is the boost transformation around the global RT surface in the semiclassical limit. It follows that we can extend the causal wedge algebra to a larger type III 1 algebra corresponding to the entanglement wedge. Within each sub-Hilbert space, the original type II ∞ reduces to type III 1 .

2D Gravity↗
DOE OSTI2025

Foams and KZ-equations in Rozansky-Witten theories

In this paper, we present a geometric description of foams, which are prevalent in topological quantum field theories (TQFTs) based on quantum algebra, and reciprocally explore the geometry of Rozansky-Witten (RW) theory from an algebraic perspective. This approach illuminates various aspects of decorated TQFTs via geometry of the target space X of RW theory. Through the formulation of the Knizhnik-Zamolodchikov (KZ) equation within this geometric framework, we derive the corresponding braiding and associator morphisms. We discuss applications where the target space of RW theory emerges as the Coulomb branch of a compactified 6d SCFT or Little String Theory, with the latter being particularly intriguing as it results in a compact X.

Gukov, Sergei [California Institute of Technology,↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1978

Indicated mean-effective pressure instrument

An apparatus for measuring indicated mean effective pressure (IMEP) of an internal combustion piston or rotary engine or of an external combustion engine such as a stirling engine is disclosed. An optical shaft encoder measures crankshaft angle of the engine. Changes in volume with respect to changes in crank angle of one or more cylinders (dV/d theta) is determined either empirically or algebraically from engine geometry and stored in a memory. As the crank angle changes, dV/d theta) is read from the memory and multiplied by chamber or cylinder pressure. The product (P dv/d theta) is then added to the total previously accumulated in the cycle. Each time theta changes by an amount equal to delta theta, the process is repeated. At the end of each engine cycle, the total is equal to the IMEP value for that cycle.

Rice, W. J.↗
NASA NTRS1984

Grid flexibility and patching techniques

The numerical determination of combustor flowfields is of great value to the combustor designer. An a priori knowledge of the flow behavior can speed the combustor design process and reduce the number of experimental test rigs required to arrive at an optimal design. Even 2-D steady incompressible isothermal flow predictions are of use; many codes of this kind are available, each employing different techniques to surmount the difficulties arising from the nonlinearity of the governing equations and from typically irregular combustor geometries. Mapping techniques (algebraic and elliptic PDE), and adaptive grid methods (both multi-grid and grid embedding) as applied to axisymmetric combustors are discussed.

Keith, T. G.↗
NASA NTRS1985

Numerical solution of the Euler equations for high-speed, blended wing-body configurations

Simulation of high-speed three-dimensional flow about blended wing-body combinations is investigated. A finite-volume explicit scheme with Runge-Kutta time integration is used to solve the compressible Euler equations in order to simulate the flow. The method, augmented by carefully chosen dissipative terms and convergence accelerators such as enthalpy damping and maximum local time-stepping, has been found to be very efficient in solving high-speed flows involving strong shocks. An analytic method for generating the body geometry and an algebraic method for quasi-three-dimensional grid generation are described. Results are presented for various blended wing-body configurations at different Mach numbers and angles of attack.

Moitra, A.↗
NASA NTRS1993

Grid and design variables sensitivity analyses for NACA four-digit wing-sections

Two distinct parameterization procedures are developed for investigating the grid sensitivity with respect to design parameters of a wing-section example. The first procedure is based on traditional (physical) relations defining NACA four-digit wing-sections. The second is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B-Splines) for defining the wing-section geometry. An interactive algebraic grid generation technique, known as Hermite Cubic Interpolation, is employed to generate C-type grids around wing-sections. The grid sensitivity of the domain with respect to design and grid parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations. A comparison of the sensitivity coefficients with those obtained using a finite-difference approach has been made to verify the feasibility of the approach. The aerodynamic sensitivity coefficients are obtained using the compressible two-dimensional thin-layer Navier-Stokes equations.

Sadrehaghighi, Ideen↗
NASA NTRS1993

Grid and aerodynamic sensitivity analyses of airplane components

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B-Splines) for defining the wing-section geometry. An interactive algebraic grid generation technique, known as Two-Boundary Grid Generation (TBGG) is employed to generate C-type grids around wing-sections. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the wing-section surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the wing-section.

Sadrehaghighi, Ideen↗
NASA NTRS1995

Grid Sensitivity and Aerodynamic Optimization of Generic Airfoils

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B- Splines) for defining the airfoil geometry. An interactive algebraic grid generation technique is employed to generate C-type grids around airfoils. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the airfoil surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the airfoil.

Sadrehaghighi, Ideen↗
NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗
DOE OSTI2020

Chiral algebra, localization, modularity, surface defects, and all that

We study the 2D vertex operator algebra (VOA) construction in 4D N = 2 superconformal field theories on S 3 × S 1 , focusing on both old puzzles and new observations. The VOA lives on a two-torus T 2 ⊂ S 3 × S 1 , it is 1 2 Z -graded, and this torus is equipped with the natural choice of spin structure (1,0) for the Z + 1 2 -graded operators, corresponding to the NS sector vacuum character. By analyzing the possible refinements of the Schur index that preserves the VOA, we find that it admits discrete deformations, which allows access to the remaining spin structures (1,1), (0,1), and (0,0), of which the latter two involve the inclusion of a particular surface defect. For Lagrangian theories, we perform the detailed analysis: we describe the natural supersymmetric background, perform localization, and derive the gauged symplectic boson action on a torus in any spin structure. In the absence of flavor fugacities, the 2D and 4D path integrals precisely match, including the Casimir factors. We further analyze the 2D theory: we identify its integration cycle and the two-point functions and interpret flavor holonomies as screening charges in the VOA. Next, we make some observations about modularity; the T-transformation acts on our four partition functions and lifts to a large diffeomorphism on S 3 × S 1 . More interestingly, we generalize the four partition functions on the torus to an infinite family labeled by both the spin structure and the integration cycle inside the complexified maximal torus of the gauge group. Members of this family transform into one another under the full modular group, and we confirm the recent observation that the S-transform of the Schur index in Lagrangian theories exhibits logarithmic behavior. Finally, we comment on how locally our background reproduces the Ω-background.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Finite difference grid generation by multivariate blending function interpolation

The General Interpolants Method (GIM) code which solves the multidimensional Navier-Stokes equations for arbitrary geometric domains is described. The geometry module in the GIM code generates two and three dimensional grids over specified flow regimes, establishes boundary condition information and computes finite difference analogs for use in the GIM code numerical solution module. The technique can be classified as an algebraic equation approach. The geometry package uses multivariate blending function interpolation of vector-values functions which define the shapes of the edges and surfaces bounding the flow domain. By employing blending functions which conform to the cardinality conditions the flow domain may be mapped onto a unit square (2-D) or unit cube (3-D), thus producing an intrinsic coordinate system for the region of interest. The intrinsic coordinate system facilitates grid spacing control to allow for optimum distribution of nodes in the flow domain.

Anderson, P. G.↗
DOE OSTI2020

A new form of the Saint-Venant equations for variable topography

The solution stability of river models using the one-dimensional (1D) Saint-Venant equations can be easily undermined when source terms in the discrete equations do not satisfy the Lipschitz smoothness condition for partial differential equations. Although instability issues have been previously noted, they are typically treated as model implementation issues rather than as underlying problems associated with the form of the governing equations. This study proposes a new reference slope form of the Saint-Venant equations to ensure smooth slope source terms and eliminate one source of potential numerical oscillations. It is shown that a simple algebraic transformation of channel geometry provides a smooth reference slope while preserving the correct cross-section flow area and the total Piezometric pressure gradient that drives the flow. The reference slope method ensures the slope source term in the governing equations is Lipschitz continuous while maintaining all the underlying complexity of the real-world geometry. The validity of the mathematical concept is demonstrated with the open-source Simulation Program for River Networks (SPRNT) model in a series of artificial test cases and a simulation of a small urban creek. Validation comparisons are made with analytical solutions and the Hydrologic Engineering Center's River Analysis System (HEC-RAS) model. The new method reduces numerical oscillations and instabilities without requiring ad hoc smoothing algorithms.

54 ENVIRONMENTAL SCIENCES↗