SEARCH · Search NASA
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.
A program which accepts a system model in the form of Boolean equations and solves these equations using a ternary algebra will determine the response of large combinational and sequencial switching circuits to given input changes, taking into account malfunctions due to races, hazards, and oscillations.
FORTRAN coded out-of-core equation solvers that solve using direct methods symmetric banded systems of simultaneous algebraic equations. Banded, frontal and column (skyline) solvers were studied as well as solvers that can partition the working area and thus could fit into any available core. Comparison timings are presented for several typical two dimensional and three dimensional continuum type grids of elements with and without midside nodes. Extensive conclusions are also given.
A method is implemented in COSY Infinity that allows the computation of space charge effects of arbitrary and large distributions of particles in an efficient and accurate way based on a variant of the Fast Multipole Method (FMM). It relies on an automatic multigrid-based decomposition of charges in near and far regions and the use of high-order differential algebra methods to obtain decompositions of far fields that lead to an error that scales with a high power of the order. Given an ensemble of N particles, the method allows the computation of the self-fields of all particles on each other with a computational expense that scales as O(N). Further- more, the method allows the computation of all high-order multipoles of the space charge fields that are necessary for the computation of high-order transfer maps and all resulting aberrations. Space charge effects are crucial in modeling the latter stages of the six-dimensional (6D) cooling channel for the Muon Collider. Results of simulating the 6D cooling channel for the Muon Collider using the FMM method and other tools and improvements implemented for ionization cooling lattices are presented.
A computer code has been developed to analyze the inviscid flow field in a supersonic combustion ramjet (scramjet) inlet. The code uses the three-dimensional Euler equations in full conservation form to describe the inlet flow. An algebraic numerical coordinate transformation is used to generate a set of boundary-fitted curvilinear coordinates. The governing equations are solved by a time-asymptotic, unsplit, two-step, finite-difference method. This method is highly efficient on the vector processing computers for which the current code is written. Detailed results are presented for two scramjet inlet configurations over a range of Mach numbers. The calculated results are compared with the available experimental and theoretical results.
The solution method consists of three parts: a grid movement scheme; an unsteady Euler equation solver; and a temporal coupling routine that links the dynamic grid to the Euler solver. The grid movement scheme is an algebraic method containing grid controls that generate a smooth grid that resolves the severe solution gradients and the sharp transitions in the solution gradients. The temporal coupling is performed with a grid prediction correction procedure that is simple to implement and provides a grid that does not lag the solution in time. The adaptive solution method is tested by computing the unsteady inviscid solutions for a one dimensional shock tube and a two dimensional shock vortex iteraction.
The aerospace industry has a need for new metallic alloys that are lightweight and have high strength at elevated temperatures. The BFS (Bozzolo, Ferrante, and Smith) method is a new, computationally efficient and physically sound quantum semi-perturbative approach for describing metals and their defects. Based on a simple interpretation of the alloy formation process that identifies strain and chemical contributions to the energy of the alloy, the method provides an atom-by-atom description of an alloy. Its implementation requires little more than algebra and the solution of transcendental equations. At the NASA Lewis Research Center, we have demonstrated that BFS can investigate the properties of a large number of alloys with a minimum computational effort on low-level computers. This screening allows the selection of the best alloy candidates for a particular application and, therefore, promises large cost savings over current approaches.
We introduce a new iterative Krylov subspace-based eigensolver for the simulation of macromolecular motions on desktop multithreaded platforms equipped with multicore processors and, possibly, a graphics accelerator (GPU). The method consists of two stages, with the original problem first reduced into a simpler band-structured form by means of a high-performance compute-intensive procedure. This is followed by a memory-intensive but low-cost Krylov iteration, which is off-loaded to be computed on the GPU by means of an efficient data-parallel kernel. The experimental results reveal the performance of the new eigensolver. Concretely, when applied to the simulation of macromolecules with a few thousands degrees of freedom and the number of eigenpairs to be computed is small to moderate, the new solver outperforms other methods implemented as part of high-performance numerical linear algebra packages for multithreaded architectures.
This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.
Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.
Electron sources have a wide range of applications and there are many stakeholders that express continuing need for improvements and performance enhancements. Whether we consider ultra-cold, high-brightness, high-charge or high-average current source needs, there are some common themes from the point of view of the beam dynamics involved. These are the following ones: ability to model accurately the emission processes, including the presence of often complicated cathode and other boundary surfaces with a wide range of spatial scales; ability to deal accurately and efficiently with a large number of particles interacting pair-wise, including the stochastic part of these interactions with a wide range of spatial scales; and ability to propagate the particle distributions in time, including collisions with a wide range of temporal scales. These tasks require high precision and accuracy since the goal is usually generation, transport and preservation of very high-quality beams. This grant addressed one of the rem
Microprocessor and arithmetic support chip technology was applied to the design of a reconfigurable emulator for real time flight simulation. The system developed consists of master control system to perform all man machine interactions and to configure the hardware to emulate a given aircraft, and numerous slave compute modules (SCM) which comprise the parallel computational units. It is shown that all parts of the state equations can be worked on simultaneously but that the algebraic equations cannot (unless they are slowly varying). Attempts to obtain algorithms that will allow parellel updates are reported. The word length and step size to be used in the SCM's is determined and the architecture of the hardware and software is described.
The flow over a 5 deg semi-angle cone at incidence in supersonic flow is studied as a model problem for the flow over aircraft forebodies. A computational method utilizing the conically symmetric Navier-Stokes equations is used to obtain theoretical flow results which are compared with experimental data from the Ames Research Center 6- by 6-Foot Wind Tunnel and with results from a cone model sting mounted on an F-15 aircraft. The computed results agree well with the wind-tunnel data but less well with the flight data. Modification of the algebraic turbulence model was necessary to reflect an apparent lower turbulence level in flight than was present in the wind tunnel.
The General Interpolants Method (GIM) code which solves the multidimensional Navier-Stokes equations for arbitrary geometric domains is described. The geometry module in the GIM code generates two and three dimensional grids over specified flow regimes, establishes boundary condition information and computes finite difference analogs for use in the GIM code numerical solution module. The technique can be classified as an algebraic equation approach. The geometry package uses multivariate blending function interpolation of vector-values functions which define the shapes of the edges and surfaces bounding the flow domain. By employing blending functions which conform to the cardinality conditions the flow domain may be mapped onto a unit square (2-D) or unit cube (3-D), thus producing an intrinsic coordinate system for the region of interest. The intrinsic coordinate system facilitates grid spacing control to allow for optimum distribution of nodes in the flow domain.
Numerical solutions of the three-dimensional mass-averaged elliptic Navier-Stokes equations, including species transport, are obtained for nonreacting, turbulent, mixing flow fields for the case of transverse sonic injection of a secondary gas into a supersonic airstream through a circular orifice injector. Results are presented for flow through a constant area duct and through a duct with a rearward-facing step upstream of the injector. The equations are numerically integrated using MacCormack's explicit method and turbulence is included using the Baldwin-Lomax algebraic eddy viscosity model. In the species transport and energy equations, diffusion coefficients based on Fick's law and an assumption of unit Lewis number are applied. The computations were performed on a CDC-VPS-32 (extended version of Cyber-205) using a grid consisting of approximately 200,000 points. The computed results are compared with experimentally observed penetration and spreading boundaries for an injected gas at two dynamic pressure ratios. Three-dimensional flow field structures are dipicted in terms of static pressure, mass fractions of species and velocity vectors.
A new three-dimensional (3D) adaptive grid code based on the algebraic, solution-adaptive scheme of Nakahashi and Deiwert is developed and applied to a variety of problems. The new computer code, SAGE, is an extension of the same-named two-dimensional (2D) solution-adaptive program that has already proven to be a powerful tool in computational fluid dynamics applications. The new code has been applied to a range of complex three-dimensional, supersonic and hypersonic flows. Examples discussed are a tandem-slot fuel injector, the hypersonic forebody of the Aeroassist Flight Experiment (AFE), the 3D base flow behind the AFE, the supersonic flow around a 3D swept ramp and a generic, hypersonic, 3D nozzle-plume flow. The associated adapted grids and the solution enhancements resulting from the grid adaption are presented for these cases. Three-dimensional adaption is more complex than its 2D counterpart, and the complexities unique to the 3D problems are discussed.
The interdisciplinary optimization of engineering systems is discussed from the standpoint of the computational alternatives available to the designer. The analysis of such systems typically requires the solution of coupled systems of nonlinear algebraic equations. The solution procedure is necessarily iterative in nature. It is shown that the system can be solved by fixed point iteration, by Newton's method, or by a combination of the two. However, the need for sensitivity analysis may affect the choice of analysis solution method. Similarly, the optimization of the system can be formulated in several ways that are discussed in the paper. It is shown that the effect of the topology of the interaction between disciplines is a key factor in the choice of analysis, sensitivity and optimization methods. Several examples are presented to illustrate the discussion.
A solution procedure is presented which considerably improves the computational efficiency of the viscous-shock-layer technique, especially for long slender bodies. The 'predictor-corrector' procedure suggested for obtaining the shock shape beyond the nose region requires only a single global pass. The accuracy of the present method is demonstrated by comparison with globally iterated results over the entire body and with ground- and flight-test data. A good comparison of the results computed with the two methods is shown for different flowfield chemistry models and axisymmetric body shapes. The new procedure results in computer run times 1/3 to 1/2 of the times required for the full-body global iteration procedure. Further, the algebraic expressions used to specify the initial shock shape eliminate the need for a shock shape generated by external means and permit immediate introduction of the full viscous-shock-layer equations. Finally, the present method of solution for the VSL equations provides to the aerothermal designer a very efficient and accurate tool for detailed flowfield as well as future technology studies.