SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

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

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS2000

A Finite-Element Approach for Modeling Inviscid and Viscous Compressible Flows using Prismatic Grids

The Galerkin finite-element method is used to solve the Euler and Navier-Stokes equations on prismatic meshes. It is shown that the prismatic grid is advantageous for correctly and efficiently capturing the boundary layers in high Reynolds number flows. It can be captured accurately because of the ability to cluster grid points normal to the body. The efficiency derives from the implicit treatment of the normal direction. To treat the normal direction implicitly, a semi-implicit Runge-Kutta time stepping scheme is developed. The semi-implicit algorithm is validated on simple geometries for inviscid and viscous flows and its convergence history is compared to that of the explicit Runge-Kutta scheme. The semi-implicit scheme is shown to be a factor of 3 to 4 faster in terms of CPU time to convergence.

Pandya, S. A.↗

NASA NTRS1988

High-order low-pass implicit tangent filters for use in finite area calculations

High-order implicit tangent filters are developed. The implicit tangent filters possess a highly selective amplitude response function and they can be applied relatively close to a boundary. Comparisons are made between the implicit and the traditional or explicit filters. Numerical simulations are performed to test the response in a limited-area model. An algorithm to maximize computing efficiency is presented. All tests indicate the desirability and utility of the implicit tangent filter.

Raymond, William H.↗

NASA NTRS1983

A finite element method for diffusion dominated unsteady viscous flows

A general conforming finite element scheme for computing viscous flows is presented which is of second-order accuracy in space and time. Viscous terms are treated implicitly and advection terms are treated explicitly in the time marching segment of the algorithm. A method for solving the algebraic equations at each time step is given. The method is demonstrated on two test problems, one of them being a plane vortex flow for which asymptotic methods are used to obtain suitable numerical boundary conditions at each time step.

Gunzburger, M. D.↗

DOE OSTI2012

A semi-implicit integration scheme for the stress update of viscoSCRAM

This report documents three improvements made to the implementation of a historically significant material model used in W13 for simulations involving components made of PBX9501. ViscoSCRAM combines linear viscoelasticity with isotropic damage evolution based on fracture mechanics concepts. The original implementation was focused on short duration transient events, thus an explicit update scheme was used. For longer duration simulations which employ relatively larger time step sizes the explicit update scheme is inadequate. This work presents a new semi-implicit update scheme suitable for simulations using relatively large time steps. The algorithm solves a nonlinear system of equations to ensure that the stress, damaged state, and internal (Maxwell) stresses are in agreement with implicit update equations at the end of each increment. The crack growth is advanced in time using a subincremental explicit scheme, thus the entire implementation is semi-implicit. Additionally, modifications to the crack growth kinetics are proposed and implemented obviating the need for an empirical tensile damage growth rate (TDGR) multiplier used in previous implementations. Finally, an automatic time stepping algorithm is implemented to adjust the time step size based on error estimates for the generalized Maxwell model update scheme. Model parameters are fit to existing data and example problems are simulated using both new and legacy implementations to assess comparative advantages and disadvantages.

Engineering(42)↗

DOE OSTI2021

Implicit highly-coupled single-ion Hall-MHD formulation for hybrid particle-in-cell codes

The rudiments of a particle-based single-fluid two-temperature magnetohydrodynamic (MHD) algorithm have been outlined in Thoma et al. (2013). The extension of this algorithm to include the effect of Hall physics is described in this paper. An implicit leapfrog version of the algorithm, which allows timesteps large compared to the resistive decay time and other relevant timescales, has recently been added to a hybrid particle-in-cell code. In standard MHD the Hall term in the generalized Ohm’s law can often be neglected when the Hall parameter is small. This term must, however, be retained in regimes where it is non-negligible. The retention of displacement current in Maxwell’s equations avoids the numerical difficulties associated with the whistler mode, which are encountered in standard explicit Hall-MHD codes, and allows the algorithm to be incorporated into hybrid particle-in-cell codes, for which particles may migrate from a kinetic to fluid to MHD description based upon local ambient plasma conditions. A highly-coupled implicit Hall-MHD formalism is presented, in which displacement current can either be retained or neglected. Even when displacement current is neglected, the highly-coupled implicit formalism avoids the restrictive timesteps for the whistler mode in explicit Hall-MHD codes. A comparison of numerical and analytic dispersion analysis demonstrates the feasibility of this approach and establishes relevant constraints to assure numerical stability. The implementation of the algorithm is described, and test simulation results in 1D and 2D in both linear and nonlinear regimes are presented.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

A barely implicit correction for flux-corrected transport

In virtue of adding one elliptic equation that must be implicitly solved, the 'barely implicit correction' method presented removes the stringent sidestep limit imposed by sound speed in the explicit methods. The barely implicit method is presently combined with a flux-corrected transport algorithm, which has been rendered fourth-order by the appropriate subtraction of corrected fluxes, in order to accurately represent the sharp gradients in subsonic flows. The multigrid MGRID technique (DeVore, 1984) is used to efficiently solve the elliptic pressure equation.

Patnaik, G.↗

NASA NTRS1988

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or implicit direct integration method. A principal feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗

NASA NTRS2008

A Formal Framework for the Analysis of Algorithms That Recover From Loss of Separation

We present a mathematical framework for the specification and verification of state-based conflict resolution algorithms that recover from loss of separation. In particular, we propose rigorous definitions of horizontal and vertical maneuver correctness that yield horizontal and vertical separation, respectively, in a bounded amount of time. We also provide sufficient conditions for independent correctness, i.e., separation under the assumption that only one aircraft maneuvers, and for implicitly coordinated correctness, i.e., separation under the assumption that both aircraft maneuver. An important benefit of this approach is that different aircraft can execute different algorithms and implicit coordination will still be achieved, as long as they all meet the explicit criteria of the framework. Towards this end we have sought to make the criteria as general as possible. The framework presented in this paper has been formalized and mechanically verified in the Prototype Verification System (PVS).

Butler, RIcky W.↗

NASA NTRS2009

Formally Verified Practical Algorithms for Recovery from Loss of Separation

In this paper, we develop and formally verify practical algorithms for recovery from loss of separation. The formal verification is performed in the context of a criteria-based framework. This framework provides rigorous definitions of horizontal and vertical maneuver correctness that guarantee divergence and achieve horizontal and vertical separation. The algorithms are shown to be independently correct, that is, separation is achieved when only one aircraft maneuvers, and implicitly coordinated, that is, separation is also achieved when both aircraft maneuver. In this paper we improve the horizontal criteria over our previous work. An important benefit of the criteria approach is that different aircraft can execute different algorithms and implicit coordination will still be achieved, as long as they all meet the explicit criteria of the framework. Towards this end we have sought to make the criteria as general as possible. The framework presented in this paper has been formalized and mechanically verified in the Prototype Verification System (PVS).

Butler, Ricky W.↗

NASA NTRS1993

Flux-difference split parabolized Navier-Stokes algorithm for non-equilibrium chemically reacting flows

A flux-difference split explicit finite-difference algorithm is presented for solving the parabolized form of the equations governing three-dimensional nonequilibrium chemically reacting flows. The algorithm is based on an explicit noniterative, upwind space-marching scheme developed by Korte, but differs in that the unsteady Riemann problem, rather than the steady Riemann problem, is solved. The algorithm allows either a second or an approximately third-order accurate upwind treatment of the convection terms by employing the unsteady approximate Riemann solver of Roe. The source terms of the species transport equations are treated in either an explicit or implicit manner, and the species diffusion terms are modeled with either a Fickian or a multicomponent model. A validation of the algorithm is performed by comparing computational results with the 2-D Mach 14, 15 degree compression-corner data of Holden. The three-dimensional capability of the algorithm is demonstrated by computing Mach 2.7 flow over a swept wedge scramjet fuel injector, and three-dimensional reacting flow capability is demonstrated by a computing a shock-jet interaction concept for mixing and combustion enhancement.

White, J. A.↗

NASA NTRS1980

A rapid implicit-explicit solution to the two-dimensional time dependent incompressible Navier-Stokes equations

A second-order time-accurate and spatially factored algorithm was used in a finite difference scheme for the numerical solution of the time-dependent, incompressible, two dimensional Navier-Stokes equations in conservation-law form using vorticity and stream function variables. The systems of equations are solved at each time step by an iterative technique. Numerical results were obtained for a circular cylinder at a Reynolds number of 15, and an NACA 0012 airfoil at zero angle of attack at Reynolds numbers of 10 to the third and 10 to the fourth powers. The results are in agreement with another numerical technique, and the computing time required to obtain the steady state solution at the Reynolds number of 10 to the 4th power was 49.7 sec on CDC 7600 computer using a 65 x 84 computational grind.

Davis, J. E.↗

NASA NTRS1989

Algorithm For Hypersonic Flow In Chemical Equilibrium

Implicit, finite-difference, shock-capturing algorithm calculates inviscid, hypersonic flows in chemical equilibrium. Implicit formulation chosen because overcomes limitation on mathematical stability encountered in explicit formulations. For dynamical portion of problem, Euler equations written in conservation-law form in Cartesian coordinate system for two-dimensional or axisymmetric flow. For chemical portion of problem, equilibrium state of gas at each point in computational grid determined by minimizing local Gibbs free energy, subject to local conservation of molecules, atoms, ions, and total enthalpy. Major advantage: resulting algorithm naturally stable and captures strong shocks without help of artificial-dissipation terms to damp out spurious numerical oscillations.

Palmer, Grant↗

DOE OSTI2024

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1984

Transonic flow calculations using a flux vector splitting method for the Euler equations

A study of the flux vector splitting method of Steger and Warming for the solution of the time dependent Euler equations in strong conservation law form for arbitrary two-dimensional geometries is presented. The procedure employed here differs from that of Buning and Steger in that it uses a different algorithm and employs implicit boundary conditions. Moreover, the method, as implemented here, does not contain any explicit smoothing or any adjustable parameters. Calculations were carried out for an NACA 0012 airfoil at various Mach numbers and angles of attack, and cylinders. Steady symmetric solutions were obtained for the full cylinder at a freestream Mach number of .5 without imposing a symmetry condition. In general, good agreement with other methods was obtained.

Seaford, C. M.↗

NASA NTRS1987

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or an implicit direct integration method. A principle feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗

NASA NTRS1986

Linearized form of implicit TVD schemes for the multidimensional Euler and Navier-Stokes equations

Linearized alternating direction implicit (ADI) forms of a class of total variation diminishing (TVD) schemes for the Euler and Navier-Stokes equations have been developed. These schemes are based on the second-order-accurate TVD schemes for hyperbolic conservation laws developed by Harten (1983, 1984). They have the property of not generating spurious oscillations across shocks and contact discontinuities. In general, shocks can be captured within 1-2 grid points. These schemes are relatively simple to understand and easy to implement into a new or existing computer code. One can modify a standard three-point central-difference code by simply changing the conventional numerical dissipation term into the one designed for the TVD scheme. For steady-state applications, the only difference in computation is that the current schemes require a more elaborate dissipation term for the explicit operator; no extra computation is required for the implicit operator. Numerical experiments with the proposed algorithms on a variety of steady-state airfoil problems illustrate the versatility of the schemes.

Yee, H. C.↗

NASA NTRS1992

Comparison Of Two Viscous-Flow Computer Codes

Two viscous-flow computer codes compared by applying them to five test cases of steady-state transonic viscous flows about transonic airfoils. Two codes were: FLOMG, which solves Navier-Stokes differential equations of flow by implementing explicit, Runge-Kutta, finite-volume, multigrid numerical-integration algorithm; and ARC2D, which implements implicit, finite-difference, approximate-factorization, eigenvector-diagonalization numerical-integration algorithm.

Maksymiuk, C. M.↗

NASA NTRS1991

Implicit solution of three-dimensional internal turbulent flows

The scalar form of the approximate factorization method was used to develop a new code for the solution of three dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form were iterated in time until a steady solution was reached. Evidence was given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at the domain boundaries was proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects were accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. The flow in a developing S-duct was then solved in the laminar regime in a Reynolds number (Re) of 790 and in the turbulent regime at Re equals 40,000 by using the Baldwin-Lomax model. The Stanitz elbow was then solved by using an invicid version of the same code at M sub inlet equals 0.4. Grid dependence and convergence rate were investigated, showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re equals 2.5 times 10(exp 6) was solved with the Baldwin-Lomax and the q-omega models. Both approaches show satisfactory agreement with experiments, although the q-omega model was slightly more accurate.

Michelassi, V.↗