SEARCH · Engineering Papers

Results for “Partially explicit”

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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1973

Unsteady turbulent boundary layer analysis

The governing equations for an unsteady turbulent boundary layer on a swept infinite cylinder, composed of a continuity equation, a pair of momentum equations and a pair of turbulent energy equations which include upstream history efforts, are solved numerically. An explicit finite difference analog to the partial differential equations is formulated and developed into a computer program. Calculations were made for a variety of unsteady flows in both two and three dimensions but primarily for two dimensional flow fields in order to first understand some of the fundamental physical aspects of unsteady turbulent boundary layers. Oscillating free stream flows without pressure gradient, oscillating retarded free stream flows and monotonically time-varying flows have all been studied for a wide frequency range. It was found that to the lowest frequency considered, the lower frequency bound being determined by economic considerations (machine time), there were significant unsteady effects on the turbulent boundary layer.

Singleton, R. E.↗

NASA NTRS1983

Direct and implicit optical matrix-vector algorithms

New direct and implicit algorithms for optical matrix-vector and systolic array processors are considered. Direct rather than indirect algorithms to solve linear systems and implicit rather than explicit solutions to solve second-order partial differential equations are discussed. In many cases, such approaches more properly utilize the advantageous features of optical systolic array processors. The matrix-decomposition operation (rather than solution of the simplified matrix-vector equation that results) is recognized as the computationally burdensome aspect of such problems that should be computed on an optical system. The Householder QR matrix-decomposition algorithm is considered as a specific example of a direct solution. Extensions to eigenvalue computation and formation of matrices of special structure are also noted.

Casasent, D.↗

NASA NTRS2004

Characteristic Matrices for Spherical Shell Photonic Systems

We establish a parallel between the transfer matrix used in the study of plane-parallel photonic structures and the matrix characterizing transfer of partial waves in concentric spheres. We derive explicit expressions for the elements of the transfer matrix for concentric spherical layers, and from those expressions derive the scattering coefficients of a multilayered sphere. The transfer matrices are 4x4 block diagonal with only four independent elements. Matrix elements for the case of TM waves are related to those for the case of TE waves through simple interchange and multiplicative constants. In analogy with plane parallel layers, the transfer matrix for concentric multilayers is simply the product of the transfer matrices of the individual layers.

Fuller, Kirk A.↗

NASA NTRS1976

A three-dimensional, time-dependent model of Mobile Bay

A three-dimensional, time-variant mathematical model for momentum and mass transport in estuaries was developed and its solution implemented on a digital computer. The mathematical model is based on state and conservation equations applied to turbulent flow of a two-component, incompressible fluid having a free surface. Thus, bouyancy effects caused by density differences between the fresh and salt water, inertia from thare river and tidal currents, and differences in hydrostatic head are taken into account. The conservation equations, which are partial differential equations, are solved numerically by an explicit, one-step finite difference scheme and the solutions displayed numerically and graphically. To test the validity of the model, a specific estuary for which scaled model and experimental field data are available, Mobile Bay, was simulated. Comparisons of velocity, salinity and water level data show that the model is valid and a viable means of simulating the hydrodynamics and mass transport in non-idealized estuaries.

Pitts, F. H.↗

NASA NTRS1981

Some experiments on explicit boundary algorithms

Experiments done with the aim of improving the accuracy and efficiency of explicit boundary algorithms for quasilinear hyperbolic systems of partial differential equations in matrix form are described. Existing methods are criticized and a new approach to the problem is presented.

Forester, K.↗

NASA NTRS1985

Interface procedures for overlapping grids

Interpolation at grid boundaries is studied for the purpose of solving partial differential equations using either implicit or conservative explicit finite-difference methods on multi-component overlapping grid systems.

Mastin, C. W.↗

NASA NTRS1986

Interface procedures for overlapping grids

The solution of partial differential equations by means of either implicit or conservative explicit finite-difference methods, on the one hand, or multicomponent overlapping grid schemes on the other, is presently subjected to interpolation at grid boundaries in an attempt to eliminate the time lag. The accuracy of the transient solution of a hyperbolic or parabolic partial differential equation is dependent on the procedures used to transfer information between grids in a composite grid system. The present techniques reduce numerical solution errors.

Mastin, C. Wayne↗

NASA NTRS1991

Distributed Minimal Residual (DMR) method for acceleration of iterative algorithms

A new method for enhancing the convergence rate of iterative algorithms for the numerical integration of systems of partial differential equations was developed. It is termed the Distributed Minimal Residual (DMR) method and it is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method was applied to Euler equations of gas dynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration. The formulation for the DMR method is general in nature and can be applied to explicit and implicit iterative algorithms for arbitrary systems of partial differential equations.

Lee, Seungsoo↗

NASA NTRS2010

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

NASA NTRS1996

Three-color resonance ionization spectroscopy of Zr in Si

As our society becomes technologically more complex, computers are being used in greater and greater numbers of high consequence systems. Giving a machine control over the lives of humans can be disturbing, especially if the software that is run on such a machine has bugs. Formal reasoning is one of the most powerful techniques available to demonstrate the correctness of a piece of software. When reasoning about software and its development, one frequently encounters expressions that contain partial functions. As might be expected, the presence of partial functions introduces an additional dimension of difficulty to the reasoning framework. This difficulty produces an especially strong impact in the case of high consequence systems. An ability to use formal methods for constructing software is essential if we want to obtain greater confidence in such systems through formal reasoning. This is only reasonable under automation of software development and verification. However, the ubiquitous presence of partial functions prevents a uniform application to software of any tools not specifically accounting for partial functions. In this paper we will describe a framework for reasoning about software, based on the nonstrict explicit domain approach, that is applicable to a large class of software/hardware systems. In this framework the Hoare triples containing partial functions can be reasoned about automatically in a well-defined and uniform manner.

Hansen, C. S.↗

NASA NTRS1983

A new explicit method for the numerical solution of parabolic differential equations

A new method is derived for solving parabolic partial differential equations arising in transient heat conduction or in boundary-layer flows. The method is based on a combination of the modified differential quadrature (MDQ) method with the rational Runge-Kutta time-integration scheme. It is fully explicit, requires no matrix inversion, and is stable for any time-step for the heat equations. Burgers equation and the one- and two-dimensional heat equations are solved to demonstrate the accuracy and efficiency of the proposed algorithm. The present method is found to be very accurate and efficient when results are compared with analytic solutions.

Satofuka, N.↗

NASA NTRS2019

A New Approach to Model Delamination Growth in Fatigue Using the Virtual Crack Closure Technique Without Re-Meshing

A modeling approach is proposed to simulate delamination propagation in fatigue that combines the Virtual Crack Closure Technique (VCCT) with a progressive nodal release strategy. The progressive nodal release alleviates the artificial stress concentrations found when using the VCCT with instantaneous release to model 3D delamination without re-meshing. This enables crack shapes that do not conform to the underlying mesh to be readily simulated. The progressive release is formulated such that no artificial growth or healing occurs as a result of a change in loading conditions. Furthermore, expressions for calculating energy release rates at partially released nodes are proposed and applied to arbitrarily shaped delamination fronts. The shape of the delamination front is considered explicitly in the energy release rate calculations, and is determined by considering the normalized crack positions associated with the partial nodal release. Contrary to previous implementations, the local delamination propagation direction is not assumed to follow mesh lines, but instead is computed as part of the iterative procedure proposed to determine the maximum energy release along the crack front. The results obtained suggest the approach can accurately simulate Mode I, Mixed Mode I/II and Mode II fatigue delamination growth and be used to simulate growth of arbitrarily shaped cracks that do not conform to the underlying mesh.

N V De Carvalho↗

NASA NTRS1977

A Green's function formulation for a nonlinear potential flow solution applicable to transonic flow

Routine determination of inviscid subsonic flow fields about wing-body-tail configurations employing a Green's function approach for numerical solution of the perturbation velocity potential equation is successfully extended into the high subsonic subcritical flow regime and into the shock-free supersonic flow regime. A modified Green's function formulation, valid throughout a range of Mach numbers including transonic, that takes an explicit accounting of the intrinsic nonlinearity in the parent governing partial differential equations is developed. Some considerations pertinent to flow field predictions in the transonic flow regime are discussed.

Baker, A. J.↗

NASA NTRS1995

Nozzle flow with vibrational nonequilibrium

This research concerns the modeling and numerical solutions of the coupled system of compressible Navier-Stokes equations in cylindrical coordinates under conditions of equilibrium and nonequilibrium thermodynamics. The problem considered was the modeling of a high temperature diatomic gas N2 flowing through a converging-diverging high expansion nozzle. The problem was modeled in two ways. The first model uses a single temperature with variable specific heats as functions of this temperature. For the second model we assume that the various degrees of freedom all have a Boltzmann distribution and that there is a continuous redistribution of energy among the various degrees of freedom as the gas passes through the nozzle. Each degree of freedom is assumed to have its own temperature and, consequently, each system state can be characterized by these temperatures. This suggests that formulation of a second model with a vibrational degree of freedom along with a rotational-translation degree of freedom, each degree of freedom having its own temperature. Initially the vibrational degree of freedom is excited by heating the gas to a high temperature. As the high temperature gas passes through the nozzle throat there is a sudden drop in temperature along with a relaxation time for the vibrational degree of freedom to achieve equilibrium with the rotational-translation degree of freedom. That is, we assume that the temperature change upon passing through the throat is so great that the changes in the vibrational degree of freedom occur at a much slower pace and consequently lags behind the rotational-translational energy changes. This lag results in a finite relaxation time. In this context the term nonequilibrium is used to denote the fact that the energy content of the various degrees of freedom are characterized by two temperatures. We neglect any chemical reactions which could also add nonequilibrium effects. We develop the energy equations for the nonequilibrium model from first principles. The resulting equations, which model the nozzle flow, can be expressed in various forms. In most forms the resulting equations are coupled systems of nonlinear partial differential equations subject to certain boundary conditions. To solve the resulting coupled system of nonlinear partial differential equations, several numerical techniques were investigated: (1) the explicit MacCormack method, (2) the explicit-implicit MacCormack method, (3) the method of operator splitting, (4) factorization schemes, and (5) the Steger-Warming scheme.

Heinbockel, J. H.↗

NASA NTRS1996

Nonstandard Finite Difference Schemes: Relations Between Time and Space Step-Sizes in Numerical Schemes for PDE's That Follow from Positivity Condition

A large class of physical phenomena can be modeled by evolution and wave type Partial Differential Equations (PDE). Few of these equations have known explicit exact solutions. Finite-difference techniques are a popular method for constructing discrete representations of these equations for the purpose of numerical integration. However, the solutions to the difference equations often contain so called numerical instabilities; these are solutions to the difference equations that do not correspond to any solution of the PDE's. For explicit schemes, the elimination of this behavior requires functional relations to exist between the time and space steps-sizes. We show that such functional relations can be obtained for certain PDE's by use of a positivity condition. The PDE's studied are the Burgers, Fisher, and linearized Euler equations.

Mickens, Ronald E.↗

NASA NTRS2010

Forces Associated with Nonlinear Nonholonomic Constraint Equations

A concise method has been formulated for identifying a set of forces needed to constrain the behavior of a mechanical system, modeled as a set of particles and rigid bodies, when it is subject to motion constraints described by nonholonomic equations that are inherently nonlinear in velocity. An expression in vector form is obtained for each force; a direction is determined, together with the point of application. This result is a consequence of expressing constraint equations in terms of dot products of vectors rather than in the usual way, which is entirely in terms of scalars and matrices. The constraint forces in vector form are used together with two new analytical approaches for deriving equations governing motion of a system subject to such constraints. If constraint forces are of interest they can be brought into evidence in explicit dynamical equations by employing the well-known nonholonomic partial velocities associated with Kane's method; if they are not of interest, equations can be formed instead with the aid of vectors introduced here as nonholonomic partial accelerations. When the analyst requires only the latter, smaller set of equations, they can be formed directly; it is not necessary to expend the labor to form the former, larger set first and subsequently perform matrix multiplications.

Roithmayr, Carlos M.↗

NASA NTRS1976

Solutions to divergence form equations using the method of partial implicitization

Partial implicitization is well suited for use on vector-processing computers since the method is an explicit unconditionally stable numerical technique. So far equations cast in nondivergence form have been used, though equations cast in the divergence form would have inherently greater accuracy. Since the method of partial implicitization is applicable only to relaxing problems to their steady state and is not applicable to true transient problems, a simple mathematical manipulation can be carried out which will produce the desired partial implicitization solution to divergence form equations.

Graves, R. A., Jr.↗

NASA NTRS2010

Symbolic Analysis of Concurrent Programs with Polymorphism

The current trend of multi-core and multi-processor computing is causing a paradigm shift from inherently sequential to highly concurrent and parallel applications. Certain thread interleavings, data input values, or combinations of both often cause errors in the system. Systematic verification techniques such as explicit state model checking and symbolic execution are extensively used to detect errors in such systems [7, 9]. Explicit state model checking enumerates possible thread schedules and input data values of a program in order to check for errors [3, 9]. To partially mitigate the state space explosion from data input values, symbolic execution techniques substitute data input values with symbolic values [5, 7, 6]. Explicit state model checking and symbolic execution techniques used in conjunction with exhaustive search techniques such as depth-first search are unable to detect errors in medium to large-sized concurrent programs because the number of behaviors caused by data and thread non-determinism is extremely large. We present an overview of abstraction-guided symbolic execution for concurrent programs that detects errors manifested by a combination of thread schedules and data values [8]. The technique generates a set of key program locations relevant in testing the reachability of the target locations. The symbolic execution is then guided along these locations in an attempt to generate a feasible execution path to the error state. This allows the execution to focus in parts of the behavior space more likely to contain an error.

Rungta, Neha Shyam↗