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 109 records · Page 6

Uneven Inflation Load Share Trends in Clusters

The use of parachute clusters for payload recovery is still seeing widespread use ever since the early days of WWII. By involving the (near) simultaneous deployment of several smaller and identical canopies connected to the payload, cluster systems offer flexibility in tailoring to needed descent rates and load management, as well as providing robustness against individual canopy deployment or opening failure. Their downside, of course, resides in the possibility of differing inflation rates by each cluster member as caused by deployment variability, canopy-to-canopy interference, etc. Such variability leads to the lead-lag phenomenon, which causes uneven loading among the parachutes, often times leaving a single canopy to take up a significant portion of the system’s inflation loads. Herein we investigate how serious such an effect can be in terms of the number N of cluster members, underinflation drag of the lagging canopies, inflation swiftness of the leader in comparison to the laggards’, disreefing cutter activation staggering and pre-disreefing drag area. Two new metrics are used to highlight load share unevenness, namely, the peak and average leader canopy riser load in comparison to the leader’s drag during no-lead-lag; and leader peak load, as compared to total peak load. Results are calculated from data collected in NASA’s Orion/CPAS test program, as well as from simple algebraic expressions informing leader drag as sustained in different cluster systems (i.e., of different N) and varying leader inflation time relative to the laggards. Generally, using large-N cluster systems confers better load sharing among canopies. However, and in deployments where significant lead-lag occur, large-N systems may feature greater leader overload excursions, oftentimes in excess of 50% the no-lead-lag levels. These excursions are particularly made worse when cutter activation among the members are far from simultaneous and the laggards’ pre-disreefing drag area is small in comparison to the leader’s.

parachutes↗

Stability of large-scale systems with stable and unstable subsystems.

The purpose of this paper is to develop new methods for constructing vector Liapunov functions and broaden the application of Liapunov's theory to stability analysis of large-scale dynamic systems. The application, so far limited by the assumption that the large-scale systems are composed of exponentially stable subsystems, is extended via the general concept of comparison functions to systems which can be decomposed into asymptotically stable subsystems. Asymptotic stability of the composite system is tested by a simple algebraic criterion. With minor technical adjustments, the same criterion can be used to determine connective asymptotic stability of large-scale systems subject to structural perturbations. By redefining the constraints imposed on the interconnections among the subsystems, the considered class of systems is broadened in an essential way to include composite systems with unstable subsystems. In this way, the theory is brought substantially closer to reality since stability of all subsystems is no longer a necessary assumption in establishing stability of the overall composite system.

Grujic, Lj. T.↗

Asymptotic stability and instability of large-scale systems

The purpose of this paper is to develop new methods for constructing vector Lyapunov functions and broaden the application of Lyapunov's theory to stability analysis of large-scale dynamic systems. The application, so far limited by the assumption that the large-scale systems are composed of exponentially stable subsystems, is extended via the general concept of comparison functions to systems which can be decomposed into asymptotically stable subsystems. Asymptotic stability of the composite system is tested by a simple algebraic criterion. By redefining interconnection functions among the subsystems according to interconnection matrices, the same mathematical machinery can be used to determine connective asymptotic stability of large-scale systems under arbitrary structural perturbations.

Grujic, L. T.↗

Numerical grid generation; Proceedings of the Symposium on Numerical Generation of Curvilinear Coordinate Systems and Their Use in the Numerical Solution of Partial Differential Equations, Nashville, TN, April 13-16, 1982

General curvilinear coordinate systems are considered along with the error induced by coordinate systems, basic differential models for coordinate generation, elliptic grid generation, conformal grid generation, algebraic grid generation, orthogonal grid generation, patched coordinate systems, and solid mechanics applications of boundary fitted coordinate systems. Attention is given to coordinate system control and adaptive meshes, the application of body conforming curvilinear grids for finite difference solution of external flow, the use of solution adaptive grids in solving partial differential equations, adaptive gridding for finite difference solutions to heat and mass transfer problems, and the application of curvilinear coordinate generation techniques to the computation of internal flows. Other topics explored are related to the solution of nonlinear water wave problems using boundary-fitted coordinate systems, the numerical modeling of estuarine hydrodynamics on a boundary-fitted coordinate system, and conformal grid generation for multielement airfoils.

Thompson, J. F.↗

The kinetic origin of the fluid helicity—A symmetry in the kinetic phase space

Helicity, a topological degree that measures the winding and linking of vortex lines, is preserved by ideal (barotropic) fluid dynamics. In the context of the Hamiltonian description, the helicity is a Casimir invariant characterizing a foliation of the associated Poisson manifold. Casimir invariants are special invariants that depend on the Poisson bracket, not on the particular choice of the Hamiltonian. The total mass (or particle number) is another Casimir invariant, whose invariance guarantees the mass (particle) conservation (independent of any specific choice of the Hamiltonian). In a kinetic description (e.g., that of the Vlasov equation), the helicity is no longer an invariant (although the total mass remains a Casimir of the Vlasov’s Poisson algebra). The implication is that some “kinetic effect” can violate the constancy of the helicity. To elucidate how the helicity constraint emerges or submerges, we examine the fluid reduction of the Vlasov system; the fluid (macroscopic) system is a “sub-algebra” of the kinetic (microscopic) Vlasov system. In the Vlasov system, the helicity can be conserved if a special helicity symmetry condition holds. To put it another way, breaking helicity symmetry induces a change in the helicity. We delineate the geometrical meaning of helicity symmetry and show that for a special class of flows (the so-called epi-two-dimensional flows), the helicity symmetry is written as ∂γ = 0 for a coordinate γ of the configuration space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ndarts

Ndarts software provides algorithms for computing quantities associated with the dynamics of articulated, rigid-link, multibody systems. It is designed as a general-purpose dynamics library that can be used for the modeling of robotic platforms, space vehicles, molecular dynamics, and other such applications. The architecture and algorithms in Ndarts are based on the Spatial Operator Algebra (SOA) theory for computational multibody and robot dynamics developed at JPL. It uses minimal, internal coordinate models. The algorithms are low-order, recursive scatter/ gather algorithms. In comparison with the earlier Darts++ software, this version has a more general and cleaner design needed to support a larger class of computational dynamics needs. It includes a frames infrastructure, allows algorithms to operate on subgraphs of the system, and implements lazy and deferred computation for better efficiency. Dynamics modeling modules such as Ndarts are core building blocks of control and simulation software for space, robotic, mechanism, bio-molecular, and material systems modeling.

Jain, Abhinandan↗

Minimizing Weight of Structural Designs

Approximation Concepts Code for Efficient Structural Synthesis (ACCESS3) combines methods to offer structural system designer powerful, efficient tool for synthesis of minimum-weight designs. Approximation concepts convert general structural synthesis problem into sequence of explicit problems of separable algebraic form; dual method exploits separable form to construct sequence of explicit dual functions.

Schmit, L. A., Jr.↗

Modeling of steady, rotational, transonic winds from rotating stars and galaxies

The theory of steady transonic winds from condensed bodies is extended to general, two-dimensional, axisymmetric systems. A stream function is used to reduce the gasdynamics equations to a single, second-order differential equation plus an algebraic equation for the density. The approach extends Parker's (1958) quasi-one-dimensional theory, which uses Bernoulli's theorem, to a complete two-dimensional calculation which includes vorticity and rotation. The conceptual basis of the stream function approach is described in detail, and a numerical method for solving the resulting equations is presented. The applications illustrate solutions for stellar (spherical source surface) and galactic (oblate spheroidal source surface) models. Among other things, it is found that for rapidly rotating stellar models the Coriolis force dominates the centrifugal terms and the streamlines bend toward the rotation axis as a consequence of the axisymmetry. For both the rotating and nonrotating galaxy models, the streamlines bend toward the equator.

Kopriva, D. A.↗

Rapid Numerical Simulation of Viscous Axisymmetric Flow Fields

A two-dimensional Navier-Stokes code has been developed for rapid numerical simulation of axisymmetric flow fields, including flow fields with an azimuthal velocity component. The azimuthal-invariant Navier-Stokes equations in a cylindrical coordinate system are mapped to a general body-fitted coordinate system, with the streamwise viscous terms then neglected by applying the thin-layer approximation. Turbulence effects are modeled using an algebraic model, typically the Baldwin-Lomax turbulence model, although a modified Cebeci-Smith model can also be used. The equations are discretized using central finite differences and solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Results are presented for calculations of supersonic flow over a waisted body-of-revolution, transonic flow through a normal shock wave in a straight circular duct of constant cross sectional area, swirling supersonic (inviscid) flow through a strong shock in a straight radial duct, and swirling subsonic flow in an annular-to-circular diffuser duct. Comparisons between computed and experimental results are in fair to good agreement, demonstrating that the viscous code can be a useful tool for practical engineering design and analysis work.

Tweedt, Daniel L.↗

In-Flight Aeroelastic Stability of the Thermal Protection System on the NASA HIAD, Part II: Nonlinear Theory and Extended Aerodynamics

Conical shell theory and a supersonic potential flow aerodynamic theory are used to study the nonlinear pressure buckling and aeroelastic limit cycle behavior of the thermal protection system for NASA's Hypersonic Inflatable Aerodynamic Decelerator. The structural model of the thermal protection system consists of an orthotropic conical shell of the Donnell type, resting on several circumferential elastic supports. Classical Piston Theory is used initially for the aerodynamic pressure, but was found to be insufficient at low supersonic Mach numbers. Transform methods are applied to the convected wave equation for potential flow, and a time-dependent aerodynamic pressure correction factor is obtained. The Lagrangian of the shell system is formulated in terms of the generalized coordinates for all displacements and the Rayleigh-Ritz method is used to derive the governing differential-algebraic equations of motion. Aeroelastic limit cycle oscillations and buckling deformations are calculated in the time domain using a Runge-Kutta method in MATLAB. Three conical shell geometries were considered in the present analysis: a 3-meter diameter 70 deg. cone, a 3.7-meter 70 deg. cone, and a 6-meter diameter 70 deg. cone. The 6-meter configuration was loaded statically and the results were compared with an experimental load test of a 6-meter HIAD. Though agreement between theoretical and experimental strains was poor, the circumferential wrinkling phenomena observed during the experiments was captured by the theory and axial deformations were qualitatively similar in shape. With Piston Theory aerodynamics, the nonlinear flutter dynamic pressures of the 3-meter configuration were in agreement with the values calculated using linear theory, and the limit cycle amplitudes were generally on the order of the shell thickness. The effect of axial tension was studied for this configuration, and increasing tension was found to decrease the limit cycle amplitudes when the circumferential elastic supports were neglected, but resulted in more complex behavior when the supports were included. The nominal flutter dynamic pressure of the 3.7-meter configuration was significantly lower than that of the 3-meter, and it was found that two sets of natural modes coalesce to flutter modes near the same dynamic pressure. This resulted in a significant drop in the limit cycle frequencies at higher dynamic pressures, where the flutter mode with the lower frequency becomes more critical. Pre-buckling pressure loads and the aerodynamic pressure correction factor were studied for all geometries, and these effects resulted in significantly lower flutter boundaries compared with Piston Theory alone. The maximum dynamic pressure predicted by aerodynamic simulations of a proposed 3.7-meter HIAD vehicle was still lower than any of the calculated flutter dynamic pressures, suggesting that aeroelastic effects for this vehicle are of little concern.

Goldman, Benjamin D.↗

Boundary-fitted coordinate systems for numerical solution of partial differential equations - A review

A comprehensive review of methods of numerically generating curvilinear coordinate systems with coordinate lines coincident with all boundary segments is given. Some general mathematical framework and error analysis common to such coordinate systems is also included. The general categories of generating systems are those based on conformal mapping, orthogonal systems, nearly orthogonal systems, systems produced as the solution of elliptic and hyperbolic partial differential equations, and systems generated algebraically by interpolation among the boundaries. Also covered are the control of coordinate line spacing by functions embedded in the partial differential operators of the generating system and by subsequent stretching transformation. Dynamically adaptive coordinate systems, coupled with the physical solution, and time-dependent systems that follow moving boundaries are treated. References reporting experience using such coordinate systems are reviewed as well as those covering the system development.

Thompson, J. F.↗

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗

Block smoothers and generalized ideal interpolation in AMG (Final Report)

The Pennsylvania State University (“Subcontractor”) worked on developing new parallel algebraic multilevel methods suitable for solving PDEs. Specifically, work on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications was completed. A main emphasis was on the design of new ideal algebraic multigrid interpolation for problems such as Maxwell’s equations where block smoothers are needed and the standard form of ideal interpolation is not an effective choice.

97 MATHEMATICS AND COMPUTING↗

Communications and information research: Improved space link performance via concatenated forward error correction coding

With the development of new advanced instruments for remote sensing applications, sensor data will be generated at a rate that not only requires increased onboard processing and storage capability, but imposes demands on the space to ground communication link and ground data management-communication system. Data compression and error control codes provide viable means to alleviate these demands. Two types of data compression have been studied by many researchers in the area of information theory: a lossless technique that guarantees full reconstruction of the data, and a lossy technique which generally gives higher data compaction ratio but incurs some distortion in the reconstructed data. To satisfy the many science disciplines which NASA supports, lossless data compression becomes a primary focus for the technology development. While transmitting the data obtained by any lossless data compression, it is very important to use some error-control code. For a long time, convolutional codes have been widely used in satellite telecommunications. To more efficiently transform the data obtained by the Rice algorithm, it is required to meet the a posteriori probability (APP) for each decoded bit. A relevant algorithm for this purpose has been proposed which minimizes the bit error probability in the decoding linear block and convolutional codes and meets the APP for each decoded bit. However, recent results on iterative decoding of 'Turbo codes', turn conventional wisdom on its head and suggest fundamentally new techniques. During the past several months of this research, the following approaches have been developed: (1) a new lossless data compression algorithm, which is much better than the extended Rice algorithm for various types of sensor data, (2) a new approach to determine the generalized Hamming weights of the algebraic-geometric codes defined by a large class of curves in high-dimensional spaces, (3) some efficient improved geometric Goppa codes for disk memory systems and high-speed mass memory systems, and (4) a tree based approach for data compression using dynamic programming.

Rao, T. R. N.↗

Composing preconditioners for multiphysics PDE systems with applications to Generalized MHD

New patch smoothers or relaxation techniques are developed for solving linear matrix equations coming from systems of discretized partial differential equations (PDEs). One key linear solver challenge for many PDE systems arises when the resulting discretization matrix has a near null space that has a large dimension, which can occur in generalized magnetohydrodynamic (GMHD) systems. Patch-based relaxation is highly effective for problems when the null space can be spanned by a basis of locally supported vectors. The patch-based relaxation methods that we develop can be used either within an algebraic multigrid (AMG) hierarchy or as stand-alone preconditioners. These patch-based relaxation techniques are a form of well-known overlapping Schwarz methods where the computational domain is covered with a series of overlapping sub-domains (or patches). Patch relaxation then corresponds to solving a set of independent linear systems associated with each patch. In the context of GMHD, we also reformulate the underlying discrete representation used to generate a suitable set of matrix equations. In general, deriving a discretization that accurately approximates the curl operator and the Hall term while also producing linear systems with physically meaningful near null space properties can be challenging. Unfortunately, many natural discretization choices lead to a near null space that includes non-physical oscillatory modes and where it is not possible to span the near null space with a minimal set of locally supported basis vectors. Further discretization research is needed to understand the resulting trade-offs between accuracy, stability, and ease in solving the associated linear systems.

97 MATHEMATICS AND COMPUTING↗

Quantum entropy and uncertainty for two-mode squeezed, coherent and intelligent spin states

We compute the quantum entropy for monomode and two-mode systems set in squeezed states. Thereafter, the quantum entropy is also calculated for angular momentum algebra when the system is either in a coherent or in an intelligent spin state. These values are compared with the corresponding values of the respective uncertainties. In general, quantum entropies and uncertainties have the same minimum and maximum points. However, for coherent and intelligent spin states, it is found that some minima for the quantum entropy turn out to be uncertainty maxima. We feel that the quantum entropy we use provides the right answer, since it is given in an essentially unique way.

Aragone, C.↗

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↗

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗