SEARCH · Engineering Papers

Results for “Jacobian matrices”

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 NTRS1983

Numerical approximations to nonlinear conservation laws with locally varying time and space grids

Numerical approximations to the initial value problem for nonlinear systems of conservation laws are considered. The considered system is said to be hyperbolic when all eigenvalues of every real linear combination of the Jacobian matrices are real. Solutions may develop discontinuities in finite time, even when the initial data are smooth. In the investigation, explicit finite difference methods which use locally varying time grids are considered. The global CFL restriction is replaced by a local restriction. The numerical flux function is studied from a finite volume viewpoint, and a differencing technique is developed at interface points between regions of distinct time increments.

Osher, S.↗

NASA NTRS1985

A three-dimensional Navier-Stokes/Euler code for blunt-body flow computations

The formulation computation method of an improved version of the three-dimensional Navier-Stokes/Euler computation algorithm of Li (1981) for the numerical simulation of blunt-body reentry flows are discussed, and results for five sample problems are presented graphically. The vector notation of the coordinate systems is defined; the governing equations are presented in full; the Jacobian matrices and damping terms of the factorization technique (based on the alternating-direction implicit procedure of Beam and Warming, 1978) are explained; and the capabilities, limitations and proper use of the code are summarized. Examples presented include the equilibrium-flow problem for Shuttle-orbiter reentry at Mach 22 and angle of attack 40.8 deg and the perfect-gas problem of an aerobraking orbital-transfer vehicle with an ellipsoidal/60-deg cone and a toroidal sonic shoulder. The advantages of the improved code in terms of accuracy and computation time are indicated.

Li, C. P.↗

NASA NTRS1985

Implicit finite-difference methods for the Euler equations

The present paper is concerned with two-dimensional Euler equations and with schemes which are in use of the time of this writing. Most of the development presented carries over directly to three dimensions. The characteristics of the two-dimensional Euler equations in Cartesian coordinates are considered along with generalized curvilinear coordinate transformations, metric relations, invariants of the transformation, flux Jacobian matrices and eigensystems, numerical algorithms, flux split algorithms, implicit and explicit nonlinear control (smoothing), upwind differencing in supersonic regions, unsteady and steady-state computation, the diagonal form of implicit algorithm, metric differencing and invariants, boundary conditions, geometry and mesh generation, and sample solutions.

Pulliam, T. H.↗

NASA NTRS1986

About the coupling of turbulence closure models with averaged Navier-Stokes equations

The MacCormack implicit predictor-corrector model (1981) for numerical solution of the coupled Navier-Stokes equations for turbulent flows is extended to nonconservative multiequation turbulence models, as well as the inclusion of second-order Reynolds stress turbulence closure. A scalar effective pressure turbulent contribution to the pressure field is defined to approximate the effects of the Reynolds stress in strongly sheared flows. The Jacobian matrices of the transport equations are diagonalized to reduce the required computer memory and run time. Techniques are defined for including turbulence in the diagonalization. Application of the method is demonstrated with solutions generated for transonic nozzle flow and for the interaction between a supersonic flat plate boundary layer and a 12 deg compression-expansion ramp.

Vandromme, D.↗

NASA NTRS1988

Nonequilibrium flow computations. 1: An analysis of numerical formulations of conservation laws

Modern numerical techniques employing properties of flux Jacobian matrices are extended to general, nonequilibrium flows. Generalizations of the Beam-Warming scheme, Steger-Warming and van Leer Flux-vector splittings, and Roe's approximate Riemann solver are presented for 3-D, time-varying grids. The analysis is based on a thermodynamic model that includes the most general thermal and chemical nonequilibrium flow of an arbitrary gas. Various special cases are also discussed.

Liu, Yen↗

NASA NTRS1988

Equilibrium gas flow computations. II - An analysis of numerical formulations of conservation laws

Modern numerical techniques employing properties of flux Jacobian matrices are extended to general, equilibrium gas laws. Generalizations of the Beam-Warming scheme, Steger-Warming and van Leer flux-vector splittings, and Roe's approximate Riemann solver are presented for three-dimensional, time-varying grids. The approximations inherent in previous generalizations are discussed.

Vinokur, Marcel↗

NASA NTRS1988

Domain decomposition methods for the parallel computation of reacting flows

Domain decomposition is a natural route to parallel computing for partial differential equation solvers. Subdomains of which the original domain of definition is comprised are assigned to independent processors at the price of periodic coordination between processors to compute global parameters and maintain the requisite degree of continuity of the solution at the subdomain interfaces. In the domain-decomposed solution of steady multidimensional systems of PDEs by finite difference methods using a pseudo-transient version of Newton iteration, the only portion of the computation which generally stands in the way of efficient parallelization is the solution of the large, sparse linear systems arising at each Newton step. For some Jacobian matrices drawn from an actual two-dimensional reacting flow problem, comparisons are made between relaxation-based linear solvers and also preconditioned iterative methods of Conjugate Gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately 10-fold speedup on 16 processors.

Keyes, David E.↗

NASA NTRS1989

A Navier-Stokes solver for high speed equilibrium flows and application to blunt bodies

This paper presents a finite element method for the solution of Navier-Stokes equations with the assumption of thermodynamic and chemical equilibrium. The method employs an upwind finite element technique with an implicit time-marching scheme for the solution, and uses an adaptively generated unstructured triangular mesh with several layers of quadrilateral elements near solid walls. The complexity associated with the assumption that the flow is in equilibrium is treated consistently, and the inviscid flux Jacobian matrices are derived. Several problems involving inviscid and viscous hypersonic flow past blunt are solved. Results are compared with other numerical results and experimental data, and generally good agreement is observed.

Prabhu, Ramadas K.↗

NASA NTRS1989

Three dimensional PNS solutions of hypersonic internal flows with equilibrium chemistry

An implicit procedure for solving parabolized Navier-Stokes equations under the assumption of a general equation of state for a gas in chemical equilibrium is given. A general and consistent approach for the evaluation of Jacobian matrices in the implicit operator avoids the use of unnecessary auxiliary quantities and approximations, and leads to a simple expression. Applications to two- and three-dimensional flow problems show efficiency in computer time and economy in storage.

Liou, May-Fun↗

NASA NTRS1989

Nonequilibrium flow computations. I - An analysis of numerical formulations of conservation laws

Liu, Yen↗

NASA NTRS1991

Newton's method applied to finite-difference approximations for the steady-state compressible Navier-Stokes equations

Finite-difference approximations for steady-state compressible Navier-Stokes equations, whose two spatial dimensions are written in generalized curvilinear coordinates and strong conservation-law form, are presently solved by means of Newton's method in order to obtain a lifting-airfoil flow field under subsonic and transonnic conditions. In addition to ascertaining the computational requirements of an initial guess ensuring convergence and the degree of computational efficiency obtainable via the approximate Newton method's freezing of the Jacobian matrices, attention is given to the need for auxiliary methods assessing the temporal stability of steady-state solutions. It is demonstrated that nonunique solutions of the finite-difference equations are obtainable by Newton's method in conjunction with a continuation method.

Bailey, Harry E.↗

NASA NTRS1990

Parallel homotopy curve tracking on a hypercube

An investigation is conducted to find good parallel algorithms for solving systems of nonlinear equations using probability-one homotopy methods. Particular attention is paid to algorithms for the hypercube. Methods for one of the most computationally expensive steps of the homotopy approach, the computation of the kernel of the Jacobian matrix of the homotopy map, are studied. General nonlinear systems of equations with small and dense Jacobian matrices are considered, however, polynomial systems are not, since their structure leads to different strategies for parallelism. The mathematics behind the homotopy algorithm is summarized and the use of orthogonal factorizations is discussed. Parallel algorithms for orthogonal factorizations and triangular system solving are described. Computational results are presented and discussed.

Chakraborty, A.↗

NASA NTRS1992

Computational aspects of helicopter trim analysis and damping levels from Floquet theory

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Gaonkar, Gopal H.↗

NASA NTRS1992

A computer model for one-dimensional mass and energy transport in and around chemically reacting particles, including complex gas-phase chemistry, multicomponent molecular diffusion, surface evaporation, and heterogeneous reaction

Various chemically reacting flow problems highlighting chemical and physical fundamentals rather than flow geometry are presently investigated by means of a comprehensive mathematical model that incorporates multicomponent molecular diffusion, complex chemistry, and heterogeneous processes, in the interest of obtaining sensitivity-related information. The sensitivity equations were decoupled from those of the model, and then integrated one time-step behind the integration of the model equations, and analytical Jacobian matrices were applied to improve the accuracy of sensitivity coefficients that are calculated together with model solutions.

Cho, S. Y.↗

NASA NTRS1992

Dynamic analysis of flexible gear trains/transmissions - An automated approach

In this paper an automated algorithmic method is presented for the dynamic analysis of geared trains/transmissions. These are treated as a system of interconnected flexible bodies. The procedure developed explains the switching of constraints with time as a result of the change in the contacting areas at the gear teeth. The elastic behavior of the system is studied through the employment of three-dimensional isoparametric elements having six degrees-of-freedom at each node. The contact between the bodies is assumed at the various nodes, which could be either a line or a plane. The kinematical expressions, together with the equations of motion using Kane's method, strain energy concepts, are presented in a matrix form suitable for computer implementation. The constraint Jacobian matrices are generated automatically based on the contact information between the bodies. The concepts of the relative velocity at the contacting points at the tooth pairs and the subsequent use of the transmission ratios in the analysis is presented.

Amirouche, F. M. L.↗

NASA NTRS1993

Time-variant analysis of rotorcraft systems dynamics - An exploitation of vector processors

In this paper a generalized algorithmic procedure is presented for handling constraints in mechanical transmissions. The latter are treated as multibody systems of interconnected rigid/flexible bodies. The constraint Jacobian matrices are generated automatically and suitably updated in time, depending on the geometrical and kinematical constraint conditions describing the interconnection between shafts or gears. The type of constraints are classified based on the interconnection of the bodies by assuming that one or more points of contact exist between them. The effects due to elastic deformation of the flexible bodies are included by allowing each body element to undergo small deformations. The procedure is based on recursively formulated Kane's dynamical equations of motion and the finite element method, including the concept of geometrical stiffening effects. The method is implemented on an IBM-3090-600j vector processor with pipe-lining capabilities. A significant increase in the speed of execution is achieved by vectorizing the developed code in computationally intensive areas. An example consisting of two meshing disks rotating at high angular velocity is presented. Applications are intended for the study of the dynamic behavior of helicopter transmissions.

Amirouche, F. M. L.↗

NASA NTRS1993

Helicopter trim analysis by shooting and finite element methods with optimally damped Newton iterations

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used, and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Achar, N. S.↗

NASA NTRS1992

A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints

A new algorithm for solving nonlinear least-squares and nonlinear equation problems is proposed which is based on approximating the nonlinear functions using the quadratic-tensor model by Schnabel and Frank. The algorithm uses a trust region defined by a box containing the current values of the unknowns. The algorithm is found to be effective for problems with linear constraints and dense Jacobian matrices.

Hanson, R. J.↗