Search NASA⌕ Search

SEARCH · Search NASA

Results for “General Algebraic Systems”

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 253 records · Page 14

PROTEUS two-dimensional Navier-Stokes computer code, version 1.0. Volume 1: Analysis description

A new computer code was developed to solve the two-dimensional or axisymmetric, Reynolds averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The thin-layer or Euler equations may also be solved. Turbulence is modeled using an algebraic eddy viscosity model. The objective was to develop a code for aerospace applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The equations are written in nonorthogonal body-fitted coordinates, and solved by marching in time using a fully-coupled alternating direction-implicit procedure with generalized first- or second-order time differencing. All terms are linearized using second-order Taylor series. The boundary conditions are treated implicitly, and may be steady, unsteady, or spatially periodic. Simple Cartesian or polar grids may be generated internally by the program. More complex geometries require an externally generated computational coordinate system. The documentation is divided into three volumes. Volume 1 is the Analysis Description, and describes in detail the governing equations, the turbulence model, the linearization of the equations and boundary conditions, the time and space differencing formulas, the ADI solution procedure, and the artificial viscosity models.

Towne, Charles E.↗

PROTEUS two-dimensional Navier-Stokes computer code, version 1.0. Volume 2: User's guide

A new computer code was developed to solve the two-dimensional or axisymmetric, Reynolds averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The thin-layer or Euler equations may also be solved. Turbulence is modeled using an algebraic eddy viscosity model. The objective was to develop a code for aerospace applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The equations are written in nonorthogonal body-fitted coordinates, and solved by marching in time using a fully-coupled alternating direction-implicit procedure with generalized first- or second-order time differencing. All terms are linearized using second-order Taylor series. The boundary conditions are treated implicitly, and may be steady, unsteady, or spatially periodic. Simple Cartesian or polar grids may be generated internally by the program. More complex geometries require an externally generated computational coordinate system. The documentation is divided into three volumes. Volume 2 is the User's Guide, and describes the program's general features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗

PROTEUS two-dimensional Navier-Stokes computer code, version 1.0. Volume 3: Programmer's reference

A new computer code was developed to solve the 2-D or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The thin-layer or Euler equations may also be solved. Turbulence is modeled using an algebraic eddy viscosity model. The objective was to develop a code for aerospace applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The equations are written in nonorthogonal body-fitted coordinates, and solved by marching in time using a fully-coupled alternating-direction-implicit procedure with generalized first- or second-order time differencing. All terms are linearized using second-order Taylor series. The boundary conditions are treated implicitly, and may be steady, unsteady, or spatially periodic. Simple Cartesian or polar grids may be generated internally by the program. More complex geometries require an externally generated computational coordinate system. The documentation is divided into three volumes. Volume 3 is the Programmer's Reference, and describes the program structure, the FORTRAN variables stored in common blocks, and the details of each subprogram.

Towne, Charles E.↗

SU(1,1) Echoes for Breathers in Quantum Gases

Though the celebrated spin echoes have been widely used to reverse quantum dynamics, they are not applicable to systems whose constituents are beyond the control of the su(2) algebra. In this work, we design echoes to reverse quantum dynamics of breathers in three-dimensional unitary fermions and two-dimensional bosons and fermions with contact interactions, which are governed by an underlying su(1, 1) algebra. Geometrically, SU(1, 1) echoes produce closed trajectories on a single or multiple Poincaré disks and thus could recover any initial states without changing the sign of the Hamiltonian. In particular, the initial shape of a breather determines the superposition of trajectories on multiple Poincaré disks and whether the revival time has period multiplication. Our work provides physicists with a recipe to tailor collective excitations of interacting many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

String membrane nets from higher-form gauging: An alternate route to 𝑝-string condensation

We present a new perspective on the $p$-string condensation procedure for constructing 3+1D fracton phases by implementing this process via the gauging of higher-form symmetries. Specifically, we show that gauging a 1-form symmetry in 3+1D that is generated by Abelian anyons in isotropic stacks of 2+1D topological orders naturally results in a 3+1D $p$-string condensed phase, providing a controlled non-perturbative construction that realizes fracton orders. This approach clarifies the symmetry principles underlying $p$-string condensation and generalizes the familiar connection between anyon condensation and one-form gauging in two spatial dimensions. We demonstrate this correspondence explicitly in both field theories and lattice models: in field theory, we derive the foliated field theory description of the $\mathbb{Z}_N$ X-Cube model by gauging a higher-form symmetry in stacks of 2+1D $\mathbb{Z}_N$ gauge theories; on the lattice, we show how gauging a diagonal 1-form symmetry in isotropic stacks of $G$-graded string-net models leads to string-membrane-nets hosting restricted mobility excitations. This perspective naturally generalizes to spatial dimensions $d \geq 2$ and provides a step towards building an algebraic theory of $p$-string condensation.

Anyons↗

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗

Current algebra approach to two-dimensional interacting chiral metals

In this study, we reinterpret the chiral U(N) Wess-Zumino-Witten (WZW) model at level k>1 in (1+1) dimensions as an interacting chiral metal in two space dimensions. In this reinterpretation, spatial translations along one of the spatial dimensions in the two-dimensional chiral metal arise from a generator of the U(N) symmetry of the WZW model. The WZW model at k=1 is equivalent to Balents and Fisher's free chiral metal. Here, the U(N) symmetry corresponds to the IR symmetry of a chiral Fermi gas with (half of a) Fermi surface, with N equal to the number of points on the Fermi surface. We argue that exactly solvable interacting generalizations occur for levels k>1. Importantly, these interacting chiral metals maintain the U(N) symmetry of the free system. We calculate two-point correlation functions of the single-particle fermion operator, the U⁡(1) number density, and current operators in these theories for general k. We find that interactions (k>1) produce 1/N corrections to scaling of the single-particle fermion operator as N→∞ and renormalize the amplitudes of the density and current two-point functions. This construction illustrates the ersatz Fermi liquid proposal of Else et al.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient and Singularity-Aware Inverse Kinematics for 6-DOF and 7-DOF Revolute Manipulators

Inverse kinematics (IK) for 6-DOF and 7-DOF revolute robot manipulators may be decomposed into canonical subproblems which find the angles on circles where they intersect with other geometric objects. We present new algebraic solutions and geometric interpretations for six subproblems. We demonstrate significant performance improvements over existing IK methods. 7-DOF manipulators have one redundant DOF to parameterize, so we introduce the general SEW angle, which generalizes the conventional SEW angle but with an arbitrary reference direction function. One special choice, the stereographic SEW angle, has a singularity when the wrist is on a half-line instead of a full line.

Computational Geometry↗

Multilevel-in-width training for deep neural network regression

A common challenge in regression is that for many problems, the degrees of freedom required for a high-quality solution also allows for overfitting. Regularization is a class of strategies that seek to restrict the range of possible solutions so as to discourage overfitting while still enabling good solutions, and different regularization strategies impose different types of restrictions. In this paper, we present a multilevel regularization strategy that constructs and trains a hierarchy of neural networks, each of which has layers that are wider versions of the previous network's layers. Here, we draw intuition and techniques from the field of Algebraic Multigrid (AMG), traditionally used for solving linear and nonlinear systems of equations, and specifically adapt the Full Approximation Scheme (FAS) for nonlinear systems of equations to the problem of deep learning. Training through V-cycles then encourage the neural networks to build a hierarchical understanding of the problem. We refer to this approach as multilevel-in-width to distinguish from prior multilevel works which hierarchically alter the depth of neural networks. The resulting approach is a highly flexible framework that can be applied to a variety of layer types, which we demonstrate with both fully connected and convolutional layers. We experimentally show with PDE regression problems that our multilevel training approach is an effective regularizer, improving the generalize performance of the neural networks studied.

97 MATHEMATICS AND COMPUTING↗

Riemann-Hilbert correspondence and blown up surface defects

The relationship of two dimensional quantum field theory and isomonodromic deformations of Fuchsian systems has a long history. Recently four-dimensional N = 2 gauge theories joined the party in a multitude of roles. In this paper we study the vacuum expectation values of intersecting half-BPS surface defects in SU(2) theory with N f = 4 fundamental hypermultiplets. We show they form a horizontal section of a Fuchsian system on a sphere with 5 regular singularities, calculate the monodromy, and define the associated isomonodromic tau-function. Using the blowup formula in the presence of half-BPS surface defects, initiated in the companion paper, we obtain the GIL formula, establishing an unexpected relation of the topological string/free fermion regime of supersymmetric gauge theory to classical integrability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

On a class of unsteady three-dimensional Navier Stokes solutions relevant to rotating disc flows: Threshold amplitudes and finite time singularities

A class of exact steady and unsteady solutions of the Navier Stokes equations in cylindrical polar coordinates is given. The flows correspond to the motion induced by an infinite disc rotating with constant angular velocity about the z-axis in a fluid occupying a semi-infinite region which, at large distances from the disc, has velocity field proportional to (x,-y,O) with respect to a Cartesian coordinate system. It is shown that when the rate of rotation is large, Karman's exact solution for a disc rotating in an otherwise motionless fluid is recovered. In the limit of zero rotation rate a particular form of Howarth's exact solution for three-dimensional stagnation point flow is obtained. The unsteady form of the partial differential system describing this class of flow may be generalized to time-periodic equilibrium flows. In addition the unsteady equations are shown to describe a strongly nonlinear instability of Karman's rotating disc flow. It is shown that sufficiently large perturbations lead to a finite time breakdown of that flow whilst smaller disturbances decay to zero. If the stagnation point flow at infinity is sufficiently strong, the steady basic states become linearly unstable. In fact there is then a continuous spectrum of unstable eigenvalues of the stability equations but, if the initial value problem is considered, it is found that, at large values of time, the continuous spectrum leads to a velocity field growing exponentially in time with an amplitude decaying algebraically in time.

Hall, Philip↗

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

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗

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

Shape and Stress Sensing of Multilayered Composite and Sandwich Structures Using an Inverse Finite Element Method

The marked increase in the use of composite and sandwich material systems in aerospace, civil, and marine structures leads to the need for integrated Structural Health Management systems. A key capability to enable such systems is the real-time reconstruction of structural deformations, stresses, and failure criteria that are inferred from in-situ, discrete-location strain measurements. This technology is commonly referred to as shape- and stress-sensing. Presented herein is a computationally efficient shape- and stress-sensing methodology that is ideally suited for applications to laminated composite and sandwich structures. The new approach employs the inverse Finite Element Method (iFEM) as a general framework and the Refined Zigzag Theory (RZT) as the underlying plate theory. A three-node inverse plate finite element is formulated. The element formulation enables robust and efficient modeling of plate structures instrumented with strain sensors that have arbitrary positions. The methodology leads to a set of linear algebraic equations that are solved efficiently for the unknown nodal displacements. These displacements are then used at the finite element level to compute full-field strains, stresses, and failure criteria that are in turn used to assess structural integrity. Numerical results for multilayered, highly heterogeneous laminates demonstrate the unique capability of this new formulation for shape- and stress-sensing.

Cerracchio, Priscilla↗

Exact quantum scars in the chiral nonlinear Luttinger liquid

While the chiral linear Luttinger liquid is integrable via bosonization, its nonlinear counterpart does not admit for an analytic solution. In this work, we find a subextensive number of exact eigenstates for a large family of density-density interaction terms. These states are embedded in a continuum of strongly correlated excited states. The real-space entanglement entropy of some exact states scales logarithmically with system size while that of others has volume-law scaling. We introduce momentum-space entanglement as an unambiguous differentiator between these exact states and the remaining excited states. With regard to momentum space, the exact states behave as bona fide quantum many-body scars: they exhibit identically zero momentum-space entanglement, while typical eigenstates behave thermally. We corroborate this finding by a level statistics analysis. Here we detail the general formalism for systematically finding all interaction terms and associated exact states, and present a number of infinite exact state sequences extending to arbitrarily high energies. Unlike many previous examples of quantum many-body scars, the exact states uncovered here do not lie at equidistant energies and do not follow from a special operator algebra. Instead, they are uniquely enabled by the interplay of Fermi statistics and chirality.

36 MATERIALS SCIENCE↗