Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit and explicit algorithms”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

Supersonic flow over ablated nosetips using an unsteady, implicit numerical procedure

The axisymmetric supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical region, containing multiple zones of embedded subsonic flow into a rectangular computational domain at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing experimental data for very mildly and severely indented blunt nosetips.

Kutler, P.↗
NASA NTRS1980

Supersonic flow over three-dimensional ablated nosetips using an unsteady implicit numerical procedure

The three-dimensional supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical domain, containing multiple zones of embedded subsonic flow and separated flow regions into a rectangular computational volume at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing numerical solutions and experimental data for simple spheres which validates the program. Results are also presented for analytically defined indented bodies for both laminar and turbulent flow conditions that demonstrate the program's capability for computing such flows.

Kutler, P.↗
NASA NTRS1996

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

Efficient Development of High Fidelity Structured Volume Grids for Hypersonic Flow Simulations

A new technique for the control of grid line spacing and intersection angles of a structured volume grid, using elliptic partial differential equations (PDEs) is presented. Existing structured grid generation algorithms make use of source term hybridization to provide control of grid lines, imposing orthogonality implicitly at the boundary and explicitly on the interior of the domain. A bridging function between the two types of grid line control is typically used to blend the different orthogonality formulations. It is shown that utilizing such a bridging function with source term hybridization can result in the excessive use of computational resources and diminishes robustness. A new approach, Anisotropic Lagrange Based Trans-Finite Interpolation (ALBTFI), is offered as a replacement to source term hybridization. The ALBTFI technique captures the essence of the desired grid controls while improving the convergence rate of the elliptic PDEs when compared with source term hybridization. Grid generation on a blunt cone and a Shuttle Orbiter is used to demonstrate and assess the ALBTFI technique, which is shown to be as much as 50% faster, more robust, and produces higher quality grids than source term hybridization.

Alter, Stephen J.↗
NASA NTRS1992

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗
NASA NTRS1989

Navier-Stokes solutions for flows related to store separation

The objective is developing CFD capabilities to obtain solutions for viscous flows about generic configurations of internally and externally carried stores. The emphasis is placed on the supersonic flow regime with extensions being made to the transonic regime. The project is broken into four steps: (1) Cavity flows for internal carriage configurations; (2) High angle of attack flows, which may be experienced during the separation of the stores: (3) Flows about a body near a flat plate for external carriage configurations; and (4) Flows about a body inside or in the proximity of a cavity. Three-dimensional unsteady cavity flow solutions are obtained by an explicit, MacCormack algorithm, EMCAV3, for open, close, and transitional cavities. High angle of attack flows past cylinders are solved by an implicit, upwind algorithm. All the results compare favorably with the experimental data. For flows about multiple body configurations, the Chimera embedding scheme is modified for finite-volume and multigrid algorithms, MaGGiE. Then a finite volume, implicit, upwind, multigrid Navier-Stokes solver which uses on overlapped/embedded and zonal grids, VUMXZ3, is developed from the CFL3D code. Supersonic flows past a cylinder near a flat plate are computed using this code. The results are compared with the experimental data. Currently the VUMXZ3 code is being modified to accomplish step 4 of this project. Wind tunnel experiments are also being conducted for validation purposes.

Baysal, Oktay↗
NASA NTRS1991

An Explicit Upwind Algorithm for Solving the Parabolized Navier-Stokes Equations

An explicit, upwind algorithm was developed for the direct (noniterative) integration of the 3-D Parabolized Navier-Stokes (PNS) equations in a generalized coordinate system. The new algorithm uses upwind approximations of the numerical fluxes for the pressure and convection terms obtained by combining flux difference splittings (FDS) formed from the solution of an approximate Riemann (RP). The approximate RP is solved using an extension of the method developed by Roe for steady supersonic flow of an ideal gas. Roe's method is extended for use with the 3-D PNS equations expressed in generalized coordinates and to include Vigneron's technique of splitting the streamwise pressure gradient. The difficulty associated with applying Roe's scheme in the subsonic region is overcome. The second-order upwind differencing of the flux derivatives are obtained by adding FDS to either an original forward or backward differencing of the flux derivative. This approach is used to modify an explicit MacCormack differencing scheme into an upwind differencing scheme. The second order upwind flux approximations, applied with flux limiters, provide a method for numerically capturing shocks without the need for additional artificial damping terms which require adjustment by the user. In addition, a cubic equation is derived for determining Vegneron's pressure splitting coefficient using the updated streamwise flux vector. Decoding the streamwise flux vector with the updated value of Vigneron's pressure splitting improves the stability of the scheme. The new algorithm is applied to 2-D and 3-D supersonic and hypersonic laminar flow test cases. Results are presented for the experimental studies of Holden and of Tracy. In addition, a flow field solution is presented for a generic hypersonic aircraft at a Mach number of 24.5 and angle of attack of 1 degree. The computed results compare well to both experimental data and numerical results from other algorithms. Computational times required for the upwind PNS code are approximately equal to an explicit PNS MacCormack's code and existing implicit PNS solvers.

Korte, John J.↗
NASA NTRS1992

A discrete momentum-conserving explicit algorithm for multibody dynamics analysis

A discrete momentum-conserving, explicit time integration is presented. The accurate feature and simplicity of the present algorithm are realized by a mid-point implicit formula for integrating the Euler parameters and a second-order discrete momentum-conserving form of the central difference algorithm, respectively. The accuracy and robustness of the algorithm is demonstrated by example problems which exhibit large overall rigid motions under holonomic constraints.

Park, K. C.↗
NASA NTRS1993

A discrete momentum-conserving explicit algorithm for rigid body dynamics analysis

A discrete momentum-conserving explicit time integration is presented. The accurate feature and simplicity of the present algorithm are realized by a mid-point implicit formula for integrating the Euler parameters and a second-order discrete momentum-conserving form of the central difference algorithm, respectively. The accuracy and robustness of the algorithm is demonstrated by example problems which exhibit large overall rigid motions under holonomic constraints.

Park, K. C.↗
NASA NTRS1978

Calculation of supersonic viscous flow over delta wings with sharp subsonic leading edges

Two complementary procedures were developed to calculate the viscous supersonic flow over conical shapes at large angles of attack, with application to cones and delta wings. In the first approach the flow is assumed to be conical and the governing equations are solved at a given Reynolds number with a time-marching explicit finite-difference algorithm. In the second method the parabolized Navier-Stokes equations are solved with a space-marching implicit noniterative finite-difference algorithm. This latter approach is not restricted to conical shapes and provides a large improvement in computational efficiency over published methods. Results from the two procedures agree very well with each other and with available experimental data.

Vigneron, Y. C.↗
NASA NTRS1978

Calculation of supersonic viscous flow over delta wings with sharp subsonic leading edges

Two complementary procedures have been developed to calculate the viscous supersonic flow over conical shapes at large angles of attack, with application to cones and delta wings. In the first approach the flow is assumed to be conical and the governing equations are solved at a given Reynolds number with a time-marching explicit finite-difference algorithm. In the second method the parabolized Navier-Stokes equations are solved with a space-marching implicit noniterative finite-difference algorithm. This latter approach is not restricted to conical shapes and provides a large improvement in computational efficiency over published methods. Results from the two procedures agree very well with each other and with available experimental data.

Vigneron, Y. C.↗
NASA NTRS1990

Explicit-implicit staggered procedure for multibody dynamics analysis

An explicit-implicit staggered time-integration procedure is presented for the solution of multibody dynamical equations involving large rotations and constraints. The algorithms adopts a two-stage modification of the central difference algorithm for integrating the translational coordinates and the angular velocity vector, and the midpoint implicit algorithm to solve the kinematical relation in terms of the Euler parameters for updating the angular orientations. The Lagrange multipliers to enforce the system constraints are obtained by implicitly integrating a parabolically regularized differential equation for the multipliers. The performance of the present procedure has been evaluated to applying the procedure to solve several sample problems. The results indicate that the procedure is robust in dealing with a variety of constraints and spatial kinematic motions, hence it is recommended for applications to general multibody dynamics analyses.

Park, K. C.↗
NASA NTRS1995

Computational strategies for three-dimensional flow simulations on distributed computer systems

This research effort is directed towards an examination of issues involved in porting large computational fluid dynamics codes in use within the industry to a distributed computing environment. This effort addresses strategies for implementing the distributed computing in a device independent fashion and load balancing. A flow solver called TEAM presently in use at Lockheed Aeronautical Systems Company was acquired to start this effort. The following tasks were completed: (1) The TEAM code was ported to a number of distributed computing platforms including a cluster of HP workstations located in the School of Aerospace Engineering at Georgia Tech; a cluster of DEC Alpha Workstations in the Graphics visualization lab located at Georgia Tech; a cluster of SGI workstations located at NASA Ames Research Center; and an IBM SP-2 system located at NASA ARC. (2) A number of communication strategies were implemented. Specifically, the manager-worker strategy and the worker-worker strategy were tested. (3) A variety of load balancing strategies were investigated. Specifically, the static load balancing, task queue balancing and the Crutchfield algorithm were coded and evaluated. (4) The classical explicit Runge-Kutta scheme in the TEAM solver was replaced with an LU implicit scheme. And (5) the implicit TEAM-PVM solver was extensively validated through studies of unsteady transonic flow over an F-5 wing, undergoing combined bending and torsional motion. These investigations are documented in extensive detail in the dissertation, 'Computational Strategies for Three-Dimensional Flow Simulations on Distributed Computing Systems', enclosed as an appendix.

Sankar, Lakshmi N.↗
NASA NTRS1989

Supersonic flow computations by two-equation turbulence modeling

In the present work a solver for the Reynolds averaged compressible Navier-Stokes equations, to compute high speed turbulent flows characterized by interacting shock waves and viscous layers, is presented. A k-epsilon turbulence model that accounts for compressibility effects is developed. The numerical algorithm is based on a finite volume multistage Runge Kutta technique that is explicit for the solution of the mean flow variables, and implicit for the solution of the k-epsilon equations. The model is validated by extensive comparison with experimental results of flows over compression ramps characterized by interacting shock waves/boundary layers.

Grasso, Francesco↗
NASA NTRS1992

Development of iterative techniques for the solution of unsteady compressible viscous flows

The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step.

Sankar, Lakshmi N.↗
NASA NTRS1982

Stability of mixed time integration schemes for transient thermal analysis

A current research topic in coupled-field problems is the development of effective transient algorithms that permit different time integration methods with different time steps to be used simultaneously in various regions of the problems. The implicit-explicit approach seems to be very successful in structural, fluid, and fluid-structure problems. This paper summarizes this research direction. A family of mixed time integration schemes, with the capabilities mentioned above, is also introduced for transient thermal analysis. A stability analysis and the computer implementation of this technique are also presented. In particular, it is shown that the mixed time implicit-explicit methods provide a natural framework for the further development of efficient, clean, modularized computer codes.

Liu, W. K.↗
NASA NTRS1984

Fourier-Legendre spectral methods for incompressible channel flow

An iterative collocation technique is described for modeling implicit viscosity in three-dimensional incompressible wall bounded shear flow. The viscosity can vary temporally and in the vertical direction. Channel flow is modeled with a Fourier-Legendre approximation and the mean streamwise advection is treated implicitly. Explicit terms are handled with an Adams-Bashforth method to increase the allowable time-step for calculation of the implicit terms. The algorithm is applied to low amplitude unstable waves in a plane Poiseuille flow at an Re of 7500. Comparisons are made between results using the Legendre method and with Chebyshev polynomials. Comparable accuracy is obtained for the perturbation kinetic energy predicted using both discretizations.

Zang, T. A.↗
NASA NTRS1991

Distributed memory compiler methods for irregular problems: Data copy reuse and runtime partitioning

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

Das, Raja↗