Search NASA⌕ Search

SEARCH · Search NASA

Results for “Newton’s equations”

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 55 records · Page 3

Molecular Simulations in Astrobiology

One of the main goals of astrobiology is to understand the origin of cellular life. In the absence of any record of the earliest ancestors of contemporary cells, protocells, the most direct way to test our understanding of their characteristics is to construct laboratory models of protocells. Such efforts, currently underway in the NASA Astrobiology Program, are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures and developing designs of molecules that are capable of performing protocellular functions. Many of these functions, such as importing nutrients, capturing and storing energy, and responding to changes in the environment, are carried out by proteins bound to membranes. We use computer simulations to address the following, questions about these proteins: (1) How do small proteins (peptides) organize themselves into ordered structures at water-membrane interfaces and insert into membranes? (2) How do peptides aggregate to form membrane-spannin(y structures (e.g., channels)? (3) By what mechanisms do such aggregates perform their functions? The simulations are performed using the molecular dynamics (MD) method. In this method, Newton's equations of motion for each atom in the system are solved iteratively. At each time step, the forces exerted on each atom by the remaining atoms are evaluated by dividing them into two parts. Short-range forces are calculated directly in real space while long-range forces are evaluated in reciprocal space, usually using a particle-mesh algorithm which is of order O(NlnN). Currently, a time step of 2 femtoseconds is typically used, thereby making studies of problems occurring on multi-nanosecond time scales (10(exp 6) - 10(exp 8) time steps) accessible. To address a broader range of problems, simulations need to be extended by three orders of magnitude. Such an extension requires both algorithmic improvements and codes scalable to a large number of parallel processors. Work in this direction is in progress. Two specific series of simulations that demonstrate how peptides self-organize and function in membranes are discussed. In one series of simulations, it was shown that nonpolar peptides, disordered in water, translocate to the nonpolar interior of the membrane and, simultaneously, fold into two different helical structures, which remain in equilibrium. Once in the membrane, the peptides can readily change their orientation, especially in response to local electric fields. This structural and orientational flexibility of peptides with changing conditions may have provided a mechanism of transmitting signals between the environment and the interior of the protocell. In another series of simulations, the mechanism by which a simple protein channel efficiently mediates proton transport across membranes was investigated. This process is a key step in cellular bioenergetics. In the channel under study, proton transport is gated by four histidines that occlude the channel pore. The simulations demonstrate that protons move through the gate by a "shuttle" mechanism, wherein one histidine is protonated on the extracellular side and, subsequently, the proton bound on the opposite side is released.

Pohorille, Andrew↗

Threshold Laws for Two-Electron Ejection Processes: A Still Controversial Problem in Atomic Physics

This talk deals with collision processes of the following kind: (a) an ionizing collision of an electron with a neutral atom, (b) a photon incident of a negative ion resulting in two-electron ejection. In both cases the final state is a positive ion and two outgoing electrons, and in principle both processes should be governed by the same form of threshold law. It is generally conceded that this is one of the most difficult basic problems in nonrelativistic quantum mechanics. The standard treatment (due to Wannier) will be briefly reviewed in terms of the derivation of his well- known threshold law for the yield (Q) of positive ions vs. the excess energy (E): Q(sub w) varies as E(exp 1.127...). The derivation is a brilliant analysis based on Newton's equations, leading to the dominance of events in which the two electrons emerge on opposite sides of the residual ion with similar energies. In contrast, I will argue on the basis of quantum mechanical ideas that in the threshold limit the more likely outcome are events in which the electrons emerge with decidedly different energies, leading to a formally different (Coulomb-dipole) threshold law Q(sub CD) varies as E(1 + C sin(alpha ln(E)+mu)]/[ln(E)](exp 2). Additional aspects of that approach will be discussed . Some: experimental results will be presented, and more incisive predictions involving polarized projectiles and targets will be given.

Temkin, Aaron↗

Computer Modeling of the Earliest Cellular Structures and Functions

In the absence of extinct or extant record of protocells (the earliest ancestors of contemporary cells). the most direct way to test our understanding of the origin of cellular life is to construct laboratory models of protocells. Such efforts are currently underway in the NASA Astrobiology Program. They are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures and developing designs for molecules that perform proto-cellular functions. Many of these functions, such as import of nutrients, capture and storage of energy. and response to changes in the environment are carried out by proteins bound to membrane< We will discuss a series of large-scale, molecular-level computer simulations which demonstrate (a) how small proteins (peptides) organize themselves into ordered structures at water-membrane interfaces and insert into membranes, (b) how these peptides aggregate to form membrane-spanning structures (eg. channels), and (c) by what mechanisms such aggregates perform essential proto-cellular functions, such as proton transport of protons across cell walls, a key step in cellular bioenergetics. The simulations were performed using the molecular dynamics method, in which Newton's equations of motion for each item in the system are solved iteratively. The problems of interest required simulations on multi-nanosecond time scales, which corresponded to 10(exp 6)-10(exp 8) time steps.

Pohorille, Andrew↗

Quasi-Newton methods for parameter estimation in functional differential equations

A state-space approach to parameter estimation in linear functional differential equations is developed using the theory of linear evolution equations. A locally convergent quasi-Newton type algorithm is applied to distributed systems with particular emphasis on parameters that induce unbounded perturbations of the state. The algorithm is computationally implemented on several functional differential equations, including coefficient and delay estimation in linear delay-differential equations.

Brewer, Dennis W.↗

Efficient smoothed particle radiation hydrodynamics I: Thermal radiative transfer

This work presents efficient solution techniques for radiative transfer in the smoothed particle hydrodynamics discretization. Two choices that impact efficiency are how the material and radiation energy are coupled, which determines the number of iterations needed to converge the emission source, and how the radiation diffusion equation is solved, which must be done in each iteration. The coupled material and radiation energy equations are solved using an inexact Newton iteration scheme based on nonlinear elimination, which reduces the number of Newton iterations needed to converge within each time step. During each Newton iteration, the radiation diffusion equation is solved using Krylov iterative methods with a multigrid preconditioner, which abstracts and optimizes much of the communication when running in parallel. The code is verified for an infinite medium problem, a one-dimensional Marshak wave, and a two and three-dimensional manufactured problem, and exhibits first-order convergence in time and second-order convergence in space. For these problems, the number of iterations needed to converge the inexact Newton scheme and the diffusion equation is independent of the number of spatial points and the number of processors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hierarchically partitioned nonlinear equation solvers

By partitioning solution space into a number of subspaces, a new multiply constrained partitioned Newton-Raphson nonlinear equation solver is developed. Specifically, for a given iteration, each of the various separate partitions are individually and simultaneously controlled. Due to the generality of the scheme, a hierarchy of partition levels can be employed. For finite-element-type applications, this includes the possibility of degree-of-freedom, nodal, elemental, geometric substructural, material and kinematically nonlinear group controls. It is noted that such partitioning can be continuously updated, depending on solution conditioning. In this context, convergence is ascertained at the individual partition level.

Padovan, Joseph↗

A new flux conserving Newton's method scheme for the two-dimensional, steady Navier-Stokes equations

A new numerical method is developed for the solution of the two-dimensional, steady Navier-Stokes equations. The method that is presented differs in significant ways from the established numerical methods for solving the Navier-Stokes equations. The major differences are described. First, the focus of the present method is on satisfying flux conservation in an integral formulation, rather than on simulating conservation laws in their differential form. Second, the present approach provides a unified treatment of the dependent variables and their unknown derivatives. All are treated as unknowns together to be solved for through simulating local and global flux conservation. Third, fluxes are balanced at cell interfaces without the use of interpolation or flux limiters. Fourth, flux conservation is achieved through the use of discrete regions known as conservation elements and solution elements. These elements are not the same as the standard control volumes used in the finite volume method. Fifth, the discrete approximation obtained on each solution element is a functional solution of both the integral and differential form of the Navier-Stokes equations. Finally, the method that is presented is a highly localized approach in which the coupling to nearby cells is only in one direction for each spatial coordinate, and involves only the immediately adjacent cells. A general third-order formulation for the steady, compressible Navier-Stokes equations is presented, and then a Newton's method scheme is developed for the solution of incompressible, low Reynolds number channel flow. It is shown that the Jacobian matrix is nearly block diagonal if the nonlinear system of discrete equations is arranged approximately and a proper pivoting strategy is used. Numerical results are presented for Reynolds numbers of 100, 1000, and 2000. Finally, it is shown that the present scheme can resolve the developing channel flow boundary layer using as few as six to ten cells per channel width, depending on the Reynolds number.

Scott, James R.↗

Further Development of a New, Flux-Conserving Newton Scheme for the Navier-Stokes Equations

This paper is one of a series of papers describing the development of a new numerical approach for solving the steady Navier-Stokes equations. The key features in the current development are (1) the discrete representation of the dependent variables by way of high order polynomial expansions, (2) the retention of all derivatives in the expansions as unknowns to be explicitly solved for, (3) the automatic balancing of fluxes at cell interfaces, and (4) the discrete simulation of both the integral and differential forms of the governing equations. The main purpose of this paper is, first, to provide a systematic and rigorous derivation of the conditions that are used to simulate the differential form of the Navier-Stokes equations, and second, to extend our previously-presented internal flow scheme to external flows and nonuniform grids. Numerical results are presented for high Reynolds number flow (Re = 100,000) around a finite flat plate, and detailed comparisons are made with the Blasius flat plate solution and Goldstein wake solution. It is shown that the error in the streamwise velocity decreases like r(sup alpha)(Delta)y(exp 2), where alpha approx. 0.25 and r = delta(y)/delta(x) is the grid aspect ratio.

Scott, James R.↗

Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation

We study parallel two-level overlapping Schwarz algorithms for solving nonlinear finite element problems, in particular, for the full potential equation of aerodynamics discretized in two dimensions with bilinear elements. The overall algorithm, Newton-Krylov-Schwarz (NKS), employs an inexact finite-difference Newton method and a Krylov space iterative method, with a two-level overlapping Schwarz method as a preconditioner. We demonstrate that NKS, combined with a density upwinding continuation strategy for problems with weak shocks, is robust and, economical for this class of mixed elliptic-hyperbolic nonlinear partial differential equations, with proper specification of several parameters. We study upwinding parameters, inner convergence tolerance, coarse grid density, subdomain overlap, and the level of fill-in in the incomplete factorization, and report their effect on numerical convergence rate, overall execution time, and parallel efficiency on a distributed-memory parallel computer.

Cai, Xiao-Chuan↗

Approximation of the Newton Step by a Defect Correction Process

In this paper, an optimal control problem governed by a partial differential equation is considered. The Newton step for this system can be computed by solving a coupled system of equations. To do this efficiently with an iterative defect correction process, a modifying operator is introduced into the system. This operator is motivated by local mode analysis. The operator can be used also for preconditioning in Generalized Minimum Residual (GMRES). We give a detailed convergence analysis for the defect correction process and show the derivation of the modifying operator. Numerical tests are done on the small disturbance shape optimization problem in two dimensions for the defect correction process and for GMRES.

Arian, E.↗

Numerical Modeling of Saturated Boiling in a Heated Tube

This paper describes a mathematical formulation and numerical solution of boiling in a heated tube. The mathematical formulation involves a discretization of the tube into a flow network consisting of fluid nodes and branches and a thermal network consisting of solid nodes and conductors. In the fluid network, the mass, momentum and energy conservation equations are solved and in the thermal network, the energy conservation equation of solids is solved. A pressure-based, finite-volume formulation has been used to solve the equations in the fluid network. The system of equations is solved by a hybrid numerical scheme which solves the mass and momentum conservation equations by a simultaneous Newton-Raphson method and the energy conservation equation by a successive substitution method. The fluid network and thermal network are coupled through heat transfer between the solid and fluid nodes which is computed by Chen's correlation of saturated boiling heat transfer. The computer model is developed using the Generalized Fluid System Simulation Program and the numerical predictions are compared with test data.

Majumdar, Alok↗

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Liou, M. S.↗

A new method for transonic static aeroelasticity problems

A new method has been developed to calculate the steady flow and structural deformations for fluid/structure interaction problems. The discretized fluid dynamic and structural equations are regarded as a single set of coupled, nonlinear, algebraic equations. The equilibrium solution is directly obtained using Newton's method. The governing equations used for the fluid flow are the two-dimensional Navier-Stokes equations, and a finite-element model is used to represent the structure. This paper describes the analytical method and presents sample calculations demonstrating the technique. The results show rapid convergence and good agreement with experimental data.

Felker, Fort F.↗

Modeling of flow systems for implementation under KATE

The modeling of flow systems is a task currently being investigated at Kennedy Space Center in parallel with the development of the KATE artificial intelligence system used for monitoring diagnosis and control. Various aspects of the modeling issues are focussed on with particular emphasis on a water system scheduled for demonstration within the KATE environment in September of this year. LISP procedures were written to solve the continuity equations for three internal pressure nodes using Newton's method for simultaneous nonlinear equations.

Whitlow, Jonathan E.↗

Multigrid Methods for Fully Implicit Oil Reservoir Simulation

In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.

Molenaar, J.↗

Equations of motion of slung-load systems, including multilift systems

General simulation equations are derived for the rigid body motion of slung-load systems. This work is motivated by an interest in trajectory control for slung loads carried by two or more helicopters. An approximation of these systems consists of several rigid bodies connected by straight-line cables or links. The suspension can be assumed elastic or inelastic. Equations for the general system are obtained from the Newton-Euler rigid-body equations with the introduction of generalized velocity coordinates. Three forms are obtained: two generalize previous case-specific results for single-helicopter systems with elastic and inelastic suspensions, respectively; and the third is a new formulation for inelastic suspensions. The latter is derived from the elastic suspension equations by choosing the generalized coordinates so that motion induced by cable stretching is separated from motion with invariant cable lengths, and by then nulling the stretching coordinates to get a relation for the suspension forces. The result is computationally more efficient than the conventional formulation, is readily integrated with the elastic suspension formulation, and is easily applied to the complex dual-lift and multilift systems. Results are given for two-helicopter systems; three configurations are included and these can be integrated in a single simulation. Equations are also given for some single-helicopter systems, for comparison with the previous literature, and for a multilift system. Equations for degenerate-body approximations (point masses, rigid rods) are also formulated and results are given for dual-lift and multilift systems. Finally, linearlized equations of motion are given for general slung-load systems are presented along with results for the two-helicopter system with a spreader bar.

Cicolani, Luigi S.↗