Search NASA⌕ Search

SEARCH · Search NASA

Results for “dependable 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.

At least 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

The calculation of transonic rotor noise

It is pointed out that an accurate prediction of the high-speed impulsive rotor noise is very difficult since the noise field depends on many complex factors. Schmitz and Yu (1981) have conducted a study with the aim to include local aerodynamic nonlinearities in a calculation regarding the acoustic shock. In the present investigation, the hover case of the model rotor studied by Schmitz and Yu was recomputed without certain implicit assumptions made in the earlier calculation. The obtained results show that the Schmitz-Yu computations are very much base-support area dependent. Attention is given to the quadrupole integral, and the pressure-time curves for the model rotor in hover.

Aggarwal, H. R.↗
DOE OSTI2025

A kinetic line-driven radiation operator and its application to Gyrokinetics

A velocity dependent, kinetic model for line radiation is developed for continuum kinetic codes. It has been implemented in the full-f gyrokinetic code Gkeyll. The total radiation for a charge state is modeled as an advection in velocity space with a form of $\nabla_v \cdot(v\nu(v)f(v))$, guaranteeing particle conservation. The velocity dependence (in the form of an effective frequency $\nu(v)$) is found through fitting the energy loss of the operator, i.e. the second velocity moment, to the radiation data in the OpenADAS database. Therefore, each individual transition does not need to be evaluated every time step, significantly reducing the computational cost of including line radiation in a kinetic model. The dependence on velocity instead of the usual, temperature, allows the radiation to be computed from non-Maxwellian electron distribution functions: We benchmark the model against a collisional radiative model using isotropic non-Maxwellian distribution functions. A velocity dependent model of radiation can more accurately describe the radiation in the more kinetic regimes expected in reactor-scale devices. The velocity dependence qualitatively captures the quantum mechanical need for a minimum velocity before any radiation occurs.

kinetic↗
DOE OSTI2025

Electron-Ion Dynamics with Time-Dependent Density Functional Theory: Towards Predictive Solar Cell Modeling

This project focussed on two aspects of computational modeling with a view toward application for photovoltaic design: (i) increased reliability of exchange-correlation functionals in time-dependent density functional theory (TDDFT) (a method of choice of the calculation of electronic spectra and dynamics), especially for time-resolved non-perturbative dynamics, and (ii) the development of a practical but rigorously-based method for coupling electronic and nuclear motion via the exact-factorization (EF) approach (a relatively new framework for developing approximations).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2018

A Simple, Velocity Dependent, Collision Probability Algorithm for Small Combined Hard Body Radii Close Approach Events

Over the last few years progress has been made in the velocity dependent collision probability problem. Recent progress in this problem has been approached via integration of the probability flux into the surface of the combined hard body object. The algorithm presented uses the surface flux approach and is designed to compute the collision probability rate between two objects given their time dependent states and state error covariance matrices. With regards to the computation of the collision probability (Pc) rate, two major differences exist between the development of this algorithm and the usual Pc algorithm. First, the shape of the at-risk volume is assumed to be a cube rather than a sphere. The size of the cube is chosen so that it circumscribes the usual hard body sphere chosen for the spherical Pc problem. This will result in half the length of a side of the cube being equal to the hard body radius (HBR) of the sphere. Second, it is assumed that the HBR of the cube is much smaller than the smallest combined position uncertainty (σ(sub min) > 5*HBR) at each time point of evaluation. This is necessary as the actual collision probability calculation is based on a first order, small variable expansion in the position components of the Gaussian probability density function. This leads to the collision probability rate being to second order in the combined HBR. The collision probability rate is in a concise, closed form containing exponential and error functions.

Frisbee, Joe↗
NASA NTRSDate not supplied

A Partitioned -Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a “plug and play” software package that allows users to conduct massively multiscale modeling of hierarchical and nonlinear materials. This work extends the scalability and improves the High Performance Computing friendliness of NASMAT by adopting a Partitioned Task-Parallel approach. Interoperability of NASMAT with external software is enhanced through preCICE, a open source library for multiphysics coupling in a partitioned manner. Enhancement through preCICE allows for easy integration of NASMAT to other macro solvers and dissociates the parallelization strategy adopted within NASMAT from the macro solver. The task-parallel framework based on Master-Worker approach is implemented as the parallelization scheme. The scheme accounts for hierarchy of multiple scales (task-dependence) and heterogeneous nature (dynamic load balancing) of computations. The applicability and scalability of the framework will be evaluated by analyzing large scale engineering problems through massively multiscale methods.

NASMAT↗
NASA NTRS1982

Three dimensional ray tracing Jovian magnetosphere in the low frequency range

Ray tracing of the Jovian magnetosphere in the low frequency range (1+40 MHz) has resulted in a new understanding of the source mechanism for Io dependent decametric radiation (DAM). Our three dimensional ray tracing computer code has provided model DAM arcs at 10 deg. intervals of Io longitude source positions for the full 360 deg of Jovian system III longitude. In addition, particularly interesting arcs were singled out for detailed study and modelling. Dependent decametric radiation arcs are categorized according to curvature--the higher curvature arcs are apparently due to wave stimulation at a nonconstant wave normal angle, psi. The psi(f) relationship has a signature that is common to most of the higher curvature arcs. The low curvature arcs, on the other hand, are adequately modelled with a constant wave normal angle of close to 90 deg. These results imply that for higher curvature arcs observed for from Jupiter (to diminish spacecraft motion effects) the electrons providing the gyroemission are relativistically beamed.

Menietti, J. D.↗
NASA NTRS1998

On-Line Robust Modal Stability Prediction using Wavelet Processing

Wavelet analysis for filtering and system identification has been used to improve the estimation of aeroservoelastic stability margins. The conservatism of the robust stability margins is reduced with parametric and nonparametric time- frequency analysis of flight data in the model validation process. Nonparametric wavelet processing of data is used to reduce the effects of external disturbances and unmodeled dynamics. Parametric estimates of modal stability are also extracted using the wavelet transform. Computation of robust stability margins for stability boundary prediction depends on uncertainty descriptions derived from the data for model validation. The F-18 High Alpha Research Vehicle aeroservoelastic flight test data demonstrates improved robust stability prediction by extension of the stability boundary beyond the flight regime. Guidelines and computation times are presented to show the efficiency and practical aspects of these procedures for on-line implementation. Feasibility of the method is shown for processing flight data from time- varying nonstationary test points.

Brenner, Martin J.↗
DOE OSTI2026

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗
NASA NTRS1990

Inverse dynamics of adaptive structures used as space cranes

As a precursor to the real-time control of fast moving adaptive structures used as space cranes, a formulation is given for the flexibility induced motion relative to the nominal motion (i.e., the motion that assumes no flexibility) and for obtaining the open loop time varying driving forces. An algorithm is proposed for the computation of the relative motion and driving forces. The governing equations are given in matrix form with explicit functional dependencies. A simulator is developed to implement the algorithm on a digital computer. In the formulations, the distributed mass of the crane is lumped by two schemes, vz., 'trapezoidal' lumping and 'Simpson's rule' lumping. The effects of the mass lumping schemes are shown by simulator runs.

Das, S. K.↗
NASA NTRS1999

Numerical Prediction of Transient Axial Thrust and Internal Flows in a Rocket Engine Turbopump

This paper presents the application of the Generalized Fluid System Simulation Program (GFSSP) to model the time-dependent flow in a complex secondary flow circuit of the turbopump of the Fastrac engine currently under development at Marshall Space Flight Center. GFSSP is a general purpose computer program for analyzing steady-state and time-dependant flowrates, pressures, temperatures, and concentrations in a complex flow network. The program employs a finite volume formulation of mass, momentum and energy conservation equations in conjunction with the thermodynamic equation of state of real fluids. GFSSP was used to calculate the axial thrust and internal flow distribution of the Fastrac engine turbopump during the start and shut down transients. The models discussed in this paper use boundary conditions that were extracted from turbopump test data. The GFSSP predicted turbopump secondary flow passage pressures and temperatures were compared with actual measured values.

VanHooser, Katherine↗
NASA NTRS2019

Recommended Methods for Setting Mission Conjunction Analysis Hard Body Radii

For real-time conjunction assessment (CA) operations, computation of the Probability of Collision (P(sub c)) typically depends on the state vector, its covariance, and the combined hard body radius (HBR) of both the primary and secondary space-craft. However, most algorithmic approaches that compute the P(sub c) use generic conservatively valued HBRs that may tend to go beyond the physical limitations of both spacecraft, enough to drastically change the results of a conjunction assessment mitigation decision. On the other hand, if the attitude of the spacecraft is known and available, then a refined HBR can be obtained that could result in an improved and accurate numerically-computed P(sub c) value. The goal of this analysis is to demonstrate the various calculated P(sub c) values obtained based on a number of different HBR calculation techniques, oriented in the encounter or conjunction plane at the time of closest approach (TCA). Since in most conjunctions the secondary object is a debris object and thus orders of magnitude smaller than the primary, the greatest operational benefit is wrought by developing a better size estimate and representation for the primary object. We present an analysis that includes the attitude information of the primary object in the HBR calculation and assesses the resulting P(sub c) values for conjunction assessment decision making.

Mashiku, Alinda K.↗
NASA NTRS2019

Recommended Methods for Setting Mission Conjunction Analysis Hard Body Radii

For real-time conjunction assessment (CA) operations, computation of the Probability of Collision (P(sub c)) typically depends on the state vector, its covariance, and the combined hard body radius (HBR) of both the primary and secondary space-craft. However, most algorithmic approaches that compute the P(sub c) use generic conservatively valued HBRs that may tend to go beyond the physical limitations of both spacecraft, enough to drastically change the results of a conjunction assessment mitigation decision. On the other hand, if the attitude of the spacecraft is known and available, then a refined HBR can be obtained that could result in an improved and accurate numerically-computed P(sub c) value. The goal of this analysis is to demonstrate the various calculated P(sub c) values obtained based on a number of different HBR calculation techniques, oriented in the encounter or conjunction plane at the time of closest approach (TCA). Since in most conjunctions the secondary object is a debris object and thus orders of magnitude smaller than the primary, the greatest operational benefit is wrought by developing a better size estimate and representation for the primary object. We present an analysis that includes the attitude information of the primary object in the HBR calculation and assesses the resulting P(sub c) values for conjunction assessment decision making.

Mashiku, Alinda K.↗
DOE OSTI2024

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗
DOE OSTI2025

Single-qubit multi-party transmission using universal symmetric quantum cloning

This study considers the hypothetical quantum network case where Alice wishes to transmit one qubit of information (specifically a pure quantum state) to M parties, where M is some large number. The remote receivers locally perform single-qubit quantum state tomography on the transmitted qubits in order to compute the quantum state within some error rate (dependent on the tomography technique and the number of transmitted qubits). We show that with the use of an intermediate optimal symmetric universal quantum cloning machine (between Alice and the remote receivers) as a repeater-type node in a hypothetical quantum network, Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the M remote receivers. This is possible due to two properties of quantum cloning. The first is that single qubit quantum clones retain the same Bloch angle as the initial quantum state. This means that if the mixed state of the quantum clone can be computed to high enough accuracy, the original pure quantum state can be inferred by extrapolating that vector to the surface of the Bloch sphere. The second property is that the state overlap of approximate quantum clones, with respect to the original pure quantum state, quickly converges (specifically for 1 → M , the limit of the fidelity as M goes to infinity is $\frac{2}{3}$). This means that Alice can prepare a constant number of qubits (which are then passed through the quantum cloning machine) in order to achieve a desired error rate if M is large enough. Combined, these two properties mean that for a large M , Alice can prepare many orders of magnitude fewer qubits in order to achieve the same single qubit transmission accuracy compared to the naive direct qubit transmission approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1973

Computational problems in three and four dimensional boundary layer theory

It is shown that three-dimensional and time-dependent boundary layer flows can be calculated in a reasonable amount of time with the current generation of computers. The physical problems used to illustrate this have a wide application, and are the following: (1) oscillating flows over cylinders with both the wall and the inviscid flow oscillating, and (2) time-dependent and three-dimensional flow over a rotating airfoil in forward flight.

Dwyer, H. A.↗
NASA NTRS1981

Numerical investigation of turbulent channel flow

Fully developed turbulent channel flow was simulated numerically at Reynolds number 13800, based on centerline velocity and channel halt width. The large-scale flow field was obtained by directly integrating the filtered, three dimensional, time dependent, Navier-Stokes equations. The small-scale field motions were simulated through an eddy viscosity model. The calculations were carried out on the ILLIAC IV computer with up to 516,096 grid points. The computed flow field was used to study the statistical properties of the flow as well as its time dependent features. The agreement of the computed mean velocity profile, turbulence statistics, and detailed flow structures with experimental data is good. The resolvable portion of the statistical correlations appearing in the Reynolds stress equations are calculated. Particular attention is given to the examination of the flow structure in the vicinity of the wall.

Moin, P.↗
NASA NTRS1990

NASTRAN migration to UNIX

COSMIC/NASTRAN, as it is supported and maintained by COSMIC, runs on four main-frame computers - CDC, VAX, IBM and UNIVAC. COSMIC/NASTRAN on other computers, such as CRAY, AMDAHL, PRIME, CONVEX, etc., is available commercially from a number of third party organizations. All these computers, with their own one-of-a-kind operating systems, make NASTRAN machine dependent. The job control language (JCL), the file management, and the program execution procedure of these computers are vastly different, although 95 percent of NASTRAN source code was written in standard ANSI FORTRAN 77. The advantage of the UNIX operating system is that it has no machine boundary. UNIX is becoming widely used in many workstations, mini's, super-PC's, and even some main-frame computers. NASTRAN for the UNIX operating system is definitely the way to go in the future, and makes NASTRAN available to a host of computers, big and small. Since 1985, many NASTRAN improvements and enhancements were made to conform to the ANSI FORTRAN 77 standards. A major UNIX migration effort was incorporated into COSMIC NASTRAN 1990 release. As a pioneer work for the UNIX environment, a version of COSMIC 89 NASTRAN was officially released in October 1989 for DEC ULTRIX VAXstation 3100 (with VMS extensions). A COSMIC 90 NASTRAN version for DEC ULTRIX DECstation 3100 (with RISC) is planned for April 1990 release. Both workstations are UNIX based computers. The COSMIC 90 NASTRAN will be made available on a TK50 tape for the DEC ULTRIX workstations. Previously in 1988, an 88 NASTRAN version was tested successfully on a SiliconGraphics workstation.

Chan, Gordon C.↗
DOE OSTI2024

Investigating the ecological fallacy through sampling distributions constructed from finite populations

Correlation coefficients and linear regression values computed from group averages can differ from correlation coefficients and linear regression values computed using individual scores. This observation known as the ecological fallacy often assumes that all the individual scores are available from a population. In many situations, one must use a sample from the larger population. In such cases, the computed correlation coefficient and linear regression values will depend on the sample that is chosen and the underlying sampling distribution. The sampling distribution of correlation coefficients and linear regression values for group averages will be identical to the sampling distribution for individuals for normally distributed variables for random samples drawn from infinitely large continuous distributions. However, data that is acquired in practice is often acquired when sampling without replacement from a finite population. Our objective is to demonstrate through Monte Carlo simulations that the sampling distributions for correlation and linear regression will also be similar for individuals and group averages when sampling without replacement from normally distributed variables. These simulations suggest that when a random sample from a population is selected, the correlation coefficients and linear regression values computed from individual scores will not be more accurate in estimating the entire population values compared to samples when group averages are used as long as the sample size is the same.

97 MATHEMATICS AND COMPUTING↗