Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit method”

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,369 records · Page 76

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing↗

A high-order numerical algorithm for DNS of low-Mach-number reactive flows with detailed chemistry and quasi-spectral accuracy

A novel and efficient algorithm is presented in this paper to deal with DNS of turbulent reacting flows under the low-Mach-number assumption, with detailed chemistry and a quasi-spectral accuracy. The temporal integration of the equations relies on an operating-split strategy, where chemical reactions are solved implicitly with a stiff solver and the convection-diffusion operators are solved with a Runge-Kutta-Chebyshev method. The spatial discretisation is performed with high-order compact schemes, and a FFT based constant-coefficient spectral solver is employed to solve a variable-coefficient Poisson equation. The numerical implementation takes advantage of the 2DECOMP&FFT libraries developed by, which are based on a pencil decomposition method of the domain and are proven to be computationally very efficient. An enhanced pressure-correction method is proposed to speed up the achievement of machine precision accuracy. It is demonstrated that a second-order accuracy is reached in time, while the spatial accuracy ranges from fourth-order to sixth-order depending on the set of imposed boundary conditions. In conclusion, the software developed to implement the present algorithm is called HOLOMAC, and its numerical efficiency opens the way to deal with DNS of reacting flows to understand complex turbulent and chemical phenomena in flames.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Formulation of 8-moment plasma transport with application to the Nernst effect

8-moment plasma models using two different distribution functions are used to study the Nernst effect and heat transport in dense plasma. These models are presented in hyperbolic form in contrast to traditional parabolic systems derived from perturbing the distribution function, as in Braginskii [Rev. Plasma Phys. 1, 205 (1965)]. The hyperbolic moment formulation can be solved implicitly in time with straightforward and fast local solvers. The numerical implementation of 8-moment models with the relaxation method in the PERSEUS code is also presented. To test 8-moment PERSEUS compared to Braginskii’s transport equations, a verification test for the Nernst thermomagnetic wave by Velikovich et al. [Phys. Plasmas 26, 112702 (2019)] is performed that confirms the presence of the same physics, but with slight differences in the transport coefficients, which are tabulated in the limits of high and low magnetization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Calculation of three-dimensional compressible laminar and turbulent boundary layers. An implicit finite-difference procedure for solving the three-dimensional compressible laminar, transitional, and turbulent boundary-layer equations

An implicit finite-difference procedure is presented for solving the compressible three-dimensional boundary-layer equations. The method is second-order accurate, unconditionally stable (conditional stability for reverse cross flow), and efficient from the viewpoint of computer storage and processing time. The Reynolds stress terms are modeled by (1) a single-layer mixing length model and (2) a two-layer eddy viscosity model. These models, although simple in concept, accurately predicted the equilibrium turbulent flow for the conditions considered. Numerical results are compared with experimental wall and profile data for a cone at an angle of attack larger than the cone semiapex angle. These comparisons clearly indicate that the numerical procedure and turbulence models accurately predict the experimental data with as few as 21 nodal points in the plane normal to the wall boundary.

Harris, J. E.↗

Real gas flow fields about three dimensional configurations

Real gas, inviscid supersonic flow fields over a three-dimensional configuration are determined using a factored implicit algorithm. Air in chemical equilibrium is considered and its local thermodynamic properties are computed by an equilibrium composition method. Numerical solutions are presented for both real and ideal gases at three different Mach numbers and at two different altitudes. Selected results are illustrated by contour plots and are also tabulated for future reference. Results obtained compare well with existing tabulated numerical solutions and hence validate the solution technique.

Balakrishnan, A.↗

A solution procedure for three-dimensional incompressible Navier-Stokes equation and its application

An implicit, finite-difference procedure is presented for numerically solving viscous incompressible flows. For convenience of applying the present method to three-dimensional problems, primitive variables, namely the pressure and velocities, are used. One of the major difficulties in solving incompressible flows that use primitive variables is caused by the pressure field solution method which is used as a mapping procedure to obtain a divergence-free velocity field. The present method is designed to accelerate the pressure-field solution procedure. This is achieved by the method of pseudocompressibility in which the time derivative pressure term is introduced into the mass conservation equation. The pressure wave propagation and the spreading of the viscous effect is investigated using simple test problems. The present study clarifies physical and numerical characteristics of the pseudo-compressible approach in simulating incompressible flows. Computed results for external and internal flows are presented to verify the present procedure. The present algorithm has been shown to be very robust and accurate if the selection of the pseudo-compressibility parameter has been made according to the guidelines given.

Kwak, D.↗

Flowfield computation of an aerobrake orbital transfer vehicle

Viscous real gas and ideal gas supersonic flowfields over the forebody of a aeroassisted orbital transfer vehicle are determined using a unsteady factored implicit algorithm. Air in chemical equilibrium is considered and its local thermodynamic properties are computed by an equilibrium composition method. Numerical solutions are obtained for both real and ideal gases at a Mach number of 30 and at angles of attack up to 20 degrees. Shock stand-off distances and surface pressure distributions are presented for the gas models with and without viscous effects. For the freestream conditions considered, viscous effects dominate the flow.

Balakrishnan, A.↗

Viscous shock-layer solutions for the low-density hypersonic flow past long slender bodies

Results are obtained for the surface pressure, drag, heat-transfer, and skin-friction coefficients for hyperboloids and sphere cones. Body half angles from 5 to 22.5 degrees are considered for various low-density flow conditions. Recently obtained surface-slip and shock-slip equations are employed to account for the low-density effects. The method of solution employed for the viscous shock-layer (VSL) equations is a partially coupled spatial-marching implicit finite-difference technique. The flow cases analyzed include highly cooled long slender bodies in high Mach number flows. The present perfect-gas VSL calculations compare quite well with available experimental data. Results have also been obtained from the steady-state Navier-Stokes (NS) equations by successive approximations. Comparison between the NS and VSL results indicates that VSL equations even with body and shock-slip boundary conditions may not be adequate in the stagnation region at altitudes greater than about 75 km for the cases analyzed here.

Gupta, R. N.↗

Computations of three-dimensional steady and unsteady viscous incompressible flows

The INS3D family of computational fluid dynamics computer codes is presented. These codes are used to as tools in developing and assessing algorithms for solving the incompressible Navier-Stokes equations for steady-state and unsteady flow problems. This work involves applying the codes to real-world problems involving complex three-dimensional geometries. The algorithms utilized include the method of pseudocompressibility including both central and upwind differencing, several types of artificial dissipation schemes, approximate factorization, and an implicit line-relaxation scheme. These codes have been validated using a wide range of problems including flow over a backward-facing step, driven cavity flow, flow through various types of ducts, and steady and unsteady flow over a circular cylinder. Many diverse flow applications have been solved using these codes including parts of the Space Shuttle Main Engine, problems in naval hydrodynamics, low-speed aerodynamics, and biomedical fluid flows. The presentation details several of these, including the flow through a Space Shuttle Main Engine inducer, vortex shedding behind a circular cylinder, and flow through an artificial heart.

Kwak, Dochan↗

Real-time fuzzy inference based robot path planning

This project addresses the problem of adaptive trajectory generation for a robot arm. Conventional trajectory generation involves computing a path in real time to minimize a performance measure such as expended energy. This method can be computationally intensive, and it may yield poor results if the trajectory is weakly constrained. Typically some implicit constraints are known, but cannot be encoded analytically. The alternative approach used here is to formulate domain-specific knowledge, including implicit and ill-defined constraints, in terms of fuzzy rules. These rules utilize linguistic terms to relate input variables to output variables. Since the fuzzy rulebase is determined off-line, only high-level, computationally light processing is required in real time. Potential applications for adaptive trajectory generation include missile guidance and various sophisticated robot control tasks, such as automotive assembly, high speed electrical parts insertion, stepper alignment, and motion control for high speed parcel transfer systems.

Pacini, Peter J.↗

A multiple-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations

A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.

Atkins, Harold↗

Chemical vapor deposition fluid flow simulation modelling tool

Accurate numerical simulation of chemical vapor deposition (CVD) processes requires a general purpose computational fluid dynamics package combined with specialized capabilities for high temperature chemistry. In this report, we describe the implementation of these specialized capabilities in the spectral element code NEKTON. The thermal expansion of the gases involved is shown to be accurately approximated by the low Mach number perturbation expansion of the incompressible Navier-Stokes equations. The radiative heat transfer between multiple interacting radiating surfaces is shown to be tractable using the method of Gebhart. The disparate rates of reaction and diffusion in CVD processes are calculated via a point-implicit time integration scheme. We demonstrate the use above capabilities on prototypical CVD applications.

Bullister, Edward T.↗

Global Qualitative Flow-Path Modeling for Local State Determination in Simulation and Analysis

For qualitative modeling and analysis, a general qualitative abstraction of power transmission variables (flow and effort) for elements of flow paths includes information on resistance, net flow, permissible directions of flow, and qualitative potential is discussed. Each type of component model has flow-related variables and an associated internal flow map, connected into an overall flow network of the system. For storage devices, the implicit power transfer to the environment is represented by "virtual" circuits that include an environmental junction. A heterogeneous aggregation method simplifies the path structure. A method determines global flow-path changes during dynamic simulation and analysis, and identifies corresponding local flow state changes that are effects of global configuration changes. Flow-path determination is triggered by any change in a flow-related device variable in a simulation or analysis. Components (path elements) that may be affected are identified, and flow-related attributes favoring flow in the two possible directions are collected for each of them. Next, flow-related attributes are determined for each affected path element, based on possibly conflicting indications of flow direction. Spurious qualitative ambiguities are minimized by using relative magnitudes and permissible directions of flow, and by favoring flow sources over effort sources when comparing flow tendencies. The results are output to local flow states of affected components.

Malin, Jane T.↗

Computational Study of Near-limit Propagation of Detonation in Hydrogen-air Mixtures

A computational investigation of the near-limit propagation of detonation in lean and rich hydrogen-air mixtures is presented. The calculations were carried out over an equivalence ratio range of 0.4 to 5.0, pressures ranging from 0.2 bar to 1.0 bar and ambient initial temperature. The computations involved solution of the one-dimensional Euler equations with detailed finite-rate chemistry. The numerical method is based on a second-order spatially accurate total-variation-diminishing (TVD) scheme, and a point implicit, first-order-accurate, time marching algorithm. The hydrogen-air combustion was modeled with a 9-species, 19-step reaction mechanism. A multi-level, dynamically adaptive grid was utilized in order to resolve the structure of the detonation. The results of the computations indicate that when hydrogen concentrations are reduced below certain levels, the detonation wave switches from a high-frequency, low amplitude oscillation mode to a low frequency mode exhibiting large fluctuations in the detonation wave speed; that is, a 'galloping' propagation mode is established.

Yungster, S.↗

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↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗