Search NASA⌕ Search

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.

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

At least 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Jump phenomena

The paper considers jump phenomena composed of large amplitude responses of nonlinear systems caused by small amplitude disturbances. Physical problems where large jumps in the solution amplitude are important features of the response are described, including snap buckling of elastic shells, chemical reactions leading to combustion and explosion, and long-term climatic changes of the earth's atmosphere. A new method of rational functions was then developed which consists of representing the solutions of the jump problems as rational functions of the small disturbance parameter; this method can solve jump problems explicitly.

Reiss, E. L.↗
NASA NTRS1982

A semi-implicit dynamic relaxation algorithm for static nonlinear structural analysis

A semiimplicit dynamic relaxation technique for solution of the nonlinear structural equlibrium equation is presented. A previously presented basic transient response analysis algorithm is employed, permitting use of one solution method and one software module for both static and dynamic analyses. A theoretical comparison of the method with explicit dynamic relaxation techniques shows that it offers a substantially improved convergence property without additional computational overhead.

Park, K. C.↗
NASA NTRS1985

Partitioning problems in parallel, pipelined and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple computer system is addressed. A Sum-Bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple satellite system: partitioning multiple chain structured parallel programs, multiple arbitrarily structured serial programs and single tree structured parallel programs. In addition, the problems of partitioning chain structured parallel programs across chain connected systems and across shared memory (or shared bus) systems are also solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple computer architectures for a wide range of problems of practical interest.

Bokhari, S.↗
NASA NTRS1988

Partitioning problems in parallel, pipelined, and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.

Bokhari, Shahid H.↗
NASA NTRS1995

Using an architectural approach to integrate heterogeneous, distributed software components

Many computer programs cannot be easily integrated because their components are distributed and heterogeneous, i.e., they are implemented in diverse programming languages, use different data representation formats, or their runtime environments are incompatible. In many cases, programs are integrated by modifying their components or interposing mechanisms that handle communication and conversion tasks. For example, remote procedure call (RPC) helps integrate heterogeneous, distributed programs. When configuring such programs, however, mechanisms like RPC must be used explicitly by software developers in order to integrate collections of diverse components. Each collection may require a unique integration solution. This paper describes improvements to the concepts of software packaging and some of our experiences in constructing complex software systems from a wide variety of components in different execution environments. Software packaging is a process that automatically determines how to integrate a diverse collection of computer programs based on the types of components involved and the capabilities of available translators and adapters in an environment. Software packaging provides a context that relates such mechanisms to software integration processes and reduces the cost of configuring applications whose components are distributed or implemented in different programming languages. Our software packaging tool subsumes traditional integration tools like UNIX make by providing a rule-based approach to software integration that is independent of execution environments.

Callahan, John R.↗
NASA NTRS1996

The Effects of Dissipation and Coarse Grid Resolution for Multigrid in Flow Problems

The objective of this paper is to investigate the effects of the numerical dissipation and the resolution of the solution on coarser grids for multigrid with the Euler equation approximations. The convergence is accomplished by multi-stage explicit time-stepping to steady state accelerated by FAS multigrid. A theoretical investigation is carried out for linear hyperbolic equations in one and two dimensions. The spectra reveals that for stability and hence robustness of spatial discretizations with a small amount of numerical dissipation the grid transfer operators have to be accurate enough and the smoother of low temporal accuracy. Numerical results give grid independent convergence in one dimension. For two-dimensional problems with a small amount of numerical dissipation, however, only a few grid levels contribute to an increased speed of convergence. This is explained by the small numerical dissipation leading to dispersion. Increasing the mesh density and hence making the problem over resolved increases the number of mesh levels contributing to an increased speed of convergence. If the steady state equations are elliptic, all grid levels contribute to the convergence regardless of the mesh density.

Eliasson, Peter↗
NASA NTRS2005

Mathematical Metaphors: Problem Reformulation and Analysis Strategies

This paper addresses the critical need for the development of intelligent or assisting software tools for the scientist who is working in the initial problem formulation and mathematical model representation stage of research. In particular, examples of that representation in fluid dynamics and instability theory are discussed. The creation of a mathematical model that is ready for application of certain solution strategies requires extensive symbolic manipulation of the original mathematical model. These manipulations can be as simple as term reordering or as complicated as discovery of various symmetry groups embodied in the equations, whereby Backlund-type transformations create new determining equations and integrability conditions or create differential Grobner bases that are then solved in place of the original nonlinear PDEs. Several examples are presented of the kinds of problem formulations and transforms that can be frequently encountered in model representation for fluids problems. The capability of intelligently automating these types of transforms, available prior to actual mathematical solution, is advocated. Physical meaning and assumption-understanding can then be propagated through the mathematical transformations, allowing for explicit strategy development.

Thompson, David E.↗
NASA NTRSDate not supplied

Convolution-Based Numerical Solutions of Transient Temperature Fields during Powder Bed Fusion Additive Manufacturing: Theory, Accuracy, and Computational Cost

Powder bed fusion (PBF) additive manufacturing has found numerous applications in the aerospace domain. However, components fabricated via PBF have a complex time-temperature history that significantly impacts subsequent mechanical performance. This study examines convolution-based numerical solutions of transient temperature fields that support simulations involving arbitrary beam shapes and paths during PBF. The convolutional approach is verified through comparisons with analytical solutions of the temperature field. The computational speed and accuracy of the method are assessed through comparisons with other explicit and implicit numerical techniques. In addition, the straightforward translation of the approach from a CPU to a GPU implementation and the resultant performance improvement are presented. The role of the technique in predicting microstructure evolution during PBF (for a greater process-structure-property-performance framework) is also demonstrated. This work supports the development of computational materials methods for understanding and controlling the time-temperature history during PBF.

powder bed fusion↗
NASA NTRS1979

Finite element methodology for transient conduction/forced-convection thermal analysis

Finite element methodology for steady state thermal analysis of convectively cooled structures has been extended for transient analysis. The finite elements are based on representing the fluid passages by fluid bulk-temperature nodes and fluid-solid interface nodes. The formulation of the finite element equations for a typical flow passage is based on the weighted residual method with upwind weighting functions. Computer implementation of the convective finite element methodology using explicit and implicit time integration algorithms is described. Accuracy and efficiency of the methodology is evaluated by comparisons with analytical solutions and finite-difference lumped-parameter analyses. The comparative analyses demonstrate that finite element conduction/conduction methodology may be used to predict transient temperatures with an accuracy equal or superior to the lumped-parameter finite-difference method.

Thornton, E. A.↗
NASA NTRS1982

Semi-implicit transient analysis procedures for structural dynamics analysis

A semi-implicit direct time integration procedure is presented which avoids factorization of the implicit difference solution matrix. The procedure, if properly implemented, requires only vectorial calculations and hence needs the same computer core space as explicit integration procedures. Guidelines for splitting the stiffness matrix into upper and lower matrices are established, which among other things are designed to satisfy a correct transmission of rigid-body motions from element (or grid) to its adjacent elements.

Park, K. C.↗
NASA NTRS1983

On a finite-difference method for solving transient viscous flow problems

A method has been developed to solve the unsteady, compressible Navier-Stokes equation with the property of consistency and the ability of minimizing the equation stiffness. It relies on innovative extensions of the state-of-the-art finite-difference techniques and is composed of: (1) the upwind scheme for split-flux and the central scheme for conventional flux terms in the inviscid and viscous regions, respectively; (2) the characteristic treatment of both inviscid and viscous boundaries; (3) an ADI procedure compatible with interior and boundary points; and (4) a scalar matrix coefficient including viscous terms. The performance of this method is assessed with four sample problems; namely, a standing shock in the Laval duct, a shock reflected from the wall, the shock-induced boundary-layer separation, and a transient internal nozzle flow. The results from the present method, an existing hybrid block method, and a well-known two-step explicit method are compared and discussed. It is concluded that this method has an optimal trade-off between the solution accuracy and computational economy, and other desirable properties for analyzing transient viscous flow problems.

Li, C. P.↗
NASA NTRS1986

Influence of numerical dissipation in computing supersonic vortex-dominated flows

Steady supersonic vortex-dominated flows are solved using the unsteady Euler equations for conical and three-dimensional flows around sharp- and round-edged delta wings. The computational method is a finite-volume scheme which uses a four-stage Runge-Kutta time stepping with explicit second- and fourth-order dissipation terms. The grid is generated by a modified Joukowski transformation. The steady flow solution is obtained through time-stepping with initial conditions corresponding to the freestream conditions, and the bow shock is captured as a part of the solution. The scheme is applied to flat-plate and elliptic-section wings with a leading edge sweep of 70 deg at an angle of attack of 10 deg and a freestream Mach number of 2.0. Three grid sizes of 29 x 39, 65 x 65 and 100 x 100 have been used. The results for sharp-edged wings show that they are consistent with all grid sizes and variation of the artificial viscosity coefficients. The results for round-edged wings show that separated and attached flow solutions can be obtained by varying the artificial viscosity coefficients. They also show that the solutions are independent of the way time stepping is done. Local time-stepping and global minimum time-steeping produce same solutions.

Kandil, O. A.↗
NASA NTRS1991

An assessment of computational fluid dynamic techniques in the analysis and design of turbomachinery - The 1990 Freeman Scholar Lecture

Various computational fluid dynamic techniques are reviewed focusing on the Euler and Navier-Stokes solvers with a brief assessment of boundary layer solutions, and quasi-3D and quasi-viscous techniques. Particular attention is given to a pressure-based method, explicit and implicit time marching techniques, a pseudocompressibility technique for incompressible flow, and zonal techniques. Recommendations are presented with regard to the most appropriate technique for various flow regimes and types of turbomachinery, incompressible and compressible flows, cascades, rotors, stators, liquid-handling, and gas-handling turbomachinery.

Lakshminarayana, B.↗
NASA NTRS1995

Hybrid Upwind Splitting (HUS) by a Field-by-Field Decomposition

We introduce and develop a new approach for upwind biasing: the hybrid upwind splitting (HUS) method. This original procedure is based on a suitable hybridization of current prominent flux vector splitting (FVS) and flux difference splitting (FDS) methods. The HUS method is designed to naturally combine the respective strengths of the above methods while excluding their main deficiencies. Specifically, the HUS strategy yields a family of upwind methods that exhibit the robustness of FVS schemes in the capture of nonlinear waves and the accuracy of some FDS schemes in the resolution of linear waves. We give a detailed construction of the HUS methods following a general and systematic procedure directly performed at the basic level of the field by field (i.e. waves) decomposition involved in FDS methods. For such a given decomposition, each field is endowed either with FVS or FDS numerical fluxes, depending on the nonlinear nature of the field under consideration. Such a design principle is made possible thanks to the introduction of a convenient formalism that provides us with a unified framework for upwind methods. The HUS methods we propose bring significant improvements over current methods in terms of accuracy and robustness. They yield entropy-satisfying approximate solutions as they are strongly supported in numerical experiments. Field by field hybrid numerical fluxes also achieve fairly simple and explicit expressions and hence require a computational effort between that of the FVS and FDS. Several numerical experiments ranging from stiff 1D shock-tube to high speed viscous flows problems are displayed, intending to illustrate the benefits of the present approach. We assess in particular the relevance of our HUS schemes to viscous flow calculations.

Coquel, Frederic↗
NASA NTRS2004

Stagnation Flow in Thin Streamer Boundaries

Slow solar wind is believed to arise in the legs or near the cusp of streamers, inside the brightness boundary. In an earlier study, we used an analytic model of flow in this layer to analyze the effect of the magnetic field on the geometry of the flow. That study successfully described those conditions that can lead to a decrease of the flow speed with increasing height near the cusp of the closed magnetic helmet inside a streamer. The model was, however, restricted to a radial brightness boundary on the streamer and hence to a relatively thick outflow region near the cusp. Here, this restriction is relaxed through the explicit introduction of a coronal hole-like region outside the brightness boundary. We use the model to describe flow solutions for outflow in a thin layer inside the brightness boundary. The flow geometry now can be constrictive above the cusp and we show solutions of this type. We fail to find solutions in which the geometry alone leads to slow flow but give a more general description than before of conditions favoring slow flow and, consequently, gravitational settling in the legs of streamers.

Nerney, S.↗
NASA NTRS2005

Stagnation Flow in Thin Streamer Boundaries

Slow solar wind is believed to arise in the legs or near the cusp of streamers, inside the brightness boundary. In an earlier study, we used an analytic model of flow in this layer to analyze the effect of the magnetic field on the geometry of the flow. That study successfully described those conditions that can lead to a decrease of the flow speed with increasing height near the cusp of the closed magnetic helmet inside a streamer. The model was, however, restricted to a radial brightness boundary on the streamer and hence to a relatively thick outflow region near the cusp. Here this restriction is relaxed through the explicit introduction of a coronal hole-like region outside the brightness boundary. We use the model to describe flow solutions for outflow in a thin layer inside the brightness boundary. The flow geometry now can be constrictive just above the cusp, and we show solutions of this type. Many solutions then show a diverging geometry at greater heights above the cusp, out to at least 5 solar radius. We fail to find solutions in which the geometry alone leads to slow flow but give a more general description than before of conditions favoring slow flow and, consequently, gravitational settling in the legs of streamers.

Suess, Steven T.↗
NASA NTRS1997

The Implicit and Explicit alpha-mu Schemes

Artificial numerical dissipation is an important issue in large Reynolds number computations. In such computations, the artificial dissipation inherent in traditional numerical schemes can overwhelm the physical dissipation and yield inaccurate results on meshes of practical size. In the present work, the space-time conservation element and solution element method is used to construct new and accurate numerical schemes such that artificial numerical dissipation will not overwhelm physical dissipation. Specifically, these schemes have the property that numerical dissipation vanishes when the physical viscosity goes to zero. These new schemes therefore accurately model the physical dissipation even when it is extremely small. The method of space-time conservation element and solution element, currently under development, is a nontraditional numerical method for solving conservation laws. The method is developed on the basis of local and global flux conservation in a space-time domain, in which space and time are treated in a unified manner. Explicit solvers for model and fluid dynamic conservation laws have previously been investigated. In this paper, we introduce a new concept in the design of implicit schemes, and use it to construct two highly accurate solvers for a convection-diffusion equation. The two schemes become identical in the pure convection case, and in the pure diffusion case. The implicit schemes are applicable over the whole Reynolds number range, from purely diffusive equations to purely inviscid (convective) equations. The stability and consistency of the schemes are analyzed, and some numerical results are presented. It is shown that, in the inviscid case, the new schemes become explicit and their amplification factors are identical to those of the Leapfrog scheme. On the other hand, in the pure diffusion case, their principal amplification factor becomes the amplification factor of the Crank-Nicolson scheme. We also construct an explicit solver with the treatment of diffusion being based on that in the implicit solvers. The explicit solver has only a CFL stability limitation on the Courant number, yet it retains the second-order spatial accuracy of the implicit schemes.

Chang, Sin-Chung↗
NASA NTRS1990

Application of implicit numerical techniques to the solution of the three-dimensional diffusion equation

Implicit techniques for calculating three-dimensional, time-dependent heat diffusion in a cube are tested with emphasis on storage efficiency, accuracy, and speed of calculation. For this purpose, a tensor product technique with both Chebyshev collocation and finite differences and a generalized conjugate gradient technique with finite differences are used in conjunction with Crank-Nicolson discretization. An Euler explicit finite difference calculation is performed for use as a benchmark. The implicit techniques are found to be competitive with the Euler explicit method in terms of storage efficiency and speed of calculation and offer advantages both in accuracy and stability. Mesh stretching in the finite difference calculations is shown to markedly improve the accuracy of the solution.

Peltier, Leonard Joel↗