SEARCH · Search NASA

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

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,423 records · Page 79

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Numerical analysis of three-dimensional viscous internal flows

A 3-D Navier-Stokes code has been developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin-layer assumption, and turbulence effects are modeled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially-varying time step and implicit residual smoothing. Calculations have been made of a horseshoe vortex formed in front of a flat plate with a round leading edge standing in a turbulent endwall boundary layer. Comparisons are made with experimental data taken by Eckerle and Langston for a circular cylinder under similar conditions. Computer and measured results are compared in terms of endwall flow visualization pictures and total pressure loss contours and vector plots on the symmetry plane. Calculated details of the primary vortex show excellent agreement with the experimental data. The calculations also show a small secondary vortex not seen experimentally.

Chima, Rodrick V.↗

NASA NTRS2003

Numerical Models of Human Circulatory System under Altered Gravity: Brain Circulation

A computational fluid dynamics (CFD) approach is presented to model the blood flow through the human circulatory system under altered gravity conditions. Models required for CFD simulation relevant to major hemodynamic issues are introduced such as non-Newtonian flow models governed by red blood cells, a model for arterial wall motion due to fluid-wall interactions, a vascular bed model for outflow boundary conditions, and a model for auto-regulation mechanism. The three-dimensional unsteady incompressible Navier-Stokes equations coupled with these models are solved iteratively using the pseudocompressibility method and dual time stepping. Moving wall boundary conditions from the first-order fluid-wall interaction model are used to study the influence of arterial wall distensibility on flow patterns and wall shear stresses during the heart pulse. A vascular bed modeling utilizing the analogy with electric circuits is coupled with an auto-regulation algorithm for multiple outflow boundaries. For the treatment of complex geometry, a chimera overset grid technique is adopted to obtain connectivity between arterial branches. For code validation, computed results are compared with experimental data for steady and unsteady non-Newtonian flows. Good agreement is obtained for both cases. In sin-type Gravity Benchmark Problems, gravity source terms are added to the Navier-Stokes equations to study the effect of gravitational variation on the human circulatory system. This computational approach is then applied to localized blood flows through a realistic carotid bifurcation and two Circle of Willis models, one using an idealized geometry and the other model using an anatomical data set. A three- dimensional anatomical Circle of Willis configuration is reconstructed from human-specific magnetic resonance images using an image segmentation method. The blood flow through these Circle of Willis models is simulated to provide means for studying gravitational effects on the brain circulation under auto-regulation.

Kim, Chang Sung↗

NASA NTRS1983

Computation of viscous flows over airfoils, including separation, with a coupling approach

Viscous incompressible flows over single or multiple airfoils, with or without separation, were computed using an inviscid flow calculation, with modified boundary conditions, and by a method providing calculation and coupling for boundary layers and wakes, within conditions of strong viscous interaction. The inviscid flow is calculated with a method of singularities, the numerics of which were improved by using both source and vortex distributions over profiles, associated with regularity conditions for the fictitious flows inside of the airfoils. The viscous calculation estimates the difference between viscous flow and inviscid interacting flow, with a direct or inverse integral method, laminar or turbulent, with or without reverse flow. The numerical method for coupling determines iteratively the boundary conditions for the inviscid flow. For attached viscous layers regions, an underrelaxation is locally calculated to insure stability. For separated or separating regions, a special semi-inverse algorithm is used. Comparisons with experiments are presented.

Leballeur, J. C.↗

NASA NTRS1980

A numerical technique for calculation of the noise of high-speed propellers with advanced blade geometry

A numerical technique and computer program were developed for the prediction of the noise of propellers with advanced geometry. The blade upper and lower surfaces are described by a curvilinear coordinate system, which was also used to divide the blade surfaces into panels. Two different acoustic formulations in the time domain were used to improve the speed and efficiency of the noise calculations: an acoustic formualtion with the Doppler factor singularity for panels moving at subsonic speeds and the collapsing sphere formulation for panels moving at transonic or supersonic speeds. This second formulation involves a sphere which is centered at the observer position and whose radius decreases at the speed of sound. The acoustic equation consisted of integrals over the curve of intersection for both the sphere and the panels on the blade. Algorithms used in some parts of the computer program are discussed. Comparisons with measured acoustic data for two model high speed propellers with advanced geometry are also presented.

Nystrom, P. A.↗

NASA NTRSDate not supplied

Towards an Optimal Estimation Retrieval of Cirrus Cloud Optical and Microphysical Properties Using Hyperspectral Shortwave Instruments and A Fast Radiative Transfer Algorithm

Cirrus cloud retrieval products (here, cloud optical depth, effective particle size, and cloud top height) are important inputs into numerical weather and climate models. Uncertainties in such retrieval products, as a matter of course, propagate downstream, impacting model calculations. Improvements in high-quality global cirrus cloud optical and microphysical data products from satellite observations are needed to understand and reduce retrieval uncertainties. Hyperspectral shortwave instruments produce high-resolution and information-dense spectra, thus offering the opportunity to reduce uncertainties in retrieval products. We are in the process of developing a retrieval that uses the very fast Principal Component Radiative Transfer Model in the solar spectral region (PCRTM-Solar) in the forward model calculations. This retrieval will use measured reflectances from the NASA Earth Surface Mineral Dust Source Investigation (EMIT) and the forthcoming Climate Absolute Radiance and Refractivity Observatory Pathfinder (CLARREO-Pathfinder) instruments. In this manuscript we present progress towards a reference retrieval employing a widely used, verified, accurate, yet computationally slower radiative transfer modeling technique. The reference retrieval, while too slow for using the complete hyperspectral measurement, will allow us to study the behavior of retrieval products and help us verify results from our in-development fast retrieval. Both retrievals will use the optimal estimation retrieval framework. In this manuscript we present results from an uncertainty analysis considering three uncertainty sources for a cirrus cloud retrieval in the form of error covariance matrices: reflectance uncertainty due to water vapor, the reflectance uncertainty due to ice crystal scattering assumptions, and the instrument measurement uncertainty. Results show that the uncertainty due to habit selection is the largest, while that due to water vapor is at most 0.6% relative to channel reflectance. As a first step, the retrieval is being designed for single layer ice clouds over open ocean water.

Cirrus cloud↗

NASA NTRS1993

Rate determination from vector observations

Vector observations are a common class of attitude data provided by a wide variety of attitude sensors. Attitude determination from vector observations is a well-understood process and numerous algorithms such as the TRIAD algorithm exist. These algorithms require measurement of the line of site (LOS) vector to reference objects and knowledge of the LOS directions in some predetermined reference frame. Once attitude is determined, it is a simple matter to synthesize vehicle rate using some form of lead-lag filter, and then, use it for vehicle stabilization. Many situations arise, however, in which rate knowledge is required but knowledge of the nominal LOS directions are not available. This paper presents two methods for determining spacecraft angular rates from vector observations without a priori knowledge of the vector directions. The first approach uses an extended Kalman filter with a spacecraft dynamic model and a kinematic model representing the motion of the observed LOS vectors. The second approach uses a 'differential' TRIAD algorithm to compute the incremental direction cosine matrix, from which vehicle rate is then derived.

Weiss, Jerold L.↗

NASA NTRS2000

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗

NASA NTRS2001

Algorithms and Application of Sparse Matrix Assembly and Equation Solvers for Aeroacoustics

An algorithm for symmetric sparse equation solutions on an unstructured grid is described. Efficient, sequential sparse algorithms for degree-of-freedom reordering, supernodes, symbolic/numerical factorization, and forward backward solution phases are reviewed. Three sparse algorithms for the generation and assembly of symmetric systems of matrix equations are presented. The accuracy and numerical performance of the sequential version of the sparse algorithms are evaluated over the frequency range of interest in a three-dimensional aeroacoustics application. Results show that the solver solutions are accurate using a discretization of 12 points per wavelength. Results also show that the first assembly algorithm is impractical for high-frequency noise calculations. The second and third assembly algorithms have nearly equal performance at low values of source frequencies, but at higher values of source frequencies the third algorithm saves CPU time and RAM. The CPU time and the RAM required by the second and third assembly algorithms are two orders of magnitude smaller than that required by the sparse equation solver. A sequential version of these sparse algorithms can, therefore, be conveniently incorporated into a substructuring for domain decomposition formulation to achieve parallel computation, where different substructures are handles by different parallel processors.

Watson, W. R.↗

NASA NTRS1984

On the solution of problems involving impact type loading

The response of beam and plate members to pulse and impact loading is investigated, and numerical methods are analyzed and compared. The equations of motion, the finite difference and finite element methods, the time integration/Runge-Kutta techniques, and material modeling are discussed in detail. It is found that both the finite difference and the finite element methods could be accurately employed to discretize the spatial variation in the displacements. Central differences or a fourth order Runge-Kutta algorithm could be used for the time integration. The total energy of the system would give the stability and accuracy of the solution. Results showed that the finite element method provided better efficiency in obtaining accurate solution than the finite difference method when a scalar processor is used. However, the finite difference method was more efficient on the vector processor. Therefore, the most efficient method of solution depends on the type of computer present for the analysis.

Moyer, E. T., Jr.↗

NASA NTRS1985

On the electromagnetic scattering from infinite rectangular conducting grids

The study and development of two numerical techniques for the analysis of electromagnetic scattering from a rectangular wire mesh are described. Both techniques follow from one basic formulation and they are both solved in the spectral domain. These techniques were developed as a result of an investigation towards more efficient numerical computation for mesh scattering. These techniques are efficient for the following reasons: (a1) make use of the Fast Fourier Transform; (b2) they avoid any convolution problems by converting integrodifferential equations into algebraic equations; and (c3) they do not require inversions of any matrices. The first method, the SIT or Spectral Iteration Technique, is applied for regions where the spacing between wires is not less than two wavelengths. The second method, the SDCG or Spectral Domain Conjugate Gradient approach, can be used for any spacing between adjacent wires. A study of electromagnetic wave properties, such as reflection coefficient, induced currents and aperture fields, as functions of frequency, angle of incidence, polarization and thickness of wires is presented. Examples and comparisons or results with other methods are also included to support the validity of the new algorithms.

Christodoulou, C.↗

NASA NTRS1988

Estimation of time- and state-dependent delays and other parameters in functional differential equations

A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.

Murphy, K. A.↗

NASA NTRS1990

Estimation of time- and state-dependent delays and other parameters in functional differential equations

Murphy, K. A.↗

NASA NTRS1993

A multilevel adaptive projection method for unsteady incompressible flow

There are two main requirements for practical simulation of unsteady flow at high Reynolds number: the algorithm must accurately propagate discontinuous flow fields without excessive artificial viscosity, and it must have some adaptive capability to concentrate computational effort where it is most needed. We satisfy the first of these requirements with a second-order Godunov method similar to those used for high-speed flows with shocks, and the second with a grid-based refinement scheme which avoids some of the drawbacks associated with unstructured meshes. These two features of our algorithm place certain constraints on the projection method used to enforce incompressibility. Velocities are cell-based, leading to a Laplacian stencil for the projection which decouples adjacent grid points. We discuss features of the multigrid and multilevel iteration schemes required for solution of the resulting decoupled problem. Variable-density flows require use of a modified projection operator--we have found a multigrid method for this modified projection that successfully handles density jumps of thousands to one. Numerical results are shown for the 2D adaptive and 3D variable-density algorithms.

Howell, Louis H.↗

NASA NTRS1987

Fronts propagating with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations

New numerical algorithms are devised (PSC algorithms) for following fronts propagating with curvature-dependent speed. The speed may be an arbitrary function of curvature, and the front can also be passively advected by an underlying flow. These algorithms approximate the equations of motion, which resemble Hamilton-Jacobi equations with parabolic right-hand-sides, by using techniques from the hyperbolic conservation laws. Non-oscillatory schemes of various orders of accuracy are used to solve the equations, providing methods that accurately capture the formation of sharp gradients and cusps in the moving fronts. The algorithms handle topological merging and breaking naturally, work in any number of space dimensions, and do not require that the moving surface be written as a function. The methods can be used also for more general Hamilton-Jacobi-type problems. The algorithms are demonstrated by computing the solution to a variety of surface motion problems.

Osher, Stanley↗

NASA NTRS1989

An explicit Runge-Kutta method for turbulent reacting flow calculations

The paper presents a numerical method for the solution of the conservation equations governing steady, reacting, turbulent viscous flow in two-dimensional geometries, in both Cartesian and axisymmetric coordinates. These equations are written in Favre-averaged form and closed with a first order model. A two-equation K-epsilon model, where low Reynolds number and compressibility effects are included, and a modified eddy-break up model are used to simulate fluid mechanics turbulence, chemistry and turbulence-combustion interaction. The solution is obtained by using a pseudo-unsteady method with improved perturbation propagation properties. The equations are discretized in space by using a finite volume formulation. An explicit multi-stage dissipative Runge-Kutta algorithm is then used to advance the flow equations in the pseudo-time. The method is applied to the computation of both diffusion and premixed turbulent reacting flows. The computed temperature distributions compare favorably with experimental data.

Boretti, A. A.↗

NASA NTRS1991

Identification of observer/Kalman filter Markov parameters: Theory and experiments

An algorithm to compute Markov parameters of an observer or Kalman filter from experimental input and output data is discussed. The Markov parameters can then be used for identification of a state space representation, with associated Kalman gain or observer gain, for the purpose of controller design. The algorithm is a non-recursive matrix version of two recursive algorithms developed in previous works for different purposes. The relationship between these other algorithms is developed. The new matrix formulation here gives insight into the existence and uniqueness of solutions of certain equations and gives bounds on the proper choice of observer order. It is shown that if one uses data containing noise, and seeks the fastest possible deterministic observer, the deadbeat observer, one instead obtains the Kalman filter, which is the fastest possible observer in the stochastic environment. Results are demonstrated in numerical studies and in experiments on an ten-bay truss structure.

Juang, Jer-Nan↗

NASA NTRS1991

Identification of observer/Kalman filter Markov parameters - Theory and experiments

Juang, Jer-Nan↗

NASA NTRS2006

Thermal Model of a Current-Carrying Wire in a Vacuum

A computer program implements a thermal model of an insulated wire carrying electric current and surrounded by a vacuum. The model includes the effects of Joule heating, conduction of heat along the wire, and radiation of heat from the outer surface of the insulation on the wire. The model takes account of the temperature dependences of the thermal and electrical properties of the wire, the emissivity of the insulation, and the possibility that not only can temperature vary along the wire but, in addition, the ends of the wire can be thermally grounded at different temperatures. The resulting second-order differential equation for the steady-state temperature as a function of position along the wire is highly nonlinear. The wire is discretized along its length, and the equation is solved numerically by use of an iterative algorithm that utilizes a multidimensional version of the Newton-Raphson method.

Border, James↗