Human and Robotic Space Mission Use Cases for High-Performance Spaceflight Computing (HPSC)
No abstract available
requirements↗
SEARCH · Engineering Papers
Results for “space computing”
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.
Human and Robotic Space Mission Use Cases for High-Performance Spaceflight Computing
Spaceflight computing is a key resource in NASA space missions and a core determining factor of spacecraft capability, with ripple effects throughout the spacecraft, end-to-end system, and mission. Onboard computing can be aptly viewed as a "technology multiplier" in that advances provide direct dramatic improvements in flight functions and capabilities across the NASA mission classes, and enable new flight capabilities and mission scenarios, increasing science and exploration return. Space-qualified computing technology, however, has not advanced significantly in well over ten years and the current state of the practice fails to meet the near- to mid-term needs of NASA missions. Recognizing this gap, the NASA Game Changing Development Program (GCDP), under the auspices of the NASA Space Technology Mission Directorate, commissioned a study on space-based computing needs, looking out 15-20 years. The study resulted in a recommendation to pursue high-performance spaceflight computing (HPSC) for next-generation missions, and a decision to partner with the Air Force Research Lab (AFRL) in this development.
use cases↗
Spin vector control of a spinning space station
Digital computer program simulates system and related functions. Program is intended for, but not limited to, altitude control studies of rotating space station. Russel's method of formulating and solving motion equations for system of rigid bodies connected by movable joints is applied. Program features are listed.
Hendricks, T.↗
Johnson Space Center Research and Technology 1997 Annual Report
This report highlights key projects and technologies at Johnson Space Center for 1997. The report focuses on the commercial potential of the projects and technologies and is arranged by CorpTech Major Products Groups. Emerging technologies in these major disciplines we summarized: solar system sciences, life sciences, technology transfer, computer sciences, space technology, and human support technology. Them NASA advances have a range of potential commercial applications, from a school internet manager for networks to a liquid metal mirror for optical measurements.
Source record↗
Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations
In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.
97 MATHEMATICS AND COMPUTING↗
The KDD Space Communications Station
Facilities, equipment, and antenna steering computer at Kokusai Denshin Denwa space communications ground station in Japan
STEERABLE ANTENNA↗
Effect of element size on the solution accuracies of finite-element heat transfer and thermal stress analyses of space shuttle orbiter
The effect of element size on the solution accuracies of finite-element heat transfer and thermal stress analyses of space shuttle orbiter was investigated. Several structural performance and resizing (SPAR) thermal models and NASA structural analysis (NASTRAN) structural models were set up for the orbiter wing midspan bay 3. The thermal model was found to be the one that determines the limit of finite-element fineness because of the limitation of computational core space required for the radiation view factor calculations. The thermal stresses were found to be extremely sensitive to a slight variation of structural temperature distributions. The minimum degree of element fineness required for the thermal model to yield reasonably accurate solutions was established. The radiation view factor computation time was found to be insignificant compared with the total computer time required for the SPAR transient heat transfer analysis.
Ko, William L.↗
Principal Landau determinants
We reformulate the Landau analysis of Feynman integrals with the aim of advancing the state of the art in modern particle-physics computations. We contribute new algorithms for computing Landau singularities, using tools from polyhedral geometry and symbolic/numerical elimination. Inspired by the work of Gelfand, Kapranov, and Zelevinsky (GKZ) on generalized Euler integrals, we define the principal Landau determinant of a Feynman diagram. We illustrate with a number of examples that this algebraic formalism allows to compute many components of the Landau singular locus. We adapt the GKZ framework by carefully specializing Euler integrals to Feynman integrals. For instance, ultraviolet and infrared singularities are detected as irreducible components of an incidence variety, which project dominantly to the kinematic space. We compute principal Landau determinants for the infinite families of one-loop and banana diagrams with different mass configurations, and for a range of cutting-edge Standard Model processes. Furthermore, our algorithms build on the Julia package this http URL and are implemented in the new open-source package this http URL available at this https URL.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Development of computer technology for medical data analysis to be applied to Apollo and follow-on space missions Final report
Computer technology for medical data analysis of Apollo and follow-on missions
Source record↗
Software development to support sensor control of robot arc welding
The development of software for a Digital Equipment Corporation MINC-23 Laboratory Computer to provide functions of a workcell host computer for Space Shuttle Main Engine (SSME) robotic welding is documented. Routines were written to transfer robot programs between the MINC and an Advanced Robotic Cyro 750 welding robot. Other routines provide advanced program editing features while additional software allows communicatin with a remote computer aided design system. Access to special robot functions were provided to allow advanced control of weld seam tracking and process control for future development programs.
Silas, F. R., Jr.↗
Heat Transfer to Longitudinal Laminar Flow Between Cylinders
Consideration is given to the fully developed heat transfer characteristics for longitudinal laminar flow between cylinders arranged in an equilateral triangular array. The analysis is carried out for the condition of uniform heat transfer per unit length. Solutions are obtained for the temperature distribution, and from these, Nusselt numbers are derived for a wide range of spacing-to-diameter ratios. It is found that as the spacing ratio increases, so also does the wall-to-bulk temperature difference for a fixed heat transfer per unit length. Corresponding to a uniform surface temperature around the circumference of a cylinder, the circumferential variation of the local heat flux is computed. For spacing ratios of 1.5 - 2.0 and greater, uniform peripheral wall temperature and uniform peripheral heat flux are simultaneously achieved. A simplified analysis which neglects circumferential variations is also carried out, and the results are compared with those from the more exact formulation.
Sparrow, Ephraim M.↗
Incorporating Manual and Autonomous Code Generation
Code can be generated manually or using code-generated software tools, but how do you interpret the two? This article looks at a design methodology that combines object-oriented design with autonomic code generation for attitude control flight software. Recent improvements in space flight computers are allowing software engineers to spend more time engineering the applications software. The application developed was the attitude control flight software for an astronomical satellite called the Microwave Anisotropy Probe (MAP). The MAP flight system is being designed, developed, and integrated at NASA's Goddard Space Flight Center. The MAP controls engineers are using Integrated Systems Inc.'s MATRIXx for their controls analysis. In addition to providing a graphical analysis for an environment, MATRIXx includes an autonomic code generation facility called AutoCode. This article examines the forces that shaped the final design and describes three highlights of the design process: (1) Defining the manual to autonomic code interface; (2) Applying object-oriented design to the manual flight code; (3) Implementing the object-oriented design in C.
McComas, David↗
The Role of Computational Fluid Dynamics at Marshall Space Flight Center
The Marshall Space Flight Center (MSFC) is the Center of Excellence for Space Propulsion Technology within NASA. One of MSFC's goals is to lower the cost of access to space. MSFC's Fluid Dynamics Division, a part of the Structures and Dynamics Lab, assists in accomplishing this goal. This division is divided into two branches: experimental and analytical, whose work is complimentary and integrated. In the analysis branch, the emphasis is to apply, rather than develop computational fluid dynamics (CFD), to reduce the cost of design and development of: (1) pump and turbine feedlines and feed manifolds; (2) all primary and secondary flow paths in pumps; (3) all primary and secondary flow paths in turbines; (4) combustion chambers; (5) rocket engine nozzles and plumes; and (6) launch vehicles ascent. The broad range of applications imposes unique constraints on the software. The use of CFD in evaluating rocket engine hardware, specifically, is of value due to several reasons: (1) Rocket engine hardware is extremely expensive to build and test; (2) high engineering and development cost is due to limited production; (3) the cost of one engine test is greater than the average yearly hardware and software cost; (4) CFD represents a relatively small investment relative to the impact it has on the engine development; and (5) computing costs are continuously decreasing. In terms of accuracy the predictable error is more useful than the inconsistent accuracy. The achievable accuracy varies from application to application. The lack of accuracy is often caused by improper analyses: such as improperly applied or located boundary conditions, or attempting steady analysis of unsteady flows. This report is in viewgraph format.
Garcia, Roberto↗
Computational Aeroacoustics by the Space-time CE/SE Method
In recent years, a new numerical methodology for conservation laws-the Space-Time Conservation Element and Solution Element Method (CE/SE), was developed by Dr. Chang of NASA Glenn Research Center and collaborators. In nature, the new method may be categorized as a finite volume method, where the conservation element (CE) is equivalent to a finite control volume (or cell) and the solution element (SE) can be understood as the cell interface. However, due to its rigorous treatment of the fluxes and geometry, it is different from the existing schemes. The CE/SE scheme features: (1) space and time treated on the same footing, the integral equations of conservation laws are solve( for with second order accuracy, (2) high resolution, low dispersion and low dissipation, (3) novel, truly multi-dimensional, simple but effective non-reflecting boundary condition, (4) effortless implementation of computation, no numerical fix or parameter choice is needed, an( (5) robust enough to cover a wide spectrum of compressible flow: from weak linear acoustic waves to strong, discontinuous waves (shocks) appropriate for linear and nonlinear aeroacoustics. Currently, the CE/SE scheme has been developed to such a stage that a 3-13 unstructured CE/SE Navier-Stokes solver is already available. However, in the present paper, as a general introduction to the CE/SE method, only the 2-D unstructured Euler CE/SE solver is chosen as a prototype and is sketched in Section 2. Then applications of the CE/SE scheme to linear, nonlinear aeroacoustics and airframe noise are depicted in Sections 3, 4, and 5 respectively to demonstrate its robustness and capability.
Loh, Ching Y.↗
A portable MPI-based parallel vector template library
This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.
Sheffler, Thomas J.↗
A Portable MPI-Based Parallel Vector Template Library
This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.
Sheffler, Thomas J.↗
Video image processing
Current technology projections indicate a lack of availability of special purpose computing for Space Station applications. Potential functions for video image special purpose processing are being investigated, such as smoothing, enhancement, restoration and filtering, data compression, feature extraction, object detection and identification, pixel interpolation/extrapolation, spectral estimation and factorization, and vision synthesis. Also, architectural approaches are being identified and a conceptual design generated. Computationally simple algorithms will be research and their image/vision effectiveness determined. Suitable algorithms will be implimented into an overall architectural approach that will provide image/vision processing at video rates that are flexible, selectable, and programmable. Information is given in the form of charts, diagrams and outlines.
Murray, N. D.↗
Geocoded data structures and their applications to Earth science investigations
A geocoded data structure is a means for digitally representing a geographically referenced map or image. The characteristics of representative cellular, linked, and hybrid geocoded data structures are reviewed. The data processing requirements of Earth science projects at the Goddard Space Flight Center and the basic tools of geographic data processing are described. Specific ways that new geocoded data structures can be used to adapt these tools to scientists' needs are presented. These include: expanding analysis and modeling capabilities; simplifying the merging of data sets from diverse sources; and saving computer storage space.
Goldberg, M.↗