Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “lie algebras”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Similarity analysis of differential equations by Lie group.

Methods for transforming partial differential equations into forms more suitable for analysis and solution are investigated. The idea of Lie's infinitesimal contact transformation group is introduced to develop a systematic method which involves mostly algebraic manipulations. A thorough presentation of the application of this general method to the problem of similarity analysis in a broader sense - namely, the similarity between partial and ordinary differential equations, boundary value and initial value problems, and nonlinear and linear equations - is given with new and very general methods evolved for deriving the possible groups of transformations.

Na, T. Y.↗
NASA NTRS1979

Theories of resonant satellite pairs in Saturn's system

Analytical theories have been devised for the three resonant pairs in Saturn's satellite system: Enceladus-Dione, Titan-Hyperion, and Mimas-Tethys. An algebraic manipulation language was adopted to calculate the theories; use of the canonically invariant Hori-Lie (1966) theory in noncanonical variables made it possible to perform direct computations of perturbations in such quantities as longitude, latitude and radius vector. Important terms at the 1-100 km level have been found second-order terms of the resonant satellite are calculated.

Jefferys, W. H.↗
NASA NTRS1993

Control of nonlinear systems with applications to constrained robots and spacecraft attitude stabilization

This thesis is organized in two parts. In Part 1, control systems described by a class of nonlinear differential and algebraic equations are introduced. A procedure for local stabilization based on a local state realization is developed. An alternative approach to local stabilization is developed based on a classical linearization of the nonlinear differential-algebraic equations. A theoretical framework is established for solving a tracking problem associated with the differential-algebraic system. First, a simple procedure is developed for the design of a feedback control law which ensures, at least locally, that the tracking error in the closed loop system lies within any given bound if the reference inputs are sufficiently slowly varying. Next, by imposing additional assumptions, a procedure is developed for the design of a feedback control law which ensures that the tracking error in the closed loop system approaches zero exponentially for reference inputs which are not necessarily slowly varying. The control design methodologies are used for simultaneous force and position control in constrained robot systems. The differential-algebraic equations are shown to characterize the slow dynamics of a certain nonlinear control system in nonstandard singularly perturbed form. In Part 2, the attitude stabilization (reorientation) of a rigid spacecraft using only two control torques is considered. First, the case of momentum wheel actuators is considered. The complete spacecraft dynamics are not controllable. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but a discontinuous feedback control strategy is constructed. Next, the case of gas jet actuators is considered. If the uncontrolled principal axis is not an axis of symmetry, the complete spacecraft dynamics are small time locally controllable. However, the spacecraft attitude cannot be asymptotically stabilized using continuous feedback, but a discontinuous stabilizing feedback control strategy is constructed. If the uncontrolled principal axis is an axis of symmetry, the complete spacecraft dynamics cannot be stabilized. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but again a discontinuous feedback control strategy is constructed.

Krishnan, Hariharan↗
NASA NTRS1973

An analytic study on bounds for the associated Legendre functions

The bounds for the normalized associated Legendre functions P sub nm were studied to provide a rational basis for the truncation of the geopotential series in spherical harmonics in various orbital analyses. The conjecture is made that the largest maximum of the normalized associated Legendre function lies in the interval which indicates the greatest integer function. A procedure is developed for verifying this conjecture. An on-line algebraic manipulator, IAM, is used to implement the procedure and the verification is carried out for all n equal to or less than 2m, for m = 1 through 6. A rigorous proof of the conjecture is not available.

Payne, M. H.↗
NASA NTRS1983

Pfaffian systems and feedback linearization/obstructions

The concept of Cartan-Vessiot filtered Lie algebra/module is defined in terms of previous feedback linearizations constructed through canonical forms of Pfaffian systems associated with nonlinear systems. Nonlinearization/Cartan-Vessiot algebras are regarded as deformations of linear ones. It is shown how certain problems of interest in nonlinear system theory translate over to algebraic problems involving this sort of algebraic structure.

Hermann, R.↗
DOE OSTI2024

Quantum chaos on edge

Recently, the physics of many-body quantum chaotic systems close to their ground states has come under intensified scrutiny. Such studies are motivated by the emergence of model systems exhibiting chaotic fluctuations throughout the entire spectrum [the Sachdev-Ye-Kitaev (SYK) model being a renowned representative] as well as by the physics of holographic principles, which likewise unfold close to ground states. Interpreting the edge of the spectrum as a quantum critical point, here we combine a wide range of analytical and numerical methods to the identification and comprehensive description of two different universality classes: the near edge physics of “sparse” and the near edge of “dense” chaotic systems. The distinction lies in the ratio between the number of a system's random parameters and its Hilbert space dimension, which is exponentially small or algebraically small in the sparse and dense case, respectively. Notable representatives of the two classes are generic chaotic many-body models (sparse) and invariant random matrix ensembles or chaotic gravitational systems (dense). While the two families share identical spectral correlations at energy scales comparable to the level spacing, the density of states and its fluctuations near the edge are different. Considering the SYK model as a representative of the sparse class, we apply a combination of field theory and exact diagonalization to a detailed discussion of its edge spectrum. Conversely, Jackiw-Teitelboim gravity is our reference model for the dense class, where an analysis of the gravitational path integral and random matrix theory reveal universal differences to the sparse class, whose implications for the construction of holographic principles we discuss. Published by the American Physical Society 2024

Altland, Alexander (ORCID:0000000229914805)↗
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↗
DOE OSTI2024

Coupling and recoupling coefficients for Wigner’s U(4) supermultiplet symmetry

A novel procedure for evaluating Wigner coupling coefficients and Racah recoupling coefficients for U(4) in two group–subgroup chains is presented. The canonical U(4) > U(3) > U(2) > U(1) coupling and recoupling coefficients are applicable to any system that possesses U(4) symmetry, while the physical U(4) coupling coefficients are more specific to nuclear structure studies that utilize Wigner’s supermultiplet symmetry concept. The procedure that is proposed sidesteps the use of binomial coefficients and alternating sum series and consequently enables fast and accurate computation of any and all U(4)-underpinned features. The inner multiplicity of a (S, T) pair within a single U(4) > SU S (2) Ⓧ SU T (2) irreducible representation is obtained from the dimension of the null space of the SU(2) raising generators, while the resolution for the outer multiplicity follows from the work of Alex et al. on U(N) . It is anticipated that a C++ library will ultimately be available for determining generic coupling and recoupling coefficients associated with both the canonical and the physical group–subgroup chains of U(4).

Cross-Coupling Reaction↗
DOE OSTI2022

Nucleon-pair truncation of the shell model for medium-heavy nuclei

Background: Establishing computationally tractable models of atomic nuclei is a long-time goal of nuclear structure physics. A flexible framework which easily includes excited states and many-body correlations is the configuration-interaction shell model (SM), but the exponential growth of the basis means one needs an efficient truncation scheme, ideally one that includes both deformation and pairing correlations. Purpose: Here, we propose an efficient truncation scheme of the SM: starting from a pair condensate variationally defined by Hartree-Fock single-particle states and the particle-number conserved Bardeen-Cooper-Schrieffer (NBCS) approximation, we carry out projection of states with good angular momentum. Methods: After generating Hartree-Fock single-particle states with Kramers degeneracy in a SM space, we optimize the pair amplitudes in the NBCS by minimizing the energy, and then use linear algebra projection (LAP) of states with good angular momentum. Both NBCS and LAP are computationally fast. Results: Our calculations yield good agreement with full configuration-interaction SM calculations for low-lying states of transitional and rotational nuclei with axially symmetric and triaxial deformation in medium- and heavy-mass regions: 44,46,48 Ti, 48,50 Cr, 52 Fe, 60,62,64 Zn, 66,68 Ge, 68 Se, and 108,110 Xe. We predict low-lying states of 112–114 Ba and 116–120 Ce, nuclei difficult to reach by large-scale SM calculations. Conclusions: Both pair correlation and the configuration mixing between different intrinsic states play a key role in reproducing collectivity and shape coexistence, demonstrating the utility of this truncation scheme of the SM to study transitional and deformed nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Structure of Odd-A Ag Isotopes Studied via Algebraic Approaches

The structure of the odd-A silver isotopes Ag 103–115 is discussed within the frame of the interacting boson–fermion model (IBFM). An overview of their key properties is presented, with a particular attention paid to the “ J -1 anomaly”, represented by an abnormal ordering of the lowest 7/2 + and 9/2 + states. By examining previously published data and newly performed calculations, it is demonstrated that the experimentally known level schemes and electromagnetic properties of Ag 103–115 can be reproduced well within IBFM-1 by using a consistent set of model parameters. The contribution of different single-particle orbitals to the structure of the lowest-lying excited nuclear states in Ag 103–115 is discussed. Given that the J-1 anomaly brings down the 7/2 + level from the j −3 multiplet to energies, which can be thermally populated in hot stellar environments, the importance of low-lying excited states in odd-A silver isotopes for astrophysical processes is outlined.

IBFM-1↗
NASA NTRS1989

Labeled trees and the efficient computation of derivations

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Grossman, Robert↗
NASA NTRS1998

Lightning Radio Source Retrieval Using Advanced Lightning Direction Finder (ALDF) Networks

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing and arrival time of lightning radio emissions. Solutions for the plane (i.e., no Earth curvature) are provided that implement all of tile measurements mentioned above. Tests of the retrieval method are provided using computer-simulated data sets. We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. In the absence of measurement errors, quadratic root degeneracy (no source location ambiguity) is shown to exist exactly on the outer sensor baselines for arbitrary non-collinear network geometries. The accuracy of the quadratic planar method is tested with computer generated data sets. The results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 deg. We also note some of the advantages and disadvantages of these methods over the nonlinear method of chi(sup 2) minimization employed by the National Lightning Detection Network (NLDN) and discussed in Cummins et al.(1993, 1995, 1998).

Koshak, William J.↗
NASA NTRS1997

ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

Koshak, W. J.↗
DOE OSTI2024

Open-closed string duality, branes, and topological recursion

We consider matrix models exhibiting open-closed string duality in two-dimensional string theories with various amounts of supersymmetry. In particular, a relationship between matrix models in the β = 2 Wigner-Dyson class and models in the (1 + 2Γ, 2) Altland-Zirnbauer class relates the perturbative solutions of the two systems’ string equations. Point-like operator insertions in the closed string theory are mapped to the topological expansion of the free energy in the open string theory. We compute correlation functions of macroscopic loop operators and FZZT branes in a general topological gravity background. The relationship between the topological recursion of moduli space volumes and branes is discussed by analyzing the Virasoro conditions in the matrix models.

2D Gravity↗
NASA NTRS2000

Data Retrieval Algorithms for Validating the Optical Transient Detector and the Lightning Imaging Sensor

A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions. Solutions for the plane (i.e., no earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated datasets, and the relative influence of bearing and arrival time data an the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA:s Optical Transient Detector and Lightning Imaging Sensor. A quadratic planar solution that is useful when only three arrival time measurements are available is also introduced. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in sc)iirce location, Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated datasets, and the results are generally better than those obtained from the three-station linear planar method when bearing errors are about 2 deg.

Koshak, W. J.↗
DOE OSTI2020

η-pairing in Hubbard models: From spectrum generating algebras to quantum many-body scars

In this work, we revisit the η-pairing states in Hubbard models and explore their connections to quantum many-body scars to discover a universal scars mechanism. η-pairing occurs due to an algebraic structure known as a spectrum generating algebra (SGA), giving rise to equally spaced towers of eigenstates in the spectrum. We generalize the original η-pairing construction and show that several Hubbard-like models on arbitrary graphs exhibit SGAs, including ones with disorder and spin-orbit coupling. We further define a restricted spectrum generating algebra (RSGA) and give examples of perturbations to the Hubbard-like models that preserve an equally spaced tower of the original model as eigenstates. The states of the surviving tower exhibit a subthermal entanglement entropy, and we analytically obtain parameter regimes for which they lie in the bulk of the spectrum, showing that they are exact quantum many-body scars. The RSGA framework also explains the equally spaced towers of eigenstates in several well-known models of quantum scars, including the Affleck-Kennedy-Lieb-Tasaki model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Design Considerations for GPU-based Mixed Integer Programming on Parallel Computing Platforms

Mixed Integer Programming (MIP) is a powerful abstraction in combinatorial optimization that finds real-life application across many significant sectors. The recent proliferation of graphical processing unit (GPU)-based accelerated computing architectures in large-scale parallel computing or supercomputing presents new opportunities as well as challenges in the advancement of MIP solver technology to effectively use the new accelerated computing platforms and scale to large parallel systems. Here, we recount the conventional processor-based strategies and focus on configurations where the most promising intersection lies between parallel MIP solver approaches and the specific strengths of accelerated parallel platforms. We note that the best potential lies in solving problems whose individual matrix sizes (of the linear program relaxation) fit entirely within one accelerator's memory and whose branch-and-bound (or branch-and-cut) trees cannot be fully contained within a small number of computational nodes. Additionally, we identify ideal features of computational linear algebra support on GPU accelerators that would help advance this direction of scalable parallel solution of MIP problems on GPU-based accelerated computing architectures.

Perumalla, Kalyan↗
NASA NTRS1999

A Method to Solve Interior and Exterior Camera Calibration Parameters for Image Resection

An iterative method is presented to solve the internal and external camera calibration parameters, given model target points and their images from one or more camera locations. The direct linear transform formulation was used to obtain a guess for the iterative method, and herein lies one of the strengths of the present method. In all test cases, the method converged to the correct solution. In general, an overdetermined system of nonlinear equations is solved in the least-squares sense. The iterative method presented is based on Newton-Raphson for solving systems of nonlinear algebraic equations. The Jacobian is analytically derived and the pseudo-inverse of the Jacobian is obtained by singular value decomposition.

Samtaney, Ravi↗