SEARCH · Search NASA

Results for “explicit solution”

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS1994

An analytic solution of the radiative transfer equation for a gray scattering atmosphere in motion

We provide a formal analytic solution of the radiative transfer equation for a gray moving atmosphere in a plane parallel geometry. A formal solution in the diffusion and the free-streaming limit is also provided in the case of a spherically extended atmosphere. The formal solutions are written explicitly for scattering atmospheres in which the density and the velocity fields are given by a power law. A self-consistent temperature profile accurate to O(Beta = v/c) is provided for the case in which the absorption or the scattering are temperature independent. The gray extinction temperature profile is considerably simplified in the case of a scattering atmosphere. Steady state flow and homologous expansion are special cases that are considered in detail.

Pistinner, Shlomi↗

NASA NTRS1994

The Dynamics of Some Iterative Implicit Schemes

Yee, H. C.↗

NASA NTRS2004

Simulating Nonlinear Deformations of Solar Sail Membranes Using Explicit Time Integration

In this study, the explicit time integration method is employed to predict deformation of highly flexible solar sail structural components. The nonlinear static analysis of a highly flexible ribbon structure is presented to demonstrate the need for having the explicit time integration method in the analysis toolbox for solar sail. Static analyses of the ribbon structure produce ambiquous results whereas the explicit time integration method determines the correct results. Extensive benchmarking examples are also presented to build confidence in the use of the explicit method. Previously determined nonlinear wrinkling deformations of solar sail membranes are found by the explicit method. As the explicit method is known to often require more computational time than nonlinear static methods, a study on mass scaling was also conducted. The computational times are reported for the nonlinear static and explicit time integration solutions to calibrate the advantage of using mass scaling for these problems.

Wang, John T.↗

NASA NTRS2008

The Adaptively-Refined MHD Solver (ARMS)

ARMS is a robust code for solving the single-fluid, fully compressible equations of magnetohydrodynamics. In this presentation I will describe how to access and run ARMS and how to use HelioSpace to analyze the results. The main features of the code are the following: 1. Equations are solved in either Cartesian or Spherical coordinates. For the latter, either a linear or a Log(r) coordinate can be used. 2. The latest flux-corrected-transport schemes developed at NRZ, are used to advance the convective equations. All waves and shocks are accurately captured. 3. A fully adaptive grid can be used. The code incorporates the PARAMESH technology for block-adaptation. Arbitrary adaptation criteria can be specified. 4. The code maintains a divergence-free magnetic field to machine accuracy throughout all refinement and de-refinement. 5. A uniform resistivity and thermal conduction can be included. Solution is either explicit or implicit. 6. Arbitrary boundary and initial conditions can be used in either Cartesian or spherical coordinates. 7. An accompanying visualization package, HelioSpace, is available for viewing and analyzing the native ARMS output, (without need for interpolating onto a structured grid).

Antichos, S. K.↗

NASA NTRS1982

Application of the Hughes-LIU algorithm to the 2-dimensional heat equation

An implicit explicit algorithm for the solution of transient problems in structural dynamics is described. The method involved dividing the finite elements into implicit and explicit groups while automatically satisfying the conditions. This algorithm is applied to the solution of the linear, transient, two dimensional heat equation subject to an initial condition derived from the soluton of a steady state problem over an L-shaped region made up of a good conductor and an insulating material. Using the IIT/PRIME computer with virtual memory, a FORTRAN computer program code was developed to make accuracy, stability, and cost comparisons among the fully explicit Euler, the Hughes-Liu, and the fully implicit Crank-Nicholson algorithms. The Hughes-Liu claim that the explicit group governs the stability of the entire region while maintaining the unconditional stability of the implicit group is illustrated.

Malkus, D. S.↗

NASA NTRS1992

Adaptive explicit and implicit finite element methods for transient thermal analysis

The application of adaptive finite element methods to the solution of transient heat conduction problems in two dimensions is investigated. The computational domain is represented by an unstructured assembly of linear triangular elements and the mesh adaptation is achieved by local regeneration of the grid, using an error estimation procedure coupled to an automatic triangular mesh generator. Two alternative solution procedures are considered. In the first procedure, the solution is advanced by explicit timestepping, with domain decomposition being used to improve the computational efficiency of the method. In the second procedure, an algorithm for constructing continuous lines which pass only once through each node of the mesh is employed. The lines are used as the basis of a fully implicit method, in which the equation system is solved by line relaxation using a block tridiagonal equation solver. The numerical performance of the two procedures is compared for the analysis of a problem involving a moving heat source applied to a convectively cooled cylindrical leading edge.

Probert, E. J.↗

NASA NTRS1993

Discrete ordinates solutions of nongray radiative transfer with diffusely reflecting walls

Nongray gas radiation in a plane parallel slab bounded by gray, diffusely reflecting walls is studied using the discrete ordinates method. The spectral equation of transfer is averaged over a narrow wavenumber interval preserving the spectral correlation effect. The governing equations are derived by considering the history of multiple reflections between two reflecting wails. A closure approximation is applied so that only a finite number of reflections have to be explicitly included. The closure solutions express the physics of the problem to a very high degree and show relatively little error. Numerical solutions are obtained by applying a statistical narrow-band model for gas properties and a discrete ordinates code. The net radiative wail heat fluxes and the radiative source distributions are obtained for different temperature profiles. A zeroth-degree formulation, where no wall reflection is handled explicitly, is sufficient to predict the radiative transfer accurately for most cases considered, when compared with increasingly accurate solutions based on explicitly tracing a larger number of wail reflections without any closure approximation applied.

Menart, J. A.↗

NASA NTRS1989

Explicit, implicit, and hybrid methods

Time integration methods can be separated into two groups: explicit and implicit. Methods which do not involve the solution of any algebraic equations are called explicit, while those that require the solution of equations are called implicit. The relative advantages and disadvantages of explicit and implicit methods are summarized. The major trend in the past decade of research was to use hybrization methods to take advantage of the complementary nature of the positive attributes of explicit and implicit integration. These trends are briefly discussed.

Belytschko, T.↗

NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results in substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed.

Johnson, G. M.↗

NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results is substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed. Previously announced in STAR as N83-21847

Johnson, G. M.↗

NASA NTRS2005

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗

NASA NTRS1992

Identifiability of linear systems in physical coordinates

Identifiability of linear, time-invariant systems in physical coordinates is discussed. It is shown that identification of the system matrix in physical coordinates can be accomplished by determining a transformation matrix that relates the physical locations of actuators and sensors to the test-data-derived input and output matrices. For systems with symmetric matrices, the solution of a constrained optimization problem is used to characterize all the possible solutions of the transformation matrix. Conditions for the existence of a unique transformation matrix are established easily from the explicit form of the solutions. For systems with limited inputs and outputs, the question about which part of the system can be uniquely identified is also answered. A simple mass-spring system is used to verify the conclusions of this study.

Su, Tzu-Jeng↗

NASA NTRS1981

A numerical solution for two-dimensional Fredholm integral equations of the second kind with kernels of the logarithmic potential form

Two dimensional Fredholm integral equations with logarithmic potential kernels are numerically solved. The explicit consequence of these solutions to their true solutions is demonstrated. The results are based on a previous work in which numerical solutions were obtained for Fredholm integral equations of the second kind with continuous kernels.

Gabrielsen, R. E.↗

NASA NTRS1994

Global Asymptotic Behavior of Iterative Implicit Schemes

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2 x 2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

Yee, H. C.↗

NASA NTRS1991

Development of a solution adaptive unstructured scheme for quasi-3D inviscid flows through advanced turbomachinery cascades

The objective of the present research is to develop a general solution adaptive scheme for the accurate prediction of inviscid quasi-three-dimensional flow in advanced compressor and turbine designs. The adaptive solution scheme combines an explicit finite-volume time-marching scheme for unstructured triangular meshes and an advancing front triangular mesh scheme with a remeshing procedure for adapting the mesh as the solution evolves. The unstructured flow solver has been tested on a series of two-dimensional airfoil configurations including a three-element analytic test case presented here. Mesh adapted quasi-three-dimensional Euler solutions are presented for three spanwise stations of the NASA rotor 67 transonic fan. Computed solutions are compared with available experimental data.

Usab, William J., Jr.↗

NASA NTRS1990

Effect of artificial viscosity on three-dimensional flow solutions

Artificial viscosity is added either implicitly or explicitly in practically every numerical scheme for suppressing spurious oscillations in the solution of fluid dynamics equations. In the present central-difference scheme, artificial viscosity is added explicitly for suppressing high frequency oscillations and achieving good convergence properties. The amount of artificial viscosity added is controlled through the use of pre-selected coefficients. In the standard scheme, scalar coefficients based on the spectral radii of the Jacobian of convective fluxes are used. However, this can add too much viscosity to the slower waves. Hence, use the matrix-valued coefficients, which give appropriate viscosity for each wave component is suggested. With the matrix-valued coefficients, the central-difference scheme produces more accurate solutions on a given grid, particularly in the vicinity of shocks, while still maintaining good convergence properties.

Turkel, Eli↗

NASA NTRS1994

Effect of artificial viscosity on three-dimensional flow solutions

Artificial viscosity is added either implicity or explicitly in practically every numerical scheme for suppressing spurious oscillations in the solution of fluid-dynamics equations. In the present central-difference scheme, artificial viscosity is added explicitly for suppressing high-frequency oscillations and achieving good convergence properties. The amount of artificial viscosity added is controlled through the use of preselected coefficients. In the standard scheme, scalar coefficients based on the spectral radii of the Jacobian of the convective fluxes are used. However, this can add too much viscosity to the slower waves. Hence, the use of matrix-valued coefficients, which give appropriate viscosity for each wave component, is suggested. With the matrix-valued coefficients, the central-difference scheme produces more accurate solutions on a given grid, particularly in the vicinity of shocks and boundary layers, while still maintaining good convergence properties.

Turkel, Eli↗

NASA NTRS1980

Computational strategy for the solution of large strain nonlinear problems using the Wilkins explicit finite-difference approach

The STEALTH code system, which solves large strain, nonlinear continuum mechanics problems, was rigorously structured in both overall design and programming standards. The design is based on the theoretical elements of analysis while the programming standards attempt to establish a parallelism between physical theory, programming structure, and documentation. These features have made it easy to maintain, modify, and transport the codes. It has also guaranteed users a high level of quality control and quality assurance.

Hofmann, R.↗