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 649 records · Page 36

Three-dimensional multigrid Navier-Stokes computations for turbomachinery applications

The fully three-dimensional, time-dependent compressible Navier-Stokes equations in cylindrical coordinates are presently used, in conjunction with the multistage Runge-Kutta numerical integration scheme for solution of the governing flow equations, to simulate complex flowfields within turbomechanical components whose pertinent effects encompass those of viscosity, compressibility, blade rotation, and tip clearance. Computed results are presented for selected cascades, emphasizing the code's capabilities in the accurate prediction of such features as airfoil loadings, exit flow angles, shocks, and secondary flows. Computations for several test cases have been performed on a Cray-YMP, using nearly 90,000 grid points.

Subramanian, S. V.↗

Continuous prediction of Spartan visibility from Orbiter over modeled free-flight mission

Orbital operations in the neighborhood of other satellites or free-flying objects need the ability to see and detect such objects optically. This ability depends primarily on the brightness of the object relative to other sources present. The present analysis and computational procedure provides a means for predicting the visual brightness of a satellite when viewed from a nearby satellite in the same orbit. It is designed specifically for estimating the brightness of Spartan free-flyers from the STS Orbiters which release and later retrieve them, but the basic methods are applicable to other satellite-to-satellite visibility prediction problems. The Spartan reflector model defined herein is illuminated both by direct solar radiation and by the earth (albedo), producing a model source of defined directional intensity. The intensity in the Orbiter direction (along orbit) yields the desired maximum range directly. The required geometric and photometric calculations involve a number of angles in space, which are readily computed from the basic directions defining their sides. The time-dependent directions are determined by straightforward calculation from fundamental relationships and constants.

King, J. C.↗

On sound generation by turbulent convection: A new look at old results

We have revisited the problem of acoustic wave generation by turbulent convection in stellar atmospheres. The theory of aerodynamically generated sound, originally developed by Lighthill and later modified by Stein to include the effects of stratification, has been used to estimate the acoustic wave energy flux generated in solar and stellar convection zones. We correct the earlier computations by incorporating an improved description of the spatial and temporal spectrum of the turbulent convection. We show the dependence of the resulting wave fluxes on the nature of the turbulence, and compute the wave energy spectra and wave energy fluxes generated in the Sun on the basis of a mixing-length model of the solar convection zone. In contrast to the previous results, we show that the acoustic energy generation does not depend very sensitively on the turbulent energy spectrum. However, typical total acoustic fluxes of order F(sub A) = 5 x 10(exp 7) ergs/sq cm/s with a peak of the acoustic frequency spectrum near omega = 100 mHz are found to be comparable to those previously calculated. The acoustic flux turns out to be strongly dependent on the solar model, scaling with the mixing-length parameter alpha as alpha(exp 3.8). The computed fluxes most likely constitute a lower limit on the acoustic energy produced in the solar convection zone if recent convection simulations suggesting the presence of shocks near the upper layers of the convection zone apply to the Sun.

Musielak, Z. E.↗

A study of the electromagnetic interaction between planetary bodies and the solar wind

Theoretical and computational techniques were developed for calculating the time dependent electromagnetic response of a radially inhomogeneous moon. The techniques were used to analyze the experimental data from the LSM (lunar surface magnetometer) thus providing an in-depth diagnostic of the Lunar interior. The theory was also incorporated into an existing computer code designed to calculate the thermal evolution of planetary bodies. The program will provide a tool for examining the effect of heating from the TE mode (poloidal magnetic field) as well as the TM mode (toroidal magnetic field).

Schwartz, K.↗

Intersymbol Interference Investigations Using a 3D Time-Dependent Traveling Wave Tube Model

For the first time, a physics based computational model has been used to provide a direct description of the effects of the TWT (Traveling Wave Tube) on modulated digital signals. The TWT model comprehensively takes into account the effects of frequency dependent AM/AM and AM/PM conversion; gain and phase ripple; drive-induced oscillations; harmonic generation; intermodulation products; and backward waves. Thus, signal integrity can be investigated in the presence of these sources of potential distortion as a function of the physical geometry of the high power amplifier and the operational digital signal. This method promises superior predictive fidelity compared to methods using TWT models based on swept amplitude and/or swept frequency data. The fully three-dimensional (3D), time-dependent, TWT interaction model using the electromagnetic code MAFIA is presented. This model is used to investigate assumptions made in TWT black box models used in communication system level simulations. In addition, digital signal performance, including intersymbol interference (ISI), is compared using direct data input into the MAFIA model and using the system level analysis tool, SPW (Signal Processing Worksystem).

Kory, Carol L.↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Crowley, Kay↗

Run-time scheduling and execution of loops on message passing machines

Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

Saltz, Joel↗

Adaptive Mesh Refinement for Microelectronic Device Design

Finite element and finite volume methods are used in a variety of design simulations when it is necessary to compute fields throughout regions that contain varying materials or geometry. Convergence of the simulation can be assessed by uniformly increasing the mesh density until an observable quantity stabilizes. Depending on the electrical size of the problem, uniform refinement of the mesh may be computationally infeasible due to memory limitations. Similarly, depending on the geometric complexity of the object being modeled, uniform refinement can be inefficient since regions that do not need refinement add to the computational expense. In either case, convergence to the correct (measured) solution is not guaranteed. Adaptive mesh refinement methods attempt to selectively refine the region of the mesh that is estimated to contain proportionally higher solution errors. The refinement may be obtained by decreasing the element size (h-refinement), by increasing the order of the element (p-refinement) or by a combination of the two (h-p refinement). A successful adaptive strategy refines the mesh to produce an accurate solution measured against the correct fields without undue computational expense. This is accomplished by the use of a) reliable a posteriori error estimates, b) hierarchal elements, and c) automatic adaptive mesh generation. Adaptive methods are also useful when problems with multi-scale field variations are encountered. These occur in active electronic devices that have thin doped layers and also when mixed physics is used in the calculation. The mesh needs to be fine at and near the thin layer to capture rapid field or charge variations, but can coarsen away from these layers where field variations smoothen and charge densities are uniform. This poster will present an adaptive mesh refinement package that runs on parallel computers and is applied to specific microelectronic device simulations. Passive sensors that operate in the infrared portion of the spectrum as well as active device simulations that model charge transport and Maxwell's equations will be presented.

Cwik, Tom↗

Parallelization of implicit finite difference schemes in computational fluid dynamics

Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.

Decker, Naomi H.↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

WFOT: A Wave Function Overlap Tool between Single- and Multi-Reference Electronic Structure Methods for Spectroscopy Simulation

We report the development of a novel diagnostic tool, named wave function overlap tool (WFOT), designed to evaluate the overlap between wave functions computed at single-reference [i.e., time-dependent density functional theory or configuration interaction singles (CIS)] and multireference (i.e., CASSCF/CASPT2) electronic structure levels of theory. It relies on truncating the single- and multireference WFs to CIS-like expansions spanning the same configurational space and maximizing the molecular orbital overlap by means of a unitary transformation. To demonstrate the functionality of the tool, we calculate the transient spectrum of acetylacetone by evaluating excited state absorption signals with multireference quality on top of single-reference on-the-fly dynamics simulations. Semiautomatic spectra generation is facilitated by interfacing the tool with the COBRAMM package, which also allows one to use WFOT with several quantum chemistry codes such as Gaussian, NWChem, and OpenMolcas. Finally, other exciting possibilities for the utilization of the code beyond the simulation of transient absorption spectroscopy are eventually discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel spatial direct numerical simulations on the Intel iPSC/860 hypercube

The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube is documented. The direct numerical simulation approach is used to compute spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows. The feasibility of using the PSDNS on the hypercube to perform transition studies is examined. The results indicate that the direct numerical simulation approach can effectively be parallelized on a distributed-memory parallel machine. By increasing the number of processors nearly ideal linear speedups are achieved with nonoptimized routines; slower than linear speedups are achieved with optimized (machine dependent library) routines. This slower than linear speedup results because the Fast Fourier Transform (FFT) routine dominates the computational cost and because the routine indicates less than ideal speedups. However with the machine-dependent routines the total computational cost decreases by a factor of 4 to 5 compared with standard FORTRAN routines. The computational cost increases linearly with spanwise wall-normal and streamwise grid refinements. The hypercube with 32 processors was estimated to require approximately twice the amount of Cray supercomputer single processor time to complete a comparable simulation; however it is estimated that a subgrid-scale model which reduces the required number of grid points and becomes a large-eddy simulation (PSLES) would reduce the computational cost and memory requirements by a factor of 10 over the PSDNS. This PSLES implementation would enable transition simulations on the hypercube at a reasonable computational cost.

Joslin, Ronald D.↗

Tula: Optimizing Time, Cost, and Generalization in Distributed Large-Batch Training

Distributed training increases the number of batches processed per iteration either by scaling-out (adding more nodes) or scaling-up (increasing the batch-size). However, the largest configuration does not necessarily yield the best performance. Horizontal scaling introduces additional communication overhead, while vertical scaling is constrained by computation cost and device memory limits. Thus, simply increasing the batch-size leads to diminishing returns: training time and cost decrease initially but eventually plateaus, creating a knee-point in the time/cost vs. batch-size pareto curve. The optimal batch-size therefore depends on the underlying model, data and available compute resources. Large batches also suffer from worse model quality due to the well-known “generalization gap”. In this paper, we present Tula, an online service that automatically optimizes time, cost, and convergence quality for large-batch training of convolutional models. It combines parallel-systems modeling with statistical performance prediction to identify the optimal batchsize. Tula predicts training time and cost within 7.5−14% error across multiple models, and achieves up to 20× overall speedup and improves test accuracy by ≈9% on average over standard large-batch training on various vision tasks, thus successfully mitigating the generalization gap and accelerating training at the same time.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗

Advances and trends in structures and dynamics; Proceedings of the Symposium, Washington, DC, October 22-25, 1984

Among the topics discussed are developments in structural engineering hardware and software, computation for fracture mechanics, trends in numerical analysis and parallel algorithms, mechanics of materials, advances in finite element methods, composite materials and structures, determinations of random motion and dynamic response, optimization theory, automotive tire modeling methods and contact problems, the damping and control of aircraft structures, and advanced structural applications. Specific topics covered include structural design expert systems, the evaluation of finite element system architectures, systolic arrays for finite element analyses, nonlinear finite element computations, hierarchical boundary elements, adaptive substructuring techniques in elastoplastic finite element analyses, automatic tracking of crack propagation, a theory of rate-dependent plasticity, the torsional stability of nonlinear eccentric structures, a computation method for fluid-structure interaction, the seismic analysis of three-dimensional soil-structure interaction, a stress analysis for a composite sandwich panel, toughness criterion identification for unidirectional composite laminates, the modeling of submerged cable dynamics, and damping synthesis for flexible spacecraft structures.

Noor, A. K.↗

Computing viscous flows

Although the goals and techniques of computational aerodynamics and computational fluid dynamics differ, advancement in the physical and mathematical aspects of the latter are required for progress in aerodynamic computation. The most attractive approach is the use of hybrid methods where both the equations treated and the solution algorithms reflect the local character of the flow. A working general turbulence model that is only peripherally related to the availability of large fast computers would provide a significant breakthrough in computational aerodynamics. There is no unanimity of opinion as to what may be the optimum algorithm or family of algorithms in the next decade. While it is premature to develop an optimum processor, such a machine dedicated to study the structure of solutions to the three-dimensional time-dependent Navier-Stokes equations and to the computability of turbulence would be very valuable.

Murphy, J. D.↗

The flight telerobotic servicer: From functional architecture to computer architecture

After a brief tutorial on the NASA/National Bureau of Standards Standard Reference Model for Telerobot Control System Architecture (NASREM) functional architecture, the approach to its implementation is shown. First, interfaces must be defined which are capable of supporting the known algorithms. This is illustrated by considering the interfaces required for the SERVO level of the NASREM functional architecture. After interface definition, the specific computer architecture for the implementation must be determined. This choice is obviously technology dependent. An example illustrating one possible mapping of the NASREM functional architecture to a particular set of computers which implements it is shown. The result of choosing the NASREM functional architecture is that it provides a technology independent paradigm which can be mapped into a technology dependent implementation capable of evolving with technology in the laboratory and in space.

Lumia, Ronald↗

Numerical Model for Isothermal and Non-Isothermal Crystallization of Liquids and Glasses

A new numerical model of isothermal and non-isothermal first order phase transformations, such as the crystallization of liquids and glasses, is presented. This model computes directly the volume fraction transformed, taking into account time-dependent nucleation rates and cluster-size-dependent growth velocities. The model is applied to the crystallization of lithium disilicate glass, using the appropriate kinetic and thermodynamic parameters. The model is used (1) to determine the validity of common methods for computing the volume fraction transformed as a function of time in isothermal experiments when a time-dependent nucleation rate is expected, (2) to simulate non-isothermal differential scanning calorimetry (DSC) studies of glass devitrification as a function of scan rate, and (3) to compute the effect of preannealing on the DSC peak parameters. A novel behavior of the nucleation rate with scan rate is predicted, arising because the relaxation of the cluster distribution cannot be described by a single relaxation time. Comparisons of the calculations with experimental data on this glass demonstrate the validity of the model.

Kelton, K. F.↗

Algorithm for Unsteady Potential Flow About Airfoils

Implicit finite-difference scheme efficiently computes unsteady potential flow about airfoils. Formulation uses density and velocity potential as dependent variables. Conservation form is retained to assure that shock wave location and speed are computed correctly. Scheme fills need for method to calculate efficiently unsteady potential flow about airfoils and to predict flutter and other unsteady aeroelastic phenomena in transonic flow regimes.

Chipman, R.↗