Search NASASearch

SEARCH · Search NASA

Results for “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 91 records · Page 5

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces.

Mastin, E. W.

An efficient numerical method for solving the incompressible Navier-Stokes equations

This paper describes an efficient numerical method for solving the steady incompressible Navier-Stokes equations. The method is a fully implicit method based on the generalized Galerkin method, and the resulting system of equations is solved in a sweeping mode by iterative line relaxation. Results of the present method are compared with published results for separating and reattaching flows, and parametric studies showing the effects of step size, boundary locations, and Reynolds number are presented. The present method is substantially faster than previously published methods; typical run times range from 10 sec to 1 min of 7600 CPU time; and, based on results obtained to date, it is stable at any Reynolds number.

Murphy, J. D.

Forebody and base region real-gas flow in severe planetary entry by a factored implicit numerical method. I - Computational fluid dynamics

A new code for the simulation of full (forebody and base region) flowfields about bluff bodies in the hypersonic regime of severe planetary entry is described. The present 'maximally conservative, maximally differenced' formulation of the unsteady compressible Navier-Stokes equations for 2-D axisymmetric 3-D flow is contrasted for stability with previous formulations of Viviand, Kutler, et al, and Thomas and Lombard. Discrete metric relations peculiar to the axisymmetric finite volume formulation are presented along with a general discussion of their relations to and consequences of failure to close computational cells. A computational mesh of curvilinear coordinate topology singular in the flow regime is presented that permits aligned capturing of the major physical features of the complex flowfield.

Lombard, C. K.

User's guide for NASCRIN: A vectorized code for calculating two-dimensional supersonic internal flow fields

A computer program NASCRIN has been developed for analyzing two-dimensional flow fields in high-speed inlets. It solves the two-dimensional Euler or Navier-Stokes equations in conservation form by an explicit, two-step finite-difference method. An explicit-implicit method can also be used at the user's discretion for viscous flow calculations. For turbulent flow, an algebraic, two-layer eddy-viscosity model is used. The code is operational on the CDC CYBER 203 computer system and is highly vectorized to take full advantage of the vector-processing capability of the system. It is highly user oriented and is structured in such a way that for most supersonic flow problems, the user has to make only a few changes. Although the code is primarily written for supersonic internal flow, it can be used with suitable changes in the boundary conditions for a variety of other problems.

Kumar, A.

Effects of numerical dissipation on finite-volume solutions of compressible flow problems

The effects of numerical dissipation upon solutions to the Euler equations are considered, and results for transonic flows past airfoils are presented to demonstrate the effects of the dissipative terms. The equations are approximated using a finite-volume spatial approximation with added dissipation provided by an adaptive mixture of second and fourth differences. The resulting difference equations are solved using either an explicit multistage Runge-Kutta method or a diagonalized implicit method. It is found that errors in surface values can be introduced by the averaging required to calculate derived quantities of interest.

Caughey, David A.

Linear iterative solvers for implicit ODE methods

The numerical solution of stiff initial value problems, which lead to the problem of solving large systems of mildly nonlinear equations are considered. For many problems derived from engineering and science, a solution is possible only with methods derived from iterative linear equation solvers. A common approach to solving the nonlinear equations is to employ an approximate solution obtained from an explicit method. The error is examined to determine how it is distributed among the stiff and non-stiff components, which bears on the choice of an iterative method. The conclusion is that error is (roughly) uniformly distributed, a fact that suggests the Chebyshev method (and the accompanying Manteuffel adaptive parameter algorithm). This method is described, also commenting on Richardson's method and its advantages for large problems. Richardson's method and the Chebyshev method with the Mantueffel algorithm are applied to the solution of the nonlinear equations by Newton's method.

Saylor, Paul E.

A coupled implicit solution method for turbulent spray combustion in propulsion systems

Many reacting flows in propulsion devices cannot be efficiently calculated by modern compressible flow CFD algorithms. Most low-speed reacting flow codes based on TEACH-type technologies are inefficient and lack robustness for complex flows. Tremendous progress has been made in high-speed compressible flow CFD in the past two decades; extending its application range to low-speed regimes is highly desirable. The objectives of this document is to present an efficient and robust algorithm for multi-phase chemically reacting flows at all speeds, with emphasis on low Mach number flows, and to calculate turbulent spray combustion flow in a gas turbine combustor.

Chen, K.-H.

Comparison of Implicit Collocation Methods for the Heat Equation

We combine a high-order compact finite difference scheme to approximate spatial derivatives arid collocation techniques for the time component to numerically solve the two dimensional heat equation. We use two approaches to implement the collocation methods. The first one is based on an explicit computation of the coefficients of polynomials and the second one relies on differential quadrature. We compare them by studying their merits and analyzing their numerical performance. All our computations, based on parallel algorithms, are carried out on the CRAY SV1.

Kouatchou, Jules

An Implicit Characteristic Based Method for Electromagnetics

An implicit characteristic-based approach for numerical solution of Maxwell's time-dependent curl equations in flux conservative form is introduced. This method combines a characteristic based finite difference spatial approximation with an implicit lower-upper approximate factorization (LU/AF) time integration scheme. This approach is advantageous for three-dimensional applications because the characteristic differencing enables a two-factor approximate factorization that retains its unconditional stability in three space dimensions, and it does not require solution of tridiagonal systems. Results are given both for a Fourier analysis of stability, damping and dispersion properties, and for one-dimensional model problems involving propagation and scattering for free space and dielectric materials using both uniform and nonuniform grids. The explicit Finite Difference Time Domain Method (FDTD) algorithm is used as a convenient reference algorithm for comparison. The one-dimensional results indicate that for low frequency problems on a highly resolved uniform or nonuniform grid, this LU/AF algorithm can produce accurate solutions at Courant numbers significantly greater than one, with a corresponding improvement in efficiency for simulating a given period of time. This approach appears promising for development of dispersion optimized LU/AF schemes for three dimensional applications.

Beggs, John H.

A fully implicit, asymptotic-preserving, semi-Lagrangian algorithm for the time dependent anisotropic heat transport equation

In this paper, we extend the operator-split asymptotic-preserving, semi-Lagrangian algorithm for time dependent anisotropic heat transport equation proposed in Chacón et al. (2014) [18] to use a fully implicit time integration with backward differentiation formulas. The proposed implicit method can deal with arbitrary heat-transport anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ $\ggg$ 1 (with $\mathcal{X}$∥, $ \mathcal{X}$⟂ the parallel and perpendicular heat diffusivities, respectively) in complicated magnetic field topologies in an accurate and efficient manner. Further, the implicit algorithm is second-order accurate temporally and demonstrates an accurate treatment at boundary layers (e.g., island separatrices), which was not ensured by the operator-split implementation. The condition number of the resulting algebraic system is independent of the anisotropy ratio, and is inverted with preconditioned GMRES. We propose a simple preconditioner that renders the finite-dimensional linear operator compact, resulting in mesh-independent convergence rates for topologically simple magnetic fields, and convergence rates scaling as ~ (NΔt) 1/4 (with N the total mesh size and Δt the timestep) in topologically complex magnetic-field configurations. We demonstrate the accuracy and performance of the approach with test problems of varying complexity, including an analytically tractable boundary-layer problem in a straight magnetic field, and a topologically complex magnetic field featuring magnetic islands with extreme anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ = 10 10 ) .

97 MATHEMATICS AND COMPUTING