Mini-Workshop: Surface Modeling and Syzygies

The problem of determining the implicit equation of the image of a rational map φ : P2 99K P3 is of theoretical interest in algebraic geometry, and of practical importance in geometric modeling. There are essentially three methods which can be applied to the problem: Gröbner bases, resultants, and syzygies. Elimination via Gröbner basis methods tends to be computationally intensive and, being a general tool, is not adapted to the geometry of specific problems. Thus, it is primarily the latter two techniques which are used in practice. This is an extremely active area of research where many different perspectives come into play. The mini-workshop brought together a diverse group of researchers with different areas of expertise

Distance bounds of ϵ-points on hypersurfaces

ϵ-points were introduced by the authors (see [S. Pérez-Díaz, J.R. Sendra, J. Sendra, Parametrization of approximate algebraic curves by lines, Theoret. Comput. Sci. 315(2–3) (2004) 627–650 (Special issue); S. Pérez-Díaz, J.R. Sendra, J. Sendra, Parametrization of approximate algebraic surfaces by lines, Comput. Aided Geom. Design 22(2) (2005) 147–181; S. Pérez-Díaz, J.R. Sendra, J. Sendra, Distance properties of ϵ-points on algebraic curves, in: Series Mathematics and Visualization, Computational Methods for Algebraic Spline Surfaces, Springer, Berlin, 2005, pp. 45–61]) as a generalization of the notion of approximate root of a univariate polynomial. The notion of ϵ-point of an algebraic hypersurface is quite intuitive. It essentially consists in a point such that when substituted in the implicit equation of the hypersurface gives values of small module. Intuition says that an ϵ-point of a hypersurface is a point close to it. In this paper, we formally analyze this assertion giving bounds of the distance of the ϵ-point to the hypersurface. For this purpose, we introduce the notions of height, depth and weight of an ϵ-point. The height and the depth control when the distance bounds are valid, while the weight is involved in the bounds.Ministerio de Educación y CienciaComunidad de MadridUniversidad de Alcal

Embedded and validated control algorithms for the spacecraft rendezvous

L'autonomie est l'une des préoccupations majeures lors du développement de missions spatiales que l'objectif soit scientifique (exploration interplanétaire, observations, etc) ou commercial (service en orbite). Pour le rendez-vous spatial, cette autonomie dépend de la capacité embarquée de contrôle du mouvement relatif entre deux véhicules spatiaux. Dans le contexte du service aux satellites (dépannage, remplissage additionnel d'ergols, correction d'orbite, désorbitation en fin de vie, etc), la faisabilité de telles missions est aussi fortement liée à la capacité des algorithmes de guidage et contrôle à prendre en compte l'ensemble des contraintes opérationnelles (par exemple, saturation des propulseurs ou restrictions sur le positionnement relatif entre les véhicules) tout en maximisant la durée de vie du véhicule (minimisation de la consommation d'ergols). La littérature montre que ce problème a été étudié intensément depuis le début des années 2000. Les algorithmes proposés ne sont pas tout à fait satisfaisants. Quelques approches, par exemple, dégradent les contraintes afin de pouvoir fonder l'algorithme de contrôle sur un problème d'optimisation efficace. D'autres méthodes, si elles prennent en compte l'ensemble du problème, se montrent trop lourdes pour être embarquées sur de véritables calculateurs existants dans les vaisseaux spatiaux. Le principal objectif de cette thèse est le développement de nouveaux algorithmes efficaces et validés pour le guidage et le contrôle impulsif des engins spatiaux dans le contexte des phases dites de "hovering" du rendez-vous orbital, i.e. les étapes dans lesquelles un vaisseau secondaire doit maintenir sa position à l'intérieur d'une zone délimitée de l'espace relativement à un autre vaisseau principal. La première contribution présentée dans ce manuscrit utilise une nouvelle formulation mathématique des contraintes d'espace pour le mouvement relatif entre vaisseaux spatiaux pour la conception d'algorithmes de contrôle ayant un traitement calculatoire plus efficace comparativement aux approches traditionnelles. La deuxième et principale contribution est une stratégie de contrôle prédictif qui assure la convergence des trajectoires relatives vers la zone de "hovering", même en présence de perturbations ou de saturation des actionneurs. Un travail spécifique de développement informatique a pu démontrerl'embarquabilité de ces algorithmes de contrôle sur une carte contenant un microprocesseur LEON3 synthétisé sur FPGA certifié pour le vol spatial, reproduisant les performances des dispositifs habituellement utilisés en vol. Finalement, des outils d'approximation rigoureuse de fonctions ont été utilisés pour l'obtention des solutions validées des équations décrivant le mouvement relatif linéarisé, permettant ainsi une propagation certifiée simple des trajectoires relatives via des polynômes et la vérification du respect des contraintes du problème.Autonomy is one of the major concerns during the planning of a space mission, whether its objective is scientific (interplanetary exploration, observations, etc.) or commercial (service in orbit). For space rendezvous, this autonomy depends on the on-board capacity of controlling the relative movement between two spacecraft. In the context of satellite servicing (troubleshooting, propellant refueling, orbit correction, end-of-life deorbit, etc.), the feasibility of such missions is also strongly linked to the ability of the guidance and control algorithms to account for all operational constraints (for example, thruster saturation or restrictions on the relative positioning between the vehicles) while maximizing the life of the vehicle (minimizing propellant consumption). The literature shows that this problem has been intensively studied since the early 2000s. However, the proposed algorithms are not entirely satisfactory. Some approaches, for example, degrade the constraints in order to be able to base the control algorithm on an efficient optimization problem. Other methods accounting for the whole set of constraints of the problem are too cumbersome to be embedded on real computers existing in the spaceships. The main object of this thesis is the development of new efficient and validated algorithms for the impulsive guidance and control of spacecraft in the context of the so-called "hovering" phases of the orbital rendezvous, i.e. the stages in which a secondary vessel must maintain its position within a bounded area of space relatively to another main vessel. The first contribution presented in this manuscript uses a new mathematical formulation of the space constraints for the relative motion between spacecraft for the design of control algorithms with more efficient computational processing compared to traditional approaches. The second and main contribution is a predictive control strategy that has been formally demonstrated to ensure the convergence of relative trajectories towards the "hovering" zone, even in the presence of disturbances or saturation of the actuators. Specific computational developments have demonstrated the embeddability of these control algorithms on a board containing a FPGA-synthesized LEON3 microprocessor certified for space flight, reproducing the performance of the devices usually used in flight. Finally, tools for rigorous approximation of functions were used to obtain validated solutions of the equations describing the linearized relative motion, allowing a simple certified propagation of the relative trajectories via polynomials and the verification of the respect of the constraints of the problem

CFD Analysis of Hypersonic Flowfields With Surface Thermochemistry and Ablation

In the past forty years much progress has been made in computational methods applied to the solution of problems in spacecraft hypervelocity flow and heat transfer. Although the basic thermochemical and physical modeling techniques have changed little in this time, several orders of magnitude increase in the speed of numerically solving the Navier-Stokes and associated energy equations have been achieved. The extent to which this computational power can be applied to the design of spacecraft heat shields is dependent on the proper coupling of the external flow equations to the boundary conditions and governing equations representing the thermal protection system in-depth conduction, pyrolysis and surface ablation phenomena. A discussion of the techniques used to do this in past problems as well as the current state-of-art is provided. Specific examples, including past missions such as Galileo, together with the more recent case studies of ESA/Rosetta Sample Comet Return, Mars Pathfinder and X-33 will be discussed. Modeling assumptions, design approach and computational methods and results are presented

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed