Search NASA⌕ Search

SEARCH · Search NASA

Results for “explicit and implicit methods”

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 235 records · Page 13

Upwind MacCormack Euler solver with non-equilibrium chemistry

A computer code, designated UMPIRE, is currently under development to solve the Euler equations in two dimensions with non-equilibrium chemistry. UMPIRE employs an explicit MacCormack algorithm with dissipation introduced via Roe's flux-difference split upwind method. The code also has the capability to employ a point-implicit methodology for flows where stiffness is introduced through the chemical source term. A technique consisting of diagonal sweeps across the computational domain from each corner is presented, which is used to reduce storage and execution requirements. Results depicting one dimensional shock tube flow for both calorically perfect gas and thermally perfect, dissociating nitrogen are presented to verify current capabilities of the program. Also, computational results from a chemical reactor vessel with no fluid dynamic effects are presented to check the chemistry capability and to verify the point implicit strategy.

Sherer, Scott E.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

A high-order Lagrangian-decoupling method for the incompressible Navier-Stokes equations

A high-order Lagrangian-decoupling method is presented for the unsteady convection-diffusion and incompressible Navier-Stokes equations. The method is based upon: (1) Lagrangian variational forms that reduce the convection-diffusion equation to a symmetric initial value problem; (2) implicit high-order backward-differentiation finite-difference schemes for integration along characteristics; (3) finite element or spectral element spatial discretizations; and (4) mesh-invariance procedures and high-order explicit time-stepping schemes for deducing function values at convected space-time points. The method improves upon previous finite element characteristic methods through the systematic and efficient extension to high order accuracy, and the introduction of a simple structure-preserving characteristic-foot calculation procedure which is readily implemented on modern architectures. The new method is significantly more efficient than explicit-convection schemes for the Navier-Stokes equations due to the decoupling of the convection and Stokes operators and the attendant increase in temporal stability. Numerous numerical examples are given for the convection-diffusion and Navier-Stokes equations for the particular case of a spectral element spatial discretization.

Ho, Lee-Wing↗

A high-resolution numerical technique for inviscid gas-dynamic problems with weak solutions

The shock resolution of Harten's (1982) second-order explicit method for one-dimensional hyperbolic conservation laws is investigated for a two-dimensional gas-dynamic problem. The possible extension to a high resolution implicit method for both one- and two-dimensional problems is also investigated. Applications of Harten's method to the quasi-one-dimensional nozzle problem with two nozzle shapes (divergent and convergent-divergent) and the two-dimensional shock-reflection problem resulted in high shock resolution steady-state numerical solutions.

Yee, H. C.↗

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.↗

Some considerations on velocity vector accuracy in dust trajectory analysis

The relative contributions of comets and asteroids to the reservoir of dust in the interplanetary medium is not known. There are direct observations of dust released from comets and there is evidence to associate the IRAS dust bands with possible collisions of asteroids in the main belt. A means towards sorting out the parent sources has been proposed in the establishment of a dust collector in orbit about the Earth. The purpose of such a facility would be to collect not only cosmic dust particles intact but also the state vectors, as they arrive at the detector, the idea being that one may combine analytical laboratory analysis of the physics and chemistry of the captured particles with orbital data in order to help distinguish between bodies and identify parent bodies. The theoretical study of dust particle orbits in the solar system takes on greatly more importance if we use collected trajectory data. The orbital motion of dust when radiation and forces alone are acting is well understood. When gravitational forces due to the planets are included, the motion can become quite complex. In order to characterize the orbits of particles as they crossed the Earth's orbits, a study of the long-time dust orbital evolution was undertaken. We have considered various parameters associated with these dust orbits to see if one may in a general way discriminate between particles evolved from comets and asteroids. We proceed in this study as we have done previously. That is, we considered the dust particles as ideal black bodies, of density 1 gm/cc, spherical, with radii 10-100 microns. Particles of this size are affected by radiation forces, photon pressure, and Poynting-Robertson drag. Account was also taken of solar wind drag, which amounts to about 30 percent of the Poynting-Robertson drag negligible. The gravitational forces due to the planets are included, unlike in our previous study; the planetary orbits are those of true n-body interaction so that the possibility of secular resonance is included. Our method was to calculate explicitly by a numerical procedure the orbits of dust particles after they left their parent bodies. The motion is determined numerically with the implicit Runge-Kutta integrator using Gauss-Radau spacings.

Jackson, A. A.↗

On the application and extension of Harten's high resolution scheme

Extensions of a second order high resolution explicit method for the numerical computation of weak solutions of one dimensonal hyperbolic conservation laws are discussed. The main objectives were (1) to examine the shock resoluton of Harten's method for a two dimensional shock reflection problem, (2) to study the use of a high resolution scheme as a post-processor to an approximate steady state solution, and (3) to construct an implicit in the delta-form using Harten's scheme for the explicit operator and a simplified iteration matrix for the implicit operator.

Yee, H. C.↗

Implicit Extrapolation Methods for Variable Coefficient Problems

Implicit extrapolation methods for the solution of partial differential equations are based on applying the extrapolation principle indirectly. Multigrid tau-extrapolation is a special case of this idea. In the context of multilevel finite element methods, an algorithm of this type can be used to raise the approximation order, even when the meshes are nonuniform or locally refined. Here previous results are generalized to the variable coefficient case and thus become applicable for nonlinear problems. The implicit extrapolation multigrid algorithm converges to the solution of a higher order finite element system. This is obtained without explicitly constructing higher order stiffness matrices but by applying extrapolation in a natural form within the algorithm. The algorithm requires only a small change of a basic low order multigrid method.

Jung, M.↗

A spectral element method for fluid dynamics - Laminar flow in a channel expansion

A spectral element method that combines the generality of the finite element method with the accuracy of spectral techniques is proposed for the numerical solution of the incompressible Navier-Stokes equations. In the spectral element discretization, the computational domain is broken into a series of elements, and the velocity in each element is represented as a high-order Lagrangian interpolant through Chebyshev collocation points. The hyperbolic piece of the governing equations is then treated with an explicit collocation scheme, while the pressure and viscous contributions are treated implicitly with a projection operator derived from a variational principle. The implementation of the technique is demonstrated on a one-dimensional inflow-outflow advection-diffusion equation, and the method is then applied to laminar two-dimensional (separated) flow in a channel expansion. Comparisons are made with experiment and previous numerical work.

Patera, A. T.↗

The simulation of 2D compressible viscous high speed flow by the finite element method

Am implicit/explicit procedure for the solution of problems of two-dimensional steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid which need only exhibit structure in the normal direction is employed while, away from this region, the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach, based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, problems of shock-boundary layer interaction and flow over a simulated forebody at high Mach number are included.

Hassan, O.↗

Improving the efficiency of aerodynamic shape optimization procedures

The computational efficiency of an aerodynamic shape optimization procedure which is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit (ADI) methodology to calculate the highly converged flow solutions which are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. A substantial factor of 8 decrease in computational time for the optimization process was achieved by implementing both of the design improvements.

Burgreen, Greg W.↗

Improving the efficiency of aerodynamic shape optimization

The computational efficiency of an aerodynamic shape optimization procedure that is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid-point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit methodology to calculate the highly converged flow solutions that are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. Practically identical optimization results are obtained that are independent of the method used to represent the surface. A substantial factor of 8 decrease in computational time for the optimization process is achieved by implementing both of the design procedure improvements.

Burgreen, Greg W.↗

Nonlinear Asymptotic Integration Algorithms for One-dimensional Autonomous Dissipative First-order Odes

Nonlinear asymptotic integrators are applied to one-dimensional, nonlinear, autonomous, dissipative, ordinary differential equations. These integrators, including a one-step explicit, a one-step implicit, and a one- and two-step midpoint algorithm, are designed to follow the asymptotic behavior of a system approaching a steady state. The methods require that the differential equation be written in a particular asymptotic form. This is always possible for a one-dimensional equation with a globally asymptotic steady state. In this case, conditions are obtained to guarantee that the implicit algorithms are well defined. Further conditions are determined for the implicit methods to be contractive. These methods are all first order accurate, while under certain conditions the midpoint algorithms may also become second order accurate. The stability of each method is investigated and an estimate of the local error is provided.

Haslach, Henry W., Jr.↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

Navagation↗

Generalized Linear Covariance Analysis

This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

n/a↗

On a class of TVD schemes for gas dynamic calculations

The purpose of this paper is to review a class of explicit and implicit second-order accurate Total Variation Diminishing (TVD) schemes and to show by numerical experiments, the performance of these schemes to the Euler equations of gas dynamics. The method of constructing these second-order accurate TVD schemes is sometimes known as the modified flux approach.

Yee, H. C.↗

The role of topography in geodetic gravity field modelling

Masses associated with the topography, bathymetry, and its isostatic compensation are a dominant source of gravity field variations, especially at shorter wavelengths. On global scales the topographic/isostatic effects are also significant, except for the lowest harmonics. In practice, though, global effects need not be taken into account as such effects are included in the coefficients of the geopotential reference fields. On local scales, the short-wavelength gravity variations due to the topography may, in rugged terrain, be an order of magnitude larger than other effects. In such cases, explicit or implicit terrain reduction procedures are mandatory in order to obtain good prediction results. Such effects may be computed by space-domain integration or by fast Fourier transformation (FFT) methods. Numerical examples are given for areas of the Canadian Rockies. In principle, good knowledge of the topographic densities is required to produce the smoothest residual field. Densities may be determined from sample measurements or by gravimetric means, but both are somewhat troublesome methods in practice. The use of a standard density, e.g., 2.67 g/cu cm, may often yield satisfactory results and may be put within a consistent theoretical framework. The independence of density assumptions is the key point of the classical Molodensky approach to the geodetic boundary value problem. The Molodensky solutions take into account that land gravity field observations are done on a non-level surface. Molodensky's problem may be solved by integral expansions or more effective FFT methods, but the solution should not be intermixed with the use of terrain reductions. The methods are actually complimentary and may both be required in order to obtain the smoothest possible signal, least prone to aliasing and other effects coming from sparse data coverage, typical of rugged topography.

Forsberg, R.↗