Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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 1,801 records · Page 100

Formation Flying Design and Applications in Weak Stability Boundary Regions

Weak Stability regions serve as superior locations for interferometric scientific investigations. These regions are often selected to minimize environmental disturbances and maximize observing efficiency. Design of formations in these regions are becoming ever more challenging as more complex missions are envisioned. The development of algorithms to enable the capability for formation design must be further enabled to incorporate better understanding of WSB solution space. This development will improve the efficiency and expand the capabilities of current approaches. The Goddard Space Flight Center (GSFC) is currently supporting multiple formation missions in WSB regions. This end-to-end support consists of mission operations, trajectory design, and control. It also includes both algorithm and software development. The Constellation-X, Maxim, and Stellar Imager missions are examples of the use of improved numerical methods for attaining constrained formation geometries and controlling their dynamical evolution. This paper presents a survey of formation missions in the WSB regions and a brief description of the formation design using numerical and dynamical techniques.

Folta, David↗

Model Structures and Algorithms for Identification of Aerodynamic Models for Flight Dynamics Applications

This paper describes model structures and parameter estimation algorithms suitable for the identification of unsteady aerodynamic models from input-output data. The model structures presented are state space models and include linear time-invariant (LTI) models and linear parameter-varying (LPV) models. They cover a wide range of local and parameter dependent identification problems arising in unsteady aerodynamics and nonlinear flight dynamics. We present a residue algorithm for estimating model parameters from data. The algorithm can incorporate apriori information and is described in detail. The algorithms are evaluated on the F-16XL wind-tunnel test data from NAS Langley Research Center. Results of numerical evaluation are presented. The paper concludes with a discussion major issues and directions for future work.

Prasanth, Ravi K.↗

Composite Characterization Using Laser Doppler Vibrometry and Multi-Frequency Wavenumber Analysis

NASA has recognized the need for better characterization of composite materials to support advances in aeronautics and the next generation of space exploration vehicles. An area of related research is the evaluation of impact induced delaminations. Presented is a non-contact method of measuring the ply depth of impact delamination damage in a composite through use of a Scanning Laser Doppler Vibrometer (SLDV), multi-frequency wavenumber analysis, and a wavenumber-ply correlation algorithm. A single acquisition of a chirp excited lamb wavefield in an impacted composite is post-processed into a numerous single frequency excitation wavefields through a deconvolution process. A spatially windowed wavenumber analysis then extracts local wavenumbers from the wavefield, which are then correlated to theoretical dispersion curves for ply depth determination. SLDV based methods to characterize as-manufactured composite variation using wavefield analysis will also be discussed.

Juarez, Peter↗

The MHOST finite element program: 3-D inelastic analysis methods for hot section components. Volume 1: Theoretical manual

Formulations and algorithms implemented in the MHOST finite element program are discussed. The code uses a novel concept of the mixed iterative solution technique for the efficient 3-D computations of turbine engine hot section components. The general framework of variational formulation and solution algorithms are discussed which were derived from the mixed three field Hu-Washizu principle. This formulation enables the use of nodal interpolation for coordinates, displacements, strains, and stresses. Algorithmic description of the mixed iterative method includes variations for the quasi static, transient dynamic and buckling analyses. The global-local analysis procedure referred to as the subelement refinement is developed in the framework of the mixed iterative solution, of which the detail is presented. The numerically integrated isoparametric elements implemented in the framework is discussed. Methods to filter certain parts of strain and project the element discontinuous quantities to the nodes are developed for a family of linear elements. Integration algorithms are described for linear and nonlinear equations included in MHOST program.

Nakazawa, Shohei↗

Unstructured Unsteady Flow Solver Applicable to MSU TURBO and Computational Design

This paper presents numerical simulations for a high-speed transonic compressor rotor, NASA Rotor 35, using an unstructured grid flow solver U2NCLE. It solves Reynolds averaged Navier-Stokes equations using an arbitrary Mach number solution algorithm. Experiments were conducted at the NASA Glen Research Center to investigate compressor stability enhancement using steady and discrete tip injections. The mass injection upstream of the tip of a high- speed axial compressor rotor has shown effectiveness in suppressing stall in tip-critical rotors. This work presents numerical simulations of a high-speed compressor rotor with and without tip injections. Methods to model the flow injection are described. Numerical simulations are conducted at 80 and 100 percent of the design speed. Results show that numerical solutions are consistent with the experimental trends.

Newman, James C., III↗

Automated Development of Accurate Algorithms and Efficient Codes for Computational Aeroacoustics

The simulation of sound generation and propagation in three space dimensions with realistic aircraft components is a very large time dependent computation with fine details. Simulations in open domains with embedded objects require accurate and robust algorithms for propagation, for artificial inflow and outflow boundaries, and for the definition of geometrically complex objects. The development, implementation, and validation of methods for solving these demanding problems is being done to support the NASA pillar goals for reducing aircraft noise levels. Our goal is to provide algorithms which are sufficiently accurate and efficient to produce usable results rapidly enough to allow design engineers to study the effects on sound levels of design changes in propulsion systems, and in the integration of propulsion systems with airframes. There is a lack of design tools for these purposes at this time. Our technical approach to this problem combines the development of new, algorithms with the use of Mathematica and Unix utilities to automate the algorithm development, code implementation, and validation. We use explicit methods to ensure effective implementation by domain decomposition for SPMD parallel computing. There are several orders of magnitude difference in the computational efficiencies of the algorithms which we have considered. We currently have new artificial inflow and outflow boundary conditions that are stable, accurate, and unobtrusive, with implementations that match the accuracy and efficiency of the propagation methods. The artificial numerical boundary treatments have been proven to have solutions which converge to the full open domain problems, so that the error from the boundary treatments can be driven as low as is required. The purpose of this paper is to briefly present a method for developing highly accurate algorithms for computational aeroacoustics, the use of computer automation in this process, and a brief survey of the algorithms that have resulted from this work. A review of computational aeroacoustics has recently been given by Lele.

Goodrich, John W.↗

Computational Challenges of Viscous Incompressible Flows

Over the past thirty years, numerical methods and simulation tools for incompressible flows have been advanced as a subset of the computational fluid dynamics (CFD) discipline. Although incompressible flows are encountered in many areas of engineering, simulation of compressible flow has been the major driver for developing computational algorithms and tools. This is probably due to the rather stringent requirements for predicting aerodynamic performance characteristics of flight vehicles, while flow devices involving low-speed or incompressible flow could be reasonably well designed without resorting to accurate numerical simulations. As flow devices are required to be more sophisticated and highly efficient CFD took become increasingly important in fluid engineering for incompressible and low-speed flow. This paper reviews some of the successes made possible by advances in computational technologies during the same period, and discusses some of the current challenges faced in computing incompressible flows.

Kwak, Dochan↗

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8.

Navier Stokes simulation↗

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8. Previously announced in STAR as N83-24467

Chima, R. V.↗

A coarse-grid correction/nonlinear relaxation algorithm for the three-dimensional, compressible Navier-Stokes equations

A combined coarse-grid correction/upwind relaxation strategy to provide rapid convergence for 3D high-speed viscous flowfields is discussed an evaluated. The construction and analysis of a simple two-grid acceleration procedure based on 'hyperbolic' multigrid concepts is presented. Numerical simulations of a 2D compression-corner flowfield, a 3D crossing shock/turbulent boundary layer interaction, and a 3D scramjet inlet flowfield are presented to illustrate the benefits of the approach. Results indicate that the procedure generally converges two or more times faster than the baseline algorithm.

Edwards, Jack R.↗

Computation of viscous transonic flow over porous airfoils

The viscous effects on transonic flow past an airfoil which contains a shallow cavity beneath a porous surface are studied numerically. The porous region occupies a small portion of the total airfoil surface, and is located near the shock. Both an interactive boundary layer (IBL) algorithm and a thin-layer Navier-Stokes (TLNS) algorithm have been modified for use in studying the outer flow, whereas a stream-function formulation has been used to model the inner flow in the small cavity. The coupling procedure at the porous surface is based on Darcy's law and on the assumption of a constant total presusre in the cavity. In addition, a modified Baldwin-Lomax turbulence model is used to consider the transpired turbulent boundary layer in the TLNS approach, and the Cebeci-Smith turbulence model is used in the IBL approach. According to the present analysis, a porous surface can reduce the wave drag appreciably, but it can also increase viscous losses. As has been observed experimentally, the numerical results indicate that the total drag is reduced at higher Mach numbers and increased at lower Mach numbers when the angles of attack are small. Furthermore, the streamline patterns of passive-shock and boundary-layer interaction are revealed in this study.

Chow, Chuen-Yen↗

Development of deterministic transport methods for low energy neutrons for shielding in space

Transport of low energy neutrons associated with the galactic cosmic ray cascade is analyzed in this dissertation. A benchmark quality analytical algorithm is demonstrated for use with BRYNTRN, a computer program written by the High Energy Physics Division of NASA Langley Research Center, which is used to design and analyze shielding against the radiation created by the cascade. BRYNTRN uses numerical methods to solve the integral transport equations for baryons with the straight-ahead approximation, and numerical and empirical methods to generate the interaction probabilities. The straight-ahead approximation is adequate for charged particles, but not for neutrons. As NASA Langley improves BRYNTRN to include low energy neutrons, a benchmark quality solution is needed for comparison. The neutron transport algorithm demonstrated in this dissertation uses the closed-form Green's function solution to the galactic cosmic ray cascade transport equations to generate a source of neutrons. A basis function expansion for finite heterogeneous and semi-infinite homogeneous slabs with multiple energy groups and isotropic scattering is used to generate neutron fluxes resulting from the cascade. This method, called the FN method, is used to solve the neutral particle linear Boltzmann transport equation. As a demonstration of the algorithm coded in the programs MGSLAB and MGSEMI, neutron and ion fluxes are shown for a beam of fluorine ions at 1000 MeV per nucleon incident on semi-infinite and finite aluminum slabs. Also, to demonstrate that the shielding effectiveness against the radiation from the galactic cosmic ray cascade is not directly proportional to shield thickness, a graph of transmitted total neutron scalar flux versus slab thickness is shown. A simple model based on the nuclear liquid drop assumption is used to generate cross sections for the galactic cosmic ray cascade. The ENDF/B V database is used to generate the total and scattering cross sections for neutrons in aluminum. As an external verification, the results from MGSLAB and MGSEMI were compared to ANISN/PC, a routinely used neutron transport code, showing excellent agreement. In an application to an aluminum shield, the FN method seems to generate reasonable results.

Ganapol, Barry↗

Assessing Effects of Climate and Technology Uncertainties in Large Natural Resource Allocation Problems

The productivity of the world's natural resources is critically dependent on a variety of highly uncertain factors, which obscure individual investors and governments that seek to make long-term, sometimes irreversible, investments in their exploration and utilization. These dynamic considerations are poorly represented in disaggregated resource models, as incorporating uncertainty into large-dimensional problems presents a challenging computational task. In this paper, we apply the SCEQ algorithm (Cai and Judd, 2023) to solve a large-scale dynamic stochastic global land resource use problem with stochastic crop yields due to adverse climate impacts and limits on further technological progress. For the same model parameters and bounded shocks, the range of land conversion is considerably smaller for the dynamic stochastic model than for deterministic scenario analysis.

numerical methods↗

Topography Modeling in Atmospheric Flows Using the Immersed Boundary Method

Numerical simulation of flow over complex geometry needs accurate and efficient computational methods. Different techniques are available to handle complex geometry. The unstructured grid and multi-block body-fitted grid techniques have been widely adopted for complex geometry in engineering applications. In atmospheric applications, terrain fitted single grid techniques have found common use. Although these are very effective techniques, their implementation, coupling with the flow algorithm, and efficient parallelization of the complete method are more involved than a Cartesian grid method. The grid generation can be tedious and one needs to pay special attention in numerics to handle skewed cells for conservation purposes. Researchers have long sought for alternative methods to ease the effort involved in simulating flow over complex geometry.

Ackerman, A. S.↗

On stiffly stable implicit linear multistep methods.

The motivation to increase the step size with no degradation of numerical accuracy and stability has led to the discovery of particular members of the class of stiffly stable implicit linear multistep algorithms. Sufficient conditions for a consistent linear multistep method to be stiffly stable are given. These conditions involve properties of the stability mapping from the extended complex plane onto itself.

Cooke, C. H.↗

Outline of a new approach to the analysis of complex systems and decision processes.

Development of a conceptual framework for dealing with systems which are too complex or too ill-defined to admit of precise quantitative analysis. The approach outlined is based on the premise that the key elements in human thinking are not numbers, but labels of fuzzy sets - i.e., classes of objects in which the transition from membership to nonmembership is gradual rather than abrupt. The approach in question has three main distinguishing features - namely, the use of so-called 'linguistic' variables in place of or in addition to numerical variables, the characterization of simple relations between variables by conditional fuzzy statements, and the characterization of complex relations by fuzzy algorithms.

Zadeh, L. A.↗

Iterative methods for plasma sheath calculations: Application to spherical probe

The computer cost of a Poisson-Vlasov iteration procedure for the numerical solution of a steady-state collisionless plasma-sheath problem depends on: (1) the nature of the chosen iterative algorithm, (2) the position of the outer boundary of the grid, and (3) the nature of the boundary condition applied to simulate a condition at infinity (as in three-dimensional probe or satellite-wake problems). Two iterative algorithms, in conjunction with three types of boundary conditions, are analyzed theoretically and applied to the computation of current-voltage characteristics of a spherical electrostatic probe. The first algorithm was commonly used by physicists, and its computer costs depend primarily on the boundary conditions and are only slightly affected by the mesh interval. The second algorithm is not commonly used, and its costs depend primarily on the mesh interval and slightly on the boundary conditions.

Parker, L. W.↗

Interpolation in numerical optimization

The present work discusses the generation of the cubic-spline interpolator in numerical optimization methods which use a variable-step integrator with step size control based on local relative truncation error. An algorithm for generating the cubic spline with successive over-relaxation is presented which represents an improvement over that given by Ralston and Wilf (1967). Rewriting the code reduces the number of N-vectors from eight to one. The algorithm is formulated in such a way that the solution of the linear system set up yields the first derivatives at the nodal points. This method is as accurate as other schemes but requires the minimum amount of storage.

Hall, K. R.↗

Refine your search to explore more results.