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 19 records

Applications of Algebraic Geometry to Systems Theory

Basic theorems of algebraic geometry are applied to prove some pole-placement theorems, including an improved version of pole placement with output feedback. Examples are given which show the limitations of the algebro-geometric theorems and their potential value for systems theory. This paper and those to follow might contribute towards making the powerful theorems of modern algebraic geometry accessible and applicable to problems of engineering.

Hermann, Robert↗

A new application of algebraic geometry to systems theory

Following an introduction to algebraic geometry, the dominant morphism theorem is stated, and the application of this theorem to systems-theoretic problems, such as the feedback problem, is discussed. The Gaussian elimination method used for solving linear equations is shown to be an example of a dominant morphism.

Martin, C. F.↗

On the algebraic geometry of the output feedback pole placement map

Pole placement by output feedback is based on a concept that a transfer function can be considered as a curve in a Grassmanian manifold, so that pole placement consists of finding a special hypersurface in the manifold which intersects the curve at a prescribed set of points. An equation is derived for the number of different gains which yield the same set of poles in the case where the number of output feedback gains equals the number of poles of the system.

Brockett, R. W.↗

On families of systems and deformations

Until recently, there has not been any systematic effort towards a theory of systems with parameter variations. It is presently suggested that the concept of families of systems is basic to such an effort, and entails the techniques of Lie theory, differential geometry, and algebraic geometry. Attention is given to the geometric characterization of certain families of systems that appear in control and identification problems. The ways in which families of systems degenerate as parameter variations become large are isolated, using the topological rather than algebraic geometric case.

Krishnaprasad, P. S.↗

Linear systems with structure group and their feedback invariants

A general method described by Hermann and Martin (1976) for the study of the feedback invariants of linear systems is considered. It is shown that this method, which makes use of ideas of topology and algebraic geometry, is very useful in the investigation of feedback problems for which the classical methods are not suitable. The transfer function as a curve in the Grassmanian is examined. The general concepts studied in the context of specific systems and applications are organized in terms of the theory of Lie groups and algebraic geometry. Attention is given to linear systems which have a structure group, linear mechanical systems, and feedback invariants. The investigation shows that Lie group techniques are powerful and useful tools for analysis of the feedback structure of linear systems.

Martin, C.↗

On curve veering and flutter of rotating blades

The eigenvalues of rotating blades usually change with rotation speed according to the Stodola-Southwell criterion. Under certain circumstances, the loci of eigenvalues belonging to two distinct modes of vibration approach each other very closely, and it may appear as if the loci cross each other. However, our study indicates that the observable frequency loci of an undamped rotating blade do not cross, but must either repel each other (leading to 'curve veering'), or attract each other (leading to 'frequency coalescence'). Our results are reached by using standard arguments from algebraic geometry--the theory of algebraic curves and catastrophe theory. We conclude that it is important to resolve an apparent crossing of eigenvalue loci into either a frequency coalescence or a curve veering, because frequency coalescence is dangerous since it leads to flutter, whereas curve veering does not precipitate flutter and is, therefore, harmless with respect to elastic stability.

Afolabi, Dare↗

A Survey of Mathematical Structures for Lunar Networks

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay tolerant networking↗

Advances in Modeling Solar System Internet Structures and their Data Flows

With an ever-increasing presence in space, there is also an increasing burden on existing communications infrastructure. We are heading towards an inflection point where the traditional approach of scheduled, single-path communications for space will no longer be viable. One answer is Delay Tolerant Networking (DTN), which takes the once disparate system of point-to-point links and unifies them in a networked architecture, thereby making communications more scalable. However, much work remains for discovering and harnessing the underlying theory of DTN. For example, in the terrestrial setting the interplay between routing domains is well-understood, however this is not the case in DTNs. In this paper, we build up the fundamental foundations of DTN, with an emphasis on modeling time varying networks and data flows across them, with examples of cross-domain routing in a DTN. A lofty goal of DTN is to enable the so-called Solar System Internet (SSI), which implies a standardized and robust suite of protocols. These protocols include routing across disconnected networks using store, carry, and forward mechanisms, which is necessary due to the disconnections, delays, and mobility intrinsic to space networks. Due to these factors, each of which generalize traditional networking, there is a deep and rich theory of DTNs. Here we build off of past successes to broaden this theory while striving to keep actionable results a goal for future implementations and operations. The approach includes modeling the unicast, broadcast, and multicast communications using the language of hypergraphs, which capture the geometric properties of such networked communications algebraically. Also inherent to these networks is their time-varying nature, particularly given mobility, and hence we also cultivate modeling techniques that respect this time dependence. This leads us to develop models using tools from category theory and algebraic geometry, which provide a language well-suited to describing synchronization and optimization over such networks. We also introduce and study a novel generalization of curvature applicable to time-evolving networks, which provides quantitative controls on diffusion processes on the network. Because an interplanetary network would feature links with propagation delays the preclude discovery (feedback) mechanisms, they will always feature a scheduled component. However, it is beneficial to support discovery where possible. While DTNs do not yet have strong definitions for their analogues of autonomous systems or network areas, we show how to join dynamic and schedule-based routing domains, using the language of sheaves, which marks progress towards such definitions. We conclude with a discussion of the progress made, as well as suggestions for future work.

Delay Tolerant Networking↗

Space Mathematics: A Resource for Secondary School Teachers

A collection of mathematical problems related to NASA space science projects is presented. In developing the examples and problems, attention was given to preserving the authenticity and significance of the original setting while keeping the level of mathematics within the secondary school curriculum. Computation and measurement, algebra, geometry, probability and statistics, exponential and logarithmic functions, trigonometry, matrix algebra, conic sections, and calculus are among the areas addressed.

Kastner, Bernice↗

Formal Verification of the Interaction Between Semi-Algebraic Sets and Real Analytic Functions

Semi-algebraic sets and real analytic functions are fundamental concepts in Real Algebraic Geometry and Real Analysis, respectively. These concepts interact in the study of Differential Equations, where the real analytic solution to a differential equation is known to enter or exit a semi-algebraic set in a predicable way. Motivated to enhance the capability to reason about differential equations in the Prototype Verification System (PVS), a formalization of multivariate polynomials, semi-algebraic sets, and real analytic functions is developed. The favorable way that a real analytic function enters and exits a semi-algebraic set is proven. It is further shown that if the function is assumed to be smooth, a slightly weaker assumption than real analytic, these favorable interactions with semi-algebraic sets may fail.

Real analytic functions↗

On the stabilizability of multivariable systems by minimum order compensation

In this paper, a derivation is provided of the necessary condition, mp equal to or greater than n, for stabilizability by constant gain feedback of the generic degree n, p x m system. This follows from another of the main results, which asserts that generic stabilizability is equivalent to generic solvability of a deadbeat control problem, provided mp equal to or less than n. Taken together, these conclusions make it possible to make some sharp statements concerning minimum order stabilization. The techniques are primarily drawn from decision algebra and classical algebraic geometry and have additional consequences for problems of stabilizability and pole-assignability. Among these are the decidability (by a Sturm test) of the equivalence of generic pole-assignability and generic stabilizability, the semi-algebraic nature of the minimum order, q, of a stabilizing compensator, and the nonexistence of formulae involving rational operations and extraction of square roots for pole-assigning gains when they exist, answering in the negative a question raised by Anderson, Bose, and Jury (1975).

Byrnes, C. I.↗

Application of Navier-Stokes code PAB3D with kappa-epsilon turbulence model to attached and separated flows

A three-dimensional Navier-Stokes solver was used to determine how accurately computations can predict local and average skin friction coefficients for attached and separated flows for simple experimental geometries. Algebraic and transport equation closures were used to model turbulence. To simulate anisotropic turbulence, the standard two-equation turbulence model was modified by adding nonlinear terms. The effects of both grid density and the turbulence model on the computed flow fields were also investigated and compared with available experimental data for subsonic and supersonic free-stream conditions.

Abdol-Hamid, Khaled S.↗

A Study of Visualization for Mathematics Education

Graphical representations such as figures, illustrations, and diagrams play a critical role in mathematics and they are equally important in mathematics education. However, graphical representations in mathematics textbooks are static, Le. they are used to illustrate only a specific example or a limited set. of examples. By using computer software to visualize mathematical principles, virtually there is no limit to the number of specific cases and examples that can be demonstrated. However, we have not seen widespread adoption of visualization software in mathematics education. There are currently a number of software packages that provide visualization of mathematics for research and also software packages specifically developed for mathematics education. We conducted a survey of mathematics visualization software packages, summarized their features and user bases, and analyzed their limitations. In this survey, we focused on evaluating the software packages for their use with mathematical subjects adopted by institutions of secondary education in the United States (middle schools and high schools), including algebra, geometry, trigonometry, and calculus. We found that cost, complexity, and lack of flexibility are the major factors that hinder the widespread use of mathematics visualization software in education.

Daugherty, Sarah C.↗

A Formally-Verified Decision Procedure for Univariate Polynomial Computation Based on Sturm's Theorem

Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

Narkawicz, Anthony J.↗

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗

Grid generation and inviscid flow computation about cranked-winged airplane geometries

An algebraic grid generation procedure that defines a patched multiple-block grid system suitable for fighter-type aircraft geometries with fuselage and engine inlet, canard or horizontal tail, cranked delta wing and vertical fin has been developed. The grid generation is based on transfinite interpolation and requires little computational power. A finite-volume Euler solver using explicit Runge-Kutta time-stepping has been adapted to this grid system and implemented on the VPS-32 vector processor with a high degree of vectorization. Grids are presented for an experimental aircraft with fuselage, canard, 70-20-cranked wing, and vertical fin. Computed inviscid compressible flow solutions are presented for Mach 2 at 3.79, 7 and 10 deg angles of attack. Conmparisons of the 3.79 deg computed solutions are made with available full-potential flow and Euler flow solutions on the same configuration but with another grid system. The occurrence of an unsteady solution in the 10 deg angle of attack case is discussed.

Eriksson, L.-E.↗

Algebraic grid generation for complex geometries

An efficient computer program called GRID2D/3D has been developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2D and 3D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation. The distribution of grid points within the spatial domain is controlled by stretching functions and grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For 2D spatial domains the boundary curves are constructed by using either cubic or tension spline interpolation. For 3D spatial domains the boundary surfaces are constructed by using a new technique, developed in this study, referred to as 3D bidirectional Hermite interpolation.

Shih, T. I.-P.↗