Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational efficiency”

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 289 records · Page 16

The gravitational field of a disk

The gravitational potential of a disk is given, as is the gravitational field at a point in space. It is pointed out that formulas for a ring can be obtained as the difference between the results presented here for two different values of the disk radius. Results are obtained in terms of elliptic integrals and it is shown how these functions can be computed efficiently. Formulas necessary for the computation of partial derivatives are also presented.

Krough, F. T.↗

An algorithm for computing the number of distinct spectral vectors in thematic mapper data

A computationally efficient method was developed to compute the number of distinct spectral vectors and their frequency of occurrence in Landsat-4 Thematic Mapper (TM) data. The algorithm first partitions the image into spectrally disjoint subsets and then computes the frequency distribution of distinct spectral vectors within each subset from a multidimensional histogram. The overall frequency distribution is tabulated by accumulating the results from each subset. The number of distinct spectral vectors could be used as a measure of potential storage compaction of alternate data representations for data compression, or as a measure of information content in the comparison of spectral band combinations and/or spatial resolutions for an image. Results from processing three 512 x 512 pixel Landsat-4 TM images and one Landsat-4 Multispectral Scanner (MSS) image are presented as examples. An algorithm for computing the frequency distribution of distinct spectral vectors in MSS data is given in the Appendix.

Wharton, S. W.↗

The use of the QR factorization in the partial realization problem

The use of the QR factorization of the Hankel matrix in solving the partial realization problem is analyzed. Straightforward use of the QR factorization results in a realization scheme that possesses all of the computational advantages of Rissanen's realization scheme. These latter properties are computational efficiency, recursiveness, use of limited computer memory, and the realization of a system triplet having a condensed structure. Moreover, this scheme is robust when the order of the system corresponds to the rank of the Hankel matrix. When this latter condition is violated, an approximate realization could be determined via the QR factorization. In this second scheme, the given Hankel matrix is approximated by a low-rank non-Hankel matrix. Furthermore, it is demonstrated that column pivoting might be incorporated in this second scheme. The results presented are derived for a single input/single output system, but this does not seem to be a restriction.

Verhaegen, M. H.↗

A two-layer multiple-time-scale turbulence model and grid independence study

A two-layer multiple-time-scale turbulence model is presented. The near-wall model is based on the classical Kolmogorov-Prandtl turbulence hypothesis and the semi-empirical logarithmic law of the wall. In the two-layer model presented, the computational domain of the conservation of mass equation and the mean momentum equation penetrated up to the wall, where no slip boundary condition has been prescribed; and the near wall boundary of the turbulence equations has been located at the fully turbulent region, yet very close to the wall, where the standard wall function method has been applied. Thus, the conservation of mass constraint can be satisfied more rigorously in the two-layer model than in the standard wall function method. In most of the two-layer turbulence models, the number of grid points to be used inside the near-wall layer posed the issue of computational efficiency. The present finite element computational results showed that the grid independent solutions were obtained with as small as two grid points, i.e., one quadratic element, inside the near wall layer. Comparison of the computational results obtained by using the two-layer model and those obtained by using the wall function method is also presented.

Kim, S.-W.↗

Development of a CFD code for internal flows in liquid fueled engines

To support the design efforts of engines in which liquid propellants are used, one is often required to analyze incompressible, two-dimensional or axisymmetric flows within ducts and cavities with rotating walls and complicated geometries. The steady-state solution is of interest in most cases. This code is intended to provide a tool for efficient computational fluid dynamics (CFD) analysis of such flow problems, taking advantage of the artificial compressibility concept and the Beam-Warming numerical scheme modified for second order accurate, implicit boundary conditions. These concepts ensure a stable, robust, and accurate algorithm due to the reduced speed of sound and the accuracy of the boundary conditions. The code is dedicated only to two-dimensional or axisymmetric flows with or without swirl. Three-dimensional computation is excluded to increase efficiency and speed. This paper briefly presents the theory of the code, as well as several benchmark applications with comparison to well known analytical solutions. In all these test cases, the code produced accurate results.

Dakhoul, Youssef↗

Order-Reduced Solution of the Nonlinear High-Fidelity Generalized Method of Cells Micromechanics Relations

The High-Fidelity Generalized Method of Cells (HFGMC) is one technique for accurately simulating nonlinear composite material behavior. The HFGMC uses a higher-order approximation for the subcell displacement field that allows for a more accurate determination of the subcell stressstrain fields at the cost of some computational efficiency. In order to reduce computational costs associated with the solution of the ensuing system of simultaneous equations, the HFGMC global system of equations for doubly-periodic repeating unit cells with nonlinear constituents was reduced in size through the use of a Petrov-Galerkin-based Proper Orthogonal Decomposition order-reduction scheme. A number of cases were presented that address the computational feasibility of using order-reduction techniques to solve solid mechanics problems involving complex microstructures.

order-reduction↗

Partial Derivatives of the Lambert Problem

A procedure for deriving analytic partial derivatives of the Lambert problem is presented. Using the universal, cosine based Lambert formulation; first order partial derivatives of the velocities with respect to the positions and times are developed. Taking advantage of inherent symmetries and intermediate variables, the derivatives are expressed in a computationally efficient form. The added cost of computing these partials is found to be approximately 10% to approximately 60% of the Lambert compute cost. The availability of analytic partial derivatives increases optimization speed, efficiency and allows for trajectory optimization formulations that implicitly enforce continuity constraints via embedded Lambert problems.

trajectory computation↗

Development of Efficient Real-Fluid Model in Simulating Liquid Rocket Injector Flows

The characteristics of propellant mixing near the injector have a profound effect on the liquid rocket engine performance. However, the flow features near the injector of liquid rocket engines are extremely complicated, for example supercritical-pressure spray, turbulent mixing, and chemical reactions are present. Previously, a homogeneous spray approach with a real-fluid property model was developed to account for the compressibility and evaporation effects such that thermodynamics properties of a mixture at a wide range of pressures and temperatures can be properly calculated, including liquid-phase, gas- phase, two-phase, and dense fluid regions. The developed homogeneous spray model demonstrated a good success in simulating uni- element shear coaxial injector spray combustion flows. However, the real-fluid model suffered a computational deficiency when applied to a pressure-based computational fluid dynamics (CFD) code. The deficiency is caused by the pressure and enthalpy being the independent variables in the solution procedure of a pressure-based code, whereas the real-fluid model utilizes density and temperature as independent variables. The objective of the present research work is to improve the computational efficiency of the real-fluid property model in computing thermal properties. The proposed approach is called an efficient real-fluid model, and the improvement of computational efficiency is achieved by using a combination of a liquid species and a gaseous species to represent a real-fluid species.

Cheng, Gary↗

An Efficient Solution Method for Multibody Systems with Loops Using Multiple Processors

This paper describes a multibody dynamics algorithm formulated for parallel implementation on multiprocessor computing platforms using the divide-and-conquer approach. The system of interest is a general topology of rigid and elastic articulated bodies with or without loops. The algorithm divides the multibody system into a number of smaller sets of bodies in chain or tree structures, called "branches" at convenient joints called "connection points", and uses an Order-N (O (N)) approach to formulate the dynamics of each branch in terms of the unknown spatial connection forces. The equations of motion for the branches, leaving the connection forces as unknowns, are implemented in separate processors in parallel for computational efficiency, and the equations for all the unknown connection forces are synthesized and solved in one or several processors. The performances of two implementations of this divide-and-conquer algorithm in multiple processors are compared with an existing method implemented on a single processor.

Multibody dynamics↗

Ginkgo - A math library designed to accelerate Exascale Computing Project science applications

Large-scale simulations require efficient computation across the entire computing hierarchy. A challenge of the Exascale Computing Project (ECP) was to reconcile highly heterogeneous hardware with the myriad of applications that were required to run on these supercomputers. Mathematical software forms the backbone of almost all scientific applications, providing efficient abstractions and operations that are crucial to harness the performance of computing systems. Ginkgo is one such mathematical software library, nurtured by ECP, providing high-performance, user-friendly, and performance portable interfaces for applications in ECP and beyond. In this paper, we elaborate on Ginkgo’s philosophy of high-performance software that is sustainable, reproducible, and easy to use. We showcase the wide feature set of solvers and preconditioners available in Ginkgo and the central concepts involved in their design. We elaborate on four different ECP software integrations: MFEM, PeleLM + SUNDIALS, XGC, and ExaSGD that use Ginkgo to accelerate their science runs. Performance studies of different problems from these applications highlight the effectiveness of Ginkgo and the benefits incurred by these ECP applications.

Cojean, Terry↗

Efficient Method for Optimizing Placement of Sensors

A computationally efficient method has been developed to enable optimization of the placement of sensors for the purpose of diagnosis of a complex engineering system (e.g., an aircraft or spacecraft). The method can be used both in (1) designing a sensor system in which the number and positions of sensors are initially not known and must be determined and (2) adding sensors to a pre-existing system to increase the diagnostic capability. The optimal-sensor-placement problem can be summarized as involving the following concepts, issues, and subproblems: a) Degree of Diagnosability - This is a concept for characterizing the set of faults that can be discriminated by use of a given set of sensors. b) Minimal Sensor Set - The idea is one of finding a minimal set of sensors that guarantees a specific degree of diagnosability. c) Minimal-Cost Sensors - In a case in which different sensors are assigned with different costs, it is desired to choose the least costly set of sensors that affords a specific degree of diagnosability.

Fijany, Amir↗

Numerical computation of transonic flow about wing-fuselage configurations on a vector computer

The transonic wing analysis code TWING, which uses the AF2 relaxation algorithm, has been vectorized to run on the Cray-1S computer. Vectorization of this code improved computational efficiency over that of the CDC 7600 computer by factors of 11 to 13. The improvement compares favorably with the prediction of a theoretical performance model. A convenient generalization now permits the treatment of rudimentary wing-fuselage combinations. Flow predictions for a transport configuration in both isolated-wing and wing-fuselage modes show the expected trends in shock strength and position when compared with wind-tunnel results. An isolated fighter wing is examined in terms of execution time on three different computers and in comparison with experimental data. The computational fluid dynamics code produced during this study is a careful union of an efficient three-dimensional, transonic, numerical algorithm and the vector features presently available on modern computers.

Thomas, S. D.↗

Recent Enhancements to NASA’s PCBoom Sonic Boom Propagation Code

This paper presents the recent updates the author has made to PCBoom sonic boom propagation code on its computational efficiency, predictive capability, and file operations. The updated version has recently been released and has a Burgers’ equation solver, which is computationally more efficient than that in the older version by 2 to 3 orders of magnitude. The updated version also enhances the accuracy of the sonic boom propagation prediction by accounting for the full wind effects on the shock wave propagation. Predictions from the updated PCBoom are compared with predictions from the older version and with data from flight tests. Other upgrades and changes that have been made in the latest version include support for Unix-like operating systems, bug fixes, and generation of new types of output files that allow for better manipulation of PCBoom-generated data.

Lonzaga, Joel B.↗

Efficient near-field ptychography reconstruction using the Hessian operator

X-ray ptychography is a powerful and robust coherent imaging method providing access to the complex object and probe (illumination). Ptychography reconstruction is typically performed using first-order methods due to their computational efficiency. Higher-order methods, while potentially more accurate, are often prohibitively expensive in terms of computation. In this study, we present a mathematical framework for reconstruction using second-order information derived from an efficient computation of the bilinear Hessian and Hessian operator. The formulation is provided for Gaussian-based models, enabling the simultaneous reconstruction of the object, probe, and object positions. Synthetic data tests, along with experimental near-field ptychography data processing, demonstrate a ten-fold reduction in computation time compared to first-order methods. The derived formulas for computing the Hessians, along with the strategies for incorporating them into optimization schemes, are well-structured and easily adaptable to various ptychography problem formulations.

Carlsson, Marcus [Lund Univ. (Sweden)] (ORCID:0000↗

A Very High Order, Adaptable MESA Implementation for Aeroacoustic Computations

Since computational efficiency and wave resolution scale with accuracy, the ideal would be infinitely high accuracy for problems with widely varying wavelength scales. Currently, many of the computational aeroacoustics methods are limited to 4th order accurate Runge-Kutta methods in time which limits their resolution and efficiency. However, a new procedure for implementing the Modified Expansion Solution Approximation (MESA) schemes, based upon Hermitian divided differences, is presented which extends the effective accuracy of the MESA schemes to 57th order in space and time when using 128 bit floating point precision. This new approach has the advantages of reducing round-off error, being easy to program. and is more computationally efficient when compared to previous approaches. Its accuracy is limited only by the floating point hardware. The advantages of this new approach are demonstrated by solving the linearized Euler equations in an open bi-periodic domain. A 500th order MESA scheme can now be created in seconds, making these schemes ideally suited for the next generation of high performance 256-bit (double quadruple) or higher precision computers. This ease of creation makes it possible to adapt the algorithm to the mesh in time instead of its converse: this is ideal for resolving varying wavelength scales which occur in noise generation simulations. And finally, the sources of round-off error which effect the very high order methods are examined and remedies provided that effectively increase the accuracy of the MESA schemes while using current computer technology.

Dydson, Roger W.↗

A reformulation of the Linear-Quadratic-Gaussian stochastic control problem for application to low thrust navigation analysis

The formulation of the classical Linear-Quadratic-Gaussian stochastic control problem as employed in low thrust navigation analysis is reviewed. A reformulation is then presented which eliminates a potentially unreliable matrix subtraction in the control calculations, improves the computational efficiency, and provides for a cleaner computational interface between the estimation and control processes. Lastly, the application of the U-D factorization method to the reformulated equations is examined with the objective of achieving a complete set of factored equations for the joint estimation and control problem.

Jacobson, R. A.↗

An efficient Mindlin finite strip plate element based on assumed strain distribution

A simple two node, linear, finite strip plate bending element based on Mindlin-Reissner plate theory for the analysis of very thin to thick bridges, plates, and axisymmetric shells is presented. The new transverse shear strains are assumed for constant distribution in the two node linear strip. The important aspect is the choice of the points that relate the nodal displacements and rotations through the locking transverse shear strains. The element stiffness matrix is explicitly formulated for efficient computation and ease in computer implementation. Numerical results showing the efficiency and predictive capability of the element for analyzing plates with different supports, loading conditions, and a wide range of thicknesses are given. The results show no sign of the shear locking phenomenon.

Chulya, Abhisak↗

Improved finite strip Mindlin plate bending element using assumed shear strain distributions

A linear finite strip plate element based on Mindlin/Reissner plate theory is developed. The analysis is suitable for both thin and thick plates. In the formulation new transverse shear strains are introduced and assumed constant in each two-code linear strip. The element stiffness matrix is explicitly formulated for efficient computation and computer implementation. Numerical results showing the efficiency and predictive capability of the element for the analysis of plates are presented for different support and loading conditions and a wide range of thicknesses. No sign of shear locking phenomenon was observed with the newly developed element.

Chulya, Abhisak↗